Hostname: page-component-848d4c4894-wg55d Total loading time: 0 Render date: 2024-05-27T13:02:14.835Z Has data issue: false hasContentIssue false
  • English
  • Français

On Niu&s conjecture for tandem queues

Published online by Cambridge University Press:  01 July 2016

Betsy S. Greenberg
Betsy S. Greenberg*
Affiliation:
University of Texas, Austin
*
∗Postal address: Department of Management Science and Information Systems, The University of Texas at Austin, CBA 5.202, Austin, TX 78712–1175, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We show that Niu&s (1980) conjecture is true for Poisson arrivals and light traffic. We also show that a weak version of the conjecture is true for a special case in heavy traffic.

Type
Letters to the Editor
Information
Advances in Applied Probability , Volume 19 , Issue 3 , September 1987 , pp. 751 - 753
Copyright
Copyright © Applied Probability Trust 1987 

References

Greenberg, B. S. (1986) Queueing Systems with Returning Customers and the Order of Tandem Queues. Ph.D. Thesis, University of California, Berkeley.Google Scholar
Harrison, J. M. (1978) The diffusion approximation for tandem queues in heavy traffic. Adv. Appl. Prob. 10, 886–905.Google Scholar
Kingman, J. F. C. (1962) Some inequalities for the queue GI/G/1. Biometrika 47, 315–324.Google Scholar
Niu, Shun-Chen (1980) Bounds for the expected delays in some tandem queues. J. Appl. Prob. 17, 831–838.Google Scholar
Wolff, R. W. (1982) Tandem queues with dependent service times in light traffic. Operat. Res. 30, 619–635.Google Scholar