An Enhanced P4P-Based Pastry Routing Algorithm for P2P Network

Aiming at the current structured P2P system´s locality of physical location and accessing resources, in the context of P4P technology, this paper takes the Pastry and P4P-Pastry algorithms as foundation, proposes a enhanced P4P routing algorithm, in which peers performed clustering to the same resources and the proximity of physical location of nodes. When routing, the node routes to the nodes which are physical adjacent to it and have the lowest cost of communication. Theory analysis and the experimental results show that the algorithm proposed in this paper has realized localization download and greatly raised the data transfer rate, reduced the load in backbone network and enhanced the network performance.