A space lower bound for routing in trees

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

Volumn 2285, Issue , 2002, Pages 65-75

  Fraigniaud, Pierre ^a   Gavoille, Cyril ^b  

^a CNRS   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Algorithms and data structures; Compact routing; Computational and structural complexity

Indexed keywords

FORESTRY; NETWORK ROUTING; ROUTING PROTOCOLS;

ALGORITHMS AND DATA STRUCTURES; ARBITRARY GRAPHS; COMPACT ROUTING; COMPUTATIONAL AND STRUCTURAL COMPLEXITY; ROUTING MESSAGE; ROUTING SCHEME; ROUTING TABLE; SPACE COMPLEXITY;

TREES (MATHEMATICS);

ALGORITHMS; DATA; STRUCTURES; TREES;

EID: 84937389285     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_4     Document Type: Conference Paper

References (15)

1. Baruch Awerbuch and David Peleg. Sparse partitions. In 31th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 503–513. IEEE Computer Society Press, October 1990.
2. Baruch Awerbuch and David Peleg. Routing with polynomial communication-space trade-off. SIAM Journal on Discrete Mathematics, 5(2):151–162, May 1992.
3. Lenore J. Cowen. Compact routing with minimum stretch. Journal of Algorithms, 38:170–183, 2001.
4. Tamar Eilam, Cyril Gavoille, and David Peleg. Compact routing schemes with low stretch factor. In 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 11–20. ACM PRESS, August 1998.
5. Paul Erdös. Extremal problems in graph theory. In Publ. House Cszechoslovak Acad. Sci., Prague, pages 29–36, 1964.
6. Pierre Fraigniaud and Cyril Gavoille. Routing in trees. In 28th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 757–772. Springer, July 2001.
7. Cyril Gavoille. A survey on interval routing. Theoretical Computer Science, 245(2):217–253, 2000.
8. Cyril Gavoille. Routing in distributed networks: Overview and open problems. ACM SIGACT News - Distributed Computing Column, 32(1):36–52, March 2001.
9. Cyril Gavoille and David Peleg. Compact and localized distributed data structures. Research Report RR-1261-01, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France, August 2001. To appear in Journal of Distributed Computing.
10. Cyril Gavoille, David Peleg, Stéphane Pérennes, and Ran Raz. Distance labeling in graphs. In 12th Symposium on Discrete Algorithms (SODA), pages 210–219. ACM-SIAM, January 2001.
11. David Peleg. Informative labeling schemes for graphs. In 25th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 1893 of Lecture Notes in Computer Science, pages 579–588. Springer, August 2000.
12. David Peleg. Proximity-preserving labeling schemes. Journal of Graph Theory, 33:167–176, 2000.
13. 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.
14. Mikkel Thorup and Uri Zwick. Approximate distance oracles. In 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 183–192, Hersonissos, Crete, Greece, July 2001.
15. Mikkel Thorup and Uri Zwick. Compact routing schemes. In 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1–10, Her-sonissos, Crete, Greece, July 2001. ACM PRESS.