Routing in networks with low doubling dimension

Proceedings - International Conference on Distributed Computing Systems

Volumn 2006, Issue , 2006, Pages

  Abraham, Ittai ^a   Gavoille, Cyril ^b   Goldberg, Andrew V ^c   Malkhi, Dahlia ^a,c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Doubling dimension; Object location; Routing

Indexed keywords

LINEAR STORAGE; OBJECT LOCATION;

COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; GRAPHIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

NETWORK ROUTING;

EID: 33947637738     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2006.72     Document Type: Conference Paper

References (29)

1. I. Abraham, C. Gavoille, A. V. Goldberg, and D. Malkhi. Routing in networks with low doubling dimension. Technical Report MSR-TR-2005-175, Microsoft Research, Microsoft Corporation, One Microsoft Way, Redmond, WA 98052 - http://www.research.microsoft.com, Dec. 2005.
2. th International Symposium on Distributed Computing (DISC), volume 3274 of Lecture Notes in Computer Science, pages 305-319. Springer, Oct. 2004.
3. th International Symposium on Distributed Computing (DISC), volume 3724 of Lecture Notes in Computer Science, pages 442-456. Springer, Sept. 2005.
4. I. Abraham, C. Gavoille, and D. Malkhi. On space-stretch trade-offs for compact routing schemes. Technical Report RR-1374-05, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, Nov. 2005.
5. rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 141-149. ACM Press, July 2004.
6. th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA). ACM Press, July 2005.
7. th Symposium on Discrete Algorithms (SODA), pages 550-559. ACM-SIAM, Jan. 2004.
8. st Annual ACM Symposium on Theory of Computing (STOC), pages 479-489. ACM Press, May 1989.
9. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Improved routing strategies with succinct tables. Journal of Algorithms, 11(3):307-341, 1990.
10. th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 503-513. IEEE Computer Society Press, Oct. 1990.
11. th Symposium on Discrete Algorithms (SODA). ACM-SIAM, Jan. 2005.
12. th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 757-772. Springer, July 2001.
13. C. Gavoille. Routing in distributed networks: Overview and open problems. ACM SIGACT News - Distributed Computing Column, 32(1):36-52, Mar. 2001.
14. C. Gavoille and D. Peleg. Compact and localized distributed data structures. Journal of Distributed Computing, 16:111-120, May 2003.
15. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics, a foundation for computer science (second edition). Addison-Wesley, 1994.
16. th Annual IEEE Symposium on Foundations of Computer Science, pages 534-543. IEEE Computer Society Press, Oct. 2003.
17. Y. Hassin and D. Peleg. Sparse communication networks and efficient routing in the plane. Distributed Computing, 14(4):205-215, 2001.
18. th Annual ACM Symposium on Theory of Computing (STOC), pages 386-395. ACM Press, May 2005.
19. G. Konjevod, A. W. Richa, and D. Xia. On optimal stretch name-independent compact routing in doubling metrics. Manuscript submitted for publication.
20. th Symposium on Discrete Algorithms (SODA), pages 798-807. ACM-SIAM, Jan. 2004.
21. th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 434-443. IEEE Computer Society Press, Oct. 2004.
22. th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 60-68. ACM Press, July 2005.
23. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), page 216. ACM Press, July 2005.
24. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SLAM Monographs on Discrete Mathematics and Applications, 2000.
25. th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 41-50. ACM Press, July 2005.
26. th Symposium on Discrete Algorithms (SODA), pages 640-649. ACM-SIAM, Jan. 2005.
27. th Annual ACM Symposium on Theory of Computing (STOC), pages 281-290, June 2004.
28. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM, 46:362-394, 1999.
29. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1-10. ACM Press, July 2001.