Heavy-traffic optimality of a stochastic network under utility-maximizing resource allocation

Operations Research

Volumn 56, Issue 2, 2008, Pages 453-470

  Ye, Heng Qing ^a,b   Yao, David D ^c  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c Department of Earth and Environmental Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC OPTIMALITY; DIFFUSION LIMITS; MULTIPLE CLASS; NETWORK STATE; OPTIMALITY; OPTIMIZATION PROBLEMS; REAL-TIME CONTROLS; SERVICE CAPACITIES; SHARING MECHANISMS; STOCHASTIC NETWORKS; UTILITY FUNCTIONS;

PLANNING; RANDOM PROCESSES; REAL TIME CONTROL; SERVERS;

RESOURCE ALLOCATION;

EID: 55149112178     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0455     Document Type: Article

References (37)

1. Bertsekas, D., R. Gallager. 1992. Data Networks. Prentice-Hall, Englewood Cliffs, NJ.
2. Billingsley, P. 1999. Convergence of Probability Measures, 2nd ed. John Wiley & Sons, New York.
3. Bonald, T, L. Massoulie. 2001. Impact of fairness on Internet performance. Proc. ACM Sigmetrics, Cambridge, MA, 82-91.
4. Bramson, M. 1998. State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems, Theory Appl. 30 89-148.
5. Chen, H., D. D. Yao. 2001. Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization. Springer-Verlag, New York.
6. Chen, H., H. Q. Ye. 2001. Existence condition for the diffusion approximations of priority multiclass queueing networks. Queueing Systems, Theory Appl. 38 435-470.
7. Chen, H., H. Zhang. 1998. Diffusion approximations for Kumar-Seidman network under a priority service discipline. Oper. Res. Lett. 23 171-181.
8. Chen, H., H. Zhang. 2000. A sufficient condition and a necessary condition for the diffusion approximations of multiclass queueing networks under priority service disciplines. Queueing Systems, Theory Appl. 34 237-268.
9. 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.
10. de Veciana, G., T. J. Lee, T. Konstantopoulos. 2001. Stability and performance analysis of networks supporting elastic services. IEEE/ACM Trans. Networking 9 2-14.
11. Fayolle, G., A. de La Fortell, J.-M. Lasgouttes, L. Massoulié, J. Roberts. 2001. Best-effort networks: Modeling and performance analysis via large networks asymptotics. Proc. IEEE INFOCOM, Anchorage, AK, 709-716.
12. Harrison, J. M. 2000. Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 10 75-103. Correction: 13 390-393, 2003.
13. Harrison, J. M. 2003. A broader view of Brownian networks. Ann. Appl. Probab. 13(3) 1119-1150.
14. Harrison, J. M., M. J. López. 1999. Heavy traffic resource pooling in parallel-server systems. Queueing Systems Theory Appl. 33 339-368.
15. Harrison, J. M., J. A. Van Mieghem. 1997. Dynamic control of Brownian networks: State space collapse and equivalent workload formulations. Ann. Appl. Probab. 7 747-771.
16. Kelly, F. P. 1986. Blocking probabilities in large circuit-switched networks. Adv. Appl. Probab. 18 473-505.
17. Kelly, F. P. 1988. Routing in circuit-switched networks: Optimization, shadow prices and decentralization. Adv. Appl. Probab. 20 112-144.
18. Kelly, F. P. 1997. Charging and rate control for elastic traffic. Eur. Trans. Telecomm. 29 1009-1016.
19. Kelly, F. P. 2001. Mathematical modeling of the Internet. B. Engquist, W. Schmid, eds. Mathematics Unlimited - 2001 and Beyond. Springer-Verlag, Berlin, Germany, 685-702.
20. Kelly, F. P., C. N. Laws. 1993. Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Systems, Theory Appl. 13 47-86.
21. Kelly, F. P., R. J. Williams. 2004. Fluid model for a network operating under a fair bandwidth-sharing policy. Ann. Appl. Probab. 14 1055-1083.
22. Kelly, F. P., A. Maulloo, D. Tan. 1998. Rate control in communication networks: Shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49 237-252.
23. Laws, C. N. 1992. Resource pooling in queueing networks with dynamic routing. Adv. Appl. Probab. 24 699-726.
24. Low, S. 2003. A duality model of TCP and queue management algorithms. IEEE/ACM Trans. Networking 11(4) 525-536.
25. Mandelbaum, A., A. L. Stolyar. 2004. Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52(6) 836-855.
26. Massoulie, L., J. W. Roberts. 1999. Bandwidth sharing: Objectives and algorithms. Proc. IEEE INFOCOM, New York, 1395-1403.
27. Massoulie, L., J. W. Roberts. 2000. Bandwidth sharing and admission control for elastic traffic. Telecomm. Systems 15 185-201.
28. Mo, J., J. C. Walrand. 2000. Fair end-to-end window-based congestion control. IEEE/ACM Trans. Networking 8 556-567.
29. Ross, K. W. 1995. Multiservice Loss Models for Broadband Telecommunication Networks. Springer-Verlag, New York.
30. Rudin, W. 1987. Real and Complex Analysis, 3rd ed. McGraw-Hill, New York.
31. Stolyar, A. L. 2004. Max-weight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14 1-53.
32. Stolyar, A. L. 2005. On the asymptotic optimality of the gradient scheduling algorithm for multi-user throughput allocation. Oper. Res. 53 12-25.
33. Wen, J. T., M. Arcak. 2004. A unifying passivity framework for network flow control. IEEE Trans. Automatic Control 49(2) 162-174.
34. Whitt, W. 1985. Blocking when service is required from several facilities simultaneously. AT&T Tech. J. 64 1807-1856.
35. Williams, R. J. 2000. On dynamic scheduling of a parallel server system with complete resource pooling. D. R. McDonald, S. R. E. Turner, eds. Analysis of Communication Networks: Call Centres, Traffic and Performance, Vol. 28. Fields Institute Communications, American Mathematical Society, Providence, RI, 49-71.
36. Ye, H. Q. 2003. Stability of data networks under an optimization-based bandwidth allocation. IEEE Trans. Automatic Control 48(7) 1238-1242.
37. Ye, H. Q., J. Ou, X. M. Yuan. 2005. Stability of data networks: Stationary and bursty models. Oper. Res. 53(1) 107-125.