基于蚁群算法的P2P网络路由

Ant Algorithm Based Routing in P2P Networks

对等计算是目前分布计算领域的一个研究热点。对于对等网络系统来说,路由效率是一个关键问题。在此应用蚁群算法到对等网路由中,解决P2P网络的路由问题。仿真实验证实该方法是有效、可行的。

Peer-to-Peer （P2P） systems have received increasingly attention from both research and industry circles. For content sharing P2P systems ,the efficiency of routing is a critical to system performance. This paper addresses the routing issue in P2P systems based on ant algorithm,and proposes a new ant algorithm to support efficient routing in P2P networks. Simulated experiments are conducted to validate the feasibility of the proposed algorithm.