Article contents
Ergodicity of a Jackson network by batch arrivals
Published online by Cambridge University Press: 14 July 2016
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
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 1994
References
- 2
- Cited by