User-level performance of channel-aware scheduling algorithms in wireless data networks

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2003, Pages 321-331

  Borst, Sem ^a,b,c  

^a LUCENT TECHNOLOGIES   (United States)

^b CWI   (Netherlands)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Channel aware scheduling; Elastic traffic; Insensitivity; Processor Sharing; Proportional Fair scheduling; Response time; Stability; Throughput optimization; Wireless data networks

Indexed keywords

ALGORITHMS; CODE DIVISION MULTIPLE ACCESS; PROBABILITY; SCHEDULING; BLOCKING PROBABILITY; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; RESPONSE TIME (COMPUTER SYSTEMS); THROUGHPUT;

WIRELESS DATA NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS; SCHEDULING ALGORITHMS;

CHANNELAWARE SCHEDULING; ELASTIC TRAFFIC; INSENSITIVITY; PROCESSOR SHARING; PROPORTIONAL FAIR SCHEDULING; THROUGHPUT OPTIMIZATION; WIRELESS DATA NETWORKS;

EID: 0042475172     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Agrawal, R., Bedekar, A., La, R.J., Subramanian, V. (2001). Class and channel condition based weighted proportional fair scheduler. In: Teletraffic Engineering in the Internet Era, Proc. ITC-17, Salvador da Bahia, eds. J.M. de Souza, N.L.S. da Fonseca, E.A. de Souza e Silva (North-Holland, Amsterdam), 553-565.
2. Andrews, D.M. (2002). Instability of the Proportional Fair scheduling algorithm for HDR. Technical memorandum, submitted for publication.
3. Andrews, D.M., Kumaran, K., Ramanan, K., Stolyar, A.L., Vijayakumar, R., Whiting, P.A. (2000). Scheduling in a queueing system with asynchronously varying service rates. Technical memorandum, submitted for publication.
4. Bender, P., Black, P., Grob, M., Padovani, R., Sindhushayana, N., Viterbi, A. (2000). CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users. IEEE Commun. Mag. 38 (7), 70-77.
5. Bonald, T., Proutière, A., Régnié, G., Roberts, J.W. (2001). Insensitivity results in statistical bandwidth sharing. In: Teletraffic Engineering in the Internet Era, Proc. ITC-17, Salvador da Bahia, eds. J.M. de Souza, N.L.S. da Fonseca, E.A. de Souza e Silva (North-Holland, Amsterdam), 125-136.
6. Borst, S.C. (2002). User-level performance of channel-aware scheduling algorithms in wirless data networks. CWI Report PNA-R0223.
7. Borst, S.C., Kumaran, K., Ramanan, K., Whiting, P.A. (2002). Queueing models for user-level performance of Proportional Fair scheduling. Technical memorandum, Bell Laboratories, Lucent Technologies.
8. Borst, S.C., Whiting, P.A. (2001). Dynamic rate control algorithms for HDR throughput optimization. In: Proc. Infocom 2001, 976-985.
9. Cohen, J.W. (1979). The multiple phase service network with generalized processor sharing. Acta Informatica 12, 245-284.
10. Fayolle, G., Mitrani, I., Iasnogorodski, R. (1980). Sharing a processor among many job classes. J. ACM 27, 519-532.
11. Jalali, A., Padovani, R., Pankaj, R. (2000). Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system. In: Proc. 50th IEEE Veh. Techn. Conf., 1854-1858.
12. Kelly, F.P. (1979). Reversibility and Stochastic Networks. Wiley, Chichester.
13. Kushner, H.J., Whiting, P.A. (2002). Convergence of Proportional Fair sharing algorithms under general conditions. Technical memorandum, submitted for publication.
14. Liu, X., Chong, E.K.P., Shroff, N.B. (2001). A framework for opportunistic scheduling. Technical report, submitted for publication.
15. Neely, M.J., Modiano, E., Rohrs, C.E. (2002). Power and server allocation in a multi-beam satellite with time varying channels. In: Proc. Infocom 2002, 1451-1460.
16. Rege, K.M., Sengupta, B. (1996). Queue-length distribution for the discriminatory processor-sharing queue. Oper. Res. 44, 653-657.
17. Shakkottai, S., Stolyar, A.L. (2001). Scheduling algorithms for a mixture of real-time and non-real time data in HDR. In: Teletraffic Engineering in the Internet Era, Proc. ITC-17, Salvador da Bahia, eds. J.M. de Souza, N.L.S. da Fonseca, E.A. de Souza e Silva (North-Holland, Amsterdam), 793-804.
18. Stolyar, A.L. (2002). Multi-user throughput dynamics under Proportional Fair and other gradient-based scheduling algorithms, Technical memorandum, submitted for publication.
19. Tassiulas, L., Ephremides, A. (1993). Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Trans. Inf. Theory 30, 466-478.
20. Tse, D. (2002). Multi-user diversity and Proportional Fair scheduling. In preparation.