Skip to main content
SpringerLink
Log in

Dynamic Routing Schemes for General Graphs

(Extended Abstract)

  • Conference paper
Automata, Languages and Programming (ICALP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4051))

Included in the following conference series:

Abstract

This paper studies approximate distributed routing schemes on dynamic communication networks. The paper focuses on dynamic weighted general graphs where the vertices of the graph are fixed but the weights of the edges may change. Our main contribution concerns bounding the cost of adapting to dynamic changes. The update efficiency of a routing scheme is measured by the number of messages that need to be sent, following a weight change, in order to update the scheme. Our results indicate that the graph theoretic parameter governing the amortized message complexity of these updates is the local density D of the underlying graph, and specifically, this complexity is \({\tilde\Theta}(D)\). The paper also establishes upper and lower bounds on the size of the databases required by the scheme at each site.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afek, Y., Awerbuch, B., Plotkin, S.A., Saks, M.: Local management of a global resource in a communication network. J. ACM 43, 1–19 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Afek, Y., Gafni, E., Ricklin, M.: Upper and lower bounds for routing schemes in dynamic networks. In: Proc. 30th Symp. on Foundations of Computer Science, pp. 370–375 (1989)

    Google Scholar 

  3. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Improved routing strategies with succinct tables. J. Algorithms 11, 307–341 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Awerbuch, B., Peleg, D.: Routing with polynomial communication-space trade-off. SIAM J. Discrete Math. 5, 307–341 (1992)

    Article  MathSciNet  Google Scholar 

  5. Cowen, L.: Compact routing with minimum stretch. J. Algorithms 38, 170–183 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dolev, S., Kranakis, E., Krizanc, D., Peleg, D.: Bubbles: Adaptive routing scheme for high-speed dynamic networks. SIAM J. on Comput. 29, 804–833 (1999)

    Article  MathSciNet  Google Scholar 

  7. Eppstein, D., Galil, Z., Italiano, G.F.: Dynamic Graph Algorithms. In: Atallah, M.J. (ed.) Algorithms and Theoretical Computing Handbook, ch.8, CRC Press, Boca Raton (1999)

    Google Scholar 

  8. Fraigniaud, P., Gavoille, C.: Universal routing schemes. Distributed Computing 10, 65–78 (1997)

    Article  Google Scholar 

  9. Feigenbaum, J., Kannan, S.: Dynamic Graph Algorithms. In: Handbook of Discrete and Combinatorial Mathematics, CRC Press, Boca Raton (2000)

    Google Scholar 

  10. Gavoille, C.: Routing in distributed networks: Overview and open problems. ACM SIGACT News-Distributed Computing Column 32, 36–52 (2001)

    Article  Google Scholar 

  11. Iwama, K., Kawachi, A.: Compact routing with stretch factor less than three. In: Proc. 19th ACM Symp. on Principles of Distributed Computing, p. 337 (2000)

    Google Scholar 

  12. Iwama, K., Okita, M.: Compact Routing for Flat Networks. In: Proc. 17th International Simposium on Distributed Computing (October 2003)

    Google Scholar 

  13. Korman, A.: General Compact Labeling Schemes for Dynamic Trees. In: Proc. 19th International Simposium on Distributed Computing (September 2005)

    Google Scholar 

  14. Korman, A., Peleg, D., Rodeh, Y.: Labeling schemes for dynamic tree networks. Theory of Computing Systems 37, 49–75 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  15. Korman, A., Peleg, D.: Labeling schemes for weighted dynamic trees. In: Proc. 30th Int. Colloq. on Automata, Languages and Prog, July 2003, pp. 369–383 (2003)

    Google Scholar 

  16. Peleg, D.: Distributed computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)

    Book  MATH  Google Scholar 

  17. Peleg, D., Upfal, E.: A tradeoff between size and efficiency for routing tables. J. ACM 36, 510–530 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  18. Santoro, N., Khatib, R.: Labeling and implicit routing in networks. The Computer Journal 28, 5–8 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  19. Thorup, M., Zwick, U.: Compact routing schemes. In: Proc. 13th ACM Symp. on Parallel Algorithms and Architectures, July 2001, pp. 1–10 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Systems Group, Faculty of IE&M, The Technion, Haifa, Israel

    Amos Korman

  2. Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel

    David Peleg

Authors
  1. Amos Korman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Peleg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università Ca’ Foscari, Venice

    Michele Bugliesi

  2. Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    Bart Preneel

  3. ECS, University of Southampton, UK

    Vladimiro Sassone

  4. FB Informatik, Univ. Dortmund, LS2, 44221, Dortmund, Germany

    Ingo Wegener

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korman, A., Peleg, D. (2006). Dynamic Routing Schemes for General Graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786986_54

Download citation

  • DOI: https://doi.org/10.1007/11786986_54

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35904-3

  • Online ISBN: 978-3-540-35905-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation