Fast deflection routing for packets and worms
From MaRDI portal
Publication:5365160
DOI10.1145/164051.164062zbMath1373.68035OpenAlexW2071482359MaRDI QIDQ5365160
Baruch Schieber, Prabhakar Raghavan, Amotz Bar-Noy, Hisao Tamaki
Publication date: 29 September 2017
Published in: Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/164051.164062
Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12) Internet topics (68M11)
Related Items (6)
Efficient delay routing ⋮ Many-to-many routing on trees via matchings ⋮ Greedy hot-potato routing on the two-dimensional mesh ⋮ Networks on which hot-potato routing does not livelock ⋮ On the theory of interconnection networks for parallel computers ⋮ A note on deflection worm routing on meshes.
This page was built for publication: Fast deflection routing for packets and worms