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

by Cyril Gavoille
Venue:ACM SIGACT News - Distributed Computing Column
Citations:49 - 12 self

Documents Related by Co-Citation

112 Compact Routing with Minimum Stretch – Lenore Cowen
196 Compact routing schemes – Mikkel Thorup, Uri Zwick
72 Compact and Localized Distributed Data Structures – Cyril Gavoille, David Peleg - 2001
75 Routing with Polynomial Communication-Space Tradeoff – Baruch Awerbuch, David Peleg - 1993
304 Distributed Computing: A Locality-Sensitive Approach – D Peleg - 2000
134 A tradeoff between space and efficiency for routing tables – D Peleg, E Upfal - 1988
87 Routing in Trees – Pierre Fraigniaud, Cyril Gavoille - 2001
63 Compact Routing Schemes With Low Stretch Factor – Tamar Eilam, Tamar Eilam, Cyril Gavoille, Cyril Gavoille, David Peleg, David Peleg - 1998
139 parse partitions – B AWERBUCH, D PELEG - 1990
210 Approximate distance oracles – Mikkel Thorup, Uri Zwick
44 Efficient message routing in planar networks – G N Frederickson, R Janardan - 1989
64 Space-Efficiency for Routing Schemes of Stretch Factor Three – Cyril Gavoille, Marc Gengler - 1997
65 Bypassing the embedding: Algorithms for low-dimensional metrics – Kunal Talwar - 2004
89 Compact oracles for reachability and approximate distances in planar digraphs – M Thorup
472 Accessing Nearby Copies of Replicated Objects in a Distributed Environment – C. Greg Plaxton, Rajmohan Rajaraman, Andrea W. Richa, Andr'ea W. Richa - 1997
71 Compact Distributed Data Structures for Adaptive Routing – Baruch Awerbuch, Amotz Bar-noy, Nathan Linial, David Peleg - 1989
3446 Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications – Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan - 2001
154 Bounded geometries, fractals, and low-distortion embeddings – Anupam Gupta, Robert Krauthgamer, James R. Lee
58 On Hierarchical Routing in Doubling Metrics – Hubert T-H. Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou - 2005