A simulation model for studying of caching algorithms

Timo Hämäläinen; Mika Wikström; Pertti Raatikainen

doi:10.1109/ICII.2001.983645

A simulation model for studying of caching algorithms

Timo Hämäläinen
, Mika Wikström
, Pertti Raatikainen

University of Jyväskylä

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

2 Citations (Scopus)

Abstract

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.

Original language	English
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
Pages	599-604
ISBN (Print)	0-7803-7010-4
DOIs	https://doi.org/10.1109/ICII.2001.983645
Publication status	Published - 2001
MoE publication type	A4 Article in a conference publication

Access to Document

10.1109/ICII.2001.983645

Cite this

@inproceedings{8b404e00aacd4d469e9a7cd87a81f3dd,

title = "A simulation model for studying of caching algorithms",

abstract = "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.",

author = "Timo H{\"a}m{\"a}l{\"a}inen and Mika Wikstr{\"o}m and Pertti Raatikainen",

note = "Project code: T0SU00089",

year = "2001",

doi = "10.1109/ICII.2001.983645",

language = "English",

isbn = "0-7803-7010-4",

pages = "599--604",

booktitle = "Proceedings of the International Conference on Info-tech and Info-net, ICII 2001",

publisher = "IEEE Institute of Electrical and Electronic Engineers",

address = "United States",

}

A simulation model for studying of caching algorithms. / Hämäläinen, Timo; Wikström, Mika; Raatikainen, Pertti.
Proceedings of the International Conference on Info-tech and Info-net, ICII 2001: Beijing, China, 29 October - 1 November 2001. IEEE Institute of Electrical and Electronic Engineers, 2001. p. 599-604.

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - A simulation model for studying of caching algorithms

AU - Hämäläinen, Timo

AU - Wikström, Mika

AU - Raatikainen, Pertti

N1 - Project code: T0SU00089

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

U2 - 10.1109/ICII.2001.983645

DO - 10.1109/ICII.2001.983645

M3 - Conference article in proceedings

SN - 0-7803-7010-4

SP - 599

EP - 604

BT - Proceedings of the International Conference on Info-tech and Info-net, ICII 2001

PB - IEEE Institute of Electrical and Electronic Engineers

ER -

A simulation model for studying of caching algorithms

Abstract

Access to Document

Fingerprint

Cite this