Performance evaluation of peer-to-peer Web caching systems
Journal of Systems and Software - Special issue: Quality software
Hi-index | 0.00 |
In this paper, we systematically examine the design spaceof peer-to-peer Web caching systems in three orthogonal dimensions:the caching algorithm, the document lookup algorithm,and the peer granularity. Based on the observation thatthe traditional URL-based caching algorithm suffers considerablyfrom the fact of cacheability decrease caused by thefast growing of dynamic and personalized Web content, wepropose to use the content-based caching algorithm. In additionto compare two existing document lookup algorithms, wepropose a simple and effective geographic-based documentlookup algorithm. Four different peer granularities, i.e., hostlevel, organization level, building level, and centralized , arestudied and evaluated using a seven-day Web trace collectedat a medium-size education institution. Using a trace-drivensimulation, we compared and evaluated all design choices interms of two performance metrics: hit ratio and latency reduction.Finally, several implications derived from the analysis are also discussed.