Hostname: page-component-7dd5485656-dk7s8 Total loading time: 0 Render date: 2025-10-30T18:42:54.823Z Has data issue: false hasContentIssue false
  • English
  • Français

The interchangeability of ·/M/1 queues in series

Published online by Cambridge University Press:  14 July 2016

Richard R. Weber
Richard R. Weber*
Affiliation:
University of Cambridge
*
∗ Postal address: Queens' College, Cambridge CB3 9ET, U.K.
Get access Rights & Permissions [Opens in a new window]

Abstract

A series of queues consists of a number of · /M/1 queues arranged in a series order. Each queue has an infinite waiting room and a single exponential server. The rates of the servers may differ. Initially the system is empty. Customers enter the first queue according to an arbitrary stochastic input process and then pass through the queues in order: a customer leaving the first queue immediately enters the second queue, and so on. We are concerned with the stochastic output process of customer departures from the final queue. We show that the queues are interchangeable, in the sense that the output process has the same distribution for all series arrangements of the queues. The ‘output theorem' for the M/M/1 queue is a corollary of this result.

Keywords

OUTPUT PROCESSESDEPARTURE PROCESSESSERIES OF QUEUESTANDEM QUEUES

Information

Type
Short Communications
Information
Journal of Applied Probability , Volume 16 , Issue 3 , September 1979 , pp. 690 - 695
Copyright
Copyright © Applied Probability Trust 1979 

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.)

Article purchase

Temporarily unavailable

References

Boxma, O. J. (1977) Analysis of Models for Tandem Queues. Ph.D. Thesis, University of Utrecht.Google Scholar
Burke, P. J. (1956) The output of a queueing system. Opns Res. 4, 699–704.Google Scholar
Friedman, H. D. (1965) Reduction methods for tandem queueing systems. Opns Res. 13, 121–131.Google Scholar
Reich, E. (1965) Departure processes. In Proceedings of the Symposium on Congestion Theory, University of North Carolina Press, Chapel Hill, 439–457.Google Scholar
Tembe, S. V. and Wolff, R. W. (1974) The optimal order of service in tandem queues. Opns Res. 22, 824–832.Google Scholar