Prioritized dual caching algorithm for peer-to-peer content network

Content caching is a fundamental strategy for improving the performance and quality of service perceived by users by storing popular objects that are likely to be used in the near future. P2P traffic has its own characteristics, such as flattened head and long heavy tailed popularity distribution. Therefore, a new cache management algorithm which incorporates well P2P traffic characteristics needs to be considered. In this paper, we propose a prioritized dual caching algorithm which addresses P2P traffic and present results from simulation experiments. Our results show that our algorithm achieves relatively high performance improvement. In particular, the proposed algorithm is very effective when the cache size is relatively small.