Contention resolution with message deadlines

DOI10.1007/S00446-025-00490-YMaRDI QIDQ6871605zbMATH OpenFDO

Authors Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young

Publication date 20 January 2026

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00446-025-00490-Y

zbMATH Keywords

schedulingcontention resolutionbackoff

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cites work

• scientific article; zbMATH DE number 1857647 (Why is no real title available?)
• scientific article; zbMATH DE number 2089983 (Why is no real title available?)
• A better wake-up in radio networks
• A jamming-resistant MAC protocol for multi-hop wireless networks
• A jamming-resistant MAC protocol for single-hop wireless networks
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• Adversarial queuing on the multiple access channel
• Adversarial queuing on the multiple-access channel
• Algorithms and Computation
• Algorithms with Predictions
• Analysis of Backoff Protocols for Multiple Access Channels
• Analysis of practical backoff protocols for contention resolution with multiple servers
• Analyzing contention and backoff in asynchronous shared memory
• Asynchronous shared channel
• Automata, Languages and Programming
• Broadcasting competitively against adaptive adversary in multi-channel radio networks
• Competitive and fair throughput for co-existing networks under adversarial interference
• Contention Resolution with Heterogeneous Job Sizes
• Contention resolution in a non-synchronized multiple access channel
• Contention resolution on a fading channel
• Contention resolution on multiple channels with collision detection
• Contention resolution with constant expected delay
• Contention resolution with constant throughput and log-logstar channel accesses
• Contention resolution with log-logstar channel accesses
• Contention resolution without collision detection
• Distributed Online and Stochastic Queueing on a Multiple Access Channel
• Dynamic windows scheduling with reallocation
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
• Exponential separations in the energy complexity of leader election
• Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• Meeting the deadline, on the complexity of fault-tolerant \textsc{Continuous Gossip}
• Minimizing Service and Operation Costs of Periodic Scheduling
• On selection problem in radio networks
• Packet latency of deterministic broadcasting in adversarial multiple access channels
• Randomized mutual exclusion on a multiple access channel
• Reallocation problems in scheduling
• Sade: competitive MAC under adversarial SINR
• Scalable wake-up of multi-channel single-hop radio networks
• Scaling exponential backoff: constant throughput, polylogarithmic channel-access attempts, and robustness
• Simple contention resolution via multiplicative weight updates
• Station assignment with reallocation
• Stochastic Contention Resolution With Short Delays
• The Wake‐Up Problem in MultiHop Radio Networks
• The cost of synchronizing multiple-access channels
• Tight Trade-off in Contention Resolution without Collision Detection
• Unbounded contention resolution in multiple-access channels
• Windows Scheduling Problems for Broadcast Systems
• Windows scheduling as a restricted version of bin packing

This page was built for publication: Contention resolution with message deadlines

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