Scheduling algorithms for multi-carrier wireless data systems

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn , Issue , 2007, Pages 3-14

  Andrews, Matthew ^a   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Max Weight; Multiple carriers; Queue performance; Scheduling; Stability; WIMAX; Wireless communication

Indexed keywords

CHANNEL CAPACITY; DECISION MAKING; NUMERICAL METHODS; PROBLEM SOLVING; SCHEDULING ALGORITHMS;

CHANNEL RATES; MAXWEIGHT ALGORITHM; WIRELESS COMMUNICATION;

MOBILE COMPUTING;

EID: 37749028463     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1287853.1287856     Document Type: Conference Paper

References (28)

1. R. Agrawal and V. Subramanian. Optimality of certain channel aware scheduling policies. In Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, October 2002.
2. M. Andrews. Instability of the proportional fair scheduling algorithm for HDR. IEEE Transactions on Wireless Communications, 3(5), 2004.
3. 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.
4. 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.
5. M. Andrews, L. Qian, and A. Stolyar. Optimal utility based multi-user throughput allocation subject to throughput constraints. In Proceedings of IEEE INFOCOM '05, 2005.
6. M. Andrews and A. Slivkins. Oscillations with TCP-like flow control in networks of queues. In Proceedings of IEEE INFOCOM '06, 2006.
7. M. Andrews and L. Zhang. Scheduling over non-stationary wireless channels with finite rate sets. IEEE/ACM Transactions on Networking, 2006.
8. P. Bender, P. Black, M. Grob, R. Padovani, and N. Sindhushayana A. Viterbi. CDMA/HDR: A bandwidth efficient high speed data service for nomadic users. IEEE Communications Magazine, July 2000.
9. C. Chekuri and S. Khanna. A PTAS for the multiple knapsack problem. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 213-222, San Francisco, CA, January 2000.
10. A. Eryilmaz and R. Srikant. Fair resource allocation in wireless networks using queue-length based scheduling and congestion control. In Proceedings of IEEE INFOCOM '05, Miami, FL, March 2005.
11. M. Fisher, G. Nemhauser, and L. Wolsey. An analysis of approximations for maximizing submodular set functions-II. Mathematical Programming Study, 1978.
12. L. Fleischer, M. Goemans, V. Mirrokni, and M. Sviridenko. Tight approximation algorithms for maximum general assignment problems. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 611-620, Miami, FL, 2006.
13. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 300 - 309, Palo Alto, CA, November 1998.
14. D. Hochbaum. Various notions of approximations; Good, better, best, and more. In Approximation algorithms for NP-hard problems, D. Hochbaum ed., pages 346-398, 1995.
15. A. Jalali, R. Padovani, and R. Pankaj. Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system. In Proceedings of the IEEE Semiannual Vehicular Technology Conference, VTC2000-Spring, Tokyo, Japan, May 2000.
16. Viggo Kann. Maximum bounded 3-dimensional matching is max snp-complete. Inf. Process. Lett., 37(1):27-35, 1991.
17. H. Kushner and P. Whiting. Asymptotic properties of proportional-fair sharing algorithms. In 40th Annual Allerton Conference on Communication, Control, and Computing, 2002.
18. X. Liu, E. Chong, and N.B.Shroff. Opportunistic transmission scheduling with resource-sharing constraints in wireless networks. IEEE Journal on Selected Areas in Communications, 19(10), 2001.
19. X. Liu, E. Chong, and N.B.Shroff. A framework for opportunistic scheduling in wireless networks. Computer Networks, 41(4):451-474, 2003.
20. M. Neely, E. Modiano, and C. Li. Fairness and optimal stochastic control for heterogeneous networks. In Proceedings of IEEE INFOCOM '05, Miami, FL, March 2005.
21. M. Neely, E. Modiano, and C. Rohrs. Power and server allocation in a multi-beam satellite with time varying channels. In Proceedings of IEEE INFOCOM '02, New York, NY, June 2002.
22. S. Shakkottai and A. Stolyar. Scheduling algorithms for a mixture of real-time and non-real-time data in HDR. In Proceedings of 17th International Teletraffic Congress (ITC-17), pages 793 - 804, Salvador da Bahia, Brazil, 2001.
23. S. Shakkottai and A. Stolyar. Scheduling for multiple flows sharing a time-varying channel: The exponential rule. Analytic Methods in Applied Probability, 207:185 - 202, 2002.
24. A. Stolyar. Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queueing Systems, 50(4):401-457, 2005.
25. A. Stolyar. On the asymptotic optimality of the gradient scheduling algorithm for multiuser throughput allocation. Operations Research, 53:12 -25, 2005.
26. 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.
27. L. Tassiulas and A. Ephremides. Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Transactions on Information Theory, 30:466 - 478, 1993.
28. D. Tse. Multiuser diversity in wireless networks. http://www.eecs. berkeley.edu/dtse/stanford416.ps, 2002.