Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Distributed Computing

DISC 2004: Distributed Computing pp 365–378Cite as

Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3274))

Abstract

In this paper we show how to use the notion of layering-tree introduced in [5], in order to construct efficient routing schemes. We obtain a routing scheme polynomial time constructible for tree-length δ graphs, i.e., graphs admitting a tree-decomposition with small diameter bags. This routing scheme uses address and local memory of size O(δlog2 n) bits, and for all pairs of nodes, the length of the route never exceed their distance plus 6δ–2 (deviation at most 6δ–2). Then we adapt our routing scheme for k-chordal graphs. In this later case, we obtain a deviation k+1, with addresses and local memories of size O(log2 n) bits per node, an improvement on the best previous to date. Observe that for chordal graphs, for which δ =1 and k=3, the both schemes produce a deviation 4, with addresses and local memories of size O(log2 n) bits per node, also an improvement on the best previous.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive routing. In: 21st Symposium on Theory of Computing (STOC), May 1989, vol. 2, pp. 230–240 (1989)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Awerbuch, B., Peleg, D.: Sparse partitions. In: 31th Symposium on Foundations of Computer Science (FOCS), pp. 503–513. IEEE Computer Society Press, Los Alamitos (1990)

    Google Scholar 

  4. Awerbuch, B., Peleg, D.: Routing with polynomial communication-space trade-off. SIAM Journal on Discrete Mathematics 5, 151–162 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chepoi, V.D., Dragan, F.F.: A note on distance approximating trees in graphs. Europ. J. Combinatorics 21, 761–768 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chepoi, V.D., Dragan, F.F., Yan, C.: Additive spanner for k-chordal graphs. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol. 2653, pp. 96–107. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (February 2000)

    Google Scholar 

  8. Dourisboure, Y.: Routage compact et longueur arborescente, PhD Thesis, LaBRI, University of Bordeaux 1 (2003)

    Google Scholar 

  9. Dourisboure, Y., Gavoille, C.: Improved compact routing scheme for chordal graphs. In: 16th International Symposium on DIStributed Computing (DISC 2002), October 2002. LNCS, vol. 2508, pp. 252–264. Springer, Heidelberg (2002)

    Google Scholar 

  10. Dourisboure, Y., Gavoille, C.: Tree-decomposition of graphs with small diameter bags. In: European conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2003), September 2003, pp. 100–104. ITI (2003)

    Google Scholar 

  11. Dragan, F.F., Yan, C., Lomonosov, I.: Collective tree spanners of graphs. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 64–76. Springer, Heidelberg (2004) (to appear)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  13. Fraigniaud, P., Gavoille, C.: Routing in trees, Research Report RR-1252-01, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France (January 2001) (sumitted)

    Google Scholar 

  14. Frederickson, G.N., Janardan, R.: Efficient message routing in planar networks. SIAM Journal on Computing 18, 843–857 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  15. Frederickson, G.N., Janardan, R.: Space-efficient message routing in c-decomposable networks. SIAM Journal on Computing 19, 164–181 (1990)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  17. Gavoille, C., Gengler, M.: Space-efficiency of routing schemes of stretch factor three. Journal of Parallel and Distributed Computing 61, 679–687 (2001)

    Article  MATH  Google Scholar 

  18. Gavoille, C., Hanusse, N.: Compact routing tables for graphs of bounded genus. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 351–360. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  19. Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes, Research Report RR-1250-00, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France (December 2000)

    Google Scholar 

  20. Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 476–488. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Gavoille, C., Pérennès, S.: Memory requirement for routing in distributed networks. In: 15th Annual ACMSymposium on Principles of Distributed Computing (PODC), May 1996, pp. 125–133. ACM PRESS, New York (1996)

    Google Scholar 

  22. Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes. Morgan Kaufmann, San Francisco (1992)

    MATH  Google Scholar 

  23. Lu, H.-I.: Improved compact routing tables for planar networks via orderly spanning trees. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 57–66. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  24. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)

    Google Scholar 

  25. Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. Journal of the ACM 36, 510–530 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  26. Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7, 309–322 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  27. Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. In: 42th Annual IEEE Symposium on Foundations of Computer Science (FOCS), October 2001, IEEE Computer Society Press, Los Alamitos (2001)

    Google Scholar 

  28. Thorup, M., Zwick, U.: Approximate distance oracles. In: 33rd Annual ACM Symposium on Theory of Computing (STOC), Hersonissos, Crete, Greece, July 2001, pp. 183–192 (2001)

    Google Scholar 

  29. Thorup, M., Zwick, U.: Compact routing schemes. In: 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Hersonissos, Crete, Greece, July 2001, pp. 1–10. ACM PRESS, New York (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Bordeaux 1 University,  

    Yon Dourisboure

Authors
  1. Yon Dourisboure
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. EPFL, Switzerland

    Rachid Guerraoui

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dourisboure, Y. (2004). Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs. In: Guerraoui, R. (eds) Distributed Computing. DISC 2004. Lecture Notes in Computer Science, vol 3274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30186-8_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30186-8_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23306-0

  • Online ISBN: 978-3-540-30186-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation