Local queuing under contention
DOI10.4230/LIPICS.DISC.2018.28zbMATH Open1497.68046OpenAlexW2898806784MaRDI QIDQ5090920FDOQ5090920
Authors: P. Garncarek, Tomasz Jurdziński, Dariusz R. Kowalski
Publication date: 21 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.DISC.2018.28
Recommendations
- Stable memoryless queuing under contention
- Distributed Online and Stochastic Queueing on a Multiple Access Channel
- New Stability Results for Adversarial Queuing
- Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks
- Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
stabilitydistributed algorithmsdeterministic algorithmsmultiple-access channelshared channeladversarial packet arrivalslocal queueing
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
- On selection problem in radio networks
- Adversarial queuing theory
- A lower bound for radio broadcast
- Stochastic Contention Resolution With Short Delays
- Analysis of Backoff Protocols for Multiple Access Channels
- Contention resolution with constant expected delay
- The wakeup problem in synchronous broadcast systems
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Efficient algorithms for leader election in radio networks
- A perspective on multiaccess channels
- Adversarial queuing on the multiple access channel
- Consensus and Mutual Exclusion in a Multiple Access Channel
- Title not available (Why is that?)
- Maximum throughput of multiple access channels in adversarial environments
- Universal-stability results and performance bounds for greedy contention-resolution protocols
- Development of the ALOHANET
- DYNAMIC SHARING OF A MULTIPLE ACCESS CHANNEL
Cited In (4)
This page was built for publication: Local queuing under contention
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090920)