Whittle index approach to multiserver scheduling with impatient customers and DHR service times
We consider the optimal scheduling problem in a multiserver queue with impatient customers belonging to multiple classes. We assume that each customer has a random abandonment time, after which the customer leaves the system if its service has not ...
On the time-dependent behavior of preemptive single-server queueing systems with Poisson arrivals
We present a detailed study of the time-dependent behavior of both the queue-length process and the workload process of various types of preemptive Last-Come-First-Served queueing systems, such as the preemptive repeat different and preemptive ...
Exact results for the distribution of the partial busy period for a multi-server queue
Exact explicit results are derived for the distribution of the partial busy period of the M/M/c multi-server queue for a general number of servers. A rudimentary spectral method leads to a representation that is amenable to efficient numerical ...
Fluid limits for QB-CSMA with polynomial rates, homogenization and reflection
We study in this paper a variation of the acclaimed carrier sense multiple access (CSMA) protocol. A random access algorithm is where back-off rates depend on the state of the network through queue lengths. We provide the first case where full ...
Analytic approach to the non-pre-emptive Markovian priority queue
A new approach is developed for the joint queue-length distribution of the two-level non-pre-emptive M/M/c (i.e. Markovian) priority queue that allows explicit and exact results to be obtained. Marginal distributions are derived for the general ...
