Memory requirement for routing in distributed networks
From MaRDI portal
Publication:2942724
DOI10.1145/248052.248075zbMath1321.68045OpenAlexW1982100216MaRDI QIDQ2942724
Cyril Gavoille, Stéphane Pérennes
Publication date: 11 September 2015
Published in: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/248052.248075
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)
Related Items
Average stretch analysis of compact routing schemes, Unnamed Item, Distributed computing of efficient routing schemes in generalized chordal graphs, Interval routing schemes allow broadcasting with linear message-complexity, Compact and localized distributed data structures, Distance and routing labeling schemes for cube-free median graphs, Representing graphs implicitly using almost optimal space, Unnamed Item, On compact and efficient routing in certain graph classes, Compact policy routing, The compactness of adaptive routing tables, A survey on interval routing, On the complexity of multi-dimensional interval routing schemes
