Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Distributed Computing

DISC 2004: Distributed Computing pp 305–319Cite as

Routing with Improved Communication-Space Trade-Off

  • Conference paper

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

Abstract

Given a weighted undirected network with arbitrary node names, we present a family of routing schemes characterized by an integral parameter κ ≥ 1. The scheme uses \(\widetilde{O}(n^{1/\kappa} \log D)\) space routing table at each node, and routes along paths of linear stretch O(κ), where D is the normalized diameter of the network. When D is polynomial in n, the scheme has asymptotically optimal stretch factor. With the same memory bound, the best previous results obtained stretch O(κ 2).

Of independent interest, we also construct a single-source name-independent routing scheme for uniform weighted graphs with O(1) stretch and \(\widetilde{O}(1)\) bits of storage. With the same stretch, the best previous results obtained memory \(\widetilde{O}(n^{1/9})\).

Full version appears as Technical Report #RR-1330-04 of Bordeaux University [1].

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. Abraham, I., Gavoille, C., Malkhi, D.: Routing with improved communication- space trade-off, Tech. Report RR-1330-04, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France (July 2004)

    Google Scholar 

  2. Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: 16th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), pp. 20–24. ACM Press, New York (2004)

    Google Scholar 

  3. Arias, M., Cowen, L., Laing, K., Rajaraman, R., Taka, O.: Compact routing with name independence. In: 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), June 2003, pp. 184–192. ACM Press, New York (2003)

    Google Scholar 

  4. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive routing. In: 21st Annual ACM Symposium on Theory of Computing (STOC), May 1989, pp. 479–489. ACM Press, New York (1989)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Awerbuch, B., Peleg, D.: Sparse partitions. In: 31th Annual IEEE Symposium on Foundations of Computer Science (FOCS), October 1990, pp. 503–513 (1990)

    Google Scholar 

  7. Awerbuch, B., Peleg, D.: Routing with polynomial communication-space trade-off. SIAM J. Discret. Math. 5, 151–162 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Carter, J.L., Wegman, M.N.: Universal hash functions. Journal of Computer and System Sciences 18, 143–154 (1979)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Fraigniaud, P., Gavoille, C.: Routing in trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 757–772. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  13. Gavoille, C., Peleg, D.: Compact and localized distributed data structures. J. of Distributed Computing 16, 111–120 (2003); PODC 20-Year Special Issue

    Article  Google Scholar 

  14. Laing, K.: Name-independent compact routing in trees, Tech. Report 2003-02, Tufts Univ. Dep. of Comp. Science (November 2003); Also in PODC 2004 as brief announcements (2004)

    Google Scholar 

  15. Motwani, R., Raghavan, P.: Randomized Algorithms. Camb. Univ. Press, Cambridge (1995)

    MATH  Google Scholar 

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

    Google Scholar 

  17. 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 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  21. van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters 6, 80–82 (1977)

    Article  MATH  Google Scholar 

  22. van Leeuwen, J., Tan, R.B.: Computer networks with compact routing tables. In: The Book of L, pp. 259–273. Springer, Heidelberg (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem, Israel

    Ittai Abraham & Dahlia Malkhi

  2. Laboratoire Bordelais de Recherche en Informatique, University of Bordeaux, Bordeaux, France

    Cyril Gavoille

Authors
  1. Ittai Abraham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cyril Gavoille
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dahlia Malkhi
    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

Abraham, I., Gavoille, C., Malkhi, D. (2004). Routing with Improved Communication-Space Trade-Off. 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_22

Download citation

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

  • 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