Stochastic network utility maximisation - A tribute to Kelly's paper published in this journal a decade ago

European Transactions on Telecommunications

Volumn 19, Issue 4, 2008, Pages 421-442

  Yi, Yung ^a   Chiang, Mung ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; MANAGEMENT; MODAL ANALYSIS; PLANNING; RESOURCE ALLOCATION; STOCHASTIC MODELS; STOCHASTIC PROGRAMMING;

(E ,2E) THEORY; DISTRIBUTED NETWORKS; FUTURE RESEARCH; NETWORK DYNAMICS; NETWORK UTILITY; OPTIMISATION; RESEARCH EFFORTS; STOCHASTIC NETWORK MODELS; STOCHASTIC NETWORKS;

NETWORK ARCHITECTURE;

EID: 46749120268     PISSN: 1124318X     EISSN: None     Source Type: Journal    
DOI: 10.1002/ett.1285     Document Type: Article

References (89)

1. Kelly FP. Charging and rate control for elastic traffic. European Transactions on Telecommunications 1997; 8:33-37.
2. Kelly FP, Maulloo A, Tan D. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society 1998; 49:237-252.
3. Mo J, Walrand J. Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking 2000; 8(5):556-567.
4. Chiang M, Low SH, Calderbank AR, Doyle JC. Layering as optimization decomposition. Proceedings of the IEEE 2007; 95(1):255-312.
5. Shannon CE. A mathematical theory of communication. Bell Systems Technical Journal 1948; 27:379-423.
6. Lee JW, Mazumdar R, Shroff N. Non-convex optimization and rate control for multi-class services in the Internet. IEEE/ACM Transactions on Networking 2005; 13(4):827-840.
7. Hande P, Zhang S, Chiang M. Distributed rate allocation for inelastic flows. IEEE/ACM Transactions on Networking 2007; 15(6):1240-1253.
8. Kumar PR, Meyn SP. Stability of queueing networks and scheduling policies. IEEE Transactions on Automatic Control 1995; 14(2): 1055-1083.
9. Dai JG. On positive harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Annals of Applied Probability 1995; 5:49-77.
10. de Veciana G, Lee T, Konstantopoulos T. Stability and performance analysis of networks supporting elastic services. IEEE/ACM Transactions on Networking 2001; 1:2-14.
11. Bonald T, Massoulie L. Impact of fairness on internet performance. In Proceedings of ACM Sigmetrics, 2001.
12. Lin X, Shroff NB. On the stability region of congestion control. In Proceedings of the 42nd Annual Allerton Conference on Communication, Control and Computing, 2004.
13. Srikant R. On the positive recurrence of a markov chain describing file arrivals and departures in a congestion-controlled network. In IEEE Computer Communications Workshop, 2005.
14. Ye H, Ou J, Yuan X. Stability of data networks: stationary and bursty models. Operations Research 2005; 53:107-125.
15. Bramson M. Stability of networks for max-min fair routing. Presentation at INFORMS Applied Probability Conference, 2005.
16. Lakshmikantha A, Beck CL, Srikant R. Connection level stability analysis of the internet using the sum of squares (SOS) techniques. In Proceeding of the 38th Conference on Information Sciences and Systems, 2004.
17. Massoulie L. Structural properties of proportional fairness: stability and insensitivity. Annals of Applied Probability 2007; 17(3):809-839.
18. Gromoll HC, Williams R. Fluid limit of a network with fair bandwidth sharing and general document size distribution. Annals of Applied Probability 2007, in press.
19. Chiang M, Shah D, Tang A. Stochastic stability of network utility maximization: general file size distribution. In Proceedings of Allerton Conference, 2006.
20. Liu J, Proutiere A, Yi Y, Chiang M, Poor VH. Flow-level stability of data networks with non-convex and time-varying rate regions. In Proceedings of ACM Sigmetrics, 2007.
21. Bonald T, Massoulie L, Proutiere A, Virtamo J. A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Systems 2006; 53(1-2):65-84.
22. Bonald T, Borst S, Hegde N, Proutière A. Wireless data performance in multicell scenarios. In Proceedings of ACM Sigmetrics, 2004.
23. Luo W, Ephremides A. Stability of n interacting queues in random-access systems. In IEEE Transactions on Information Theory 1999; 45(5):1579-1587.
24. Borst S, Leskela L, Jonckheere M. Stability of parallel queueing systems with coupled rates. Discrete Event Dynamic Systems 2008, DOI: 10.1007/S10626-007-0021-4.
25. Jonckheere M, Borst S. Stability of multi-class queueing systems with state-dependent service rates. In Proceedings of IEEE Value Tools, 2006.
26. Szpankowski W. Stability conditions for some multi-queue distributed systems: buffered random access systems. Annals of Applied Probability 1994; 26:498-515.
27. Bonald T, Proutière A. Flow-level stability of utility-based allocations for non-convex rate regions. In Proceedings of the 40th Conference on Information Sciences and Systems, 2006.
28. Armony M, Bambos N. Queueing dynamics and maximal throughput scheduling in switched processing systems. Queueing Systems 2003; 44(3):209-252.
29. Kelly FP, Williams RJ. Fluid model for a network operating under a fair bandwidth-sharing policy. Annals of Applied Probability 2004; 14:1055-1083.
30. Shakkottai S, Srikant R. Mean FDE models for Internet congestion control under a many-flows regime. IEEE Transactions on Information Theory 2004; 50(6): 1050-1072.
31. Deb S, Shakkottai S, Srikant R. Asymptotic behavior of internet congestion controllers in a many-flows regime. Mathematics of Operation Research 2005; 30(2)420-440.
32. Baccelli F, McDonald DR, Reynier J. A mean-field model for multiple TCP connections through a buffer implementing RED. Performance Evaluation 2002; 49(1-4):77-97.
33. Tinnakornsrisuphap P, La RJ. Characterization of queue fluctuations in probabilistic AQM mechanisms. In Proceedings of ACM Sigmetrics, 2004.
34. Yi Y, Shakkottai S. On the elasticity of marking functions in an integraded network. IEEE Transactions on Automatic Control 2008; in press.
35. Johari R, Tan D. End-to-end congestion control for the Internet: delays and stability. IEEE/ACM Transactions on Networking 2001; 9(6): 818-832.
36. Cao J, Ramanan K. A poisson limit for buffer overflow probabilities. In Proceedings of IEEE Infocom, New York, NY, 2002.
37. Deb S, Srikant R. Rate-based versus Queue-based models of congestion control. In Proceedings of ACM Sigmetrics, 2004.
38. Yi Y, Deb S, Shakkottai S. Time-scale decomposition and rate-based marking. IEEE/ACM Trasactions on Networking 2006; 14(5):938-950.
39. Raina G, Wischik D. Buffer sizes for large multiplexers: TCP queueing theory and instability analysis. In Proceedings of Next Generation Internet Networks, 2005.
40. Chang CS, Liu Z. A bandwidth sharing theory for a large number of http-like connections. IEEE/ACM Transactions on Networking 2004; 12(5):952-962.
41. Zhang J, Zheng D, Chiang M. The impact of stochastic noisy feedback on distributed network utility maximization. IEEE Transactions on Information Theory 2008; 54(2):645-665.
42. Chiang M. Balancing transport and physical layers in wireless multihop networks: jointly optimal congestion control and power control. IEEE Journal on Selected Areas in Communications 2005; 23(1): 104-116.
43. Mehyar M, Spanos D, Low SH. Optimization flow control with estimation error. In Proceedings of IEEE Infocom, 2004.
44. Tassiulas L, Ephremides A. Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control 1992; 37(12): 1936-1949.
45. Agrawal R, Subramanian V. Optimality of certain channel aware scheduling policies. In Proceedings of the 40th Annual Allerton Conference on Communication, Control and Computing, 2002.
46. Kushner HJ, Whiting PA. Convergence of proportional-fair sharing algorithms under general conditions. IEEE Transactions on Wireless Communications 2004; 3(4):1250-1259.
47. Liu X, Chong EKP, Shroff NB. Opportunistic transmission scheduling with resource-sharing constraints in wireless networks. IEEE Journal on Selected Areas in Communications 2001; 19(10):2053-2064.
48. Viswanath P, Tse D, Laroia R. Opportunistic beamforming using dub antennas. IEEE Transactions on Information Theory 2002; 48(6)49-77.
49. Stolyar AL. On the asymptotic optimality of the gradient scheduling algorithm for multi-user throughput allocation. Operations Research 2005; 53(1): 12-25.
50. Andrews DM. Instability of the proportional fair scheduling algorithm for HDR. IEEE Transactions on Wireless Communications 2004; 3(5):1422-1426.
51. Eryilmaz A, Srikant R. Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control. In Proceedings of IEEE Infocom, 2005.
52. Lin X, Shroff NB. The impact of imperfect scheduling on cross-layer rate control in wireless networks. In Proceedings of IEEE Infocom, 2005.
53. Neely MJ, Modiano E, Li C. Fairness and optimal stochastic control for heterogeneous networks. In Proceedings of IEEE Infocom, 2005.
54. Stolyar AL. Maximizing queueing network utility subject to statbility: greedy primal-dual algorithm. Queueing Systems 2005; 50(4)401-457.
55. Chen L, Low SH, Chiang M, Doyle JC. Joint optimal congestion control, routing, and scheduling in wireless ad hoc networks. In Proceeding of IEEE Infocom, 2006.
56. Eryilmaz A, Srikant R. Joint congestion control, routing, and mac for stability and fairness in wireless networks. IEEE Journal on Selected Areas in Communications 2006; 24(8):1514-1524.
57. Stolyar A. Greedy primal-dual algorithm for dynamic resource allocation in complex networks. Queueing Systems 2006; 54:203-220.
58. Low SH. A duality model of TCP and queue management algorithms. IEEE/ACM Transactions on Networking 2003; 11(4):525-536.
59. Low S, Srikant R. A mathematical framework for designing a low-loss low-delay internet. Network and Spatial Economics, special issue on Crossovers between transportation planning and telecommunications 2003;4:75-101.
60. Srikant R. The mathematics of Internet Congestion Control. Birkhauser, 2004.
61. Neely MJ. Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks. IEEE Journal on Selected Areas in Communications 2006; 24(8):1489-1501.
62. Chaporkar P, Sarkar S. Stable scheduling policies for maximizing throughput in generalized constrained queueing. In Proceedings of IEEE Infocom, 2006.
63. Bender P, Black P, Grob M, Padovani R, Sindhushayana N, Viterbi A. CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users. IEEE Communications Magazine 2000; 38(4): 70-77.
64. Borst S. User-level performance of channel-aware scheduling algorithms in wireless data networks. In Proceedings of IEEE Infocom, 2003.
65. Paschalidis IC, Liu Y. Pricing in multiservice loss networks: static pricing, asymptotic optimality, and demand substitution effects. IEEE/ACM Transactions on Networking 2002; 10(3): 425-438.
66. Paschalidis IC, Tsitsiklis JN. Congestion-dependent pricing of network services. IEEE/ACM Transactions on Networking 2000; 8(2):171-184.
67. Key P, Massoulie L. Fluid models of integrated traffic and multipath routing. Queueing Systems 2006; 53(1-2):85-98.
68. Key P, Massoulie L, Bain A, Kelly F. Fair internet traffic integration: network flow models and analysis. Annales des Telecommunications 2004; 59:1338-1352.
69. Bonald T, Proutiere A. Insensitive bandwidth sharing in data networks. Queueing Systems 2003; 44(1):69-100.
70. Bonald T, Penttinen A, Virtamo J. On light and heavy traffic approximations of balanced fairness. In Proceedings of ACM Sigmetrics, 2006.
71. Villamizar C, Song C. High performance TCP in ANSNET. ACM/SIGCOMM Computer Communications Review 1994; 24(5): 45-60.
72. Appenzeller G, Keslassy I, McKeown N. Sizing router buffers. In Proceedings of ACM Sigcomm, 2004.
73. Enachescu M, Ganjali Y, Goel A, McKeown N, Roughgarden T. Part iii: Routers with very small buffers. ACM/SIGCOMM Computer Communication Review 2005; 35(3):83-90.
74. Dhamdhere A, Dovrolis C. Open issues in router buffer sizing. ACM/SIGCOMM Computer Communications Review 2006; 36(1): 87-92.
75. Tassiulas L. Linear complexity algorithms for maximum throughput in radionetworks and input queued switches. In Proceedings of IEEE Infocom, 1998.
76. Chaporkar P, Kar K, Sarkar S. Throughput guarantees through maximal scheduling in wireless networks. Proceedings of the 43rd Annual Allerton Conference on Communication, Control and Computing, 2005.
77. Sharma G, Mazumdar RR, Shroff NB. On the complexity of scheduling in wireless networks. In Proceedings of ACM Mobicom, 2006.
78. Sharma G, Shroff NB, Mazumdar RR. Joint congestion control and distributed scheduling for throughput guarantees in wireless networks. In Proceedings of IEEE Infocom, 2007.
79. Wu X, Srikant R. Bounds on the capacity region of multi-hop wireless networks under distributed greedy scheduling. In Proceedings of IEEE Infocom, 2006.
80. Yi Y, Proutiere A, Chiang M. Complexity in wireless scheduling: impact and tradeoffs. In Proceedings of ACM Mobihoc, 2008.
81. Joo C, Shroff NB. Performance of random access scheduling schemes in multi-hop wireless networks. In Proceedings of IEEE Infocom, 2007.
82. Lin X, Rasool S. Constant-time distributed scheduling policies for ad hoc wireless networks. In Proceedings of IEEE CDC, 2006.
83. Ray S, Sarkar S. Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning. Proceedings of Information Theory and Applications Second Workshop, 2007.
84. Sanghavi S, Bui L, Srikant R. Distributed link scheduling with constant overhead. In Proceedings of ACM Sigmetrics, 2007.
85. Yi Y, Chiang M. Wireless scheduling with o(1) complexity for m-hop interference model. In Proceeding of ICC, 2008.
86. Jung K, Shah D. Low delay scheduling in wireless network. In Proceeding of ISIT, 2007.
87. Yi Y, de Veciana G, Shakkottai S. Learning contention patterns and adapting to load/topology changesin in a MAC scheduling algorithm. In Proceedings of IEEE WiMesh, 2007.
88. Yi Y, de Veciana G, Shakkottai S. On optimal MAC scheduling under a physical interference model. In Proceedings of IEEE Infocom, 2006.
89. CAIDA. Http://www.caida.org