Medium access using queues

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 698-707

  Shah, Devavrat ^a   Shin, Jinwoo ^b   Tetali, Prasad ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Mixing Time; Stability; Wireless Medium Access

Indexed keywords

BACKOFF ALGORITHMS; BIPARTITE GRAPHS; COMPLETE GRAPHS; GRAPH G; INDEPENDENT SET; LOCAL INFORMATION; MEDIUM ACCESS; MIXING TIME; NETWORK GRAPH; SIMULTANEOUS TRANSMISSION; TIME INSTANCES; WIRELESS MEDIUM; WIRELESS MEDIUM ACCESS; WIRELESS RESOURCES;

COMPUTER SCIENCE; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; MARKOV PROCESSES; OPTIMIZATION; WIRELESS NETWORKS;

ALGORITHMS;

EID: 84863301121     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.99     Document Type: Conference Paper

References (25)

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. V. Anantharam and P. Tsoucas. A proof of the markov chain tree theorem. Statistics & Probability Letters, 8(2):189192, June 1989.
4. M. Dyer, A. Frieze, and R. Kannan. A random polynomial-time algorithm for approximating the volume of convex bodies. J. ACM, 38(1):1-17, 1991.
5. S. Foss and T. Konstantopoulos. An overview of some stochastic stability methods. Journal of Operations Research, Society of Japan, 47(4), 2004.
6. H. O. Georgii. Gibbs measures and phase transitions. Walter de Gruyter, 1988.
7. L. A. Goldberg and P. D. MacKenzie. Analysis of practical backoff protocols for contention resolution with multiple servers. Journal of Computer and System Sciences, 58(1):232-258, 1999. Preliminary version in SODA '96: Proceedings of the seventh annual ACM-SIAM Symposium on Discrete Algorithms.
8. L. A. 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.
9. J. Hastad, T. Leighton, and B. Rogoff. Analysis of backoff protocols for multiple access channels. SIAM Journal on Computing, 25(4), 1996. Preliminary version in STOC '87: Proceedings of the nineteenth annual ACM Symposium on Theory of Computing.
10. L. Jiang, D. Shah, J. Shin, and J. Walrand. Distributed random access algorithm: Scheduling and congesion control. IEEE Transaction on Information Theory, December 2010.
11. 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.
12. L. Jiang and J. Walrand. Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms with Collisions Accepted to appear in IEEE Transactions on Networking, 2011.
13. F. P. Kelly. Stochastic models of computer communication systems. J. R. Statist. Soc B, 47(3):379-395, 1985.
14. 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.
15. I. M. MacPhee. On optimal strategies in stochastic decision processes, d. phil. thesis, university of cambridge, 1989.
16. R. Metcalfe and D. Boggs. Distributed packet switching for local computer networks. Comm. ACM, 19:395-404, 1976.
17. R. Montenegro and P. Tetali. Mathematical aspects of mixing times in markov chains. Found. Trends Theor. Comput. Sci., 1(3):237-354, 2006. (Pubitemid 44111221)
18. J. Mosely and P. A. Humblet. A class of efficient contention resolution algorithms for multiple access channels. IEEE Transactions on Communications, 33(2):145-151, 1985.
19. S. Rajagopalan, D. Shah, and J. Shin. Network adiabatic theorem: an efficient randomized protocol for contention resolution. In Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems, pages 133-144. ACM New York, NY, USA, 2009.
20. D. Shah and J. Shin. Randomized scheduling algorithm for queueing networks. To appear in Annals of Applied Probability, 2011.
21. D. Shah, J. Shin, and P. Tetali. Efficient Distributed Medium Access. http://http://arxiv.org/abs/1104.2380.
22. D. Shah and D. J. Wischik. Optimal scheduling algorithm for input queued switch. In Proceeding of IEEE INFOCOM, 2006.
23. A. Sinclair. Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhäuser, Boston, 1993.
24. A. L. Stolyar. MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Annals of Applied Probability, 14(1):1-53, 2004.
25. 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.