Research On A Topology-Aware P2P System Model

At present, Peer-to-Peer (P2P) is a research hotspot in distributed computing and computer network. Structured P2P system based on distributed hash table like Chord, CAN, Pastry and Tapestry, can achieve a query length of O(logN) with using O(logN) neighbors per node. When many P2P systems construct its overlay network, they don't consider topology structure of physical network and induce tremendous network delay in the course of routing. In order to resolve the mismatching problem between overlay network and physical network, methods of generation proximity information and exploiting proximity information were proposed, and Improvement on existing P2P systems had achieved effective routing mechanism.In this paper, we propose a structured P2P system called Cone, which is based on proximity neighbor selection method. Cone tries to implement proximity neighbor selection method in chord and to achieve effective routing mechanism. In Cone, nodes are divided into groups with its identifier, finger table are bidirectional and pointers to the nearest nodes in special group. With landmark+RTT method to generating proximity information and proximity neighbor selection method to exploiting proximity information, Cone makes use of network topology structure effectively in routing. The result of experiments show that the Cone, compared with Chord, has obvious improved on the delay of route and the hops of overlay networks.