Closed reentrant queueing networks under affine index policies: Throughput bounds, examples and asym

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 17, Issue 1 PART 1, 2008, Pages

  Morrison, James R ^a   Juen, Joshua ^a  

^a NONE

Author keywords

Discrete event systems modeling and control; Queueing systems; Stochastic control

Indexed keywords

ASYMPTOTIC LOSS; COMPARISON STUDY; COMPUTATIONAL COSTS; DIFFERENTIAL COSTS; DISCRETE EVENT SYSTEMS MODELING AND CONTROL; EXACT SOLUTION; INDEX POLICIES; QUEUEING SYSTEMS; STOCHASTIC CONTROL; SYSTEM THROUGHPUT;

LINEARIZATION; QUEUEING THEORY; STOCHASTIC CONTROL SYSTEMS;

QUEUEING NETWORKS;

EID: 79961020078     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20080706-5-KR-1001.0849     Document Type: Conference Paper

References (14)

1. S. Kumar and P. R. Kumar. Performance bounds for queueing networks and scheduling policies. IEEE Transactions on Automatic Control, 39:1600-1611, 1994.
2. D. Bertsimas, I. C. Paschalidis and J. N. Tsitsiklis. Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance. Annals of Applied Probability, 4:43-75, 1994.
3. D. P. de Farias and B. Van Roy. The linear programming approach to approximate dynamic programming. Operations Research, 51:850-865, 2003.
4. C. H. Papadimitriou and J. N. Tsitsiklis. The complexity of optimal queueing network control. Mathematics of Operations Research, 24:293-305, 1999.
5. J. R. Morrison and P. R. Kumar. New linear program performance bounds for queueing networks. Journal of Optimization Theory and Applications, 100:575-597, 1999.
6. M. H. Veatch. Approximate dynamic programming for networks: Fluid models and constraint reduction. Submitted for publication, 2005. Available at http://faculty.gordon.edu/ns/mc/mike veatch/
7. H. Jin, J. Ou and P. R. Kumar. The throughput of irreducible closed Markovian queueing networks: Functional bounds, asymptotic loss, efficiency, and the Harrison- Wein conjectures. Mathematics of Operations Research, 22:886-920, 1997.
8. J. R. Morrison and P. R. Kumar. New linear program performance bounds for closed queueing networks. Discrete Event Dynamic Systems, 11:291-317, 2001.
9. James R. Morrison and P. R. Kumar. Linear programming performance bounds for Markov chains with polyhedrally translation invariant transition probabilities and applications to unreliable manufacturing systems and enhanced wafer fab models. Proceedings of the ASME International Mechanical Engineering Congress and Exposition (IMECE), IMECE2002-39274, New Orleans, LA, November 2002.
10. S. Lippman. Applying a new device in the optimization of exponential queueing systems. Operations Research, 23:687-710, 1975.
11. J. G. Dai and J. H. Vande Vate. The Stability of Two-Station Multi-Type Fluid Networks. Operations Research, 48:721-744, 2000.
12. J. G. Dai, J. J. Hasenbein and J. H. Vande Vate. Stability and instability of a two-station queueing network. Annals of Applied Probability, 14:326-377, 2004.
13. J. R. Morrison and P. R. Kumar. On the guaranteed throughput and efficiency of closed reentrant lines. Queueing Systems Theory and Applications, 28:33-54, 1998.
14. C. Humes, Jr., J. Ou and P. R. Kumar. The delay of open Markovian queueing networks: Uniform functional bounds, heavy traffic pole multiplicities, and stability. Mathematics of Operations Research, 22:921-954, 1997.