Lower bounds for compact routing

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

Volumn 1046, Issue , 1996, Pages 529-540

  Kranakis, Evangelos ^a   Krizanc, Danny ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ROUTING PROTOCOLS;

ARBITRARY NETWORKS; COMPACT ROUTING; INTERVAL ROUTING; LOWER BOUNDS; MAXIMAL DEGREE; NEAR-OPTIMAL; ROUTING SCHEME; STRETCH FACTOR;

NETWORK ROUTING;

EID: 84948130147     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_43     Document Type: Conference Paper

References (16)

1. V. Braune, "Theoretische und experimentelle Analyse von Intervali Routing Al-gorithmen," Master Thesis, Department of Mathematics and Computer Science, University of Padenborn, 1993.
2. H. Buhrman, J.-H. Hoepman, and P. Vitányi, "Optimal Routing," Unpublished draft, July 1995.
3. M. Flammini, G. Gambosi and S. Salomone, "Boolean Routing," in proceedings of WDAG'93, Springer Verlag LNCS Vol. 725, pp. 219-233, 1993.
4. M. Flammini, J. van Leeuwen, and A. Marchetti-Spaccamela, "The Complexity of Interval Routing on Random Graphs," In proceedings of MFCS, Springer Verlag LNCS, 1995, to appear.
5. P. Fraigniaud and C. Gavoille, "Memory Requirement for Universal Routing Schmes," In proceedings of ACM conference on Principles of Distributed Computing, 1995, to appear.
6. G. N. Fredrickson and R. Janardan, "Designing Networks with Compact Routing Tables," Algorithmica, pp. 171-190, 1988.
7. G. N. Fredrickson and R. Janardan, "Efficient Message Routing in Planar Networks," SIAM Journal on Comp. 18(4) 843-857, 1989.
8. G. N. Fredrickson and R. Janardan, "Space-Efficient Message Routing in c-Decomposable Networks," SIAM Journal on Comp. 19(1) 184-181, 1990.
9. C. Gavoille and E. Guévremont, "On the Compactness of Bounded Degree Graphs for Shortest Parh Interval Routing," in proceedings of 2nd International Conference on Structure Information and Communication Complexity, June 12-14, Olympia, Greece, 1995, Carleton University Press, to appear.
10. C. Gavoille and E. Guévremont, "Worst Case Bounds for Shortest Path Interval Routing," ENS Lyon, Technical Report, Jan. 20, 1995.
11. E. Kranakis, D. Krizanc and S. S. Ravi, "On Multiple Linear Interval Routing Schemes," in proceedings of WG'93 (Workshop on Graph Theoretic Concepts in Computer Science), Vol. 790, Springer Verlag LNCS.
12. M. Li and P. Vitanyi, "Introduction to Kolmogorov Complexity and its Applications" Springer Verlag, 1993.
13. D. Peleg and E. Upfal "A Tradeoff between Space and Efficiency for Routing Tables," in ACM STOC 1988, pages 43-52 (also in Journal of ACM, Vol. 36, pages 510-530, 1989).
14. N. Santoro and R. Khatib, "Labelling and Implicit Routing in Networks",The Computer Journal, vol. 28, no. 1, 1985, pp. 5-8.
15. J. van Leeuwen and R. B. Tan, "Computer Networks with Compact Routing Tables," in The Book of L, Edited by G. Rozenberg and A. Salomaa, Springer-verlag, Berlin 1986, pp 259-273.
16. J. van Leeuwen and R. B. Tan, "Interval Routing," The Computer Journal, vol. 30, no. 4, 1987, pp. 298-307.