Medium Access Using Queues

DOI10.1109/FOCS.2011.99MaRDI QIDQ5494994zbMATH OpenOpenAlexFDO

Authors Devavrat Shah, Jinwoo Shin, Prasad Tetali

Publication date 30 July 2014

Published in 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/focs.2011.99

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Randomized algorithms (68W20) Queues and service in operations research (90B22)

Cited in

(9)

• Crossover times in bipartite networks with activity constraints and time-varying switching rates
• Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms
• Temporal starvation in multi-channel CSMA networks: an analytical framework
• Queue-based random-access algorithms: fluid limits and stability issues
• Delay performance in random-access networks
• Lingering issues in distributed scheduling
• Distributed link scheduling in wireless networks
• Instability of backoff protocols with arbitrary arrival rates
• Queues with random back-offs

This page was built for publication: Medium Access Using Queues

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