Sojourn times and the overtaking condition in Jacksonian networks
- 1 December 1980
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 12 (4) , 1000-1018
- https://doi.org/10.2307/1426753
Abstract
Consider an open multiclass Jacksonian network in equilibrium and a path such that a customer travelling along it cannot be overtaken directly by a subsequent arrival or by the effects of subsequent arrivals. Then the sojourn times of this customer in the nodes constituting the path are all mutually independent and so the total sojourn time is easily calculated. Two examples are given to suggest that the non-overtaking condition may be necessary to ensure independence when there is a single customer class.Keywords
This publication has 6 references indexed in Scilit:
- 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
- Letter to the Editor—The Dependence of Sojourn Times in Tandem M/M/S QueuesOperations Research, 1969
- Processus de MarkovLecture Notes in Mathematics, 1967
- Note on Queues in TandemThe Annals of Mathematical Statistics, 1963
- Waiting Times When Queues are in TandemThe Annals of Mathematical Statistics, 1957