Skip to main content

An Efficient Distributed Search Method

  • Conference paper
High Performance Computing and Communications (HPCC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3726))

  • 802 Accesses

Abstract

The big challenge of constructing P2P applications is how to implement efficient distributed file searching in complex environment which implies huge-amount users and uncontrollable nodes. FriendSearch is introduced to improve the efficiency and scalability of distributed file searching. FriendSearch introduces a new hybrid architecture in which the storage and search of raw file is based on DHT network, but the storage and search of meta-data is based on unstructured P2P network. FriendSearch learns interest similarity between participating nodes and uses it to construct friend relations. The forwarding of queries is limited to friend nodes with similar interests. Simulation tests show that FriendSearch algorithm is both efficient and scalable.

This research is supported by the National Grand Fundamental Research 973 Program of China under Grant No.2003CB314802, also the National High-Tech Research and Development Plan of China under Grant No.2003AA142080.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Napster (2005), http://www.napster.com

  2. Gnutella (2005), http://www.gnutella.com

  3. Kazaa (2005), http://www.kazaa.com

  4. JxtaSearch (2005), http://search.jxta.org/

  5. Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Federrath, H. (ed.) Proc of the Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA (July 2000)

    Google Scholar 

  6. Joseph, S.R.H.: NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks. In: International Workshop on Peer-to-Peer Computing, Pisa (2002)

    Google Scholar 

  7. Cohen, E., Fiat, A., Kaplan, H.: Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. In: Proc of INFOCOM 2003 (2003)

    Google Scholar 

  8. Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems. In: Proc of INFOCOM 2003 (2003)

    Google Scholar 

  9. Alpine (2005), http://www.cubicmetercrystal.com/alpine/

  10. Tang, C., Xu, Z., Dwarkada, S.: Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Over-lay Networks. In: Proc of SIGCOM 2003 (2003)

    Google Scholar 

  11. Semplesh (2005), http://www.plesh.net/

  12. Joseph, S.: An Extendible Open Source P2P Simulator. P2P Journal (2003)

    Google Scholar 

  13. Kalogeraki, V., Gunopulos, D., Zeinalipour-Yazti, D.: A Local Search Mechanism for Peer-to-Peer Networks. In: Proc of CIKM (2002)

    Google Scholar 

  14. webtraces, http://www.web-caching.com/traces-logs.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, H., Gong, Z., Huang, Z. (2005). An Efficient Distributed Search Method. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_32

Download citation

  • DOI: https://doi.org/10.1007/11557654_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29031-5

  • Online ISBN: 978-3-540-32079-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics