Skip to main content
SpringerLink
Log in

An Adaptive Proximity Route Selection Scheme in DHT-Based Peer to Peer Systems

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

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

Abstract

This paper presents a proximity route selection scheme which is adaptive to the underlying network conditions. The proposed scheme repeatedly estimates and updates the total lookup latency based on the information from the neighborhoods. The updated information is used to select the next peer dynamically to route the query, which results in reducing the overall lookup latency. We implemented the scheme using the Chord, one of the most popular DHT-based peer to peer systems, and compared the performance with those of original Chord and the CFS’ server selection scheme. The proposed scheme shows performance improvement over other schemes.

This work was supported by grant No. R01-2003-000-10627-0 from the Basic Research Program of the Korea Science & Engineering Foundation.

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., et al.: Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)

    Article  Google Scholar 

  2. Gummadi, K., et al.: The impact of DHT Routing Geometry on Resilience and Proximity. In: Proc. of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 381–394 (2003)

    Google Scholar 

  3. Dabek, F., et al.: Wide-area cooperative storage with CFS. In: Proc. of the 18th ACM Symposium on Operating Systems Principles, pp. 202–215 (2001)

    Google Scholar 

  4. Boyan, J., Littman, M.: Packet routing in dynamically changing networks: A reinforcement learning approach. In: Proc. of Neural Information Processing Systems, pp. 982–988 (1994)

    Google Scholar 

  5. Zhang, H., Goel, A., Gobindan, R.: Incrementally Improving Lookup Latency in Distributed Hash Table. In: Proc. of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 114–125 (2003)

    Google Scholar 

  6. Chord Simulator, http://pdos.lcs.mit.edu/cgi-bin/cvsweb.cgi/sfsnet/simulator

  7. GT-ITM, http://www.isi.edu/nsnam/ns/ns-topogen.html

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Sogang University, Seoul, South Korea

    Jiyoung Song, Sungyong Park & Jihoon Yang

Authors
  1. Jiyoung Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sungyong Park
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jihoon Yang
    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

Song, J., Park, S., Yang, J. (2004). An Adaptive Proximity Route Selection Scheme in DHT-Based Peer to Peer Systems. 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_152

Download citation

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

  • 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