Stability of Jackson-type Queueing Networks, I

Abstract

This paper gives a pathwise construction of Jackson-type queueing networks allowing the derivation of stability and convergence theorems under general probabilistic assumptions on the driving sequences; namely, it is only assumed that the input process, the service sequences and the routing mechanism are jointly stationary and ergodic in a sense that is… (More)

Topics

  • Presentations referencing similar topics