Compact name-independent routing with minimum stretch

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 20-24

  Abraham, Ittai ^a   Gavoille, Cyril ^b   Malkhi, Dahlia ^a   Nisan, Noam ^a   Thorup, Mikkel ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

Compact Routing

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; DATA STRUCTURES; GRAPH THEORY; MAPPING; POLYNOMIALS; SET THEORY; TELECOMMUNICATION NETWORKS; THEOREM PROVING;

COMPACT ROUTING; DERANDOMIZE; LOGSPACE TESTS; OPTIMAL STRETCH;

ROUTERS;

EID: 8344263814     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007916     Document Type: Conference Paper

References (18)

1. M. Arias, L. J. Cowen, K. A. Laing, R. Rajaraman, and O. Taka. Compact routing with name independence. In Proceedings of the 15th annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 184-192, 2003.
2. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Compact distributed data structures for adaptive routing. In Proceedings of the 21st annual ACM Symposium on Theory of Computing (STOC), pages 479-489, 1989.
3. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Improved routing strategies with succinct tables. Journal of Algorithms, 11(3):307-341, 1990.
4. B. Awerbuch and D. Peleg. Sparse partitions. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science (FOCS), pages 503-513, 1990.
5. J.L. Carter and M.N. Wegman. Universal classes of hash functions. J. Comp. Syst. Sci., 18:143-154, 1979.
6. L. J. Cowen. Compact routing with minimum stretch. In Proceedings of the 10th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 255-260, 1999.
7. P. Fraigniaud and C. Gavoille. Routing in trees. In Proceedings of the 28th International Colloqium on Automata, Languages and Programming (ICALP), pages 757-772. Volume 2076 of LNCS, 2001.
8. th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2285 of LNCS, pages 65-75, 2002.
9. C. Gavoille. Routing in distributed networks: overview and open problems. ACM SIGACT News, 32(1):36-52, 2001.
10. C. Gavoille and M. Gengler. Space-efficiency for routing schemes of stretch factor three. Journal of Parallel and Distributed Computing, 61(5):679-687, 2001.
11. C. Gavoille and D. Peleg. Compact and localized distributed data structures. Distributed Computing, 16(2-3):111-120, 2003.
12. T. Hagerup and P.B. Miltersen, R. Pagh: Deterministic Dictionaries. J. Algorithms 41(1): 69-85 (2001).
13. N. Nisan. RL ⊆ SC. In Proceedings of the 24th annual ACM Symposium on Theory of computing (STOC), pages 619-623, 1992.
14. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
15. D. Sivakumar. Algorithmic derandomization via complexity theory. In Proceedings of the 34th annual ACM Symposium on Theory of Computing (STOC), pages 619-626, 2002.
16. R. E. Tarjan and A. C. Yao. Storing a Sparse Table. Commun. ACM 22(11): 606-611 (1979)
17. M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the 33rd annual ACM Symposium on Theory of Computing (STOC), pages 183-192, 2001.
18. M. Thorup and U. Z wick. Compact routing schemes. In Proceedings of the 13th annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1-10, 2001.