论文信息 - Bounds on the Wait in a GI/M/k Queue

Bounds on the Wait in a GI/M/k Queue

The wait in a GI/M/k queue is bounded above stochastically by the wait in an associated GI/M/1 queue. The analysis of the single server queue is considerably easier than that of the k-server queue, and also the bounds developed for single server queues by J. F. C. Kingman and Kneale T. Marshall can be applied.

Shelby L. Brumelle

[1] J. Kingman. Inequalities in the Theory of Queues , 1970 .

[2] J. Kiefer,et al. On the theory of queues with many servers , 1955 .

[3] D C LittleJohn. A Proof for the Queuing Formula , 1961 .

[4] Shelby L. Brumelle. Some Inequalities for Parallel-Server Queues , 1971, Oper. Res..

[5] J. Kingman. Some inequalities for the queue GI/G/1 , 1962 .