Distributed Hot Spots Caching Mechanism for Queries with Popular Distribution

Peer-to-peer (P2P) systems have gained considerable attention in the past few years. Since the popularity distribution of queries follows a zipf-like distribution in a P2P network, the performance can get significant improvement if a simple and effective caching mechanism called hot spots caching mechanism (HSCM) is used, which stores the IP address and port number of the successor node of the key. Simulations also show that the HSCM is basically independent of particular P2P algorithms and can be easily combined with other improved methods to further improve the performance of P2P search capabilities.