Optimal routing in output-queued flexible server systems

Probability in the Engineering and Informational Sciences

Volumn 19, Issue 2, 2005, Pages 141-189

  Stolyar, Alexander L ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUEUEING THEORY;

ASYMPTOTIC OPTIMALITY; ASYMPTOTIC REGIMES; COMPLETE RESOURCE POOLING; FLEXIBLE SERVERS; NON-HOMOGENEOUS; QUEUING SYSTEMS; SCHEDULING RULES; STRICTLY CONVEXES;

SALES;

EID: 17644378716     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269964805050096     Document Type: Article

References (20)

1. Andrews, M., Kumaran, K., Ramanan, K., Stolyar, A.L., Vijayakumar, R., & Whiting, P. (2004). Scheduling in a queueing system with asynchronously varying service rates. Probability in the Engineering and Informational Sciences 18: 191-217.
2. Armony, M. & Bambos, N. (1999). Queueing networks with interacting service resources. In Proceedings of the 37th Annual Allerton Conference, pp. 42-52.
3. Bell, S.L. & Williams, R.J. (2001). Dynamic scheduling of a system with two parallel servers in heavy traffic with complete resource pooling: Asymptotic optimality of a continuous review threshold policy. Annals of Applied Probability 11: 608-649.
4. Bramson, M. (1998). State space collapse with applications to heavy traffic limits for multiclass queueing networks. Queueing Systems 30: 89-148.
5. Chen, H. & Mandelbaum, A. (1991). Leontief Systems, RBV's and RBM's. In M.H.A. Davis & R.J. Elliott (eds.), Applied stochastic analysis. Gordon and Breach Science, pp. 1-43.
6. Dai, J.G. & Prabhakar, B. (2000). The throughput of data switches with and without speedup. In Proceedings of the INFOCOM'2000, pp. 556-564.
7. Ethier, S.N. & Kurtz, T.G. (1986). Markov process: Characterization and convergence. New York: John Wiley & Sons.
8. Harrison, J.M. (1998). Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete review policies. Annals of Applied Probability 8: 822-848.
9. Harrison, J.M. & Lopez, M.J. (1999). Heavy traffic resource pooling in parallel-server systems. Queueing Systems 33: 339-368.
10. Kelly, P.P. & Laws, C.N. (1993). Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Systems 13: 47-86.
11. Laws, C.N. (1992). Resource pooling in queueing networks with dynamic routing. Advances in Applied Probability 24: 699-726.
12. Mandelbaum, A. & Stolyar, A.L. (2004). Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Operations Research 52(6): 836-855.
13. McKeown, N., Anantharam, V., & Walrand, J. (1996). Achieving 100% throughput in an input-queued switch. In Proceedings of the INFOCOM'96, pp. 296-302.
14. Stolyar, A.L. (2004). Max Weight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Annals of Applied Probability 14(1): 1-53.
15. Tassiulas, L. & Ephremides, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio network. IEEE Transactions on Automatic Control 37: 1936-1948.
16. Teh, Y. & Ward, A. (2002). Critical thresholds for dynamic routing in queueing networks. Queueing Systems 42: 297-316.
17. Van Mieghem, J.A. (1995). Dynamic scheduling with convex delay costs: The generalized cμ rule. Annals of Applied Probability 5: 809-833.
18. Williams, R.J. (1998). An invariance principle for semimartingale reflecting Brownian motions in an orthant. Queueing Systems 30: 5-25.
19. Williams, R.J. (1998). Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Systems 30: 27-88.
20. Williams, R.J. (2000). On dynamic scheduling of a parallel server system with complete resource pooling. Fields Institute Communications 28: 49-71.