Space-efficiency for routing schemes of stretch factor three

DOI10.1006/JPDC.2000.1705MaRDI QIDQ5943110zbMATH OpenOpenAlexFDO

Authors Cyril Gavoille, Marc Gengler

Publication date 14 August 2002

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/756a0230c7475053258dddf8a6de992d9ca565c5

zbMATH Keywords

routing algorithms

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Compact routing schemes with low stretch factor
• Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
• Compact routing schemes with improved stretch
• Average stretch analysis of compact routing schemes
• On the space requirement of interval routing
• Close to linear space routing schemes
• Close to linear space routing schemes
• A trade-off between space and efficiency for routing tables
• Routing with Improved Communication-Space Trade-Off

Cited in

(23)

• Distance estimation and object location via rings of neighbors
• Bounding the locality of distributed routing algorithms
• Additive spanners and distance and routing labeling schemes for hyperbolic graphs
• Fault-Tolerant Compact Routing Schemes for General Graphs
• Distributed computing of efficient routing schemes in generalized chordal graphs
• Routing with Polynomial Communication-Space Trade-Off
• Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
• Distributed computing of efficient routing schemes in generalized chordal graphs
• scientific article; zbMATH DE number 2080868 (Why is no real title available?)
• On the efficiency of routing in sensor networks
• A trade-off between space and efficiency for routing tables
• Sparse communication networks and efficient routing in the plane
• Compact and localized distributed data structures
• The idemetric property: when most distances are (almost) the same
• Bounding the locality of distributed routing algorithms
• Sparse communication networks and efficient routing in the plane (extended abstract)
• Distributed Routing in Tree Networks with Few Landmarks
• Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs
• Compact roundtrip routing with topology-independent node names
• Close to linear space routing schemes
• \(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: Space-efficiency for routing schemes of stretch factor three

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