Scheduling over a time-varying user-dependent channel with applications to high speed wireless data

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 293-302

  Andrews, Matthew ^a   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE DIVISION MULTIPLE ACCESS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; INTEGER PROGRAMMING; PACKET SWITCHING; RESOURCE ALLOCATION; WIRELESS TELECOMMUNICATION SYSTEMS;

HIGH SPEED WIRELESS DATA; ON-LINE SCHEDULING ALGORITHMS; TIME-VARYING USER-DEPENDENT CHANNEL;

ALGORITHMS;

EID: 0036954469     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. W. Aiello, E. Kushilevitz, R. Ostrovsky, and A. Rosen. Adaptive packet routing for bursty adversarial traffic. In Proc of STOC '98, pages 359 - 368.
2. M. Andrews. Instability of proportional fair. Submitted.
3. M. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, and Z. Liu. Universal stability results and performance bounds for greedy contention-resolution protocols. Journal of the ACM, 48(1):39-69, Jan. 2001.
4. M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, R. Vijayakumar, and P. Whiting. CDMA data QoS scheduling on the forward link with variable channel conditions. Bell Labs Technical Memorandum, April 2000.
5. M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, R. Vijayakumar, and P. Whiting. Providing quality of service over a shared wireless link. IEEE Communications Magazine, February 2001.
6. E. Anshelevich, D. Kempe, and J. Kleinberg. Stability of load balancing algorithms in dynamic adversarial systems. In Proc of STOC '02.
7. B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In Proc of FOCS '01, pages 158 - 167.
8. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson. Adversarial queueing theory. Journal of the ACM, 48(1):13-38, Jan. 2001.
9. S. Borst and P. Whiting. Dynamic rate control algorithms for CDMA throughput optimization. In Proc of IEEE INFOCOM '01, Anchorage, AK, April 2001.
10. A. Jalali, R. Padovani, and R. Pankaj. Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system. In Proc of the IEEE Semiannual Vehicular Technology Conference, VTC2000-Spring, Tokyo, Japan, May 2000.
11. M. Neely, E. Modiano, and C. Rohrs. Power and server allocation in a multi-beam satellite with time varying channels. In Proc of IEEE INFOCOM '02, New York, NY, June 2002.
12. J. Rhee, T. Kim, and D. Kim. Wireless fair scheduling algorithm for 1xEV-DO system. In Proc of the IEEE Semiannual Vehicular Technology Conference, VTC2001-Fall, Atlantic City, NJ, October 2001.
13. S. Shakkottai and R. Srikant. Scheduling real-time traffic with deadlines over a wireless channel. In Proc of ACM Workshop on Wireless and Mobile Multimedia, Seattle, WA, August 1999.
14. S. Shakkottai and A. Stolyar. Scheduling algorithms for a mixture of real-time and non-real-time data in HDR. In Proc of ITC-17, pages 793 - 804, Salvador da Bahia, Brazil, 2001.
15. S. Shakkottai and A. Stolyar. Scheduling for multiple flows sharing a time-varying channel: The exponential rule. Analytic Methods in Applied Probability, 2002. To appear.
16. D. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming A, 62:461 - 474, 1993.
17. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12):1936 - 1948, December 1992.
18. D. Tse. Forward-link multiuser diversity through rate adaptation and scheduling.