Sample-path analysis of general arrival queueing systems with constant amount of work for all customers

We consider a discrete-time queueing system where the arrival process is general and each arriving customer brings in a constant amount of work which is processed at a deterministic rate. We carry out a sample-path analysis to derive an exact relation between the set of system size values and the set of waiting time values over a busy period of a given sample path. This sample-path relation is then applied to a discrete-time $$G/D/c$$ queue with constant service times of one slot, yielding a sample-path version of the steady-state distributional relation between system size and waiting time as derived earlier in the literature. The sample-path analysis of the discrete-time system is further extended to the continuous-time counterpart, resulting in a similar sample-path relation in continuous time.

[1]  Ronald W. Wolff,et al.  Little's Law and Related Results , 2011 .

[2]  Marc Moeneclaey,et al.  Calculation of delay characteristics for multiserver queues with constant service times , 2009, Eur. J. Oper. Res..

[3]  Shaler Stidham,et al.  The Relation between Customer and Time Averages in Queues , 1980, Oper. Res..

[4]  Herwig Bruneel,et al.  Discrete-time multiserver queues with geometric service times , 2004, Comput. Oper. Res..

[5]  Shaler Stidham,et al.  Technical Note - A Last Word on L = λW , 1974, Oper. Res..

[6]  Mohan L. Chaudhry,et al.  Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system , 2002, Oper. Res. Lett..

[7]  Ward Whitt.  A review of L =lambda W and extensions. , 1991 .

[8]  Bhaskar Sengupta,et al.  An invariance relationship for the G/G/1 queue , 1989, Advances in Applied Probability.

[9]  David Finkel.  Brief review: Computer Networks & Systems: Queueing Theory and Performance Evaluation by Thomas Robertazzi (Springer-Verlag, 1990) , 1991, PERV.

[10]  S. Stidham,et al.  Sample-Path Analysis of Queueing Systems , 1998 .

[11]  M. Miyazawa,et al.  The equality of the workload and total attained waiting time in average , 1991, Journal of Applied Probability.

[12]  Shaler Stidham,et al.  Analysis, Design, and Control of Queueing Systems , 2002, Oper. Res..

[13]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[14]  K. Sigman.  A Note on a Sample-Path Rate Conservation Law and its Relationship with H = λG , 1991, Advances in Applied Probability.

[15]  David Simchi-Levi,et al.  Introduction to "Little's Law as Viewed on Its 50th Anniversary" , 2011, Oper. Res..

[16]  Yi-Ching Yao.  A Duality Relation Between the Workload and Attained Waiting Time in FCFS G/G/s Queues , 2013, J. Appl. Probab..

[17]  Katrin Baumgartner,et al.  Computer Networks And Systems Queueing Theory And Performance Evaluation , 2016 .

[18]  Bart Steyaert,et al.  Deriving Delay Characteristics from Queue Length Statistics in Discrete-Time Queues with Multiple Servers , 1996, Perform. Evaluation.

[19]  M. E. Woodward,et al.  Communication and computer networks - modelling with discrete-time queues , 1993 .

[20]  Bara Kim,et al.  The analysis of a multiserver queue fed by a discrete autoregressive process of order 1 , 2004, Oper. Res. Lett..

[21]  Pierre A. Humblet,et al.  Ballot theorems applied to the transient analysis of nD/D/1 queues , 1993, TNET.

[22]  Mohan L. Chaudhry,et al.  A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times , 2003, Oper. Res. Lett..

[23]  Gang Uk Hwang,et al.  The waiting time analysis of a discrete-time queue with arrivals as a discrete autoregressive process of order 1 , 2002, Journal of Applied Probability.

[24]  Gang Uk Hwang,et al.  On the Exact Analysis of a Discrete-Time Queueing System with Autoregressive Inputs , 2003, Queueing Syst. Theory Appl..

[25]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[26]  Herwig Bruneel,et al.  Delay and partial system contents for a discrete-time G-D-c queue , 2008, 4OR.

[27]  Herwig Bruneel,et al.  Discrete-time models for communication systems including ATM , 1992 .

[28]  Ward Whitt,et al.  A review ofL=λW and extensions , 1991, Queueing Syst. Theory Appl..

[29]  Hideaki Takagi.  Queueing analysis A foundation of Performance Evaluation Volume 1: Vacation and priority systems , 1991 .

[30]  John D. C. Little,et al.  OR FORUM - Little's Law as Viewed on Its 50th Anniversary , 2011, Oper. Res..

[31]  Ronald W. Wolff,et al.  The equality of the virtual delay and attained waiting time distributions , 1990 .

[32]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .