Hop-Value-Based Query-Packet Forwarding for Pure P2P
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E88-B No.12 pp.4517-4522
- Publication Date
- 2005/12/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietcom/e88-b.12.4517
- Type of Manuscript
- Special Section LETTER (IEICE/IEEE Joint Special Section on Autonomous Decentralized Systems)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Masato UCHIDA, Shinya NOGAMI, "Hop-Value-Based Query-Packet Forwarding for Pure P2P" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 12, pp. 4517-4522, December 2005, doi: 10.1093/ietcom/e88-b.12.4517.
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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.12.4517/_p
Copy
@ARTICLE{e88-b_12_4517,
author={Masato UCHIDA, Shinya NOGAMI, },
journal={IEICE TRANSACTIONS on Communications},
title={Hop-Value-Based Query-Packet Forwarding for Pure P2P},
year={2005},
volume={E88-B},
number={12},
pages={4517-4522},
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={},
doi={10.1093/ietcom/e88-b.12.4517},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Hop-Value-Based Query-Packet Forwarding for Pure P2P
T2 - IEICE TRANSACTIONS on Communications
SP - 4517
EP - 4522
AU - Masato UCHIDA
AU - Shinya NOGAMI
PY - 2005
DO - 10.1093/ietcom/e88-b.12.4517
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2005
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.
ER -
English
