Routing in Distributed Networks: Overview and Open Problems (2001)

by Cyril Gavoille
Venue:ACM SIGACT News - Distributed Computing Column
Citations:51 - 13 self

Documents Related by Co-Citation

111 Compact Routing with Minimum Stretch – Lenore Cowen
196 Compact routing schemes – Mikkel Thorup, Uri Zwick
71 Compact and Localized Distributed Data Structures – Cyril Gavoille, David Peleg - 2001
75 Routing with Polynomial Communication-Space Tradeoff – Baruch Awerbuch, David Peleg - 1993
302 Distributed computing: a locality-sensitive approach – David Peleg - 2000
134 A tradeoff between space and efficiency for routing tables – David Peleg, Eli Upfal - 1988
86 Routing in Trees – Pierre Fraigniaud, Cyril Gavoille - 2001
61 Compact Routing Schemes With Low Stretch Factor – Tamar Eilam, Tamar Eilam, Cyril Gavoille, Cyril Gavoille, David Peleg, David Peleg - 1998
136 Sparse partitions – B Awerbuch, D Peleg - 1990
207 Approximate distance oracles – Mikkel Thorup, Uri Zwick
42 Efficient message routing in planar networks – G N Frederickson, R Janardan - 1989
63 Space-Efficiency for Routing Schemes of Stretch Factor Three – Cyril Gavoille, Marc Gengler - 1997
64 Bypassing the embedding: Algorithms for low-dimensional metrics – Kunal Talwar - 2004
87 Compact oracles for reachability and approximate distances in planar digraphs – M Thorup
474 Accessing Nearby Copies of Replicated Objects in a Distributed Environment – C. Greg Plaxton, Rajmohan Rajaraman, Andrea W. Richa, Andr'ea W. Richa - 1997
3473 Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications – Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan - 2001
71 Compact Distributed Data Structures for Adaptive Routing – Baruch Awerbuch, Amotz Bar-noy, Nathan Linial, David Peleg - 1989
153 Bounded geometries, fractals, and low-distortion embeddings – Anupam Gupta, Robert Krauthgamer, James R. Lee
64 Distance Estimation and Object Location via Rings of Neighbors – Aleksandrs Slivkins - 2005