Hardness of Low Delay Network Scheduling

DOI10.1109/TIT.2011.2168897MaRDI QIDQ5272203zbMATH OpenFDO

Authors Devavrat Shah, David N. C. Tse, John N. Tsitsiklis

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2011.2168897

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Cited in

(6)

• Queue-based random-access algorithms: fluid limits and stability issues
• Link scheduling in polynomial time
• Stability and delay of distributed scheduling algorithms for networks of conflicting queues
• Delay performance in random-access networks
• Lingering issues in distributed scheduling
• Effective Wireless Scheduling via Hypergraph Sketches

This page was built for publication: Hardness of Low Delay Network Scheduling

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