首页> 外文会议>Natural Computation (ICNC), 2008 Fourth International Conference on >Research on Peer Selection in Peer-to-Peer Networks using Ant Colony Optimization
【24h】

Research on Peer Selection in Peer-to-Peer Networks using Ant Colony Optimization

机译:基于蚁群算法的点对点网络对等点选择研究

获取原文

摘要

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.
机译:本文介绍了名为Ant Peer选择(ANTP)的新型对等选择模型,以防止在对等(P2P)系统中选择恶意或自私的同行作为服务提供商。我们创建了两个名为资源相似性信息表和信任相似性信息表的Pheromone表,了解系统中的每个对等体。当对等体产生某些请求消息时,同时创建一个名为Forward Ant(FINT)的新蚂蚁。选择哪个对等体是基于Pheromone的最合适的服务器是难以依赖于路径上的最合适的服务器。当幻想找到一些有用的资源时,将创建一个名为倒退蚂蚁(Bant)的新蚂蚁。 Bant将在后面的路上更新所有两个信息剧表。我们在查询周期模拟器上模拟了新的对等选择机制。在仿真之后,我们在我们的模型和其他三种已知模型中进行了比较,即洪水,Top-K和故意。从比较的三个方面来看,我们得出了得出的结论,即我们的模型似乎比其他模式更好,表现优秀。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号