Network adiabatic theorem: An efficient randomized protocol for contention resolution

SIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems

Volumn 37, Issue 1, 2009, Pages 133-144

  Rajagopalan, Shreevatsa ^a   Shah, Devavrat ^a   Shin, Jinwoo ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Aloha; Markov chain; Mixing time; Wireless multi access

Indexed keywords

ADIABATIC THEOREM; COMMON RESOURCES; CONTENTION RESOLUTION; MARKOV CHAIN; METROPOLIS-HASTINGS SAMPLINGS; MULTIACCESS; MULTIACCESS NETWORKS; NETWORK GRAPH; RANDOMIZED PROTOCOLS; SET CONSTRAINTS;

ALGORITHMS; DYNAMICAL SYSTEMS; MACHINE DESIGN; MARKOV PROCESSES; NETWORK PROTOCOLS; QUEUEING NETWORKS; QUEUEING THEORY; SECURITY OF DATA;

WIRELESS NETWORKS;

EID: 70449650505     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1555349.1555365     Document Type: Conference Paper

References (32)

1. N. Abramson and F. Kuo (Editors). The aloha system. Computer- Communication Networks, 1973.
2. D. J. Aldous. Ultimate instability of exponential back-off protocol for acknowledgement-based transmission control of random access communication channels. IEEE Transactions on Information Theory, 33(2):219-223, 1987.
3. C. Bordenave, D. McDonald, and A. Proutiere. Performance of random medium access - an asymptotic approach. In Proceedings of ACM Sigmetrics, 2008.
4. M. Born and V. A. Fock. Beweis des adiabatensatzes. Zeitschrift für Physik a Hadrons and Nuclei, 51(3-4):165Ucombining double acute accent180, 1928.
5. J. G. Dai. Stability of fluid and stochastic processing networks. Miscellanea Publication, (9), 1999.
6. A. Ephremides and B. Hajek. Information theory and communication networks: an unconsummated union. IEEE Transactions on Information Theory, 44(6):2416-2432, 1998.
7. A. Eryilmaz, A. Ozdaglar, D. Shah, and E. Modiano. Distributed cross-layer algorithms for the optimal control of multi-hop wireless networks. submitted to IEEE/ACM Transactions on Networking, 2008.
8. S. Foss and Takis Konstantopoulos. An overview of some stochastic stability methods. Journal of Operations Research, Society of Japan, 47(4), 2004.
9. R. K. Getoor. Transience and recurrence of markov processes. In AzOcombining double acute accentma, J. and Yor, M., editors, Séminaire de Probabilit¶es XIV, pages 397{409, 1979.
10. L.A. Goldberg, M. Jerrum, S. Kannan, and M. Paterson. A bound on the capacity of backoff and acknowledgement-based protocols. Research Report 365, Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK, January 2000.
11. Leslie Ann Goldberg. Design and analysis of contention-resolution protocols, epsrc research grant gr/l60982. http://www.csc.liv.ac.uk/ leslie/contention.html, Last updated, Oct. 2002.
12. A. G. Greenberg, P. Flajolet, and R. E. Ladner. Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. Journal of the ACM, 34(2):289-325, 1987.
13. D. J. Griffiths. Introduction to Quantum Mechanics. Pearson Prentice Hall, 2005.
14. P. Gupta and A. L. Stolyar. Optimal throughput allocation in general random-access networks. In Proceedings of 40th Annual Conf. Inf. Sci. Systems, IEEE, Princeton, NJ, pages 1254-1259, 2006.
15. Johan Hastad, Tom Leighton, and Brian Rogoff. Analysis of backoff protocols for multiple access channels. SIAM J. Comput, 25(4), 1996.
16. L. Jiang and J. Walrand. A distributed csma algorithm for throughput and utility maximization in wireless networks. In Proceedings of 46th Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, IL, 2008.
17. J.Liu and A. L. Stolyar. Distributed queue length based algorithms for optimal end-to-end throughput allocation and stability in multi-hop random access networks. In Proceedings of 45th Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, IL, 2007.
18. F. P. Kelly. Stochastic models of computer communication systems. J. R. Statist. Soc B, 47(3):379-395, 1985.
19. F.P. Kelly and I.M. MacPhee. The number of packets transmitted by collision detect random access schemes. The Annals of Probability, 15(4):1557-1568, 1987.
20. I.M. MacPhee. On optimal strategies in stochastic decision processes, d. phil. thesis, university of cambridge, 1989.
21. P. Marbach. Distributed scheduling and active queue management in wireless networks. In Proceedings of IEEE INFOCOM, Minisymposium, 2007.
22. P. Marbach, A. Eryilmaz, and A. Ozdaglar. Achievable rate region of csma schedulers in wireless networks with primary interference constraints. In Proceedings of IEEE Conference on Decision and Control, 2007.
23. S. P. Meyn and R. L. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, London, 1993.
24. E. Modiano, D. Shah, and G. Zussman. Maximizing throughput in wireless network via gossiping. In ACM SIGMETRICS/Performance, 2006.
25. Microsoft research lab. self organizing neighborhood wireless mesh networks. http://research.microsoft.com/mesh/.
26. S. Sanghavi, L. Bui, and R. Srikant. Distributed link scheduling with constant overhead. In Proceedings of ACM Sigmetrics, 2007.
27. D. Shah and D. J. Wischik. Optimal scheduling algorithm for input queued switch. In Proceeding of IEEE INFOCOM, 2006.
28. D. Shah and D. J. Wischik. Heavy traffic analysis of optimal scheduling algorithms for switched networks. Submitted, 2007.
29. S. Shakkottai and R. Srikant. Network Optimization and Control. Foundations and Trends in Networking, NoW Publishers, 2007.
30. A. L. Stolyar. Dynamic distributed scheduling in random access networks. Journal of Applied Probabability, 45(2):297-313, 2008.
31. 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:1936-1948, 1992.
32. B.S. Tsybakov and N. B. Likhanov. Upper bound on the capacity of a random multiple-access system. Problemy Peredachi Informatsii, 23(3):64-78, 1987.