Research Of P2p File-sharing System Based On Ant Colony Algorithm

Recently, P2P (peer-to-peer) applications have been widely used. It changed the traditional pattern of Internet. It is a revolutionary change in the history of Internet. In P2P network, every node is a peer node, it is either server or client. This architecture makes network more flat.With the rise of BitTorrent, eMule and other P2P applications, P2P file sharing systems are increasingly popular. However, the strategies of resource discovery and resource transmission in these popular P2P file sharing System are very simple. These simple strategies cause these P2P file sharing systems have low performance, and cost most of the network bandwidth. Because the current P2P file sharing system have such weaknesses in the resource discovery and resource transmission strategy, this paper proposes a resource discovery and transmission algorithm based on ant algorithm.Ant colony algorithm is a new intelligent optimization algorithm for solving combinatorial optimization problem or function optimization problem. Ant colony algorithm is systematic, distributed, self-organization, and has positive feedback. These features make it a very high practical value, and fit P2P file sharing system's feature of decentralization. Many domestic and foreign scholars have researched on the ant colony algorithm and verified the effectiveness of ant colony algorithm. However, there are few researches on using ant colony algorithm in P2P network. There are much fewer researches on using ant colony algorithm in P2P file sharing system.This paper introduces P2P network, P2P file sharing system and ant colony algorithm firstly, and then proposes a detailed description of P2P file sharing system design and implementation. This paper proposes a P2P dicovery and transmission strategy based on ant colony algorithm, and optimizes this strategy. Finally, the experimental data listed in this paper verifies the feasibility of my algorithm.