Ergodicity of a Jackson network by batch arrivals
- 1 September 1994
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 31 (3) , 847-853
- https://doi.org/10.2307/3215163
Abstract
The Jackson network under study receives batch arrivals at i.i.d. intervals and features Markovian routing and exponentially distributed service times. The system is shown to be stable, in the sense of not being overloaded, if and only if, for each node, the total arrival rate of external and internal customers is less than the service rate. The method of proof is of more general interest.Keywords
This publication has 2 references indexed in Scilit:
- The non-ergodic Jackson networkJournal of Applied Probability, 1984
- A positive recurrence criterion associated with multidimensional queueing processesJournal of Applied Probability, 1980