research-article

Public Access

Contention resolution with log-logstar channel accesses

Authors:

Michael A. Bender,

Tsvi Kopelowitz,

Maxwell YoungAuthors Info & Claims

STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing

Pages 499 - 508

https://doi.org/10.1145/2897518.2897655

Published: 19 June 2016 Publication History

Abstract

For decades, randomized exponential backoff has provided a critical algorithmic building block in situations where multiple devices seek access to a shared resource. Surprisingly, despite this history, the performance of standard backoff is poor under worst-case scheduling of demands on the resource: (i) subconstant throughput can occur under plausible scenarios, and (ii) each of N devices requires Omega(log N) access attempts before obtaining the resource.

In this paper, we address these shortcomings by offering a new backoff protocol for a shared communications channel that guarantees expected constant throughput with only O(log(log* N)) access attempts in expectation. Central to this result are new algorithms for approximate counting and leader election with the same performance guarantees.

References

[1]

L. Anantharamu, B. S. Chlebus, and M. A. Rokicki. Adversarial Multiple Access Channel with Individual Injection Rates. In Proceedings of the 13th International Conference on Principles of Distributed Systems (OPODIS), pages 174–188, 2009.

Digital Library

[2]

A. F. Anta, M. A. Mosteiro, and J. R. Mu˜ noz. Unbounded contention resolution in multiple-access channels. Algorithmica, 67(3):295–314, 2013.

[3]

B. Awerbuch, A. Richa, and C. Scheideler. A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks. In Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC), pages 45–54, 2008.

Digital Library

[4]

Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. SIAM J. Comput., 29(1):180–200, Sept. 1999.

Digital Library

[5]

M. A. Bender, M. Farach-Colton, S. He, B. C. Kuszmaul, and C. E. Leiserson. Adversarial contention resolution for simple channels. In Proc. 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 325–332, 2005.

Digital Library

[6]

M. A. Bender, J. T. Fineman, and S. Gilbert. Contention resolution with heterogeneous job sizes. In Proc. 14th Annual European Symposium on Algorithms (ESA), pages 112–123, 2006.

Digital Library

[7]

M. A. Bender, J. T. Fineman, S. Gilbert, and M. Young. How to scale exponential backoff: Constant throughput, polylog access attempts, and robustness. In Proc. 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2016.

Digital Library

[8]

P. Berenbrink, A. Czumaj, M. Englert, T. Friedetzky, and L. Nagel. Multiple-choice balanced allocation in (almost) parallel. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX-RANDOM), pages 411–422, 2012.

[9]

P. Berenbrink, A. Czumaj, A. Steger, and B. Vöcking. Balanced allocations: The heavily loaded case. SIAM J. Comput., 35(6):1350–1385, 2006.

Digital Library

[10]

P. Berenbrink, K. Khodamoradi, T. Sauerwald, and A. Stauffer. Balls-into-bins with nearly optimal load distribution. In Proceedings of the Twenty-fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 326–335, 2013.

Digital Library

[11]

D. J. Bernstein. qmail — an email message transfer agent. http://cr.yp.to/qmail.html, June 1998.

[12]

G. Bianchi. Performance analysis of the IEEE 802.11 distributed coordination function. IEEE Journal on Selected Areas in Communications, 18(3):535–547, Sept. 2006.

Digital Library

[13]

B. S. Chlebus, L. Gasieniec, D. R. Kowalski, and T. Radzik. On the Wake-up Problem in Radio Networks. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), pages 347–359, 2005.

Digital Library

[14]

B. S. Chlebus and D. R. Kowalski. A Better Wake-up in Radio Networks. In Proceedings of 23rd ACM Symposium on Principles of Distributed Computing (PODC), pages 266–274, 2004.

Digital Library

[15]

B. S. Chlebus, D. R. Kowalski, and M. A. Rokicki. Adversarial queuing on the multiple-access channel. In Proc. Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC, pages 92–101, 2006.

Digital Library

[16]

B. S. Chlebus, D. R. Kowalski, and M. A. Rokicki. Adversarial queuing on the multiple access channel. ACM Transactions on Algorithms, 8(1):5, 2012.

