Skip to main content
SpringerLink
Log in

Improving Topology-Aware Routing Efficiency in Chord

  • Conference paper
Grid and Cooperative Computing (GCC 2003)

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

Included in the following conference series:

  • 290 Accesses

Abstract

Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we present a study of topology-aware routing approaches in P2P overlays, and present an improved design in Chord. We evaluate TaChord and other algorithms by physical hops, interdomain-adjusted latency, and aggregate bandwidth used per message. From experimental results TaChord shows the drastic improvement in routing performance. Finally, we show that the impact of cache management strategies in the TaChord overlay can’t be neglected.

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. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. ACM Sigcomm. (2001)

    Google Scholar 

  2. Zhao, B.Y., Duan, Y., et al.: Brocade: landmark routing on overlay networks. In: Electronic Proceedings for IPTP 2002, Cambridge, MA, USA, March 7-8 (2002)

    Google Scholar 

  3. Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: 19th International Conference on Data Engineering, Bangalore, India, IEEE Computer Society, Los Alamitos (2003)

    Google Scholar 

  4. Brite, a network topology generator, http://www.cs.bu.edu/brite/

  5. Wu, Z., Ma, L., Wang, K.: Efficient Topology-aware Routing. In: Peer-to-Peer Network. GCC2002, pp. 172–185 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, USTC, Hefei, 230026, China

    Dongfeng Chen & Shoubao Yang

Authors
  1. Dongfeng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shoubao Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiatong University, 80 Dongcuan Road, 200240, Shanghai, China

    Minglu Li

  2. Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA

    Xian-He Sun

  3. Department. of Computer Science, Shanghai Jiaotong University, 1954 HuaShan Road, 200030, Shanghai, P.R. China

    Qianni Deng

  4. Department of Computer Science, College of Liberal Arts and Science, University of Iowa, IA 52242, Iowa City, USA

    Jun Ni

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, D., Yang, S. (2004). Improving Topology-Aware Routing Efficiency in Chord. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_71

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24680-0_71

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21993-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation