Sojourn times in a processor sharing queue with multiple vacations

We study an M/G/1 processor sharing queue with multiple vacations. The server only takes a vacation when the system has become empty. If he finds the system still empty upon return, he takes another vacation, and so on. Successive vacations are identically distributed, with a general distribution. When the service requirements are exponentially distributed we determine the sojourn time distribution of an arbitrary customer. We also show how the same approach can be used to determine the sojourn time distribution in an M/M/1-PS queue of a polling model, under the following constraints: the service discipline at that queue is exhaustive service, the service discipline at each of the other queues satisfies a so-called branching property, and the arrival processes at the various queues are independent Poisson processes. For a general service requirement distribution we investigate both the vacation queue and the polling model, restricting ourselves to the mean sojourn time.

[1]  U. Narayan Bhat,et al.  An Introduction to Queueing Theory , 2008 .

[2]  R. Núñez Queija,et al.  Centrum Voor Wiskunde En Informatica Reportrapport Sojourn times in a Processor Sharing Queue with Service Interruptions Sojourn times in a Processor Sharing Queue with Service Interruptions , 2022 .

[3]  Thomas M. O'Donovan.  Technical Note - Distribution of Attained and Residual Service in General Queuing Systems , 1974, Oper. Res..

[4]  S. Brumelle.  On the relation between customer and time averages in queues , 1971 .

[5]  Konstantin Avrachenkov,et al.  Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling , 2005, Queueing Syst. Theory Appl..

[6]  Jacques Resing,et al.  Polling systems and multitype branching processes , 1993, Queueing Syst. Theory Appl..

[7]  Bara Kim,et al.  Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals , 2008, Queueing Syst. Theory Appl..

[8]  R. Schassberger,et al.  A new approach to the M/G/1 processor-sharing queue , 1984, Advances in Applied Probability.

[9]  J. Snyder.  Coupling , 1998, Critical Inquiry.

[10]  R. Serfozo.  Introduction to Stochastic Networks , 1999 .

[11]  Hans van den Berg,et al.  TheM/G/1 queue with processor sharing and its relation to a feedback queue , 1991, Queueing Syst. Theory Appl..

[12]  Erik M. M. Winands,et al.  On polling systems with large setups , 2007, Oper. Res. Lett..

[13]  Andrea Zanella,et al.  Performance Evaluation of Bluetooth Polling Schemes: An Analytical Approach , 2004, Mob. Networks Appl..

[14]  R. D. van der Mei,et al.  Polling Systems with Periodic Server Routeing in Heavy Traffic: Distribution of the Delay , 2003 .

[15]  Naishuo Tian,et al.  Vacation Queueing Models: Theory and Applications (International Series in Operations Research & Management Science) , 2006 .

[16]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[17]  Adam Wierman,et al.  Scheduling in polling systems , 2007, Perform. Evaluation.

[18]  Natalia Osipova.  Batch processor sharing with hyper-exponential service time , 2008, Oper. Res. Lett..

[19]  Edward G. Coffman,et al.  Distribution of Attained Service in Time-Shared Systems , 1967, J. Comput. Syst. Sci..

[20]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[21]  Philippe Robert,et al.  Stochastic Networks and Reversibility , 2003 .

[22]  U. Narayan Bhat,et al.  An Introduction to Queueing Theory: Modeling and Analysis in Applications , 2006 .

[23]  Isi Mitrani,et al.  Sharing a Processor Among Many Job Classes , 1980, JACM.

[24]  F. Baccelli,et al.  Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences , 2010 .

[25]  Nikhil Bansal.  Analysis of the M/G/1 processor-sharing queue with bulk arrivals , 2003, Oper. Res. Lett..

[26]  B. Sengupta,et al.  A conditional response time of the M/M/1 processor-sharing queue , 1985, AT&T Technical Journal.

[27]  Victor C. M. Leung,et al.  Polling-based protocols for packet voice transport over IEEE 802.11 wireless local area networks , 2006, IEEE Wireless Communications.

[28]  T. Ott.  THE SOJOURN-TIME DISTRIBUTION IN THE M/G/1 QUEUE , 1984 .

[29]  Onno J. Boxma,et al.  Sojourn times in polling systems with various service disciplines , 2009, Perform. Evaluation.

[30]  T. M. O'Donovan.  Direct Solutions of M/G/1 Processor-Sharing Models , 1974, Oper. Res..

[31]  Urtzi Ayesta.  A unifying conservation law for single server queues. , 2005 .

[32]  Edward G. Coffman,et al.  Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.

[33]  Naishuo Tian,et al.  Vacation Queueing Models Theory and Applications , 2006 .

[34]  Leonard Kleinrock,et al.  The processor-sharing queueing model for time-shared systems with bulk arrivals , 1971, Networks.

[35]  J. W. Cohen,et al.  The multiple phase service network with generalized processor sharing , 1979, Acta Informatica.

[36]  O. Boxma.  Polling Systems , 2010 .

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

[38]  J. Kingman.  THE SINGLE SERVER QUEUE , 1970 .

[39]  T. Olsen,et al.  Periodic polling systems in heavy-traffic: distribution of the delay , 2003 .

[40]  J. Morrison.  Response-Time Distribution for a Processor-Sharing System , 1985 .