Stable scheduling policies for fading wireless channels

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 454-

  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

[No Author keywords available]

Indexed keywords

CELLULAR RADIO SYSTEMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; FADING (RADIO); RADIO LINKS; VECTORS;

DELAYED QUEUE LENGTH UPDATE; FADING WIRELESS CHANNELS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0141973321     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228471     Document Type: Conference Paper

References (3)

1. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," IEEE Proceedings of Infocom, Vol.2, 533-39, 1998.
2. P. Giaccone, B. Prabhakar, D. Shah, "Towards simple, high-performance schedulers for high-aggregate bandwidth switches," IEEE Proceedings of Infocom, Vol.3, 1160-69, 2002.
3. A. Eryilmaz, R. Srikant, J. Perkins, "Stable scheduling policies for fading wireless channels," Technical report at http://www.comm.csl.uiuc.edu/~srikant, 2002.