Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 371-375

  Jiang, Libin ^a   Leconte, Mathieu ^b   Ni, Jian ^c   Srikant, R ^d   Walrand, Jean ^e  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b INRIA   (France)

^c IBM RESEARCH   (United States)

^d UIUC   (United States)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; ARRIVAL RATES; AVERAGE QUEUE LENGTHS; CAPACITY REGIONS; DERIVE BOUNDS; GLAUBER DYNAMICS; INTERFERENCE GRAPHS; LOW DELAY; MIXING TIME; MULTIHOP WIRELESS NETWORK; MULTIPLE LINKS;

CARRIER SENSE MULTIPLE ACCESS; SCHEDULING ALGORITHMS; WIRELESS NETWORKS;

DYNAMICS;

EID: 79960878137     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5935185     Document Type: Conference Paper

References (15)

1. R. R. Boorstyn, A. Kershenbaum, B. Maglaris, and V. Sahin. Throughput analysis in multihop CSMA packet radio networks. IEEE Transactions on Communications, 35(3):267-274, March 1987.
2. M. Dyer and C. Greenhill. On Markov chains for independent sets. Journal of Algorithms, 35:17-49, 2000.
3. J. Ghaderi and R. Srikant. On the design of efficient CSMA algorithms for wireless networks. In Proceedings of the IEEE Conference on Decision and Control, December 2010.
4. T. P. Hayes and A. Sinclair. A general lower bound for mixing of singlesite dynamics on graphs. In FOCS '05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005.
5. L. Jiang, M. Leconte, J. Ni, R. Srikant, and J. Walrand. Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling. Technical Report, 2010. Available online: http://arxiv.org/abs/1008.0227.
6. L. Jiang and J. Walrand. A distributed CSMA algorithm for throughput and utility maximization in wireless networks. In Proceedings 46th Annual Allerton Conference on Communication, Control and Computing, September 2008.
7. L. Jiang and J. Walrand. Convergence and stability of a distributed CSMA algorithm for maximal network throughput. In IEEE Conference on Decision and Control, December 2009.
8. J. Liu, Y. Yi, A. Proutiere, M. Chiang, and H. V. Poor. Maximizing utility via random access without message passing. Microsoft Research Technical Report, September 2008.
9. F. Martinelli. Lectures on Glauber dynamics for discrete spin models. Lectures on probability theory and statistics (Saint-Flour, 1997), Lecture Notes in Math., 1717, Springer, Berlin, 1999.
10. J. Ni and R. Srikant. Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks. In Information Theory and Applications Workshop, Feburary 2009.
11. J. Ni, B. Tan, and R. Srikant. Q-CSMA: Queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks. In Proceedings of IEEE INFOCOM, March 2010.
12. S. Rajagopalan, D. Shah, and J. Shin. Network adiabatic theorem: an efficient randomized protocol for contention resolution. In Proceedings of ACM Sigmetrics, June 2009.
13. D. Shah, D. N. C. Tse, and J. N. Tsitsiklis. Hardness of low delay network scheduling. Submitted to IEEE Transactions on Information Theory, 2009.
14. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximal throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12):1936-1948, December 1992.
15. E. Vigoda. A note on the Glauber dynamics for sampling independnet sets. The Electronic Journal of Combinatorics, 8, 2001.