The authors generalize Jackson's theorem to the non-ergodic case. Here, despite the fact that the entire Jackson network will not achieve steady state, it is still possible to determine the maximal subnetwork that does. They do so by formulating and algorithmically solving a new non-linear throughput equation. These results, together with the ergodic results and the ones for closed networks, completely characterize the large-time behavior of any Jackson network.
|Original language||English (US)|
|Number of pages||10|
|Journal||Journal of Applied Probability|
|State||Published - Jan 1 1984|
All Science Journal Classification (ASJC) codes
- Statistics and Probability
- Statistics, Probability and Uncertainty