Randomized Search Strategy for Unstructured P2P Networks

Wei-Mei CHEN; Kuang-Chu LIU

doi:10.1587/transcom.E95.B.289

Randomized Search Strategy for Unstructured P2P Networks

Wei-Mei CHEN, Kuang-Chu LIU

Full Text Views

0

Share
Cite this

Summary :

P2P (peer-to-peer) file sharing systems have been in operation for years. However, recent studies show that many peers in P2P networks are free-riders, who download files but are unwilling to share. This paper proposes a randomized search algorithm that considers the potential of a peer for information exchange and controlled query forwarding in the search process. Based on churn situations, the simulation results in this study demonstrate that the proposed algorithm can reduce network traffic and search latency while searching for files in the system.

Publication: IEICE TRANSACTIONS on Communications Vol.E95-B No.1 pp.289-292

Publication Date: 2012/01/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E95.B.289

Type of Manuscript: LETTER

Category: Network

Cite this

Copy

Wei-Mei CHEN, Kuang-Chu LIU, "Randomized Search Strategy for Unstructured P2P Networks" in IEICE TRANSACTIONS on Communications, vol. E95-B, no. 1, pp. 289-292, January 2012, doi: 10.1587/transcom.E95.B.289.
Abstract: P2P (peer-to-peer) file sharing systems have been in operation for years. However, recent studies show that many peers in P2P networks are free-riders, who download files but are unwilling to share. This paper proposes a randomized search algorithm that considers the potential of a peer for information exchange and controlled query forwarding in the search process. Based on churn situations, the simulation results in this study demonstrate that the proposed algorithm can reduce network traffic and search latency while searching for files in the system.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.289/_p

Copy

@ARTICLE{e95-b_1_289,
author={Wei-Mei CHEN, Kuang-Chu LIU, },
journal={IEICE TRANSACTIONS on Communications},
title={Randomized Search Strategy for Unstructured P2P Networks},
year={2012},
volume={E95-B},
number={1},
pages={289-292},
abstract={P2P (peer-to-peer) file sharing systems have been in operation for years. However, recent studies show that many peers in P2P networks are free-riders, who download files but are unwilling to share. This paper proposes a randomized search algorithm that considers the potential of a peer for information exchange and controlled query forwarding in the search process. Based on churn situations, the simulation results in this study demonstrate that the proposed algorithm can reduce network traffic and search latency while searching for files in the system.},
keywords={},
doi={10.1587/transcom.E95.B.289},
ISSN={1745-1345},
month={January},}

Copy

TY - JOUR
TI - Randomized Search Strategy for Unstructured P2P Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 289
EP - 292
AU - Wei-Mei CHEN
AU - Kuang-Chu LIU
PY - 2012
DO - 10.1587/transcom.E95.B.289
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2012
AB - P2P (peer-to-peer) file sharing systems have been in operation for years. However, recent studies show that many peers in P2P networks are free-riders, who download files but are unwilling to share. This paper proposes a randomized search algorithm that considers the potential of a peer for information exchange and controlled query forwarding in the search process. Based on churn situations, the simulation results in this study demonstrate that the proposed algorithm can reduce network traffic and search latency while searching for files in the system.
ER -