Randomized algorithms for throughput-optimality and fairness in wireless networks

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2006, Pages 1936-1941

  Eryilmaz, Atilla ^a   Modiano, Eytan ^a   Ozdaglar, Asuman ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK ROUTING; PARALLEL ALGORITHMS; RESOURCE ALLOCATION;

INTERFERENCE MODELS; NETWORK CAPACITY;

WIRELESS NETWORKS;

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

References (28)

1. M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, R. Vijayakumar, and P. Whiting. Scheduling in a queueing system with asynchronously varying service rates, 2000. Bell Laboratories Technical Report.
2. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Athena Scientific, Belmont, MA, 1997.
3. L. Bui, A. Eryilmaz, R. Srikant, and X. Wu. Joint asynchronous congestion control and distributed scheduling for wireless networks. Proceedings of IEEE Infocom 2006.
4. P. Chaporkar, K. Kar, and S. Sarkar. Throughput guarantees through maximal scheduling in wireless networks. In Proceedings of the Allerton Conference on Control, Communications and Computing, 2005.
5. A. Eryilmaz. Efficient and fair scheduling for wireless networks. PhD thesis, University of Illinois at Urbana, Champaign, August 2005.
6. A. Eryilmaz, A. Ozdaglar, and E. Modiano. Polynomial complexity algorithms for full utilization of multi-hop wireless networks, 2006. LIDS Report, submitted.
7. A. Eryilmaz and R. Srikant. Fair resource allocation in wireless networks using queue-length based scheduling and congestion control. In Proceedings of IEEE Infocom, Miami, FL, March 2005.
8. A. Eryilmaz and R. Srikant. Resource allocation of multi-hop wireless networks. In Proceedings of International Zurich Seminar on Communications, February 2006.
9. A. Eryilmaz, R. Srikant, and J. Perkins. Stable scheduling policies for fading wireless channels. In Proceedings of IEEE International Symposium on Information Theory, 2003. A longer version appeared in the IEEE/ACM Transactions on Networking, 2005.
10. A. Eryilmaz, R. Srikant, and J. R. Perkins. Stable scheduling policies for fading wireless channels. IEEE/ACM Transactions on Networking, 13:411-425, April 2005.
11. F. P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33-37, 1997.
12. F. P. Kelly, A. Maulloo, and D. Tan. Rate control in communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237-252, 1998.
13. X. Lin and N. Shroff. Joint rate control and scheduling in multihop wireless networks. In Proceedings of IEEE Conference on Decision and Control, Paradise Island, Bahamas, December 2004.
14. X. Lin and N. Shroff. The impact of imperfect scheduling on crosslayer rate control in multihop wireless networks. In Proceedings of IEEE Infocom, Miami, FL, March 2005.
15. S. H. Low and D. E. Lapsley. Optimization flow control, I: Basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7:861-875, December 1999.
16. S. Meyn and R. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, 1993.
17. E. Modiano, D. Shah, and G. Zussman. Maximizing throughput, in wireless networks via gossiping. In ACM SIGMETRICS/IFIP Performance, 2006.
18. M.J. Neely, E. Modiano, and C. Li. Fairness and optimal stochastic control for heterogeneous networks. In Proceedings of IEEE Infocom, pages 1723-1734, Miami, FL, March 2005.
19. M.J. Neely, E. Modiano, and C.E. Rohrs. Dynamic power allocation and routing for time varying wireless networks. In Proceedings of IEEE Infocom, pages 745-755, April 2003.
20. G. Sasaki and B. Hajek. Link scheduling in polynomial time. IEEE Transactions on Information Theory, 32:910-917, 1988.
21. S. Shakkottai and A. Stolyar. Scheduling for multiple flows sharing a time-varying channel: The exponential rule. Translations of the AMS, Series 2, A volume in memory of F. Karpelevich, 207:185-202, 2002.
22. R. Srikant. The Mathematics of Internet Congestion Control. Birkhäuser, Boston, MA, 2004.
23. A. Stolyar. Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queueing Systems, 50(4):401-457, 2005.
24. L. Tassiulas. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In Proceedings of IEEE Infocom, pages 533-539, 1998.
25. 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, 36:1936-1948, December 1992.
26. 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.
27. X. Wu and R. Srikant. Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with nodeexclusive spectrum sharing, 2005. Submitted to IEEE Conference on Decision and Control.
28. X. Wu and R. Srikant. Bounds on the capacity region of multi-hop wireless networks under distributedgreedy scheduling. In Proceedings of IEEE Infocom, 2006.