Passage times for overtake-free paths in Gordon–Newell networks
- 1 September 1982
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 14 (3) , 672-686
- https://doi.org/10.2307/1426680
Abstract
Consider a path in a multiclass Gordon–Newell network such that a customer present in a node of this path cannot be overtaken by any other customer behind him in a node of this path or by probabilistic influences created by such customers. The passage time through such a path is a mixture of Erlangian distributions, where the mixing distribution is given by the steady state of the network.Keywords
This publication has 6 references indexed in Scilit:
- Sojourn times and the overtaking condition in Jacksonian networksAdvances in Applied Probability, 1980
- The Cycle Time Distribution of Exponential Cyclic QueuesJournal of the ACM, 1980
- On Total Sojourn Time in Acyclic Jackson NetworksPublished by Defense Technical Information Center (DTIC) ,1979
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Note on Queues in TandemThe Annals of Mathematical Statistics, 1963
- Waiting Times When Queues are in TandemThe Annals of Mathematical Statistics, 1957