论文信息 - A note on the discretization of Little's result

A note on the discretization of Little's result

By considering discrete-time queueing systems as special cases of continuous-time queueing systems, we derive a discrete-time equivalent of Little's result. Our result is general in the sense that no assumptions are made regarding the exact details of arrival and departure processes within a discrete-time unit.

Dieter Fiems | Herwig Bruneel | D. Fiems | H. Bruneel

[1] Shang Zhi,et al. A proof of the queueing formula: L=λW , 2001 .

[2] Rainer Händel. ATM Networks , 1994 .

[3] C. Burrus,et al. Discrete-time systems , 1975 .

[4] Herwig Bruneel,et al. An analytical technique for the derivation of the delay performance of ATM switches with multiserver output queues , 1992 .

[5] Masakiyo Miyazawa,et al. Rate conservation principle for discrete-time queues , 1992, Queueing Syst. Theory Appl..

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

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

[8] J. Little. A Proof for the Queuing Formula: L = λW , 1961 .