Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-24T02:33:37.172Z Has data issue: false hasContentIssue false
  • English
  • Français

An upper bound for multi-channel queues

Published online by Cambridge University Press:  14 July 2016

Ronald W. Wolff
Ronald W. Wolff*
Affiliation:
University of California, Berkeley
Get access Rights & Permissions [Opens in a new window]

Abstract

Moments of the delay distribution and other measures of performance for a multi-channel queue are shown to be bounded above by corresponding quantities for one or a collection of single-channel queues.

Keywords

UPPER BOUNDMULTI-CHANNEL OR SERVERQUEUE
Type
Short Communications
Information
Journal of Applied Probability , Volume 14 , Issue 4 , December 1977 , pp. 884 - 888
Copyright
Copyright © Applied Probability Trust 1977 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This research was completed while the author was a visiting consultant to the Operations Research Projects Department, Bell Telephone Laboratories, Holmdel, New Jersey.

References

[1] Brumelle, S. L. (1971) Some inequalities for parallel-server queues Opns. Res. 19, 402–413.Google Scholar
[2] Kingman, J. F. C. (1962) The effect of queue discipline on waiting time variance. Proc. Camb. Phil. Soc. 58, 163–164.Google Scholar
[3] Kingman, J. F. C. (1970) Inequalities in the theory of queues. J. R. Statist. Soc. B 32, 102–110.Google Scholar
[4] Marchal, W. G. (1974) Some simple bounds and approximations in queuing. Report T-294, The George Washington University Program in Logistics, Washington, D.C.Google Scholar
[5] Piater, R. (1975) The G/G/2 queue: cyclic vs. FIFS service order. , The University of British Columbia, Vancouver, B.C.Google Scholar