On efficient distributed construction of near optimal routing schemes (extended abstract)

DOI10.1145/2933057.2933098MaRDI QIDQ5361941zbMATH OpenOpenAlexFDO

Authors Michael Elkin, Ofer Neiman

Publication date 29 September 2017

Published in Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

congest modelrouting

Mathematics Subject Classification ID

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

Recommendations

• On efficient distributed construction of near optimal routing schemes
• Fast routing table construction using small messages (extended abstract)
• Near-optimal distributed routing with low memory
• Compact routing schemes with improved stretch
• Routing with Improved Communication-Space Trade-Off

Cited in

(10)

• On efficient distributed construction of near optimal routing schemes
• Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC
• Distributed distance computation and routing with small messages
• Distributed computing of efficient routing schemes in generalized chordal graphs
• Distributed computing of efficient routing schemes in generalized chordal graphs
• Near-optimal distributed routing with low memory
• A csomagtovábbítás skálázhatósága: korlátok és optimumok
• Hopsets with constant hopbound, and applications to approximate shortest paths
• Fast routing table construction using small messages (extended abstract)
• Integer Programming and Combinatorial Optimization

This page was built for publication: On efficient distributed construction of near optimal routing schemes (extended abstract)

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