Simulation of Client-side Caching Policies for Distributed File Systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F13%3A43919081" target="_blank" >RIV/49777513:23520/13:43919081 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Simulation of Client-side Caching Policies for Distributed File Systems
Original language description
Cache as an intermediate component serves for storing content which has been requested by user and will be potentially used in the future. The cache capacity is limited, thus we cannot store all requested content. We have to use algorithms which mark anold content to be replaced in the cache. These algorithms are commonly named cache or caching policies. Optimally, the caching policy should replace the content which will not be used in the near future. First goal of this paper is to present a cache simulator which serves for comparison of caching policies. In a simulation, requests for data are produced by random request generator or can be generated from a log file. The second goal of this paper is to present results gained from simulations of different caching policies applicable to mobile devices and other clients in order to choose most suitable one.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
EuroCon 2013
ISBN
978-1-4673-2232-4
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
679-686
Publisher name
IEEE
Place of publication
Piscataway
Event location
Záhřeb, Chorvatsko
Event date
Jul 1, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—