Research On Peer-to-Peer Network Technique Towards Multi-task

Over the Internet today, computing and communications environments are significantly more complex and chaotic. As a new computing model, the emerging Peer-to-Peer (P2P) network has been widely used. Compared with traditional C/S model, each peer in P2P system has two roles: it functions as server and client at the same time. The P2P system function is realized through co-work and cooperation among peers. The P2P system is made up of self-governing peers, lacking any centralized control, highly dynamic, and avoiding the single-node-failure and low-scalability problem.This paper is devoted to the issues of improving the utilization ratio of idling ability of peers. With the existing problem of current P2P system, this paper presents a new P2P network model towards multi tasks, and studies the relevant technology like P2P network evaluation and rapid construction of P2P overlay topology. The main contributions are as follows:1. This paper presents a new P2P network model towards multi tasks. Based on the present research on P2P system, network evaluation, overlay topology management and rapid construction, this paper presents a new P2P network model towards multi tasks. It organizes all the peers in the form of foundation network, then chooses the suitable peer according to its ability and the peculiarity of the task, finally rapidly builds the application layer P2P network for the specific task which is meant to deal with the task efficiently. This paper makes a detailed introduction and further discussion on the supporting technology of the presented P2P network model which is technically feasible and can highly improve the utilization ratio of idling ability of peers.2. This paper proposes an algorithm for rapidly building Kademlia overlay topology. The rapid construction of various P2P overlay topologies is the key technology of the proposed P2P network model. The current P2P systems have their own merits and drawbacks, and each is suitable for limited kinds of tasks. This paper proposes an algorithm for rapidly building Kademlia overlay topology, and expatiates on the principle of the algorithm and the detailed executing process. At last, it is demonstrated through extensive simulation experiments that the proposed algorithm can create a perfect Kademlia overlay topology in a logarithmic number of steps.3. This paper proposes an algorithm for rapidly building CAN overlay topology. CAN is a structured P2P systems based on space partition. Because CAN uses a virtual multi-dimensional Cartesian coordinate space and spatially continues in neighbor relations, it has its peculiar advantage in dealing with complex query. Inspired by the binary tree structure, this paper proposes an algorithm for rapidly building CAN overlay topology, and expatiates on the principle of the algorithm and the detailed executing process. At last, it is demonstrated through extensive simulation experiments that the proposed algorithm can create a perfect CAN overlay topology in a logarithmic number of steps, and the average increased communication overhead of peer is still a constant, so the proposed algorithm has high scalability.