The throughput of irreducible closed Markovian queueing networks: Functional bounds, asymptotic loss, efficiency, and the Harrison-Wein conjectures

Mathematics of Operations Research

Volumn 22, Issue 4, 1997, Pages 886-920

  Jin, H ^a   Ou, J ^b   Kumar, P R ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Asymptotic loss; Asymptotic optimality; Closed networks; Efficiency; Optimal scheduling; Performance evaluation; Queueing networks; Throughput

Indexed keywords

BUFFER STORAGE; MARKOV PROCESSES; PROBLEM SOLVING; TELECOMMUNICATION TRAFFIC;

CLOSED NETWORKS; HARRISON WEIN CONJECTURES; IRREDUCIBLE CLOSED MARKOVIAN QUEUEING NETWORKS; PERFORMANCE EVALUATION;

COMPUTER NETWORKS;

EID: 0031273170     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.22.4.886     Document Type: Article

References (14)

1. Blackwell, D. (1962). Discrete dynamic programming. Ann. of Math. Statist. 33 719-726.
2. Chevalier, P. B., L. M. Wein (1993). Scheduling networks of queues: Heavy traffic analysis of a multi-station closed network. Oper. Res. 41 743-757.
3. Ginsberg, M., P. R. Kumar (1996). Throughput bounds for closed networks with competing routes. (In preparation).
4. Harrison, J. M., V. Nguyen (1995). Some badly behaved closed queueing networks. Frank P. Kelly and Ruth Williams, Eds., Stochastic Networks 71, Springer-Verlag, New York, NY, 117-124.
5. _, L. M. Wein (1990). Scheduling networks of queues: Heavy traffic analysis of a two-station closed network. Oper. Res. 38 1052-1064.
6. Humes, C., Jr., J. Ou. P. R. Kumar (1997). The delay of open Markovian queueing networks: Uniform functional bounds, heavy traffic pole multiplicities, and stability. Math. Oper. Res.
7. Kumar, P. R., T. I. Seidman (1990). Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems. IEEE Trans. Automat. Control AC-35 289-298.
8. Kumar, S., P. R. Kumar (1994). Performance bounds for queueing networks and scheduling policies. IEEE Trans. Automat. Control AC-39 1600-1611.
9. Lavenberg, S. (1983). Computer Performance Modeling Handbook. Academic Press, New York.
10. Lippman, S. (1975). Applying a new device in the optimization of exponential queueing systems. Oper. Res. 23 687-710.
11. Lu, S. H., P. R. Kumar (1991). Distributed scheduling based on due dates and buffer priorities. IEEE Trans. Automat. Control AC-36 1406-1416.
12. Murty, K. G., Linear Programming. John Wiley and Sons, New York, NY.
13. Walrand, J. (1991). Communication Networks - A first course. Aksen Associates, Boston.
14. Wein, L. M. (1988). Scheduling semiconductor wafer fabrication. IEEE Trans. Semiconductor Manufacturing 1 115-130.