International Journal of Computer Applications
Peer-to-peer networks are generally characterized in terms of sharing computer resources without the intermediation of a centralized server. Interconnected nodes in peer-to-peer networks are able to communicate through a self organizing topology which runs as an overlay on top of the physical network. The mismatch problem between underlay and overlay network in such systems, known as locality problem, creates extra traffic in the network. Knowledge about peers in the underlay network can be used to find the solution of locality problem by defining a proximity measure. This paper proposes an algorithm to measure proximity of nodes in peer-to-peer networks. In this algorithm, the authors measure proximity among pairs of nodes in the overlay network.