Asymptotic optimality of maximum pressure policies in stochastic processing networks

Annals of Applied Probability

Volumn 18, Issue 6, 2008, Pages 2239-2299

  Dai, J G ^a,c   Lin, Wuqin ^b,d  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

^c Georgia Institute of Technology   (United States)

^d NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Asymptotic optimality; Backpressure policies; Brownian models; Diffusion limits; Heavy traffic; Maximum pressure policies; State space collapse; Stochastic processing networks

Indexed keywords

EID: 50249094735     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/08-AAP522     Document Type: Article

References (47)

1. ATA, B. and KUMAR, S. (2005). Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies. Ann. Appl. Probab. 15 331-391. MR2115046
2. BELL, S. L. and WILLIAMS, R. J. (2005). Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: Asymptotic optimality of a threshold policy. Electron. J. Probab. 10 1044-1115 (electronic). MR2164040
3. BELL, S. L. and WILLIAMS, R. J. (2001). Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probab. 11 608-649. MR1865018
4. BILLINGSLEY, P. (1999). Convergence of Probability Measures, 2nd ed. Wiley, New York. MR1700749
5. BRAMSON, M. (1994). Instability of FIFO queueing networks. Ann. Appl. Probab. 4 414-431. MR1272733
6. BRAMSON, M. (1998). State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems Theory Appl. 30 89-148. MR1663763
7. BRAMSON, M. and DAI, J. G. (2001). Heavy traffic limits for some queueing networks. Ann. Appl. Probab. 11 49-90. MR1825460
8. BRAMSON, M. and WILLIAMS, R. J. (2003). Two workload properties for Brownian networks. Queueing Syst. 45 191-221. MR2024178
9. BUDHIRAJA, A. and GHOSH, A. P. (2005). A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic. Ann. Appl. Probab. 15 1887-1935. MR2152248
10. CHEN, H. and MANDELBAUM, A. (1991). Stochastic discrete flow networks: Diffusion approximations and bottlenecks. Ann. Probab. 19 1463-1519. MR1127712
11. CHEN, H. and YAO, D. D. (2001). Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization. Springer, New York. MR1835969
12. CHEN, H. and ZHANG, H. (2000). Diffusion approximations for some multiclass queueing networks with FIFO service disciplines. Math. Oper. Res. 25 679-707. MR1855373
13. CHUANG, S.-T., GOEL, A., MCKEOWN, N. and PRABHAKAR, B. (1999). Matching output queueing with a combined input output queued switch. IEEE Journal on Selected Areas in Communications 17 1030-1039.
14. DAI, J. G. (1995). On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probab. 5 49-77. MR1325041
15. DAI, J. G. and KURTZ, T. G. (1995). A multiclass station with Markovian feedback in heavy traffic. Math. Oper. Res. 20 721-742. MR1354779
16. DAI, J. G. and LIN, W. (2005). Maximum pressure policies in stochastic processing networks. Oper. Res. 53 197-218. MR2131925
17. DAI, J. G. and WILLIAMS, R. J. (2003). Stochastic networks, fluids and diffusions. Unpublished manuscript. Available at http://www.isye.gatech.edu/faculty/dai/.
18. ETHIER, S. N. and KURTZ, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York. MR838085
19. GANS, N., KOOLE, G. and MANDELBAUM, A. (2003). Telephone call centers: Tutorial, review, and research prospects. Management Science and Operations Management 5 79-141.
20. GEORGIADIS, L., NEELY, M. J. and TASSIULAS, L. (2006). Resource allocation and cross-layer control in wireless networks. Foundations and Trends in Networking 1 1-144.
21. HARRISON, J. M. (1988). Brownian models of queueing networks with heterogeneous customer populations. In Stochastic Differential Systems, Stochastic Control Theory and Applications (Minneapolis, Minn., 1986). The IMA Volumes in Mathematics and Its Applications 10 147-186. Springer, New York. MR934722
22. HARRISON, J. M. (1996). The BIGSTEP approach to flow management in stochastic processing networks. In Stochastic Networks: Theory and Applications (F. P. Kelly, S. Zachary and I. Ziedins, eds.). Lecture Note Series 4 57-90. Oxford Univ. Press.
23. HARRISON, J. M. (1998). Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies. Ann. Appl. Probab. 8 822-848. MR1627791
24. HARRISON, J. M. (2000). Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 10 75-103. MR1765204
25. HARRISON, J. M. (2002). Stochastic networks and activity analysis. In Analytic Methods in Applied Probability. American Mathematical Society Translations, Series 2 207 53-76. Amer. Math. Soc., Providence, RI. MR1992207
26. HARRISON, J. M. (2003). A broader view of Brownian networks. Ann. Appl.Probab. 13 1119-1150. MR1994047
27. HARRISON, J. M. and LÓPEZ, M. J. (1999). Heavy traffic resource pooling in parallel-server systems. Queueing Systems Theory Appl. 33 339-368. MR1742575
28. HARRISON, J. M. and VAN MIEGHEM, J. A. (1997). Dynamic control of Brownian networks: State space collapse and equivalent workload formulations. Ann. Appl. Probab. 1 747-771. MR1459269
29. HARRISON, J. M. and WEIN, L. M. (1989). Scheduling networks of queues: Heavy traffic analysis of a simple open network. Queueing Systems Theory Appl. 5 265-279. MR1030470
30. IGLEHART, D. L. and WHITT, W. (1970). Multiple channel queues in heavy traffic. I. Adv. in Appl. Probab. 2 150-177. MR0266331
31. KUMAR, P. R. (1993). Re-entrant lines. Queueing Systems Theory Appl. 13 87-110. MR1218845
32. LUENBERGER, D. (1984). Linear and Nonlinear Programming. Addison-Wesley, Reading, MA.
33. MANDELBAUM, A. and STOLYAR, A. L. (2004). Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52 836-855. MR2104141
34. MANGASARIAN, O. L. (1979). Uniqueness of solution in linear programming. Linear Algebra Appl. 25 151-162. MR528721
35. MARTINS, L. F., SHREVE, S. E. and SONER, H. M. (1996). Heavy traffic convergence of a controlled, multiclass queueing system. SIAM J. Control Optim. 34 2133-2171. MR1416504
36. RUDIN, W. (1991). Functional Analysis, 2nd ed. McGraw-Hill, New York. MR1157815
37. SHAH, D. and WISCHIK, D. (2006). Optimal scheduling algorithms for input-queued switches. In Proceeding of INFOCOM.
38. STOLYAR, A. L. (2004). Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14 1-53. MR2023015
39. TASSIULAS, L. (1995). Adaptive back-pressure congestion control based on local information. IEEE Trans. Automat. Control 40 236-250. MR1312890
40. TASSIULAS, L. and BHATTACHARYA, P. P. (2000). Allocation of interdependent resources for maximal throughput. Comm. Statist. Stochastic Models 16 27-48. MR1742516
41. TASSIULAS, L. and EPHREMIDES, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automat. Control 37 1936-1948. MR1200609
42. TASSIULAS, L. and EPHREMIDES, A. (1993). Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Trans. Inform. Theory 39 466-478. MR1224342
43. WILLIAMS, R. J. (1996). On the approximation of queueing networks in heavy traffic. In Stochastic Networks: Theory and Applications (F. P. Kelly, S. Zachary and I. Ziedins, eds.) 35-56. Oxford Univ. Press, Oxford.
44. WILLIAMS, R. J. (1998a). Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Systems Theory Appl. 30 27-88. MR1663759
45. WILLIAMS, R. J. (1998b). An invariance principle for semimartingle reflecting Brownian motions in an orthant. Queueing Systems Theory Appl. 30 5-25.
46. WILLIAMS, R. J. (2000). On dynamic scheduling of a parallel server system with complete resource pooling. In Analysis of Communication Networks: Call Centres, Traffic and Performance (Toronto, ON, 1998). Fields Institute Communications 28 49-71. Amer. Math. Soc., Providence, RI. MR1788708
47. WRIGHT, S. J. (1997). Primal-Dual Interior-Point Methods. SIAM, Philadelphia, PA. MR1422257