ERAntBudget: A Search Algorithm in Unstructured P2P Networks

  • Authors:
  • Gongyi Wu;Jiaoyao Liu;Xin Shen;Lijin Gao;Jingdong Xu;Kun Xi

  • Affiliations:
  • -;-;-;-;-;-

  • Venue:
  • IITA '08 Proceedings of the 2008 Second International Symposium on Intelligent Information Technology Application - Volume 02
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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 popularity’s 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.