Optimal-stretch name-independent compact routing in doubling metrics

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2006, Issue , 2006, Pages 198-207

  Konjevod, Goran ^a   Richa, Andréa W ^a   Xia, Donglin ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Compact Routing; Doubling Metrics; Name Independent Routing

Indexed keywords

INFORMATION ANALYSIS; OPTIMIZATION; PACKET NETWORKS; ROUTERS; TELECOMMUNICATION NETWORKS;

COMPACT ROUTING; DOUBLING METRICS; NAME-INDEPENDENT ROUTING; POLYLOGARITHMIC FUNCTIONS;

METRIC SYSTEM;

EID: 33748678507     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146381.1146412     Document Type: Conference Paper

References (21)

1. I. Abraham and C. Gavoille. Object location using path separators. Technical Report RR-1394-06, LaBRI, University of Bordeaux, March 2006.
2. th International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society Press, July 2006. To appear.
3. I. Abraham, C. Gavoille, and D. Malkhi. Routing with improved communication-space trade-off. In Proceedings of the 18th International Conference on Distributed Computing, volume 3274 of Lecture Notes in Computer Science, pages 305-319, 2004.
4. I. Abraham, C. Gavoille, and D. Malkhi. Compact routing for graphs excluding a fixed minor. In Proceedings of the 19th International Conference on Distributed Computing, volume 3724 of Lecture Notes in Computer Science, pages 442-456, 2005.
5. I. Abraham and D. Malkhi. Compact routing on Euclidean metrics. In Proceedings of the 23rd Annual A CM Symposium on Principles of Distributed Computing, pages 141-149, 2004.
6. I. Abraham and D. Malkhi. Name independent routing for growth bounded networks. In Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms and Architecture, pages 49-55, 2005.
7. I. Abraham, D. Malkhi, and O. Dobzinski. Land: stretch (1 + ε) locality-aware networks for DHTs. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 550-559, 2004.
8. B. Awerbuch and D. Peleg. Routing with polynomial communication-space trade-off. SIAM J. Discret. Math., 5(2): 151-162, 1992.
9. H. T.-H. Chan, A. Gupta, B. Maggs, and S. Zhou. On hierarchical routing in doubling metrics. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 762-771, 2005.
10. A. Gupta, R. Krauthgamer, and J.R.Lee. Bounded geometries, fractals and low-distortion embeddings. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 534-543, 2003.
11. S. Har-Peled and M. Mendel. Fast construction of nets in low dimensional metrics and their applications. In Proceedings of the, 21st Annual ACM Symposium on Computational Geometry, pages 150-158, 2005.
12. Y. Hassin and D. Peleg. Sparse communication networks and efficient routing in the plane. Distributed computing, 14:205-215, 2001.
13. D. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In Proceedings of the 34th Annual A CM Symposium on Theory of Computing, pages 63-66, 2002.
14. J. Kleinberg, A. Slivkins, and T. Wexler. Triangulation and embedding using small sets of beacons. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 444-453, 2004.
15. R. Krauthgamer and J. R. Lee. Navigating nets: simple algorithms for proximity search. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 798-807, 2004.
16. T. S. E. Ng and H. Zhang. Predicting Internet, network distance with coordinates-based approaches. In Proceedings of the 21th Annual Joint Conference of the IEEE Computer and Communications Society, pages 170-179, 2002.
17. R.Krauthgamer, J. R. Lee, M. Mendel, and A. Naor. Measured descent: A new embedding method for finite metrics. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 434-443, 2004.
18. A. Slivkins. Distance estimation and object location via rings of neighbors. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing, pages 41-50, 2005.
19. A. Slivkins. Distributed approaches to triangulation and embedding. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 640-649, 2005.
20. K. Talwar. Bypassing the embedding: algorithms for low dimensional metrics. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 281-290, 2004.
21. M. Thorup. Compact oracles for reachability and approximate distances in planar digraphs. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 242-251, 2001.