Compact roundtrip routing with topology-independent node names
From MaRDI portal
Publication:5900132
DOI10.1016/j.jcss.2007.09.001zbMath1151.68562OpenAlexW2075607802MaRDI QIDQ5900132
Marta Arias, Kofi A. Laing, Lenore J. Cowen
Publication date: 26 June 2008
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2007.09.001
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed object location in a dynamic network
- Accessing nearby copies of replicated objects in a distributed environment
- Distance-dependent distributed directories
- Name-independent compact routing in trees
- Compact Routing with Minimum Stretch
- Routing with Polynomial Communication-Space Trade-Off
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Compact routing schemes with low stretch factor
- Compact roundtrip routing in directed networks
- All-Pairs Almost Shortest Paths
- Compact name-independent routing with minimum stretch
- Approximate distance oracles
- Compact roundtrip routing in directed networks (extended abstract)
- Routing with Improved Communication-Space Trade-Off
- Compact Routing with Name Independence
- Compact roundtrip routing with topology-independent node names
- Distributed Computing
- Space-efficiency for routing schemes of stretch factor three