Hop-value-based query-packet forwarding for pure P2P

Masato Uchida*, Shinya Nogami

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


In pure peer-to-peer (P2P) file sharing applications and protocols using a flooding-based query algorithm, a large number of control packets (query packets) are transmitted on the network to search for target files. This clearly leads to a degradation of communication quality on the network and terminals as the number of users of the application increases. To solve such problems, this paper proposes: (1) a unified framework to describe a wide variety of query algorithms for pure P2P and (2) a new query algorithm based on this framework. Our framework determines the number of destinations for query packets based on the hop value recorded in received query packets. Simulation results revealed that the proposed query algorithm can reduce the overhead in the flooding-based query algorithm and k-random walks without decreasing the success rate of retrieval regardless of the density of target files in the network.

Original languageEnglish
Pages (from-to)4517-4522
Number of pages6
JournalIEICE Transactions on Communications
Issue number12
Publication statusPublished - 2005 Dec
Externally publishedYes


  • P2P
  • Query algorithm

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Hop-value-based query-packet forwarding for pure P2P'. Together they form a unique fingerprint.

Cite this