On queues with impatience: stability, and the optimality of Earliest Deadline First

In this paper, we consider a queue with impatient customers, under general assumptions. We introduce a convenient representation of the system by a stochastic recursive sequence keeping track of the remaining service and patience times of the customers. This description allows us (i) to provide a comprehensive stability condition in the general case, (ii) to give a rigorous proof of the optimality of the Earliest Deadline First (EDF) service discipline in several cases, and (iii) to show that the abandonment probability of the system follows inversely the stochastic ordering of the generic patience time distribution.

[1]  P. Moyal.  The queue with impatience: construction of the stationary workload under FIFO , 2010, Journal of Applied Probability.

[2]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[3]  Leonidas Georgiadis,et al.  On optimal lateness and tardiness scheduling in real-time systems , 2006, Computing.

[4]  Laurent Decreusefond,et al.  Fluid limit of a heavily loaded EDF queue with impatient customers , 2005 .

[5]  F. Baccelli,et al.  Single-server queues with impatient customers , 1984, Advances in Applied Probability.

[6]  Kavita Ramanan,et al.  Heavy traffic analysis for EDF queues with reneging , 2011, The Annals of Applied Probability.

[7]  Philippe Robert,et al.  The impact of reneging in processor sharing queues , 2006, SIGMETRICS '06/Performance '06.

[8]  Philippe Robert,et al.  Fluid Limits for Processor-Sharing Queues with Impatience , 2008, Math. Oper. Res..

[9]  Laurent Decreusefond,et al.  Stochastic Modeling and Analysis of Telecom Networks: Decreusefond/Stochastic Modeling and Analysis of Telecom Networks , 2012 .

[10]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[11]  Michael L. Dertouzos,et al.  Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.

[12]  Paul G. Sorenson,et al.  A Real-Time System Design Methodology* , 1975 .

[13]  Donald F. Towsley,et al.  Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service , 1988, JACM.

[14]  Don Towsley,et al.  Optimal scheduling policies for a class of Queues with customer deadlines to the beginning of service , 1990, PERV.

[15]  Amber L. Puha,et al.  THE FLUID LIMIT OF A HEAVILY LOADED PROCESSOR SHARING QUEUE , 2002 .

[16]  Thomas L. Saaty,et al.  Elements of queueing theory , 1961 .

[17]  Steven Nahmias.  Queues with Impatient Customers , 2011 .

[18]  H. P..  Annales de l'Institut Henri Poincaré , 1931, Nature.

[19]  P. Moyal,et al.  Convex comparison of service disciplines in real time queues , 2007, Oper. Res. Lett..

[20]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[21]  S. Shreve,et al.  Real-time queues in heavy traffic with earliest-deadline-first queue discipline , 2001 .

[22]  S. Foss,et al.  Two ergodicity criteria for stochastically recursive sequences , 1994 .

[23]  D. Y. Barrer.  Queuing with Impatient Customers and Ordered Service , 1957 .

[24]  H. Thorisson.  Coupling, stationarity, and regeneration , 2000 .

[25]  Laurent Decreusefond,et al.  A functional central limit theorem for the M/GI/infinity queue , 2006, math/0608258.