Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

WNChord: A Weighted Nodes Based Peer-to-Peer Routing Algorithm

  • Conference paper
Parallel and Distributed Computing: Applications and Technologies (PDCAT 2004)

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

  • 780 Accesses

Abstract

Considering the existing difference in load rates, computing performance and delivery latency between peers in Chord protocol, we present a weighted nodes based P2P routing algorithm(WNChord), in which each node could be treated respectively to make highly capable nodes take more tasks. Specifically speaking, the routing algorithm in peers is reformulated and is parameterized using a quantity C, which may control latency’s expected value such that P2P network’s total latency to become much lower by choosing proper C.

This paper is supported by 973 project (No.2002CB312002)of China, ChinaGrid Program of MOE of China, and grand project of the Science and Technology Commission of Shanghai Municipality (No. 03dz15026, No. 03dz15027 and No. 03dz15028).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Saroiu, S., Gummadi, K., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Conferencing and Networking (2002)

    Google Scholar 

  2. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM 2001 Conference, San Diego, California (August 2001)

    Google Scholar 

  3. Ohaha, Smart decentralized peer-to-peer sharing, http://www.ohaha.com/design.html

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai, 200030, China

    Liang Zhang, Shudong Chen, Fanyuan Ma & Minglu Li

Authors
  1. Liang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shudong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fanyuan Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Minglu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Nanyang Centre for Supercomputing and Visualisation School of Mechanical and Production Engineering, Nanyang Technological University, 50 Nanyang Avenue, 639 798, Singapore

    Kim-Meow Liew

  2. School of Computer Science, The University of Adelaide,  

    Hong Shen

  3. Asia Pacific Science and Technology Center, Sun Microsystems Inc., 50 Nanyang Avenue, N3-1c-10, 639798, Singapore

    Simon See

  4. School of Computer Engineering, Nanyang Technological University, 639798, Singapore

    Wentong Cai

  5. Southwest Jiaotong University,  

    Pingzhi Fan

  6. Tohoku University ,  

    Susumu Horiguchi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, L., Chen, S., Ma, F., Li, M. (2004). WNChord: A Weighted Nodes Based Peer-to-Peer Routing Algorithm. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30501-9_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24013-6

  • Online ISBN: 978-3-540-30501-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation