Packet routing with arbitrary end-to-end delay requirements

DOI10.1145/301250.301401zbMATH Open1345.68024OpenAlexW2086627596MaRDI QIDQ2819587FDOQ2819587

Authors: Lisa Zhang, Matthew Andrews 

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301401

Recommendations

• General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate)
• Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
• Source routing and scheduling in packet networks
• Delay-constrained routing problems: accurate scheduling models and admission control
• Efficient delay routing

Mathematics Subject Classification ID

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

Cited In (7)

• Delay-constrained routing problems: accurate scheduling models and admission control
• Enhanced bulk scheduling for supporting delay sensitive streaming applications
• Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
• Differential AR algorithm for packet delay prediction
• Title not available (Why is that?)
• General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate)
• A generalized delay allocation model for rate-based packet scheduling algorithms

This page was built for publication: Packet routing with arbitrary end-to-end delay requirements

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