Memory requirement for universal routing schemes

DOI10.1145/224964.224989zbMath1373.68044OpenAlexW1997881834MaRDI QIDQ5361458

Cyril Gavoille, Pierre Fraigniaud

Publication date: 29 September 2017

Published in: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Related Items (10)

Average stretch analysis of compact routing schemes ⋮ Unnamed Item ⋮ Sparse communication networks and efficient routing in the plane ⋮ Compact and localized distributed data structures ⋮ Fault-Tolerant Compact Routing Schemes for General Graphs ⋮ \(f\)-sensitivity distance oracles and routing schemes ⋮ Unnamed Item ⋮ On compact and efficient routing in certain graph classes ⋮ Compact policy routing ⋮ On the complexity of multi-dimensional interval routing schemes

This page was built for publication: Memory requirement for universal routing schemes