Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule

DOI10.1016/J.JALGOR.2004.03.004zbMATH Open1085.68012OpenAlexW2029501804MaRDI QIDQ4828564FDOQ4828564

Authors: Lisa Zhang, Matthew Andrews 

Publication date: 23 November 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.03.004

Recommendations

• General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate)
• Enhanced bulk scheduling for supporting delay sensitive streaming applications
• Packet routing with arbitrary end-to-end delay requirements
• Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality
• Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

zbMATH Keywords

SchedulingPacket routingEarliest deadline firstDelay boundsWeighted fair queueing

Mathematics Subject Classification ID

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

Cited In (6)

• Coupled friction and roughness surface effects in shallow spherical nanoindentation
• Delay bound and packet scale rate guarantee for some expedited forwarding networks
• Enhanced bulk scheduling for supporting delay sensitive streaming applications
• Service curve allocation for end-to-end delay requirement
• Packet routing with arbitrary end-to-end delay requirements
• Multiperiod Network Rate Allocation With End-to-End Delay Constraints

This page was built for publication: Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule

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