Efficient Deadline-Based QoS Algorithms for High-Performance Networks

DOI10.1109/TC.2008.39MaRDI QIDQ4564044zbMATH OpenFDO

Authors

Publication date 12 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Performance bounds for scheduling queueing networks
• A robust and high-performance queue management controller for large round trip time networks

Cited in

(2)

• Earliest-deadline-first service in heavy-traffic acyclic networks.
• A robust and high-performance queue management controller for large round trip time networks

This page was built for publication: Efficient Deadline-Based QoS Algorithms for High-Performance Networks

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