IEICE TRANSACTIONS on Communications
Performance Evaluation of Adaptive Probabilistic Search in P2P Networks
Summary :
The overall performance of P2P-based file sharing applications is becoming increasingly important. Based on the Adaptive Resource-based Probabilistic Search algorithm (ARPS), which was previously proposed by the authors, a novel probabilistic search algorithm with QoS guarantees is proposed in this letter. The algorithm relies on generating functions to satisfy the user's constraints and to exploit the power-law distribution in the node degree. Simulation results demonstrate that it performs well under various P2P scenarios. The proposed algorithm provides guarantees on the search performance perceived by the user while minimizing the search cost. Furthermore, it allows different QoS levels, resulting in greater flexibility and scalability.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E91-B No.4 pp.1172-1175
- Publication Date
- 2008/04/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e91-b.4.1172
- Type of Manuscript
- LETTER
- Category
- Network
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
Haoxiang ZHANG, Lin ZHANG, Xiuming SHAN, Victor O.K. LI, "Performance Evaluation of Adaptive Probabilistic Search in P2P Networks" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 4, pp. 1172-1175, April 2008, doi: 10.1093/ietcom/e91-b.4.1172.
Abstract: The overall performance of P2P-based file sharing applications is becoming increasingly important. Based on the Adaptive Resource-based Probabilistic Search algorithm (ARPS), which was previously proposed by the authors, a novel probabilistic search algorithm with QoS guarantees is proposed in this letter. The algorithm relies on generating functions to satisfy the user's constraints and to exploit the power-law distribution in the node degree. Simulation results demonstrate that it performs well under various P2P scenarios. The proposed algorithm provides guarantees on the search performance perceived by the user while minimizing the search cost. Furthermore, it allows different QoS levels, resulting in greater flexibility and scalability.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.4.1172/_p
Copy
@ARTICLE{e91-b_4_1172,
author={Haoxiang ZHANG, Lin ZHANG, Xiuming SHAN, Victor O.K. LI, },
journal={IEICE TRANSACTIONS on Communications},
title={Performance Evaluation of Adaptive Probabilistic Search in P2P Networks},
year={2008},
volume={E91-B},
number={4},
pages={1172-1175},
abstract={The overall performance of P2P-based file sharing applications is becoming increasingly important. Based on the Adaptive Resource-based Probabilistic Search algorithm (ARPS), which was previously proposed by the authors, a novel probabilistic search algorithm with QoS guarantees is proposed in this letter. The algorithm relies on generating functions to satisfy the user's constraints and to exploit the power-law distribution in the node degree. Simulation results demonstrate that it performs well under various P2P scenarios. The proposed algorithm provides guarantees on the search performance perceived by the user while minimizing the search cost. Furthermore, it allows different QoS levels, resulting in greater flexibility and scalability.},
keywords={},
doi={10.1093/ietcom/e91-b.4.1172},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - Performance Evaluation of Adaptive Probabilistic Search in P2P Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1172
EP - 1175
AU - Haoxiang ZHANG
AU - Lin ZHANG
AU - Xiuming SHAN
AU - Victor O.K. LI
PY - 2008
DO - 10.1093/ietcom/e91-b.4.1172
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2008
AB - The overall performance of P2P-based file sharing applications is becoming increasingly important. Based on the Adaptive Resource-based Probabilistic Search algorithm (ARPS), which was previously proposed by the authors, a novel probabilistic search algorithm with QoS guarantees is proposed in this letter. The algorithm relies on generating functions to satisfy the user's constraints and to exploit the power-law distribution in the node degree. Simulation results demonstrate that it performs well under various P2P scenarios. The proposed algorithm provides guarantees on the search performance perceived by the user while minimizing the search cost. Furthermore, it allows different QoS levels, resulting in greater flexibility and scalability.
ER -
English
