Advertisement

Lower bounds for compact routing

Extended abstract
  • Evangelos Kranakis
  • Danny Krizanc
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1046)

Abstract

We study the complexity of compact routing on arbitrary networks. We give (1) networks on n vertices which for any interval routing scheme, Ω(n) routers of the network require Ω(n) intervals on some out-going link and (2) for each d≥ 3, networks of maximal degree d which for any interval routing scheme, Ω(n) routers each require Ω(n/ log n) intervals on some out-going link. Our results give the best known worst-case lower bounds for interval routing. For the case of universal routing schemes we give (3) networks on n vertices which for any near-optimal routing scheme with stretch factor<2 a total of Ω(n2) memory bits are required, and (4) for each d ≥3, networks of maximal degree d for which any optimal (resp., near-optimal) routing scheme (resp., with stretch factor <2) requires a total of Ω(n2/log n) (resp. Ω(n2/log2n)) memory bits.

Keywords

Maximal Degree Kolmogorov Complexity Stretch Factor Route Table Degree Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. Braune, “Theoretische und experimentelle Analyse von Intervall Routing Algorithmen”, Master Thesis, Department of Mathematics and Computer Science, University of Padenborn, 1993.Google Scholar
  2. 2.
    H. Buhrman, J.-H. Hoepman, and P. Vitányi, “Optimal Routing”, Unpublished draft, July 1995.Google Scholar
  3. 3.
    M. Flammini, G. Gambosi and S. Salomone, “Boolean Routing”, in proceedings of WDAG'93, Springer Verlag LNCS Vol. 725, pp. 219–233, 1993.Google Scholar
  4. 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.Google Scholar
  5. 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.Google Scholar
  6. 6.
    G. N. Fredrickson and R. Janardan, “Designing Networks with Compact Routing Tables”, Algorithmica, pp. 171–190, 1988.Google Scholar
  7. 7.
    G. N. Fredrickson and R. Janardan, “Efficient Message Routing in Planar Networks”, SIAM Journal on Comp. 18(4) 843–857, 1989.CrossRefGoogle Scholar
  8. 8.
    G. N. Fredrickson and R. Janardan, “Space-Efficient Message Routing in c-Decomposable Networks”, SIAM Journal on Comp. 19(1) 184–181, 1990.Google Scholar
  9. 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.Google Scholar
  10. 10.
    C. Gavoille and E. Guévremont, “Worst Case Bounds for Shortest Path Interval Routing”, ENS Lyon, Technical Report, Jan. 20, 1995.Google Scholar
  11. 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.Google Scholar
  12. 12.
    M. Li and P. Vitanyi, “Introduction to Kolmogorov Complexity and its Applications” Springer Verlag, 1993.Google Scholar
  13. 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).Google Scholar
  14. 14.
    N. Santoro and R. Khatib, “Labelling and Implicit Routing in Networks”, The Computer Journal, vol. 28, no. 1, 1985, pp. 5–8.CrossRefGoogle Scholar
  15. 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.Google Scholar
  16. 16.
    J. van Leeuwen and R. B. Tan, “Interval Routing”, The Computer Journal, vol. 30, no. 4, 1987, pp. 298–307.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Evangelos Kranakis
    • 1
  • Danny Krizanc
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations