Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control

IEEE/ACM Transactions on Networking

Volumn 15, Issue 6, 2007, Pages 1333-1344

  Eryilmaz, Atilla ^a   Srikant, R ^b  

^a Ohio State University   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Congestion control; m weighted fairness; Proportional fairness; Resource management; Telecommunication congestion control; Throughput optimal scheduling; Wireless communication; Wireless networks

Indexed keywords

BASE STATIONS; CHANNEL ESTIMATION; CONGESTION CONTROL (COMMUNICATION); QUEUEING THEORY; RADIO RECEIVERS; RESOURCE ALLOCATION; SCHEDULING ALGORITHMS;

CHANNEL STATISTICS; PROPORTIONAL FAIRNESS; QUEUE-LENGTH-BASED SCHEDULING;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 37549069277     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.897944     Document Type: Article

References (44)

1. R. Agrawal, A. Bedekar, R. J. La, and V. Subramanian, "Class and channel condition based weighted proportionally fair scheduler," in Proc. Int. Teletraffic Congr., 2001, pp. 553-65.
2. T. Alpcan and T. Başar, "A utility-based congestion control scheme for internet-style networks with delay," presented at the IEEE INFOCOM, San Francisco, CA, 2003.
3. M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, R. Vijayakumar, and P. Whiting, "Providing quality of service over a shared wireless link," IEEE Commun. Mag., Feb. 2001.
4. M. Armony and N. Bambos, Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems Stanford Univ., Technical Report Netlab-2001-09/01.
5. S. Asmussen, Applied Probability and Queues. New York: Springer-Verlag, 2003.
6. D. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1995.
7. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice Hall, 1987.
8. S. C. Borst, "User-level performance of channel-aware scheduling algorithms in wireless data networks," in Proc. IEEE INFOCOM, 2003.
9. S. C. Borst and P. A. Whiting, "Dynamic rate control algorithms for HDR throughput optimization," in Proc. IEEE INFOCOM, 2001, pp. 976-985.
10. R. Buche and H. J. Kushner, "Control of mobile communication systems with time-varying channels via stability methods," IEEE Trans. Autom. Contr., vol. 49, no. 11, pp. 1954-1962, Nov. 2004.
11. A. Eryilmaz, "Efficient and Fair Scheduling for Wireless Networks," Ph.D. dissertation, Univ. of Illinois, Urbana-Champaign, Aug. 2005.
12. A. Eryilmaz, R. Srikant, and J. Perkins, "Stable scheduling policies for fading wireless channels," in Proc. IEEE Int. Symp. Information Theory, 2003.
13. A. Eryilmaz, R. Srikant, and J. R. Perkins, "Stable scheduling policies for fading wireless channels," IEEE/ACM Trans. Networking, vol. 13, pp. 411-425, Apr. 2005.
14. R. J. Gibbens and F. P. Kelly, "Resource pricing and the evolution of congestion control," Automatica, vol. 35, pp. 1969-1985, 1999.
15. A. Jalali, R. Padovani, and R. Pankaj, "Data throughput of CDMA-HDR: A high efficiency-high data rate personal communication system," in Proc. IEEE Vehicular Technology Conf., May 2000, pp. 1854-1858.
16. F. P. Kelly, "Charging and rate control for elastic traffic," Eur. Trans. Telecommun., vol. 8, pp. 33-37, 1997.
17. F. P. Kelly, A. Maulloo, and D. Tan, "Rate control in communication networks: Shadow prices, proportional fairness and stability," J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
18. H. Khalil, Nonlinear Systems, 2nd ed. Upper Saddle River, NJ: Prentice Hall, 1996.
19. S. Kunniyur and R. Srikant, "Analysis and design of an adaptive virtual queue algorithm for active queue management," in Proc. ACM SIGCOMM San Diego, CA, Aug. 2001, pp. 123-134.
20. S. Kunniyur and R. Srikant, "A time-scale decomposition approach to adaptive ECN marking," IEEE Trans. Autom. Contr., vol. 47, no. 6, pp. 882-894, June 2002.
21. H. J. Kushner and P. A. Whiting, "Convergence of proportional-fair sharing algorithms under general conditions," IEEE Trans. Wireless Commun., vol. 3, pp. 1250-1259, Jul. 2004.
22. A. Lakshmikantha, C. Beck, and R. Srikant, "Robustness of real and virtual queue based active queue management schemes," IEEE/ACM Trans. Networking, vol. 13, no. 1, pp. 81-93, Feb. 2005.
23. R. Leelahakriengkrai and R. Agrawal, "Scheduling in multimedia wireless networks," in Proc. ITC, 2001.
24. X. Lin and N. Shroff, "The multi-path utility maximization problem," presented at the Allerton Conf. Communications, Control and Computing, Monticello, IL, Oct. 2003.
25. X. Liu, E. Chong, and N. Shroff, "Opportunistic transmission scheduling with resource-sharing constraints in wireless networks," IEEE J. Sel. Areas Commun., vol. 19, no. 10, pp. 2053-2064, Oct. 2001.
26. Y. Liu and E. Knightly, "Opportunistic fair scheduling over multiple wireless channels," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 2003.
27. S. H. Low and D. E. Lapsley, "Optimization flow control, I: Basic algorithm and convergence," IEEE/ACM Trans. Networking, pp. 861-875, Dec. 1999.
28. M. J. Neely, E. Modiano, and C. E. Rohrs, "Dynamic power allocation and routing for time varying wireless networks," presented at the IEEE INFOCOM, 2003.
29. J. R. Norris, Markov Chains. Cambridge, U.K.: Cambridge Univ. Press, 1997.
30. F. Paganini, "A global stability result in network flow control," Syst. Contr. Lett., vol. 46, no. 3, pp. 153-163, 2002.
31. A. G. Pakes, "Some conditions on the ergodicity and recurrence of Markov chains," Oper. Res., p. 17, 1969.
32. S. Shakkottai, R. Srikant, and A. Stolyar, "Pathwise optimality of the exponential scheduling rule for wireless channels," Adv. Appl. Probabil., vol. 36, pp. 1021-1045, 2004.
33. S. Shakkottai and A. Stolyar, "Scheduling for multiple flows sharing a time-varying channel: The exponential rule," in Translations of the AMS, ser.2. :,2002, vol. 207, a volume in memory of F. Karpelevich.
34. R. Srikant, The Mathematics of Internet Congestion Control. London: Birkhauser, 2004.
35. A. Stolyar, "Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm," Queueing Syst., vol. 50, no. 4, pp. 401-457, 2005.
36. V. Subramanian and R. Agrawal, "A stochastic approximation analysis of channel condition aware wireless scheduling algorithms," in Proc. INFORMS Telecommunications Conf., 2002.
37. L. Tassiulas, "Scheduling and performance limits of networks with constantly varying topology," IEEE Trans. Inf. Theory, pp. 1067-1073, May 1997.
38. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Contr., pp. 1936-1948, Dec. 1992.
39. D. N. Tse, "Multi-user diversity and proportional fairness," U.S. patent 6,449,490.
40. P. Viswanath, D. Tse, and R. Laroia, "Opportunistic beamforming using dumb antennas," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1277-1294, Jun. 2002.
41. W.-H. Wang, M. Palaniswami, and S. H. Low, "Optimal flow control and routing in multi-path networks," Perform. Eval., pp. 119-132, 2003.
42. J. T. Wen and M. Arcak, "A unifying passivity framework for network flow control," in Proc. IEEE INFOCOM, 2003.
43. H. Yaiche, R. R. Mazumdar, and C. Rosenberg, "A game-theoretic framework for bandwidth allocation and pricing in broadband networks," IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 667-678, Oct. 2000.
44. A. Eryilmaz, R. Srikant, and J. Perkins, "Stable scheduling policies for fading wireless channels," IEEE/ACM Trans. Networking, vol. 13, no. 2, pp. 411-424, Apr. 2005.