Scheduling with QoS constraints over rayleigh fading channels

Proceedings of the IEEE Conference on Decision and Control

Volumn 4, Issue , 2004, Pages 3447-3452

  Eryilmaz, A ^a   Srikant, R ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; PROBABILITY DENSITY FUNCTION; RAYLEIGH FADING; SCHEDULING; SIGNAL TO NOISE RATIO; THROUGHPUT; TIME DIVISION MULTIPLEXING; TIME VARYING SYSTEMS; WIRELESS TELECOMMUNICATION SYSTEMS;

CELLULAR WIRELESS COMMUNICATION; RAYLEIGH FADING CHANNELS; THRESHOLD LEVEL; WIRELESS SYSTEMS;

QUALITY OF SERVICE;

EID: 14244267339     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2004.1429242     Document Type: Conference Paper

References (13)

1. P. Bender, P. Black, M. Grob, R. Padovani, N. Sindhushayana, and A. Viterbi. Cdma/hdr: A bandwidth efficient high speed wireless data service for nomadic users. IEEE Communications Magazine, pages 70-77, July 2000.
2. A. Eryilmaz, R. Srikant, and J. Perkins. Stable scheduling policies for fading wireless channels. To be published at ACM/IEEE Transactions on Networking, available at http://www.comm.csl.uiuc.edu/~srikant.
3. P. W. Glynn and W. Whitt. Logarithmic asymptotics for steady-state tail probabilities in single-server queues. Journal of Applied Probability, 31A:131-156, 1994.
4. X. Liu, E. Chong, and N. Shroff. Opportunistic transmission scheduling with resource-sharing constraints in wireless networks. IEEE Journal on Selected Areas in Communications, 19(10):2053-2064, October 2001.
5. J. Padhye, V. Firoiu, D. Towsley, and J. Kurose. Modeling tcp throughput: A simple model and its empirical validation. In Proceedings of ACM SIGCOMM, 1998.
6. S. Sanghavi and B. Hajek. Adaptive induced fluctuations for multi-user diversity. In Proceedings of ISIT, Lausanne, Switzerland, July 2002.
7. S. Shakkottai. Effective capacity of the max-queue rule. In Proceedings of the Allerton Conference on Control, Communications and Computing, pages 665-674, 2003.
8. S. Shakkottai. Modes of overflow, effective capacity and qos for wireless scheduling. In ISIT, page 334, 2003.
9. S. Shakkottai, R. Srikant, and A. Stolyar. Pathwise optimality of the exponential scheduling rule for wireless channels. In Proceedings of ISIT, Lausanne, Switzerland, July 2002. Longer version available at http://www.comm.csl.uiuc.edu/~srikant.
10. S. Shakkottai and A. Stolyar. Scheduling for multiple flows sharing a time-varying channel: The exponential rule. Translations of the American Mathematical Society, 2001. To appear.
11. L. Tassiulas and A. Ephremides. Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Transactions on Information Theory, 39:466-478, March 1993.
12. D. N. Tse. Multi-user diversity and proportional fairness. Unpublished work. Also US Patent 6449490.
13. P. Viswanath, D. Tse, and R. Laroia. Opportunistic beamforming using dumb antennas. IEEE Transactions on Information Theory, 48(6):1277-1294, June 2002.