Simulation of Client-side Caching Policies for Distributed File Systems

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Simulation of Client-side Caching Policies for Distributed File Systems

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Simulation of Client-side Caching Policies for Distributed File Systems

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

EuroCon 2013

ISBN

978-1-4673-2232-4

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

679-686

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Záhřeb, Chorvatsko

Datum konání akce

1. 7. 2013

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—