Memory requirement for universal routing schemes

DOI10.1145/224964.224989MaRDI QIDQ5361458zbMATH OpenOpenAlexFDO

Authors Pierre Fraigniaud, Cyril Gavoille

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)

Cited in

(10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361458)