Modeling modern DNS caches

Caching is undoubtedly one of the most popular solution that easily scales up with a world-wide deployment of resources. Records in Domain Name System (DNS) caches are kept for a pre-set duration (time-to-live or TTL) to avoid becoming outdated. Modern caches are those that set locally the TTL regardless of what authoritative servers say. In this paper, we introduce analytic models to study the modern DNS cache behavior based on renewal arguments. For tree cache networks, we derive the cache performance metrics, characterize at each cache the miss process and the aggregate request process. We address the problem of the optimal caching duration and find that constant TTL is the best only if if inter-request times have a concave CDF. We validate our theoretical findings using real DNS traces (single cache case) and via event-driven simulations (network case). Our models are very robust as the relative error between empirical and analytic values stays within 1% in the former case and less than 5% in the latter case.

[1]  Anja Feldmann,et al.  Fitting mixtures of exponentials to long-tail distributions to analyze network performance models , 1997, Proceedings of INFOCOM '97.

[2]  Massimo Gallo,et al.  Performance evaluation of the random replacement policy for networks of caches , 2012, SIGMETRICS '12.

[3]  Hari Balakrishnan,et al.  Modeling TTL-based Internet caches , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  James Allen Fill,et al.  On the distribution of search cost for the move-to-front rule , 1996 .

[5]  M. Babillot,et al.  Théorie du renouvellement pour des chaînes semi-markoviennes transientes , 1988 .

[6]  Asit Dan,et al.  An approximate analysis of the LRU and FIFO buffer replacement schemes , 1990, SIGMETRICS '90.

[7]  Michael Tortorella Numerical Solutions of Renewal-Type Integral Equations , 2005, INFORMS J. Comput..

[8]  Evgenia Smirni,et al.  KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[9]  Roberto J. Bayardo,et al.  YouServ: a web-hosting and content sharing tool for the masses , 2002, WWW '02.

[10]  Sara Alouf,et al.  Non-renewal TTL-based Cache Replacement Policy and Applications: Case of Modern DNS Hierarchy , 2013 .

[11]  Mark Allman,et al.  On modern DNS behavior and properties , 2013, CCRV.

[12]  Donald F. Towsley,et al.  Approximate Models for General Cache Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[13]  Jianping Pan,et al.  Coping miss synchronization in hierarchical caching systems with nonlinear TTL functions , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[14]  Anees Shaikh,et al.  On the responsiveness of DNS-based network control , 2004, IMC '04.

[15]  Jianping Pan,et al.  On expiration-based hierarchical caching systems , 2004, IEEE Journal on Selected Areas in Communications.

[16]  F. Baccelli,et al.  Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences , 2010 .

[17]  Donald F. Towsley,et al.  Analysis of TTL-based cache networks , 2012, 6th International ICST Conference on Performance Evaluation Methodologies and Tools.

[18]  A. J. Lawrance,et al.  Dependency of Intervals between Events in Superposition Processes , 1973 .

[19]  Robert Tappan Morris,et al.  DNS performance and the effectiveness of caching , 2001, IMW '01.

[20]  I. B. Russak,et al.  Manifolds , 2019, Spacetime and Geometry.