Caching Scheme Research Based on Unstructured Peer-to-Peer Network

For Unstructured P2P (Peer-to-Peer) networks leading to the high-load of “high-degree peers”and the quick deletion of rarely requested contents. This paper proposed a new cache scheme MFU (Most Frequently Used) that replaces the cache on the basis of the number of request messages per unit of time. This algorithm aims to achieve the high-degree peers to delete the popular contents and low-degree ones hold the unpopular contents by setting the threshold properly. Moreover, The author also used a simulation to show the effectivity of the new algorithm. With the traditional LRU, LFU and ARP scheme compared to prove that the advantage of the new replacement policy in load balance and hit rate.