The impact of reneging in processor sharing queues

We investigate an overloaded processor sharing queue with renewal arrivals and generally distributed service times. Impatient customers may abandon the queue, or renege, before completing service. The random time representing a customer's patience has a general distribution and may be dependent on his initial service time requirement.We propose a scaling procedure that gives rise to a fluid model, with nontrivial yet tractable steady state behavior. This fluid model captures many essential features of the underlying stochastic model, and we use it to analyze the impact of impatience in processor sharing queues. We show that this impact can be substantial compared with FCFS, and we propose a simple admission control policy to overcome these negative impacts.

[1]  Gennady Samorodnitsky,et al.  Ruin problem and how fast stochastic processes , 2003 .

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

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

[4]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[5]  Fabrice Guillemin,et al.  Tail asymptotics for processor-sharing queues , 2004, Advances in Applied Probability.

[6]  Robert E. Stanford,et al.  Reneging Phenomena in Single Channel Queues , 1979, Math. Oper. Res..

[7]  Sem C. Borst,et al.  Stability of size-based scheduling disciplines in resource-sharing networks , 2005, Perform. Evaluation.

[8]  Nam Kyoo Boots,et al.  A Multiserver Queueing System with Impatient Customers , 1999 .

[9]  Alexandre Proutière,et al.  Insensitive Bandwidth Sharing in Data Networks , 2003, Queueing Syst. Theory Appl..

[10]  Peter W. Glynn,et al.  A Diffusion Approximation for a Markovian Queue with Reneging , 2003, Queueing Syst. Theory Appl..

[11]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[12]  Alexander L. Stolyar,et al.  The Fluid Limit of an Overloaded Processor Sharing Queue , 2006, Math. Oper. Res..

[13]  Edward G. Coffman,et al.  Processor-Shared Buffers with Reneging , 1994, Perform. Evaluation.

[14]  N. H. Lee,et al.  Fluid and Brownian approximations for an Internet congestion control model , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[15]  Thomas Bonald,et al.  Congestion at flow level and the impact of user behaviour , 2003, Comput. Networks.

[16]  Gustavo de Veciana,et al.  Bandwidth sharing: the role of user impatience , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

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

[19]  Alexandre Proutière,et al.  On Stochastic Bounds for Monotonic Processor Sharing Networks , 2004, Queueing Syst. Theory Appl..

[20]  Sara Oueslati,et al.  Quality of service and flow level admission control in the Internet , 2002, Comput. Networks.

[21]  John P. Lehoczky,et al.  Multiple-input heavy-traffic real-time queues , 2003 .

[22]  Avishai Mandelbaum,et al.  Telephone Call Centers: Tutorial, Review, and Research Prospects , 2003, Manuf. Serv. Oper. Manag..

[23]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[24]  Laurent Massoulié,et al.  Fair internet traffic integration: network flow models and analysis , 2004, Ann. des Télécommunications.

[25]  Jean Walrand,et al.  Fair end-to-end window-based congestion control , 1998, TNET.

[26]  R. J. Williams,et al.  Fluid model for a network operating under a fair bandwidth-sharing policy , 2004, math/0407057.

[27]  R. E. Stanford.  On queues with impatience , 1990, Advances in Applied Probability.