Performance models for hierarchy of caches: Application to modern DNS caches

Abstract : This paper studies expiration-based caching systems in which caches assign a timer to each content they store and redraw the timer upon a cache miss. The modern Domain Name System (DNS) hierarchy is a valid application case and will be used throughout the paper. We introduce analytical models to study expiration-based caching systems based on renewal arguments. For polytree cache networks, we derive the cache performance metrics and characterize at each cache the aggregate request process, the thinning process and the miss process. A constant TTL policy is proved to maximize/minimize the hit probability if the requests' renewal function is concave/convex. We find that no distribution maximizes the hit probability anywhere in a network of caches. We validate our theoretical findings using real DNS traces (single cache and network cases) and via trace-driven simulations (network case).
Document type :
Journal articles
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal.inria.fr/hal-01258189
Contributor : Sara Alouf <>
Submitted on : Tuesday, July 9, 2019 - 11:00:20 AM
Last modification on : Tuesday, July 9, 2019 - 11:07:46 AM

File

PEVA1854.pdf
Files produced by the author(s)

Identifiers

Collections

Relations

Citation

Sara Alouf, Nicaise Choungmo Fofack, Nedko Nedkov. Performance models for hierarchy of caches: Application to modern DNS caches. Performance Evaluation, Elsevier, 2016, 97, pp.57-82. ⟨10.1016/j.peva.2016.01.001⟩. ⟨hal-01258189⟩

Share

Metrics

Record views

344

Files downloads

154