Skip to main content

Design of a Robust Search Algorithm for P2P Networks

  • Conference paper
High Performance Computing - HiPC 2004 (HiPC 2004)

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

Included in the following conference series:

Abstract

In this paper, we report a decentralized algorithm, termed ImmuneSearch, for searching p2p networks. ImmuneSearch avoids query message flooding; instead it uses an immune-systems-inspired concept of proliferation and mutation for message movement. In addition, a protocol is formulated to change the neighborhoods of the peers based upon their proximity with the queried item. This results in topology evolution of the network whereby similar contents cluster together. The topology evolution help the p2p network to develop ‘memory’, as a result of which the search efficiency of the network improves as more and more individual peers perform searches. Moreover, the algorithm is extremely robust and its performance is stable even when peers are transient.

This work was partially supported by the Future & Emerging Technologies unit of the European Commission through Project BISON (IST-2001-38923).

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Canright, G., Deutsch, A., Jelasity, M., Ducatelle, F.: Structures and functions of dynamic networks. Bison Deliverable (2003), www.cs.unibo.it/bison/deliverables/D01.pdf

  2. Freenet, http://freenet.sourceforge.net/

  3. Lv, Q., Cao, P., Cohen, E., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proceedings of the 16th ACM International Conference on Supercomputing (June 2002)

    Google Scholar 

  4. Zipf, G.K.: Psycho-Biology of Languages. Houghton-Mifflin (1935)

    Google Scholar 

  5. Napster (2000), http://www.napster.com

  6. Gnutella (2001), http://www.gnutellanews.com

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganguly, N., Canright, G., Deutsch, A. (2004). Design of a Robust Search Algorithm for P2P Networks. In: Bougé, L., Prasanna, V.K. (eds) High Performance Computing - HiPC 2004. HiPC 2004. Lecture Notes in Computer Science, vol 3296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30474-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30474-6_27

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30474-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics