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

Masato Uchida, Shinya Nogami

Research output: Contribution to journalArticle

Abstract

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
VolumeE88-B
Issue number12
DOIs
Publication statusPublished - 2005
Externally publishedYes

Fingerprint

Degradation
Communication

Keywords

  • P2P
  • Query algorithm

ASJC Scopus subject areas

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

Cite this

Hop-value-based query-packet forwarding for pure P2P. / Uchida, Masato; Nogami, Shinya.

In: IEICE Transactions on Communications, Vol. E88-B, No. 12, 2005, p. 4517-4522.

Research output: Contribution to journalArticle

Uchida, Masato ; Nogami, Shinya. / Hop-value-based query-packet forwarding for pure P2P. In: IEICE Transactions on Communications. 2005 ; Vol. E88-B, No. 12. pp. 4517-4522.
@article{9bb10ff5b7a6409ab2c858e1ef00f2b1,
title = "Hop-value-based query-packet forwarding for pure P2P",
abstract = "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.",
keywords = "P2P, Query algorithm",
author = "Masato Uchida and Shinya Nogami",
year = "2005",
doi = "10.1093/ietcom/e88-b.12.4517",
language = "English",
volume = "E88-B",
pages = "4517--4522",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

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

AU - Uchida, Masato

AU - Nogami, Shinya

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - P2P

KW - Query algorithm

UR - http://www.scopus.com/inward/record.url?scp=29144460624&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=29144460624&partnerID=8YFLogxK

U2 - 10.1093/ietcom/e88-b.12.4517

DO - 10.1093/ietcom/e88-b.12.4517

M3 - Article

VL - E88-B

SP - 4517

EP - 4522

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 12

ER -