Distributed cross-layer algorithms for the optimal control of multihop wireless networks

IEEE/ACM Transactions on Networking

Volumn 18, Issue 2, 2010, Pages 638-651

  Eryilmaz, Atilla ^a   Ozdaglar, Asuman ^b   Shah, Devavrat ^b   Modiano, Eytan ^b  

^a Ohio State University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Congestion control; Dynamic routing; Fair allocation; Multihop wireless networks; Network optimization; Randomized algorithms; Throughout optimal scheduling

Indexed keywords

CONGESTION CONTROL; FAIR ALLOCATION; MULTIHOP WIRELESS NETWORK; NETWORK OPTIMIZATION; OPTIMAL SCHEDULING; RANDOMIZED ALGORITHMS;

ALGORITHMS; COMPUTATIONAL EFFICIENCY; DYNAMIC ROUTING ALGORITHMS; ERRORS; OPTIMIZATION; TELECOMMUNICATION NETWORKS;

WIRELESS NETWORKS;

EID: 77951130242     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2009.2030681     Document Type: Article

References (46)

1. M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, R. Vijayakumar, and P.Whiting, "Scheduling in a queueing system with asynchronously varying service rates," Probab. Eng. Inf. Sci., vol.18, pp. 191-217, 2004.
2. E. Arikan, "Some complexity results about packet radio networks," IEEE Trans. Inf. Theory, vol.IT-30, no.4, pp. 681-685, Jul. 1984.
3. S. Asmussen, Applied Probability and Queues. New York: Springer-Verlag, 2003.
4. M. Bayati, B. Prabhakar, D. Shah, and M. Sharma, "Iterative scheduling algorithms," in Proc. IEEE INFOCOM, 2007, pp. 445-453.
5. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont, MA: Athena Scientific, 1997.
6. L. Bui, A. Eryilmaz, R. Srikant, and X. Wu, "Joint asynchronous congestion control and distributed scheduling for wireless networks," presented at the IEEE INFOCOM, 2006.
7. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees through maximal scheduling in wireless networks," presented at the Allerton Conf. Control, Commun. Comput., 2005.
8. L. Chen, S. H. Low, M. Chiang, and J. C. Doyle, "Jointly optimal congestion control, routing, and scheduling for wireless ad hoc networks," presented at the IEEE INFOCOM, Barcelona, Spain, Apr. 2006.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms. London, U.K.: M.I.T. Press, McGraw-Hill, 2001.
10. D. Shah, D. N. C. Tse, and J. N. Tsitsiklis, "Hardness of low delay network scheduling," IEEE Trans. Inf. Theory, 2009, submitted for publication.
11. J. Dai and B. Prabhakar, "The throughput of switches with and without speed-up," in Proc. IEEE INFOCOM, 2000, pp. 556-564.
12. A. Eryilmaz, E. Modiano, and A. Ozdaglar, "Randomized algorithms for throughput-optimality and fairness in wireless networks," in Proc. IEEE Conf. Decision Control, San Diego, CA, Dec. 2006, pp. 1936-1941. (Pubitemid 351283928)
13. A. Eryilmaz, A. Ozdaglar, and E. Modiano, "Polynomial complexity algorithms for full utilization of multihop wireless networks," in Proc. IEEE INFOCOM, 2007, pp. 499-507.
14. A. Eryilmaz, A. Ozdaglar, D. Shah, and E. Modiano, "Imperfect randomized algorithms for the optimal control of wireless networks," in Proc. CISS, 2008, pp. 922-937.
15. A. Eryilmaz and R. Srikant, "Fair resource allocation in wireless networks using queue-length based scheduling and congestion control," in Proc. IEEE INFOCOM, Miami, FL, Mar. 2005, vol.3, pp. 1794-1803.
16. A. Eryilmaz and R. Srikant, "Joint congestion control, routing and mac for stability and fairness in wireless networks," IEEE J. Sel. Areas Commun., vol.14, no.8, pp. 1514-1524, Aug. 2006.
17. A. Eryilmaz, R. Srikant, and J. R. Perkins, "Stable scheduling policies for fading wireless channels," IEEE/ACM Trans. Netw., vol.13, no.2, pp. 411-425, Apr. 2005.
18. R. G. Gallager, P. A. Humblet, and P. M. Spira, "A distributed algorithm for minimum-weight spanning trees," ACM Trans. Prog. Lang. Syst., vol.5, pp. 66-77, 1983.
19. P. Giaccone, B. Prabhakar, and D. Shah, "Randomized scheduling algorithms for high-aggregate bandwidth switches," IEEE J. Sel. Areas Commun., vol.21, no.4, pp. 546-559, May 2003.
20. C.Joo, X. Lin, andN. Shroff, "Understanding the capacity region of the greedy maximal scheduling algorithm in multihop wireless networks," in Proc. IEEE INFOCOM, 2008, pp. 1103-1111.
21. K. Jung and D. Shah, "Low delay scheduling in wireless networks," in Proc. ISIT, 2007, pp. 1396-1400.
22. F. P. Kelly, "Charging and rate control for elastic traffic," Eur. Trans. Telecommun., vol.8, pp. 33-37, 1997.
23. F. P. Kelly, A. Maulloo, and D. Tan, "Rate control in communication networks: Shadow prices, proportional fairness and stability," J. Oper. Res. Soc., vol.49, pp. 237-252, 1998.
24. I. Keslassy and N. McKeown, "Analysis of scheduling algorithms that provide 100% throughput in input-queued switches," presented at the Allerton Conf. Contr., Commun. Comput., 2001.
25. X. Lin and N. Shroff, "Joint rate control and scheduling in multihop wireless networks," in Proc. IEEE Conf. Decision Control, Paradise Island, Bahamas, Dec. 2004, vol.2, pp. 1484-1489.
26. X. Lin and N. Shroff, "The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks," in Proc. IEEE IN-FOCOM, Miami, FL, Mar. 2005, vol.3, pp. 1804-1814.
27. S. H. Low and D. E. Lapsley, "Optimization flow control, I: Basic algorithm and convergence," IEEE/ACM Trans. Netw., vol.7, no.6, pp. 861-875, Dec. 1999.
28. M. Marsan, E. Leonardi, M. Mellia, and F. Neri, "On the stability of input-buffer cell switches with speed-up," in Proc. IEEE INFOCOM, 2000, vol.3, pp. 1604-1614.
29. E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless networks via gossiping," in Proc. ACM SIGMETRICS/IFIP, 2006, pp. 27-38.
30. D. Mosk-Aoyama and D. Shah, "Computing separable functions via gossip," in Proc. IEEE PODC, Denver, CO, 2006, pp. 113-122.
31. M. J. Neely, E. Modiano, and C. Li, "Fairness and optimal stochastic control for heterogeneous networks," in Proc. IEEE INFOCOM, Miami, FL, Mar. 2005, pp. 1723-1734.
32. M. J. Neely, E. Modiano, and C. E. Rohrs, "Dynamic power allocation and routing for time varying wireless networks," in Proc. IEEE INFOCOM, Apr. 2003, pp. 745-755.
33. L. Peterson and B. Davie, Computer Networks: A Systems Approach., 2nd ed. San Mateo, CA: Morgan Kaufmann, 2000.
34. S. Sanghavi, L. Bui, and R. Srikant, "Distributed link scheduling with constant overhead," Tech. Rep., 2006.
35. G. Sasaki and B. Hajek, "Link scheduling in polynomial time," IEEE Trans. Inf. Theory, vol.34, no.5, pp. 910-917, 1988.
36. D. Shah, "Stable algorithms for input queued switches," presented at the Allerton Conf. Control, Commun. Comput., 2001.
37. D. Shah and D. J. Wischik, "Optimal scheduling algorithms for input-queued switches," presented at the IEEE INFOCOM, 2006.
38. D. Shah and D. J. Wischik, "The teleology of scheduling algorithms for switched networks under light load, critical load, and overload," Ann. Appl. Probab. 2009 [Online]. Available: http://www.cs.ucl.ac.uk/staff/ucacdjw/ Research/netsched.html, submitted for publication
39. S. Shakkottai and A. Stolyar, "Scheduling for multiple flows sharing a time-varying channel: The exponential rule," Translat. AMS, ser. 2, vol.207, A volume in memory of F. Karpelevich, pp. 185-202, 2002.
40. R. Srikant, The Mathematics of Internet Congestion Control. Boston, MA: Birkhäuser, 2004.
41. A. Stolyar, "Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm," Queueing Syst., vol.50, no.4, pp. 401-457, 2005.
42. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in Proc. IEEE IN-FOCOM, 1998, pp. 533-539.
43. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol.37, no.12, pp. 1936-1948, Dec. 1992.
44. X. Wu and R. Srikant, "Regulated maximal matching: A distributed scheduling algorithm for multihop wireless networks with node-exclusive spectrum sharing," in Proc. IEEE Conf. Decision Control., 2005, pp. 5342-5347.
45. X. Wu and R. Srikant, "Bounds on the capacity region of multihop wireless networks under distributedgreedy scheduling," presented at the IEEE INFOCOM, 2006.
46. H. Yaiche, R. R. Mazumdar, and C. Rosenberg, "A game-theoretic framework for bandwidth allocation and pricing in broadband networks," IEEE/ACM Trans. Netw., vol.8, no.5, pp. 667-678, Oct. 2000.