Skip to main content
SpringerLink
Log in
Book cover

International Conference on Grid and Cooperative Computing

GCC 2004: Grid and Cooperative Computing - GCC 2004 pp 626–633Cite as

HP-Chord: A Peer-to-Peer Overlay to Achieve Better Routing Efficiency by Exploiting Heterogeneity and Proximity

  • Conference paper

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

Abstract

Routing efficiency is the critical issue when constructing peer-to-peer overlay. A peer-to-peer overlay, called HP-Chord, is illustrated in this article which aims to achieve better routing efficiency. HP-Chord is built on the basis of Chord overlay, which makes use of the heterogeneity of the bandwidth of the nodes and exploits the proximity of the underlying network. The simulation shows that HP-Chord has achieved better routing efficiency than standard Chord overlay on two aspects, which are lower number of hops and lower RDP per message routing.

This research is supported by National Basic Research Program of China(grant No.2002CB312002), ChinaGrid Program of MOE of China and Grand Project of the Science and Technology Commission of Shanghai Municipality(grant No.03dz15027)

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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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. Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-topeer file sharing systems. In: Proceedings of Multimedia Conferencing and Networking (2002)

    Google Scholar 

  2. Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for dhts: Some open questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 45. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting network proximity in peer-to-peer overlay networks, Technical report MSR-TR-2002-82 (2002)

    Google Scholar 

  4. Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (1997)

    Google Scholar 

  5. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)

    Article  Google Scholar 

  6. Zegura, E.w., Calvert, K., Bhattacharjee, S.: How to model an Internetwork. In: Proceedings of IEEE INFOCOM (1996)

    Google Scholar 

  7. GT-ITM, http://www.cc.gatech.edu/projects/gtitm/

  8. p2psim, http://www.pdos.lcs.mit.edu/p2psim/

  9. Zhang, Z., Shi, S.M., Zhu, J.: Self-Balanced Expressway: When Marxism Meets Confucian. Technical report MSRTR-2002-72 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Shanghai JiaoTong University, China

    Feng Hong, Minglu Li, Xinda Lu, Jiadi Yu, Yi Wang & Ying Li

Authors
  1. Feng Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Minglu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xinda Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jiadi Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yi Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Ying Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology, Huazhong University of Science and Technology, 430074, Wuhan, China

    Hai Jin

  2. Dept. of CS, Georgia State University, 30302, Atlanta, GA, USA

    Yi Pan

  3. National Laboratory for Parallel and Distributed Processing, NUDT, Changsha, 410073, Hunan, China

    Nong Xiao

  4. Cluster and Grid Computing Lab, Huazhong University of Science and Technology, 430074, Wuhan, China

    Jianhua Sun

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hong, F., Li, M., Lu, X., Yu, J., Wang, Y., Li, Y. (2004). HP-Chord: A Peer-to-Peer Overlay to Achieve Better Routing Efficiency by Exploiting Heterogeneity and Proximity. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_84

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30208-7_84

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30208-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation