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

详细信息    查看全文

• 作者：Sara Alouf ; ^{sara.alouf@inria.fr" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Nicaise Choungmo Fofack¹ ; ^{nchoungmofofack.ext@orange.com" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Nedko Nedkov² ; ^{nedkostefanovnedkov@gmail.com" class="auth_mail" title="E-mail the corresponding author}Author Vitae
• 关键词：Analysis ; Cache networks ; Domain Name System ; Time-to-live (TTL) ; Real DNS trace validation ; Renewal theory
• 刊名：Performance Evaluation
• 出版年：2016
• 出版时间：March 2016
• 年：2016
• 卷：97
• 期：Complete
• 页码：57-82
• 全文大小：1206 K

文摘

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