Digital Library

[17]

M. Chrobak, L. Gasieniec, and D. R. Kowalski. The Wake-up Problem in Multihop Radio Networks. SIAM Journal on Computing, 36(5):1453–1471, 2007.

Digital Library

[18]

R. Cole, A. M. Frieze, B. M. Maggs, M. Mitzenmacher, A. W. Richa, R. K. Sitaraman, and E. Upfal. On balls and bins with deletions. In Proc. Second International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), pages 145–158, 1998.

Digital Library

[19]

B. Costales and E. Allman. Sendmail. O’Reilly, third edition, Dec. 2002.

[20]

M. Geréb-Graus and T. Tsantilas. Efficient optical communication in parallel computers. In Proceedings 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 41–48, 1992.

Digital Library

[21]

M. Geréb-Graus and T. Tsantilas. Efficient optical communication in parallel computers. In Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 41–48, 1992.

Digital Library

[22]

L. A. Goldberg, M. Jerrum, T. Leighton, and S. Rao. Doubly logarithmic communication algorithms for optical-communication parallel computers. SIAM J. Comput., 26(4):1100–1119, Aug. 1997.

Digital Library

[23]

L. A. Goldberg and P. D. MacKenzie. Analysis of practical backoff protocols for contention resolution with multiple servers. In Proc. Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 554–563, 1996.

Digital Library

[24]

L. A. Goldberg, P. D. Mackenzie, M. Paterson, and A. Srinivasan. Contention Resolution with Constant Expected Delay. Journal of the ACM, 47(6):1048–1096, 2000.

Digital Library

[25]

L. A. Goldberg, Y. Matias, and S. Rao. An optical simulation of shared memory. SIAM J. Comput., 28(5):1829–1847, Oct. 1999.

Digital Library

[26]

J. Goodman, A. G. Greenberg, N. Madras, and P. March. Stability of binary exponential backoff. J. ACM, 35(3):579–602, July 1988.

Digital Library

[27]

Google. GCM (Google Cloud Messaging) Advanced Topics. http://developer.android.com/google/gcm/ adv.html#retry, 2014.

[28]

A. G. Greenberg, P. Flajolet, and R. E. Ladner. Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. JACM, 34(2):289–325, Apr. 1987.

Digital Library

[29]

A. G. Greenberg and S. Winograd. A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. JACM, 32(3):589–596, July 1985.

Digital Library

[30]

R. I. Greenberg and C. E. Leiserson. Randomized routing on fat-trees. In Proceedings 26th Annual Symposium on Foundations of Computer Science (FOCS), pages 241–249, 1985.

Digital Library

[31]

J. Hastad, T. Leighton, and B. Rogoff. Analysis of backoff protocols for multiple access channels. In STOC’87, pages 241–253, New York, New York, May 1987.

Digital Library

[32]

J. Hastad, T. Leighton, and B. Rogoff. Analysis of Backoff Protocols for Mulitiple Access Channels. SIAM Journal on Computing, 25(4):1996, 740-774.

Digital Library

[33]

M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In Proc. of the 20th Intnl. Conference on Computer Architecture., pages 289–300, San Diego, California, 1993.

Digital Library

[34]

V. Jacobson and M. J. Karels. Congestion Avoidance and Control. In Symposium Proceedings on Communications Architectures and Protocols (SIGCOMM), pages 314–329, 1988.

Digital Library

[35]

T. Jurdzi´ nski, M. Kutylowski, and J. Zatopia´ nski. Energy-Efficient Size Approximation of Radio Networks with No Collision Detection. In Proceedings of the 8th Annual International Conference (COCOON), pages 279–289, 2002.

Digital Library

[36]

J. F. Kurose and K. Ross. Computer Networking: A Top-Down Approach Featuring the Internet. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2nd edition, 2002.

Digital Library

[37]

R. M. Metcalfe and D. R. Boggs. Ethernet: Distributed packet switching for local computer networks. CACM, 19(7):395–404, July 1976.

Digital Library

[38]

M. Mitzenmacher. The power of two choices in randomized load balancing. IEEE Transactions on Parallel and Distributed Systems, 12(10):1094–1104, Oct 2001.

Digital Library

[39]

A. Mondal and A. Kuzmanovic. Removing Exponential Backoff from TCP. SIGCOMM Comput. Commun. Rev., 38(5):17–28, Sept. 2008.

Digital Library

[40]

A. Ogierman, A. Richa, C. Scheideler, S. Schmid, and J. Zhang. Competitive MAC under Adversarial SINR, 2013. http://arxiv.org/abs/1307.7231.

[41]

G. A. Platform. Google Documents List API version 3.0: Implementing Exponential Backoff. https: //developers.google.com/google-apps/documents-list/ ?csw=1#implementing exponential backoff, 2011.

[42]

P. Raghavan and E. Upfal. Stochastic contention resolution with short delays. SIAM J. Comput., 28(2):709–719, Apr. 1999.

Digital Library

[43]

R. Rajwar and J. R. Goodman. Speculative lock elision: Enabling highly concurrent multithreaded execution. In Proc. of the 34th Annual Intnl. Symposium on Microarchitecture, pages 294–305, Austin, Texas, Dec. 2001.

Digital Library

[44]

A. Richa, C. Scheideler, S. Schmid, and J. Zhang. A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In Proceedings of the International Symposium on Distributed Computing (DISC), pages 179–193, 2010.

Digital Library

[45]

A. Richa, C. Scheideler, S. Schmid, and J. Zhang. Competitive and Fair Medium Access Despite Reactive Jamming. In Proceedings of the 31st International Conference on Distributed Computing Systems (ICDCS), pages 507–516, 2011.

Digital Library

[46]

A. Richa, C. Scheideler, S. Schmid, and J. Zhang. Competitive and Fair Throughput for Co-Existing Networks Under Adversarial Interference. In Proceedings of the 31st ACM Symposium on Principles of Distributed Computing (PODC), 2012.

Digital Library

[47]

A. Richa, C. Scheideler, S. Schmid, and J. Zhang. An Efficient and Fair MAC Protocol Robust to Reactive Interference. IEEE/ACM Transactions on Networking, 21(1):760–771, 2013.

Digital Library

[48]

A. Richa, C. Scheideler, S. Schmid, and J. Zhang. Competitive Throughput in Multi-Hop Wireless Networks Despite Adaptive Jamming. Distributed Computing, 26(3):159–171, 2013.

Digital Library

[49]

A. W. Richa, M. Mitzenmacher, and R. Sitaraman. The power of two random choices: A survey of techniques and results. Combinatorial Optimization, 9:255–304, 2001.

[50]

A. W. Services. Error Retries and Exponential Backoff in AWS. http://docs.aws.amazon.com/general/latest/ gr/api-retries.html, 2012.

[51]

N.-O. Song, B.-J. Kwak, and L. E. Miller. On the stability of exponential backoff. Journal of Research of the National Institute of Standards and Technology, 108(4), 2003.

[52]

B. Vöcking. How asymmetry helps load balancing. J. ACM, 50(4):568–589, 2003.

Digital Library

[53]

D. E. Willard. Log-logarithmic Selection Resolution Protocols in a Multiple Access Channel. SIAM J. Comput., 15(2):468–477, May 1986.

Digital Library

[54]

Y. Xiao. Performance Analysis of Priority Schemes for IEEE 802.11 and IEEE 802.11e Wireless LANs. Wireless Communications, IEEE Transactions on, 4(4):1506–1515, July 2005.

Digital Library

Cited By

Chang Y(2024)The energy complexity of diameter and minimum cut computation in bounded-genus networksTheoretical Computer Science10.1016/j.tcs.2023.114279982(114279)Online publication date: Jan-2024
https://doi.org/10.1016/j.tcs.2023.114279
Biswas UChakraborty TYoung M(2024)Softening the Impact of Collisions in Contention ResolutionStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-74498-3_29(398-416)Online publication date: 20-Oct-2024
https://doi.org/10.1007/978-3-031-74498-3_29
Chang YDuan RJiang S(2023)Near-Optimal Time–Energy Tradeoffs for Deterministic Leader ElectionACM Transactions on Algorithms10.1145/361442919:4(1-23)Online publication date: 26-Sep-2023
https://dl.acm.org/doi/10.1145/3614429
Show More Cited By

Index Terms

Contention resolution with log-logstar channel accesses

Recommendations

Contention Resolution with Message Deadlines
SPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures

In the contention-resolution problem, multiple players contend for access to a shared resource. Contention resolution is used in wireless networks, where messages must be transmitted on a shared communication channel. When two or more messages are ...
Adversarial contention resolution for simple channels
SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures

This paper analyzes the worst-case performance of randomized backoff on simple multiple-access channels. Most previous analysis of backoff has assumed a statistical arrival model.For batched arrivals, in which all n packets arrive at time 0, we show the ...
Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses

For decades, randomized exponential backoff has provided a critical algorithmic building block in situations where multiple devices seek access to a shared resource. Despite this history, the performance of standard exponential backoff is poor under worst-...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing

June 2016

1141 pages

ISBN:9781450341325

DOI:10.1145/2897518

General Chair:
Daniel Wichs
Northeastern, USA
,
Program Chair:
Yishay Mansour
Tel Aviv

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 June 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

STOC '16

Sponsor:

SIGACT

STOC '16: Symposium on Theory of Computing

June 19 - 21, 2016

MA, Cambridge, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
404
Total Downloads

Downloads (Last 12 months)52
Downloads (Last 6 weeks)12

Reflects downloads up to 17 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chang Y(2024)The energy complexity of diameter and minimum cut computation in bounded-genus networksTheoretical Computer Science10.1016/j.tcs.2023.114279982(114279)Online publication date: Jan-2024
https://doi.org/10.1016/j.tcs.2023.114279
Biswas UChakraborty TYoung M(2024)Softening the Impact of Collisions in Contention ResolutionStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-74498-3_29(398-416)Online publication date: 20-Oct-2024
https://doi.org/10.1007/978-3-031-74498-3_29
Chang YDuan RJiang S(2023)Near-Optimal Time–Energy Tradeoffs for Deterministic Leader ElectionACM Transactions on Algorithms10.1145/361442919:4(1-23)Online publication date: 26-Sep-2023
https://dl.acm.org/doi/10.1145/3614429
De Marco GKowalski DStachowiak G(2023)Deterministic non-adaptive contention resolution on a shared channelJournal of Computer and System Sciences10.1016/j.jcss.2022.11.001133(1-22)Online publication date: May-2023
https://doi.org/10.1016/j.jcss.2022.11.001
Ravelomanana VAndriambolamalala N(2023)Transmitting Once to Elect a Leader on Wireless NetworksAlgorithmica10.1007/s00453-023-01095-285:9(2529-2553)Online publication date: 6-Mar-2023
https://doi.org/10.1007/s00453-023-01095-2
Chang Y(2023)The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus NetworksStructural Information and Communication Complexity10.1007/978-3-031-32733-9_12(262-296)Online publication date: 25-May-2023
https://doi.org/10.1007/978-3-031-32733-9_12
Jiang YZheng CAgrawal KLee I(2022)Robust and Optimal Contention Resolution without Collision DetectionProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538592(107-118)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538592
Bender MGilbert SKuhn FKuszmaul JMédard MAgrawal KLee I(2022)Contention Resolution for Coded Radio NetworksProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538573(119-130)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538573
Chen HJiang YZheng CMiller ACensor-Hillel K(2021)Tight Trade-off in Contention Resolution without Collision DetectionProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467920(139-149)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467920
De Marco GKowalski DStachowiak G(2021)Deterministic Contention Resolution without Collision Detection: Throughput vs Energy2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS51616.2021.00100(1009-1019)Online publication date: Jul-2021
https://doi.org/10.1109/ICDCS51616.2021.00100
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents