Name independent routing for growth bounded networks

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 49-55

  Abraham, Ittai ^a   Malkhi, Dahlia ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Compact Routing

Indexed keywords

COMPACT ROUTING; GROWTH BOUNDED NETWORKS;

PROBABILITY; ROUTERS;

TELECOMMUNICATION NETWORKS;

EID: 32144433689     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1073978     Document Type: Conference Paper

References (33)

1. Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi. On space-stretch trade-offs for compact routing schemes. Submitted for publication.
2. th International Symposium on Distributed Computing (DISC), volume 3274 of Lecture Notes in Computer Science, pages 305-319. Springer, October 2004.
3. th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA). ACM PRESS, June 2004.
4. Ittai Abraham, Dahlia Malkhi, and Oren Dobzinski. Land: stretch (1 + ε,) locality-aware networks for DHTs. In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pages 550-559. Society for Industrial and Applied Mathematics, 2004.
5. Marta Arias, Lenore J. Cowen, Kofi A. Laing, Rajmohan Rajaraman, and Orjeta Taka. Compact routing with name independence. In Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pages 184-192. ACM Press, 2003.
6. Baruch Awerbuch, Amotz Bar Noy, Nati Linial, and David Peleg. Improved routing strategies with succinct tables. Journal of Algorithms, 11(3):307-341, 1990.
7. Baruch Awerbuch and David Peleg. Sparse partitions. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science (FOCS), pages 503-513, 1990.
8. Baruch Awerbuch and David Peleg. Routing with polynomial communication-space trade-off. SIAM J. Discret. Math., 5(2):151-162, 1992.
9. Bruch Awerbuch, Amotz Bar-Noy, Nati Linial, and David Peleg. Compact distributed data structures for adaptive routing. In Proceedings of the twenty-first annual A CM symposium on Theory of computing, pages 479-489. ACM Press, 1989.
10. J. Lawrence Carter and Mark N. Wegman. Universal hash functions. Journal of Computer and System Sciences, 18(2):143-154, 1979.
11. T-H. Hubert Chan, Anupam Gupta, Bruce M. Maggs, and Shuheng Zhou. On hierarchical routing in doubling metrics. In Proc. 16th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
12. Lenore J. Cowen. Compact routing with minimum stretch. In Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, pages 255-260. Society for Industrial and Applied Mathematics, 1999.
13. Tamar Eilam, Cyril Gavoille. and David Peleg. Compact routing schemes with low stretch factor. Journal of Algorithms, 46:97-114, 2003.
14. th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 757-772. Springer, July 2001.
15. th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2285 of Lecture Notes in Computer Science, pages 65-75. Springer. March 2002.
16. Cyril Gavoille. Routing in distributed networks: Overview and open problems. A CM SIGACT News - Distributed Computing Column, 32(1):36-52, March 2001.
17. Cyril Gavoille and Marc Gengler. Space-efficiency for routing schemes of stretch factor three. J. Parallel Distrib. Comput. 61(5):679-687, 2001.
18. Cyril Gavoille and David Peleg. Compact and localized distributed data structures. Journal of Distributed Computing, 16:111-120, May 2003. PODC 20-Year Special Issue.
19. Anupam Gupta, Robert Krauthgamer, and James R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, page 534. IEEE Computer Society, 2003.
20. Sariel Har-Peled and Manor Mendel. Fast construction of nets in low dimensional metrics, and their applications. In SCG '05: Proceedings of the twenty first annual symposium on Computational geometry, New York, NY, USA, 2005. ACM Press.
21. Kirsten Hildrum, Robert Krauthgamer, and John Kubiatowicz. Object location in realistic networks. In SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 25-35. ACM Press, 2004.
22. Kirsten Hildrum. John Kubiatowicz, Sean Ma, and Satish Rao. A note on the nearest neighbor in growth-restricted metrics. In SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pages 560-561. Society for Industrial and Applied Mathematics, 2004.
23. Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, and Ben Y. Zhao. Distributed object location in a dynamic network. In SPAA '02: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, pages 41-52. ACM Press, 2002.
24. th International Symposium on Distributed Computing (DISC), pages 196-210. Springer, 2003.
25. Kofi A. Laing. Brief announcement: name-independent compact routing in trees. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 382-382. ACM Press, 2004.
26. David Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications, 2000.
27. David Peleg and Eli Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36(3):510-530, July 1989.
28. C. Greg Plaxton, Rajmohan Rajaraman, and Andréa W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, pages 311-320. ACM Press, 1997.
29. thl Annual ACM Symposium on Principles of Distributed Computing (PODC), 2005.
30. Aleksandrs Slivkins. Distributed approaches to triangulation and embedding. In Proc. 16th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
31. Kunal Talwar. Bypassing the embedding: algorithms for low dimensional metrics. In Proceedings of the thirty-sixth annual A CM symposium on Theory of computing, pages 281-290. ACM Press, 2004.
32. rd Annual ACM Symposium on Theory of Computing (STOC), pages 183-192, Hersonissos, Crete, Greece, July 2001.
33. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1-10. ACM Press, July 2001.