Throughput Optimal Scheduling Over Time-Varying Channels in the Presence of Heavy-Tailed Traffic

DOI10.1109/TIT.2014.2311125MaRDI QIDQ2986404zbMATH OpenOpenAlexFDO

Authors Krishna Jagannathan, Mihalis G. Markakis, Eytan Modiano, John N. Tsitsiklis

Publication date 16 May 2017

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

Full work available at URL https://doi.org/10.1109/tit.2014.2311125

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Communication theory (94A05) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Cited in

(6)

• Improving the efficiency of multipath traffic via opportunistic traffic scheduling
• On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
• scientific article; zbMATH DE number 638301 (Why is no real title available?)
• Asymptotically Optimal Policies for Hard-Deadline Scheduling Over Fading Channels
• Optimal Dynamic Coding-Window Selection for Serving Deadline-Constrained Traffic Over Time-Varying Channels
• Whittle index approach to size-aware scheduling for time-varying channels with multiple states

This page was built for publication: Throughput Optimal Scheduling Over Time-Varying Channels in the Presence of Heavy-Tailed Traffic

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