ERAntBudget: A Search Algorithm in Unstructured P2P Networks

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.