The Time for a Round Trip in a Cycle of Exponential Queues
- 1 January 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 30 (1), 146-150
- https://doi.org/10.1145/322358.322369
Abstract
The distnbutlon of the time for a round trip of a job m a cycle of M exponential FIFO queues, where Njobs are cycling, is derived.Keywords
This publication has 3 references indexed in Scilit:
- The Cycle Time Distribution of Exponential Cyclic QueuesJournal of the ACM, 1980
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973
- Note on Queues in TandemThe Annals of Mathematical Statistics, 1963