Compact Roundtrip Routing with Topology-Independent Node Names

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 43-52

  Arias, Marta ^a   Cowen, Lenore J ^a   Laing, Kofi A ^a  

^a Tufts University   (United States)

Author keywords

Compact Routing; Digraphs; Distributed Lookup Tables; Stretch

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; TABLE LOOKUP; TELECOMMUNICATION NETWORKS; THEOREM PROVING; TOPOLOGY;

COMPACT ROUTING; DIGRAPHS; DISTRIBUTED LOOKUP TABLES; STRETCH ANALYSIS;

GRAPH THEORY;

EID: 1142293111     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872042     Document Type: Conference Paper

References (30)

1. M. Arias, L. Cowen, K. Laing, R. Rajaraman, and O. Taka, Compact routing with name independence. To appear in SPAA, 2003.
2. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Compact distributed data structures for adaptive network routing. In Proc. 21st ACM Symp. on Theory of Computing, pages 479-489, May 1989.
3. B. Awerbuch and D. Peleg. Sparse partitions. In Proc. 31st IEEE Symp. on Found. of Comp. Science, pages 503-513, 1990.
4. L. Cowen. Compact routing with minimum stretch. J. of Algorithms, 38:170-183, 2001.
5. L. Cowen and W. Wagner. Compact roundtrip routing in digraphs. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages S885-886, 1999.
6. L. J. Cowen and C. G. Wagner. Compact roundtrip routing in directed networks. In Proc. 19th ACM Symp. on Principles of Distrib. Computing, pages 51-59, 2000.
7. M. Crovella. Personal communication, 2002.
8. D. Dor, S. Halperin, and U. Zwick. All pairs almost shortest paths. In 37th Annual Symposium on Foundations of Computer Science, pages 452-461, Burlington, Vermont, 14-16 Oct. 1996. IEEE.
9. T. Eilam, C. Gavoille, and D. Peleg. Compact routing schemes with low stretch factor. In 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 11-20, 1998.
10. th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 757-772. Springer, 2001.
11. C. Gavoille. Routing in distributed networks: Overview and open problems. ACM SIGACT News -Distributed Computing Column, 32(1):36-52, March 2001.
12. C. Gavoille and M. Gengler. Space-efficiency of routing schemes of stretch factor three. Journal of Parallel and Distributed Computing, 61:679-687, 2001.
13. K. Hildrum, J. Kubiatowicz, S. Rao, and B. Zhao. Distributed object location in a dynamic network. In Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 41-52, 2002.
14. K. Iwama and A. Kawachi. Compact routing with stretch factor of less than three. In 19th Annual ACM Symposium on Principles of Distributed Computing (PODC), page 337, 2000.
15. K. Iwama and M. Okita. Compact routing for average case networks. In 21st Annual ACM Symposium on Principles of Distributed Computing (PODC), 2002.
16. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, H. W. R. Gummadi, S. Rhea, W.Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for global-scale persistent storage. In Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2000.
17. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, 1992.
18. D. Peleg. Distance-dependent distributed directories. Information and Computation, 103(2):270-298, 1993.
19. C. Plaxton, R. Rajaraman, and A. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 32:241-180, 1999.
20. R. Rajaraman. Personal communication, 2002.
21. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, pages 161-172. ACM Press, 2001.
22. L. Roditty, M. Thorup, and U. Zwick. Roundtrip spanners and roundtrip routing in directed graphs. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pages 844-851, Jan. 2002.
23. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329-350, Nov. 2001.
24. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149-160, 2001.
25. M. Thorup and U. Zwick. Compact routing schemes. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 1-10. ACM, July 2001.
26. M. van Steen, F. Hauck, and A. Tanenbaum. A model for worldwide tracking of distributed objects. In Proceedings of the 1996 Conference on Telecommunications Information Networking Architecture (TINA 96), pages 203-212, Sept. 1996.
27. C. Wagner. Drawing with Bezier Curves and Routing on Digraphs. PhD thesis, Dept. of Mathematical Sciences, Johns Hopkins University, 1999.
28. B. Y. Zhao, Y. Duan, L. Huang, A. D. Joseph, and J. D. Kubiatowicz. Brocade: landmark routing on overlay networks. In First International Workshop on Peer-to-Peer Systems (IPTPS)/LNCS, pages 34-44, march 2002.
29. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, Apr. 2001.
30. U. Zwick. Exact and approximate distances in graphs - a survey. In Proc. of 9th European Symposium on Algorithms, pages 33-48, 2001.