Optimal multiplexing on a single link: delay and buffer requirements

DOI10.1109/18.623149MaRDI QIDQ4371892zbMATH OpenOpenAlexFDO

Authors Leonidas Georgiadis, Roch Guérin, Abhay Parekh

Publication date 8 June 1998

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

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

zbMATH Keywords

data networksdelay constraintsminimizing buffermultiplexingpacket-switched networksscheduling policies

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• Delay Optimal Buffered Decode-and-Forward for Two-Hop Networks With Random Link Connectivity
• Buffer contents and delay for statistical multiplexers with fixed-length packet-train arrivals
• scientific article; zbMATH DE number 4160444
• Throughput and Latency in Finite-Buffer Line Networks
• Advances in Multi-Channel Resource Allocation: Throughput, Delay, and Complexity
• Delay Optimal Transmission Policy in a Wireless Multiaccess Channel
• Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers
• Optimal Rate–Delay Tradeoffs and Delay Mitigating Codes for Multipath Routed and Network Coded Networks
• scientific article; zbMATH DE number 1726636

Cited in

(13)

• A simple formula for mean multiplexing delay for independent regenerative sources
• Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality
• Real-time traffic scheduling and routing in packet-switched networks using a least-laxity-first strategy
• Largest weighted delay first scheduling: Large deviations and optimality
• Delay optimization for buffered traffic of switched sources
• Examining QoS guarantees for real-time CBR services in broadband wireless access networks
• Optimum Scheduling and Memory Management in Input Queued Switches With Finite Buffer Space
• Tight arrival curve at the output of a work-conserving blind multiplexing server
• Optimal scheduling of interactive and noninteractive traffic in telecommunication systems
• A note on preemptive scheduling of multiclass jobs with geometric service times and hard deadlines
• A class of scheduling policies for mixed data with renewal arrival processes
• Worst case burstiness increase due to FIFO multiplexing
• A general framework for handling commitment in online throughput maximization

This page was built for publication: Optimal multiplexing on a single link: delay and buffer requirements

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