Abstract
An efficient searching algorithm in the absence of control over the object locations is a challenging issue in the design of unstructured peer-to-peer (P2P) networks. In this paper, we report files searching constraints in the unstructured P2P systems. Hence, we exploit learning automata adaptive probabilistic search (LAAPS) algorithm for those constraints which are distributed entirely with adequate bandwidth. LAAPS optimize the learning automata using file container nodes which are leveraged with the types of file. In the simulation, we compare the proposed algorithm with the random probabilistic walk, adaptive search algorithm, and improved adaptive probabilistic search algorithm. The numerical result demonstrates that LAAPS improves the number of hits per query, achieving high success rate with significant message reduction.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computers and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
