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 made precise in the paper. The main tools for these results are the subadditive ergodic theorem, which is used to derive a strong law of large numbers, and basic theorems on monotone stochastic recursive sequences. The techniques which are proposed here apply to other and more general classes of discrete event systems, like Petri nets or GSMPs. The paper also provides new results on the Jackson-type networks with i.i.d. driving sequences which were studied in the past.
| Original language | English |
|---|---|
| Pages (from-to) | 5-72 |
| Number of pages | 68 |
| Journal | Queueing Systems |
| Volume | 17 |
| DOIs | |
| Publication status | Published - Mar 1994 |
Keywords
- Ordered directed graph
- Euler graphs
- Euler ordered directed graph
- switching sequence
- open Jackson-type queueing network
- point processes
- Euler network
- composition
- decomposition
- conservation rule
- departure and throughput processes
- first and second-order ergodic properties
- subadditive ergodic theorem
- solidarity property
- stochastic recursive sequences
- stationary solution
- coupling-convergence
- uniqueness of the stationary regime