A novel cache distribution heuristic algorithm for a mesh of caches and its performance evaluation
✍ Scribed by Jorge Escorcia; Dipak Ghosal; Dilip Sarkar
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 259 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0140-3664
No coin nor oath required. For personal study only.
✦ Synopsis
The widespread use of the Internet has created two problems: document retrieval latency and network traf®c. Caching of documents close' to users has helped alleviate both problems. Different caching policies have been proposed/implemented to make best use of limited available cache at each caching server. A mesh of caching servers, aided by different data diffusion algorithms and the natural hierarchical structure of the Internet topology, has increased virtual' size of cache. Yet the size of available cache is small compared to the total size of all documents served, and remains a major resource constraint. In this work, we looked at how to improve document download time, by distributing a ®xed amount of total storage in a network or mesh of caches. The intuition behind our cache distribution approach is to give more storage to the caching nodes in the network, which experience more traf®c, in the hope that this will reduce the average latency of document retrieval in the network. A heuristic was developed to estimate traf®c at each cache of a network. From this traf®c estimation, each cache then receives a corresponding percentage of the total storage capacity of the network. Through extensive simulation it is found that the proposed cache distribution algorithm can reduce latency up to 80% over prior work that includes both Harvest-type and demand-driven data diffusion algorithms. Furthermore, the best improvement was achieved in a cache range that corresponds to practical, real world cache ranges.