Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
O.J. Boxma
Information about the author O.J. Boxma will soon be added to the site.
Found
15 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
The equivalence between processor sharing and service in random order
2003
In this note we explore a useful equivalence relation for the delay distribution in...
Two-queue polling models with a patient server
2002
We consider two-queue polling models with the special feature that a timer mechanism...
A queueing model with dependence between service and interarrival times
2001
We consider a storage model that can be either interpreted as a certain queuing model...
Asymptotic behavior of the tandem queueing system with identical service times at both queues
2000
Consider a tandem queue consisting of two single-server queues in series, with a...
Sojourn time asymptotics in the M/G/1 processor sharing queue
2000
We show for the M/G/1 processor sharing queue that the service time distribution is...
Polling models with and without switchover times
1997
We consider two different single-server cyclic polling models: (i) a model with zero...
Fluid queues and mountain processes
1999
This paper is devoted to the analysis of a fluid queue with a buffer content that...
Analysis of a multi-server queueing model of Available Bit Rate
1998
In this paper we present a queueing model for the performance analysis of Available...
Dynamic server assignment in a two-queue model
1997
We consider a polling model of two M/G/I queues, served by a single server. The...
Stochastic bounds for a polling system
1994
In this note the authors consider two queueing systems: a symmetric polling system...
Tandem queues with deterministic service times
1994
In this paper the authors consider a tandem queueing model for a sequence of...
An M/G/1 queue with customer collection
1993
This paper analyses a variant of the M/G/1 queue in which the service times of...
A queueing network model for analyzing a class of branch-and-bound algorithms on a master-slave architecture
1991
Partitioning methods lend themselves very well to implementation on parallel...
Machine allocation problems in manufacturing networks
1990
In this paper the authors discuss two server (machine) allocation problems that occur...
Sojourn times in the M/G/1 queue with deterministic feedback
1989
In this paper the authors consider an M / G /1 queueing model, in which each customer...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers