Back to Search Start Over

IACO resources search algorithm in unstructured P2P network.

Authors :
FANG Pei
YAN Xiang-long
LIANG Zi
WU Xiao-jun
Source :
Application Research of Computers / Jisuanji Yingyong Yanjiu. Feb2014, Vol. 31 Issue 2, p522-525. 4p.
Publication Year :
2014

Abstract

To solve the problems of low efficiency and more redundant messages in unstructured P2P network resources search, this paper proposed an ant colony optimization based on interest factor(IACO). It gave full consideration to the effects of node value of resources search. It introduced node interest factor into traditional ant colony algorithm to adjust the weight relationship of node value and pheromones dynamically in the forward probability calculation, and effectively guided the generation of resources query path. The simulation results show that the proposed algorithm can improve the success significantly rate and to a certain extent can reduce the amount of redundant messages in the network at the same time. [ABSTRACT FROM AUTHOR]

Details

Language :
Chinese
ISSN :
10013695
Volume :
31
Issue :
2
Database :
Academic Search Index
Journal :
Application Research of Computers / Jisuanji Yingyong Yanjiu
Publication Type :
Academic Journal
Accession number :
95444155
Full Text :
https://doi.org/10.3969/j.issn.1001-3695.2014.02.048