Stable memoryless queuing under contention

DOI10.4230/LIPICS.DISC.2019.17MaRDI QIDQ6487533zbMATH OpenFDO

Authors P. Garncarek, Tomasz Jurdziński, Dariusz R. Kowalski

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2019.17

zbMATH Keywords

adversarial injectionsmemoryless algorithmsonline algorithmspacket schedulingstabilitystochastic injections

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Recommendations

• Local queuing under contention
• New Stability Results for Adversarial Queuing
• Distributed Online and Stochastic Queueing on a Multiple Access Channel
• Adversarial queuing on the multiple-access channel
• Universal-stability results and performance bounds for greedy contention-resolution protocols

Cited in

(7)

• Stable routing scheduling algorithms in multi-hop wireless networks
• Universal stability in multi-hop radio networks
• Queue-based random-access algorithms: fluid limits and stability issues
• Local queuing under contention
• Stable scheduling in transactional memory
• Jamming-resistant backoff with polylogarithmic sending and listening cost
• Bankrupting DoS attackers

This page was built for publication: Stable memoryless queuing under contention

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