TY - GEN
T1 - Performance aspects of distributed caches using TTL-based consistency
AU - Cohen, Edith
AU - Halperin, Eran
AU - Kaplan, Haim
PY - 2001
Y1 - 2001
N2 - Web objects are stored and can be requested from numerous servers, including authoritative origin servers and caches. Objects can be modified only by their origin servers and weak consistency with cached copies is maintained by limiting their lifetime durations. Copies fetched from origin servers are received with maximum time-to-live (TTL) that equals their lifetime duration whereas copies obtained through a cache have shorter TTLs since their age (elapsed time since fetched from the origin) is deducted from their lifetime duration. A request served by a cache constitutes a hit if the cache has a fresh copy of the object. Otherwise, the request is considered a miss and is propagated to another server. Performance is measured by the number of requests constituting cache misses. It is evident that the number of cache misses depends on the age of the copies the cache receives. Thus, a cache that sends requests to another cache would suffer more misses than a cache that sends requests directly to an authoritative server. More subtly, the number of misses depends on the particular configuration of higher-level caches, e.g., whether one or more higher-level caches are used. Guided by practices for Web caching, we model and compare different configurations. We also analyze the effect of pre-term refreshes at high-level caches and extended lifetimes at low-level caches and reveal patterns that may seem counter-intuitive at first. Even though TTLbased consistency is very widely used, our work seems to be the first to formally analyze it. Our analysis yields insights and guidelines for improving the performance of Web caches.
AB - Web objects are stored and can be requested from numerous servers, including authoritative origin servers and caches. Objects can be modified only by their origin servers and weak consistency with cached copies is maintained by limiting their lifetime durations. Copies fetched from origin servers are received with maximum time-to-live (TTL) that equals their lifetime duration whereas copies obtained through a cache have shorter TTLs since their age (elapsed time since fetched from the origin) is deducted from their lifetime duration. A request served by a cache constitutes a hit if the cache has a fresh copy of the object. Otherwise, the request is considered a miss and is propagated to another server. Performance is measured by the number of requests constituting cache misses. It is evident that the number of cache misses depends on the age of the copies the cache receives. Thus, a cache that sends requests to another cache would suffer more misses than a cache that sends requests directly to an authoritative server. More subtly, the number of misses depends on the particular configuration of higher-level caches, e.g., whether one or more higher-level caches are used. Guided by practices for Web caching, we model and compare different configurations. We also analyze the effect of pre-term refreshes at high-level caches and extended lifetimes at low-level caches and reveal patterns that may seem counter-intuitive at first. Even though TTLbased consistency is very widely used, our work seems to be the first to formally analyze it. Our analysis yields insights and guidelines for improving the performance of Web caches.
UR - http://www.scopus.com/inward/record.url?scp=23044528024&partnerID=8YFLogxK
U2 - 10.1007/3-540-48224-5_61
DO - 10.1007/3-540-48224-5_61
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:23044528024
SN - 3540422870
SN - 9783540422877
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 744
EP - 756
BT - Automata, Languages and Programming - 28th International Colloquium, ICALP 2001, Proceedings
A2 - Orejas, Fernando
A2 - Spirakis, Paul G.
A2 - van Leeuwen, Jan
PB - Springer Verlag
T2 - 28th International Colloquium on Automata, Languages and Programming, ICALP 2001
Y2 - 8 July 2001 through 12 July 2001
ER -