Optimal multiplexing on a single link: delay and buffer requirements

DOI10.1109/18.623149zbMath0888.90060OpenAlexW2005801993MaRDI QIDQ4371892

Abhay K. Parekh, Roch Guérin, Leonidas Georgiadis

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

scheduling policiesdata networkspacket-switched networksmultiplexingdelay constraintsminimizing buffer

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (5)

Largest weighted delay first scheduling: Large deviations and optimality ⋮ A note on preemptive scheduling of multiclass jobs with geometric service times and hard deadlines ⋮ Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality ⋮ A general framework for handling commitment in online throughput maximization ⋮ Examining QoS Guarantees for Real-Time CBR Services in Broadband Wireless Access Networks

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