The WWW employs a hierarchical data dissemination architecture in which hypermedia objects stored at a remote server are delivered to clients across the Internet and cached on disks at intermediate proxy servers. One of the objectives of Web caching algorithms is to maximize the amount of data transferred through the proxy servers or cache hierarchies. In this paper, we present a generic simulation model, which can be used to develop and study caching algorithms. Our goal is to utilize this model in developing new cache-maintaining methods, which support CoS, scale to multiple server farms, and are optimized to achieving high throughput.
|Title of host publication||Proceedings of the International Conference on Info-tech and Info-net, ICII 2001|
|Subtitle of host publication||Beijing, China, 29 October - 1 November 2001|
|Publisher||IEEE Institute of Electrical and Electronic Engineers|
|Publication status||Published - 2001|
|MoE publication type||A4 Article in a conference publication|
Hämäläinen, T., Wikström, M., & Raatikainen, P. (2001). A simulation model for studying of caching algorithms. In Proceedings of the International Conference on Info-tech and Info-net, ICII 2001: Beijing, China, 29 October - 1 November 2001 (pp. 599-604). IEEE Institute of Electrical and Electronic Engineers. https://doi.org/10.1109/ICII.2001.983645