Search methods in p2p networks: a survey

  • Authors:
  • German Sakaryan;Markus Wulff;Herwig Unger

  • Affiliations:
  • Computer Science Dept., University of Rostock, Rostock, Germany;Computer Science Dept., University of Rostock, Rostock, Germany;Computer Science Dept., University of Rostock, Rostock, Germany

  • Venue:
  • IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The peer-to-peer (P2P) file sharing applications have gained a tremendous popularity and now they have millions of users worldwide, since they were introduced in 1999. Due to chaotic structure, achieved scale and network dynamics, they mostly employ a flooding-based search to locate required files and therefore they are the main source of Internet traffic. Thus, the study and development of P2P systems is an important research challenge. This article presents a survey of existing approaches to organize operations of P2P file sharing systems. It gives a classification of existing protocols and discusses the advantages and disadvantages of each technique. It shows that both network structure and search algorithm influence the operations of P2P applications.