Proximity Neighbor Selection in Structured P2P Network

Structured P2P network offers efficient and faulttolerant routing, object location and load balancing for upper applications. In this paper, we propose a novel scheme to improve the proximity property of structured P2P network. Basing on 2-dimension virtual network coordinates, the psychically nearby nodes are clustered into the same and adjacent regions after mapping from the network coordinates space to the identifier space of DHT. Through searching the corresponding region id using RPC calls in Chord, nodes obtain their nearby neighbors quickly in pure distributed way. Results obtained via simulation of large scale topology models denote that our scheme has lower average neighbor delay than randomly sampling approach and only incurs a modest additional searching overhead.