Routing in trees

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

Volumn 2076 LNCS, Issue , 2001, Pages 757-772

  Fraigniaud, Pierre ^a,b   Gavoille, Cyril ^a,b  

^a CNRS   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Cmpact routing; Ruting algorithms; Tees

Indexed keywords

AUTOMATA THEORY; ECONOMIC AND SOCIAL EFFECTS; FORESTRY; NETWORK ROUTING; ROUTING PROTOCOLS; TREES (MATHEMATICS); COMPUTATIONAL LINGUISTICS; ROUTING ALGORITHMS;

CMPACT ROUTING; CONSTANT TIME; DISTRIBUTED DATA STRUCTURES; MEMORY REQUIREMENTS; ROUTING MESSAGE; ROUTING SCHEME; SHORTEST PATH; TEES; COMPACT ROUTING; TREES;

WELL LOGGING; TREES (MATHEMATICS);

EID: 84879544062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_62     Document Type: Conference Paper

References (14)

1. B. Awerbuch and D. Peleg, Sparse partitions, in 31th Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, 1990, pp. 503-513.
2. L. J. Cowen, Compact routing with minimum stretch, in 10th Symposium on Discrete Algorithms (SODA), ACM-SIAM, 1999, pp. 255-260.
3. 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), ACM PRESS, Aug. 1998, pp. 11-20.
4. C. Gavoille, A survey on interval routing, Theoretical Computer Science, 245 (2000), pp. 217-253.
5. C. Gavoille and S. Ṕerenǹes, Memory requirement for routing in distributed networks, in 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, May 1996, pp. 125-133.
6. M. J. Hall, Combinatorial Theory (second edition), Wiley-Interscience Publication, 1986.
7. J. I. Munro, Tables, in 16th FSTandTCS, vol. 1180 of Lectures Notes in Computer Science, Springer-Verlag, 1996, pp. 37-42.
8. J. I. Munro and V. Raman, Succinct representation of balanced parentheses, static trees and planar graphs, in 38th Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Oct. 1997, pp. 118-126.
9. D. Peleg, Proximity-preserving labeling schemes and their applications, in 25th International Workshop, Graph-Theoretic Concepts in Computer Science (WG), vol. 1665 of Lecture Notes in Computer Science, Springer, June 1999, pp. 30-41.
10. D. Peleg and E. Upfal, A trade-off between space and efficiency for routing tables, Journal of the ACM, 36 (1989), pp. 510-530.
11. N. Santoro and R. Khatib, Labelling and implicit routing in networks, The Computer Journal, 28 (1985), pp. 5-8.
12. M. Thorup and U. Zwick, Compact routing schemes, in 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM PRESS, July 2001. To appear.
13. J. van Leeuwen and R. B. Tan, Interval routing, The Computer Journal, 30 (1987), pp. 298-307.
14. R. Warlimont, Factorisatio numerorum with constraints, Journal of Number Theory, 45 (1993), pp. 186-199.