Routing with improved communication-space trade-off

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3274, Issue , 2004, Pages 305-319

  Abraham, Ittai ^a   Gavoille, Cyril ^b   Malkhi, Dahlia ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; ROUTING PROTOCOLS;

ASYMPTOTICALLY OPTIMAL; COMMUNICATION SPACES; INTEGRAL PARAMETERS; MEMORY BOUNDS; ROUTING SCHEME; STRETCH FACTOR; UNDIRECTED NETWORK; WEIGHTED GRAPH;

NETWORK ROUTING;

EID: 35048822141     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30186-8_22     Document Type: Article

References (22)

1. I. ABRAHAM, G. GAVOILLE, AND D. MALKHI, Routing with improved communication-space trade-off, Tech. Report RR-1330-04, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, Prance, July 2004.
2. thAnnual ACM Symposium on Parallel Algorithms and Architecture (SPAA), ACM Press, 2004, pp. 20-24.
3. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, June 2003, pp. 184-192.
4. st Annual ACM Symposium on Theory of Computing (STOC), ACM Press, May 1989, pp. 479-489.
5. B. AWERBUCH, A. B. NOY, N. LINIAL, AND D. PELEG, Improved routing strategies with succinct tables, Journal of Algorithms, 11 (1990), pp. 307-341.
6. th Annual IEEE Symposium on Foundations of Computer Science (FOGS), Oct. 1990, pp. 503-513.
7. B. AWERBUCH AND D. PELEG, Routing with polynomial communication-space trade-off, SIAM J. Discret. Math., 5 (1992), pp. 151-162.
8. J. L. CARTER AND M. N. WEGMAN, Universal hash functions, Journal of Computer and System Sciences, 18 (1979), pp. 143-154.
9. L. J. CowEN, Compact routing with minimum stretch, Journal of Algorithms, 38 (2001), pp. 170-183.
10. th International Colloquium on Automata, Languages and Programming (1CALP), vol. 2076 of Lecture Notes in Computer Science, Springer, July 2001, pp. 757-772.
11. C. GAVOILLE, Routing in distributed networks: Overview and open problems, ACM SIGACT News - Distributed Computing Column, 32 (2001), pp. 36-52.
12. C. GAVOILLE AND M. GENGLER, Space-efficiency of routing schemes of stretch factor three, J. of Parallel and Distributed Computing, 61 (2001), pp. 679-687.
13. C. GAVOILLE AND D. PELEG, Compact and localized distributed data structures, J. of Distributed Computing, 16 (2003), pp. 111-120. PODC 20-Year Special Issue.
14. K. LAING, Name-independent compact routing in trees, Tech. Report 2003-02, Tufts Univ. Dep. of Comp. Science, Nov. 2003. Also in PODC '04 as brief announcements.
15. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Camb Univ Press, 1995.
16. D. PELEG, Distributed Computing: A Locality-Sensitive Approach, SIAM Monographs on Discrete Mathematics and Applications, 2000.
17. D. PELEG AND E. UPFAL, A trade-off between space and efficiency for routing tables, Journal of the ACM, 36 (1989), pp. 510-530.
18. N. SANTORO AND R. KHATIB, Labelling and implicit routing in networks, The Computer Journal, 28 (1985), pp. 5-8.
19. rd Annual ACM Symposium on Theory of Computing (STOC), July 2001, pp. 183-192.
20. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, July 2001, pp. 1-10.
21. P. VAN EMDE BOAS, Preserving order in a forest in less than logarithmic time and linear space, Information Processing Letters, 6 (1977), pp. 80-82.
22. J. VAN LEEUWEN AND R. B. TAN, Computer networks with compact routing tables, in The Book of L, Springer-Verlag, 1986, pp. 259-273.