An O (log N ) deterministic packet-routing scheme

DOI10.1145/147508.147517zbMath0799.68105OpenAlexW2016237810MaRDI QIDQ4302818

Eli Upfal

Publication date: 13 November 1994

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

performancenetwork routingpacket networksdeterministic routingparallel computer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Related Items (4)

Real-time emulations of bounded-degree networks ⋮ Routing with bounded buffers and hot-potato routing in vertex-symmetric networks ⋮ On the theory of interconnection networks for parallel computers ⋮ A theory of decomposition into prime factors of layered interconnection networks

This page was built for publication: An O (log N ) deterministic packet-routing scheme