Delay and partial system contents for a discrete-time G-D-c queue. (English) Zbl 1165.90393

Summary: We consider a discrete-time multiserver queueing system with infinite buffer size, constant service times of multiple slots and a first-come-first-served queueing discipline. A relationship between the probability distributions of the partial system contents and the packet delay is established. The relationship is general in the sense that it doesn’t require knowledge of the exact nature of the arrival process. By means of the relationship, results for the distribution of the partial system contents for a wide variety of discrete-time queueing models can be transformed into corresponding results for the delay distribution. As a result, a separate full analysis of the packet delay becomes unnecessary.


90B22 Queues and service in operations research
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
60K25 Queueing theory (aspects of probability theory)
Full Text: DOI


[1] Bertsimas D, Nakazato D (1995) The distributional Little’s law and its applications. Oper Res 43(2): 298–310 · Zbl 0837.90048
[2] Brumelle S (1971) On the relation between customer and time averages in queues. J Appl Prob 8(3):508–520 · Zbl 0232.60085
[3] Bruneel H, Kim BG (1993) Discrete-time models for communication systems including ATM. Kluwer, Boston
[4] Bruneel H, Wuyts I (1994) Analysis of discrete-time multiserver queueing models with constant service times. Oper Res Lett 15(5):231–236 · Zbl 0814.90030
[5] Chaudhry ML, Kim NK (2003) A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times. Oper Res Lett 31(2):101–107 · Zbl 1041.90010
[6] Fiems D, Bruneel H (2002) A note on the discretization of Little’s result. Oper Res Lett 30(1):17–18 · Zbl 1030.90015
[7] Gao P, Wittevrongel S, Bruneel H (2003) Delay against system contents in discrete-time G/Geom/c queue. Electron Lett 39(17):1290–1292
[8] Gao P, Wittevrongel S, Bruneel H (2004) Delay analysis for a discrete-time GI-D-c queue with arbitrary-length service times. Lect Notes Comput Sci 3236:184–195 · Zbl 1111.68361
[9] Gao P, Wittevrongel S, Bruneel H (2005) Analysis of discrete-time multiserver queues with constant service times and correlated arrivals. In: Proceedings of 12th international conference on analytical and stochastic modelling techniques and applications, ASMTA 2005, Riga, Latvia, 1–4 June 2005, pp 1–8
[10] Hunter JJ (1983) Mathematical techniques of applied probability, vol 2, discrete time models: techniques and applications. Academic, New York · Zbl 0539.60065
[11] Little JDC (1961) A proof for the queueing formula: L = {\(\lambda\)} W. Oper Res 9:383–387 · Zbl 0108.14803
[12] Mitrani I (1987) Modelling of computer and communication systems. Cambridge University Press, Cambridge · Zbl 0648.68015
[13] Robertazzi TG (2000) Computer networks and systems: queueing theory and performance evaluation. Springer, New York
[14] Stidham S (1974) A last word on L = {\(\lambda\)} W. Oper Res 22(2):417–421 · Zbl 0274.60080
[15] Takagi H (1993) Queueing analysis, a foundation of performance evaluation, vol 3: discrete-time systems. North-Holland, Amsterdam
[16] Vinck B, Bruneel H (1995) Relationship between delay and buffer contents in ATM queues. Electron Lett 31(12):952–954
[17] Whitt W (1991) A review of L = {\(\lambda\)} W and extensions. Queue Syst 9(3):235–268 · Zbl 0727.60112
[18] Woodward ME (1993) Communication and computer networks: modelling with discrete-time queues. Pentech Press, London · Zbl 0825.68173
[19] Xiong Y, Bruneel H, Steyaert B (1996) Deriving delay characteristics from queue length statistics in discrete-time queues with multiple servers. Perform Eval 24(3):189–204 · Zbl 0875.68060
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.