Routing with Improved Communication-Space Trade-Off

DOI10.1007/978-3-540-30186-8_22MaRDI QIDQ5464200zbMATH OpenOpenAlexFDO

Authors Ittai Abraham, Cyril Gavoille, Dahlia Malkhi

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-30186-8_22

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Compact name-independent routing with minimum stretch
• A trade-off between space and efficiency for routing tables
• Routing with Polynomial Communication-Space Trade-Off
• Close to linear space routing schemes
• New routing techniques and their applications

Cited in

(18)

• A note on models for graph representations
• On efficient distributed construction of near optimal routing schemes
• Distance estimation and object location via rings of neighbors
• Name-independent compact routing in trees
• Max-stretch reduction for tree spanners
• New routing techniques and their applications
• Routing with Polynomial Communication-Space Trade-Off
• A trade-off between space and efficiency for routing tables
• Compact name-independent routing with minimum stretch
• Subexponential parameterized algorithms for graphs of polynomial growth
• Compact routing schemes with improved stretch
• On efficient distributed construction of near optimal routing schemes (extended abstract)
• Improving Topological Routing in N2R Networks
• Close to linear space routing schemes
• Compact oblivious routing in weighted graphs
• Compact roundtrip routing with topology-independent node names
• Space-efficiency for routing schemes of stretch factor three
• Strong-diameter decompositions of minor free graphs

This page was built for publication: Routing with Improved Communication-Space Trade-Off

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