General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate)

DOI10.1137/S009753979935061XzbMath0976.68018OpenAlexW2103348200MaRDI QIDQ2706127

No author found.

Publication date: 19 March 2001

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753979935061x

zbMATH Keywords

schedulingcommunication networksdelay boundspacket routing

Mathematics Subject Classification ID

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

Related Items (3)

Routing and scheduling for energy and delay minimization in the powerdown model ⋮ Time-optimum packet scheduling for many-to-one routing in wireless sensor networks ⋮ Smooth scheduling under variable rates or the analog-digital confinement game

This page was built for publication: General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate)