Efficient Lookup Using Proximity Caching for P2P Networks

Abstract

In peer-to-peer(P2P) network, the overall efficiency heavily depends on the performance of the lookup procedure. So, we propose a simple caching protocol, which intuitively obtains an information about physical network structure. Our caching protocol utilizes the internet address(IP) i.e. first 16 bits of IP address (can be adaptive), The metadata used in our caching protocol is exchanged using piggy-back mechanism, and we extract useful IP prefix set by using round trip time threshold value. We have deployed our caching protocol into Chord, a well-known distributed hash table-based lookup protocol. And our result showed genuine relationship between physical and logical network structure.