Some New (And Old) Results on Contention Resolution (Invited Talk)

Author Leslie Ann Goldberg

Thumbnail PDF


  • Filesize: 0.55 MB
  • 3 pages

Document Identifiers

Author Details

Leslie Ann Goldberg
  • University of Oxford, UK

Cite AsGet BibTex

Leslie Ann Goldberg. Some New (And Old) Results on Contention Resolution (Invited Talk). In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 3:1-3:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


This is an extended abstract of my talk at ICALP 2022, based on joint work with John Lapinskas.

Subject Classification

ACM Subject Classification
  • Mathematics of computing
  • contention resolution
  • multiple access channel
  • randomised algorithms


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Hesham Al-Ammal, Leslie Ann Goldberg, and Philip D. MacKenzie. An improved stability bound for binary exponential backoff. Theory of Computing Systems, 34(3):229-244, 2001. Google Scholar
  2. David Aldous. Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels. IEEE Transactions on Information Theory, 33(2):219-223, 1987. Google Scholar
  3. Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, and Seth Pettie. Contention resolution without collision detection. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath, and Julia Chuzhoy, editors, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC, pages 105-118. ACM, 2020. Google Scholar
  4. Haimin Chen, Yonggang Jiang, and Chaodong Zheng. Tight trade-off in contention resolution without collision detection. In Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen, editors, PODC '21: ACM Symposium on Principles of Distributed Computing, pages 139-149. ACM, 2021. Google Scholar
  5. Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, and Mike Paterson. A bound on the capacity of backoff and acknowledgment-based protocols. SIAM Journal on Computing, 33(2):313-331, 2004. Google Scholar
  6. Leslie Ann Goldberg and John Lapinskas. Instability of backoff protocols with arbitrary arrival rates, 2022. URL:
  7. Jonathan Goodman, Albert G. Greenberg, Neal Madras, and Peter March. Stability of binary exponential backoff. Journal of the ACM, 35(3):579-602, 1988. Google Scholar
  8. Johan Håstad, Frank T. Leighton, and Brian Rogoff. Analysis of backoff protocols for multiple access channels. SIAM Journal on Computing, 25(4):740-774, 1996. Google Scholar
  9. Frank P. Kelly and Iain M. MacPhee. The number of packets transmitted by collision detect random access schemes. Annals of Probability, 15:1557-1568, 1987. Google Scholar
  10. Iain M. MacPhee. On Optimal Strategies in Stochastic Decision Processes. PhD thesis, University of Cambridge, 1987. Google Scholar
  11. Robert Metcalfe and David R. Boggs. Ethernet: Distributed packet switching for local computer networks. Communications of the ACM, 19(7):395-404, 1976. Google Scholar
  12. Jeannine Mosely and Pierre Humblet. A class of efficient contention resolution algorithms for multiple access channels. IEEE Transactions on Communications, 33(2):145-151, 1985. Google Scholar
  13. Devavrat Shah and Jinwoo Shin. Randomized scheduling algorithm for queueing networks. Annals of Applied Probability, 22:128-171, 2012. Google Scholar
  14. Devavrat Shah, Jinwoo Shin, and Prasad Tetali. Medium access using queues. In IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, pages 698-707. IEEE Computer Society, 2011. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail