Asynchronous shared channel

DOI10.1145/3087801.3087831MaRDI QIDQ5368991zbMATH OpenOpenAlexWikidataFDO

Authors Grzegorz Stachowiak, Gianluca De Marco

Publication date 11 October 2017

Published in Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3087801.3087831

zbMATH Keywords

contention resolutiondistributed algorithmslower boundmultiple-access channelrandomized algorithmsshared channel

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15) Randomized algorithms (68W20) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Contention resolution with constant expected delay
• Contention resolution in a non-synchronized multiple access channel
• On adaptive conflict resolution algorithms in a multiple access channel
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• Conflict resolution in a multiple access channel

Cited in

(16)

• Singletons for simpletons revisiting windowed backoff with Chernoff bounds
• Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
• Counting in one-hop beeping networks
• Deterministic non-adaptive contention resolution on a shared channel
• Contention resolution with constant throughput and log-logstar channel accesses
• Analyzing contention and backoff in asynchronous shared memory
• Contention resolution with constant expected delay
• Subquadratic non-adaptive threshold group testing
• Optimal channel utilization with limited feedback
• Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
• Restrained medium access control on adversarial shared channels
• Thinning protocols for routing \(h\)-relations over shared media
• Contention resolution with message deadlines
• Jamming-resistant backoff with polylogarithmic sending and listening cost
• Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution
• Softening the impact of collisions in contention resolution

This page was built for publication: Asynchronous shared channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368991)