Skip to Main Content
Unstructured peer-to-peer (P2P) networks have power-law topology, and the number of content requests also follows power-law distributions. These properties cause two problems: the high-load of high-degree peers and the quick deletion of rarely requested contents. We propose a new caching scheme that replaces the cache on the basis of the number of request messages per unit of time. It significantly reduces the load of high-degree peers and improves the hit rate. Moreover, we use a simulation to show the effectivity of our proposed method.