File(s) under permanent embargo
An efficient and distributed file search in unstructured peer-to-peer networks
journal contribution
posted on 2015-01-01, 00:00 authored by M Shojafar, Jemal AbawajyJemal Abawajy, Z Delkhah, A Ahmadi, Z Pooranian, A AbrahamPeer-to-peer (P2P) networks are gaining increased attention from both the scientific community and the larger Internet user community. Data retrieval algorithms lie at the center of P2P networks, and this paper addresses the problem of efficiently searching for files in unstructured P2P systems. We propose an Improved Adaptive Probabilistic Search (IAPS) algorithm that is fully distributed and bandwidth efficient. IAPS uses ant-colony optimization and takes file types into consideration in order to search for file container nodes with a high probability of success. We have performed extensive simulations to study the performance of IAPS, and we compare it with the Random Walk and Adaptive Probabilistic Search algorithms. Our experimental results show that IAPS achieves high success rates, high response rates, and significant message reduction.
History
Journal
Peer-to-peer networking and applicationsVolume
8Issue
1Pagination
120 - 136Publisher
SpringerLocation
New York, N.Y.Publisher DOI
ISSN
1936-6450eISSN
1936-6442Language
engPublication classification
C1 Refereed article in a scholarly journal; C Journal articleCopyright notice
2013, SpringerUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC