Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Exact analysis of TTL cache networks

Tools
- Tools
+ Tools

Berger, Daniel S., Gland, Philipp, Singla, Sahil and Ciucu, Florin (2014) Exact analysis of TTL cache networks. Performance Evaluation, Volume 79 . pp. 2-23. doi:10.1016/j.peva.2014.07.001

[img]
Preview
PDF
WRAP_Ciucu_091_bgsc_exactanalysisofttlcachenetworks_cr.pdf - Accepted Version - Requires a PDF viewer.

Download (918Kb) | Preview
Official URL: http://dx.doi.org/10.1016/j.peva.2014.07.001

Request Changes to record.

Abstract

TTL caching models have recently regained significant research interest due to their connection to popular caching policies such as LRU. This paper advances the state-of-the-art analysis of TTL-based cache networks by developing two exact methods with orthogonal generality and computational complexity. The first method generalizes existing results for line networks under renewal requests to the broad class of caching policies whereby evictions are driven by stopping times; in addition to classical policies used in DNS and web caching, our stopping time model captures an emerging new policy implemented in SDN switches and Amazon web services. The second method further generalizes these results to feedforward networks with Markov arrival process (MAP) requests. MAPs are particularly suitable for non-line networks because they are closed not only under superposition and splitting, as known, but also under caching operations with phase-type (PH) TTL distributions. The crucial benefit of the two closure properties is that they jointly enable the first exact analysis of TTL feedforward cache networks in great generality. Moreover, numerical results highlight that existing Poisson approximations in binary-tree topologies are subject to relative errors as large as 30%, depending on the tree depth.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH): Cache memory, Querying (Computer science), Machine theory, Computer programming, Markov processes
Journal or Publication Title: Performance Evaluation
Publisher: Elsevier Science BV
ISSN: 0166-5316
Official Date: September 2014
Dates:
DateEvent
September 2014Published
Volume: Volume 79
Page Range: pp. 2-23
DOI: 10.1016/j.peva.2014.07.001
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Embodied As: 1

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us