Hardness of Low Delay Network Scheduling
From MaRDI portal
Publication:5272203
DOI10.1109/TIT.2011.2168897zbMath1365.68268MaRDI QIDQ5272203
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)
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) 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)
Related Items
Stability and delay of distributed scheduling algorithms for networks of conflicting queues ⋮ Delay performance in random-access networks ⋮ Lingering issues in distributed scheduling ⋮ Queue-Based Random-Access Algorithms: Fluid Limits and Stability Issues ⋮ Effective Wireless Scheduling via Hypergraph Sketches
This page was built for publication: Hardness of Low Delay Network Scheduling