The Throughput of Irreducible Closed Markovian Queueing Networks: Functional Bounds, Asymptotic Loss, Efficiency, and the Harrison-Wein Conjectures
Let N be the population of an irreducible closed Markovian queueing network, and denote by <tex-math>$\alpha ^{{\prime\prime}}(N)$</tex-math> the throughput of a scheduling policy u. The policy u is said to be efficient if <tex-math>${\rm lim}_{N\rightarrow +\infty}\ \alpha ^{{\pri...
| Veröffentlicht in: | Mathematics of Operations Research. - Institute for Operations Research and the Management Sciences. - 22(1997), 4, Seite 886-920 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
1997
|
| Zugriff auf das übergeordnete Werk: | Mathematics of Operations Research |
| Schlagworte: | Queueing networks Closed networks Optimal scheduling Performance evaluation Throughput Efficiency Asymptotic loss Asymptotic optimality Business Applied sciences mehr... |
| Online verfügbar |
Volltext |