An O (log N ) deterministic packet-routing scheme

DOI10.1145/147508.147517zbMath0799.68105MaRDI 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

performance; network routing; packet networks; deterministic routing; parallel computer

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

68W10: Parallel algorithms in computer science

68W15: Distributed algorithms

Related Items

A theory of decomposition into prime factors of layered interconnection networks, Real-time emulations of bounded-degree networks