Abstract
Peer-to-Peer (P2P) networks have been developed for resource sharing for years. In a P2P network, resource locating is the first and foremost challenge, including issues about long searching time, a large amount of duplicated query message and a small success rate. Many efficient methods have been proposed to resolve these issues. However, most of these proposals may only benefit searching a popular object. In this paper, we propose a Cloning Random Walker with a Dominating Set (CloneRW+DS) method to adaptively locate the target resource no matter the target resource is popular or unpopular in a P2P network. Our simulation results show our proposed scheme can perform a better trade-off among message overhead, searching delay, and success rate while conducting resource locating in a P2P network.
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.
