Abstract
In this paper, we propose an efficient search method for unstructured P2P networks. The method is based on the existing method called expanding ring in which the search area is gradually enlarged. In expanding ring, a large number of queries are forwarded unnecessarily because the same query is forwarded to the same node multiple times. We mitigate this problem by using temporary links. By conducting simulations, we demonstrate that the proposed method can spread search queries with fewer messages than existing methods. We also show that it is possible to search efficiently in various types of networks by using degree and cluster coefficient information obtained from the nodes through which a search query passes.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
