Compact routing with name independence

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 184-192

  Arias, Marta ^a   Cowen, Lenore J ^a   Laing, Kofi A ^a   Rajaraman, Rajmohan ^b   Taka, Orjeta ^a  

^a Tufts University   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Compact Routing; Distributed Lookup Tables; Stretch

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PACKET NETWORKS; TELECOMMUNICATION TRAFFIC;

ADAPTIVE ROUTING;

ROUTERS;

EID: 0037703321     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777441.777442     Document Type: Conference Paper

References (18)

1. 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.
2. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Improved routing strategies with succinct tables. J. of Algorithms, 11:307-341, 1990.
3. B. Awerbuch and D. Peleg. Sparse partitions. In Proc. 31st IEEE Symp. on Found. of Comp. Science, pages 503-513, 1990.
4. B. Awerbuch and D. Peleg. Routing with polynomial communication - space trade-off. SIAM J. Disc. Math, 5(2):151-162, 1992.
5. J. L. Carter and M. Wegman. Universal classes of hash functions. J. Comput. and Syst. Sci., 18:143-154, 1979.
6. L. Cowen. Compact routing with minimum stretch. J. of Algorithms, 38:170-183, 2001.
7. 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.
8. th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 757-772. Springer, 2001.
9. C. Gavoille and M. Gengler. Space-efficiency of routing schemes of stretch factor three. In 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 162-175, July 1997.
10. 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.
11. 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.
12. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, 1992.
13. L. Lovasz. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
14. D. Peleg. Distance-dependent distributed directories. Information and Computation, 103(2):270-298, 1993.
15. C. Plaxton, R. Rajaraman, and A. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 32:241-280, 1999.
16. M. Thorup and U. Zwick. Approximate distance oracles. In Proc. 33rd ACM Symp. on Theory of Computing, pages 183-192, May 2001.
17. M. Thorup and U. Zwick. Compact routing schemes. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 1-10, July 2001.
18. 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.