@techreport{choungmofofack:hal-00676735,
    hal_id = {hal-00676735},
    url = {http://hal.inria.fr/hal-00676735},
    title = {{Analysis of TTL-based Cache Networks}},
    author = {Choungmo Fofack, Nicaise and Nain, Philippe and Neglia, Giovanni and Towsley, Don},
    abstract = {{This paper provides building blocks for the performance evaluation of Content Centric-like Networks (CCNs). In CCNs if a cache receives a request for a content it does not store ({\em miss}), it forwards the request to a higher-level cache, if any, or to the server. When located, the document is routed on the reverse-path and a copy is placed in each cache along the path. In this paper we consider a cache replacement policy based on Time-to-Lives (TTLs) like in a DNS network. A local TTL is set when the content is first stored at the cache and is renewed every time the cache can satisfy a request for this content (at each hit). The content is removed when the TTL expires. Under the assumption that requests follow a renewal process and the TTLs are exponential random variables, we determine exact formulas for the performance metrics of interest (average cache occupancy, hit and miss probabilities/rates) for some specific architectures (a linear network and a tree network with one root node and $N$ leaf nodes). For more general topologies and general TTL distributions, we propose an approximate solution. Numerical results show the approximations to be accurate, with relative errors smaller than $10^{-3}$ and $10^{-2}$ respectively for exponentially distributed and constant TTLs.}},
    keywords = {Cache architecture; content-centric network; timer, Markov model; renewal theory},
    language = {English},
    affiliation = {MAESTRO - INRIA Sophia Antipolis , Department of Computer Science [Amherst]},
    type = {Research Report},
    institution = {INRIA},
    number = {RR-7883},
    year = {2012},
    month = Mar,
    pdf = {http://hal.inria.fr/hal-00676735/PDF/RR-INRIA-7883.pdf},
}