Abstract
The searching mechanism in traditional unstructured P2P networks often consumes a large amount of network resources. Furthermore, queries for rare objects do not receive the desired number of results or even fail, for the object popularitypsilas imbalanced distribution. To deal with these problems, we propose a novel search algorithm: ERAntBudget, which is based on Gnutella protocol and adopts the budget mechanism as well as the trail-laying-and-following policy of ant colony optimization principle. In this paper, we present the design and architecture of ERAntbudget, the simulation results demonstrate the effectiveness.
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.
