 The stability of open queueing networksKarl Sigman Stochastic Processes and their Applications, 1990, vol. 35, issue 1, 11-25 Abstract: The stability of open Jackson networks is established where service times are i.i.d. general distribution, exogeneous interarrival times are i.i.d. general distribution, and the routing is Markovian. The service time distributions are only required to have finite first moment. The system is modeled (at arrival epochs) as a general state space Markov chain. Explicit regeneration points are found (even in the case when the system never empties) and the chain is shown to be Harris ergodic if standard rate conditions are enforced, that is, if at each node, the long run average amount of work per unit time that arrives exogenously destined for that node is strictly less than one. In addition, we prove that if the system is modeled in continuous time then convergence to a steady-state occurs in total variation if the interarrival time distribution is spread-out. Extensions of the results to multi-server nodes, non-Markovian routing and Markov modulated arrivals are given. Keywords: queue; Jackson; open; network; regenerative; Harris; chain (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:35:y:1990:i:1:p:11-25 Ordering information: This journal article can be ordered from Access Statistics for this article Stochastic Processes and their Applications is currently edited by T. Mikosch More articles in Stochastic Processes and their Applications from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.