Abstract
Random walks are an excellent search mechanism in unstructured P2P network. However, it suffers long delay when searching files, especially for uncommon files. An efficient search mechanism - ARW is presented. ARW utilizes path information carrying and walker self-replication technologies to increase the number of different peers all walkers visit and reduces the delay which random walks spends on searching files especially for uncommon files greatly. Experimental results show that ARW reduces the delay of random walks on searching uncommon files by 63.7% with almost no extra overhead in a Gnutella-like overlay network and gets a good tradeoff between performance and overhead.
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.
