Back to Search
Start Over
The interchangeability of ·/M/1 queues in series
- Source :
- Journal of Applied Probability. 16:690-695
- Publication Year :
- 1979
- Publisher :
- Cambridge University Press (CUP), 1979.
-
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. OUTPUT PROCESSES; DEPARTURE PROCESSES; SERIES OF QUEUES; TANDEM QUEUES
- Subjects :
- Statistics and Probability
Discrete mathematics
Mathematical optimization
Queue management system
M/G/k queue
General Mathematics
010102 general mathematics
M/M/1 queue
G/G/1 queue
Fork–join queue
01 natural sciences
Computer Science::Performance
010104 statistics & probability
Burke's theorem
Computer Science::Networking and Internet Architecture
M/G/1 queue
M/M/c queue
0101 mathematics
Statistics, Probability and Uncertainty
Mathematics
Subjects
Details
- ISSN :
- 14756072 and 00219002
- Volume :
- 16
- Database :
- OpenAIRE
- Journal :
- Journal of Applied Probability
- Accession number :
- edsair.doi...........619e8929d6e3c4d00321ac6835440275
- Full Text :
- https://doi.org/10.1017/s0021900200107855