Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking

Volumn 13, Issue 2, 2005, Pages 411-424

  Eryilmaz, Atilla ^a   Srikant, R ^a   Perkins, James R ^b  

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

^b BOSTON UNIVERSITY   (United States)

Author keywords

Resource allocation; Stability in the mean; Stochastic control; Throughput optimal scheduling

Indexed keywords

APPROXIMATION THEORY; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FADING (RADIO); MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES; STABILITY; STATISTICAL METHODS; TELECOMMUNICATION LINKS;

STABILITY IN THE MEAN; STOCHASTIC MODEL; THROUGHPUT OPTIMAL SCHEDULING;

WIRELESS TELECOMMUNICATION SYSTEMS;

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

References (19)

1. M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, R. Vijayakumar, and P. Whiting, "Scheduling in a Queueing System with Asynchronously Varying Service Rates," Bell Laboratories, Tech. Rep., 2000.
2. M. Armony and N. Bambos, "Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems," Stanford Univ., Tech. Rep. Netlab-2002-05/01.
3. D. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1995.
4. P. Billingsley, Convergence of Probability Measures. New York: Wiley, 1968.
5. P. Giaccone, B. Prabhakar, and D. Shah, "Toward simple, high-performance schedulers for high-aggregate bandwidth switches," in Proc. IEEE INFOCOM, 2002.
6. P. R. Kumar and S. P. Meyn, "Stability of queueing networks and scheduling policies," IEEE Trans. Automat. Contr., vol. 40, no. 2, pp. 251-260, Feb. 1995.
7. R. Leelahakriengkrai and R. Agrawal, "Scheduling in multimedia CDMA wireless networks," IEEE Trans. Veh. Technol., vol. 52, no. 1, pp. 226-239, Jan. 2003.
8. L. Li and A. J. Goldsmith, "Optimal resource allocation for fading broadcast channels - Part I: Ergodic capacity," IEEE Trans. Inform. Theory, vol. 47, no. 3, pp. 1083-1102, Mar. 2001.
9. X. Liu, E. Chong, and N. Shroff, "Opportunistic transmission scheduling with resource-sharing constraints in wireless networks," IEEE J. Select. Areas Commun., vol. 19, no. 10, pp. 2053-2064, Oct. 2001.
10. D. Mitra and J. Morrison, "Multiple time scale regulation and worst case processes for ATM network control," in Proc. the IEEE Conf. Decision and Control, New Orleans, LA, 1995, pp. 353-358.
11. K. Ross and N. Bambos, "Projective Processing Schedules in Queueing Structures: Applications to Packet Scheduling in Communication Network Switches," Stanford Univ., Tech. Rep. Netlab-2002-05/01.
12. S. Shakkottai, R. Srikant, and A. Stolyar, "Pathwise optimality of the exponential scheduling rule for wireless channels," in Proc. ISIT, Lausanne, Switzerland, Jul. 2002. Longer version available at http://www.comm.csl.uiuc.edu/~srikant.
13. S. Shakkottai and A. Stolyar, "Scheduling for multiple flows sharing a time-varying channel: The exponential rule," Translations of the AMS, A Volume in Memory of F. Karpelevich, ser. 2, vol. 207, 2002.
14. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Automat. Contr., vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
15. L. Tassiulas and A. Ephremides, "Dynamic server allocation to parallel queues with randomly varying connectivity," IEEE Trans. Inform. Theory, vol. 39, no. 2, pp. 466-478, Mar. 1993.
16. L. Tassiulas, "Scheduling and performance limits of networks with constantly varying topology," IEEE Trans. Inform. Theory, vol. 43, no. 3, pp. 1067-1073, May 1997.
17. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in Proc. IEEE INFOCOM, 1998, pp. 533-539.
18. D. Tse, "Multi-user diversity and proportional fairness," U.S. Patent 6,449,490, Sep. 10, 2002.
19. P. Viswanath, D. Tse, and R. Laroia, "Opportunistic beamforming using dumb antennas," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1277-1294, Jun. 2002.