On the performance of ACO-based methods in p2p resource discovery
Applied Soft Computing
| Hi-index | 0.00 |
This paper presents a novel peer selection model named Ant Peer Selection (AntPS) to prevent selecting malicious or selfish peers as service providers in peer-to-peer (P2P) systems. We created two pheromone tables named resource similarity pheromone table and trust similarity pheromone table for every peer in the system. When a peer produces some request messages, a new ant called forward ant (Fant) is created at the same time. It is the Fant's task to select which peer is the most suitable server based on the pheromone remained on the path. A new ant called backward ant (Bant) will be created when Fant finds some useful resources. Bant will update all the two pheromone tables on its way back. We simulated the new peer selection mechanism on the Query Cycle Simulator. After the simulation, we made a comparison among our model and three other known models, i.e., Flooding, Top-k and EigenTrust. From three aspects of the comparison, we made a conclusion that our model seems better than the others, and the performance is excellent.