Optimal Dynamic Coding-Window Selection for Serving Deadline-Constrained Traffic Over Time-Varying Channels

DOI10.1109/TIT.2012.2204031MaRDI QIDQ2989746zbMATH OpenOpenAlexFDO

Authors Ruogu Li, Harsha Gangammanavar, Atilla Eryilmaz

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Throughput Optimal Scheduling Over Time-Varying Channels in the Presence of Heavy-Tailed Traffic
• Dynamic Server Allocation Over Time-Varying Channels With Switchover Delay
• Optimal sliding-window strategies in networks with long round-trip delays
• Optimal Rate–Delay Tradeoffs and Delay Mitigating Codes for Multipath Routed and Network Coded Networks
• Optimal Rate Control for Delay-Constrained Data Transmission Over a Wireless Channel
• Asymptotically Optimal Policies for Hard-Deadline Scheduling Over Fading Channels
• Delay Optimal Buffered Decode-and-Forward for Two-Hop Networks With Random Link Connectivity
• Toward a timed theory of channel coding
• Joint Scheduling and Network Coding for Multicast in Delay-Constrained Wireless Networks

Cited in

(1)

• scientific article; zbMATH DE number 638301 (Why is no real title available?)

This page was built for publication: Optimal Dynamic Coding-Window Selection for Serving Deadline-Constrained Traffic Over Time-Varying Channels

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