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. In: SIGMETRICS '14 , Austin, Texas, 16-20 Jun 2014. Published in: The 2014 ACM international conference on Measurement and modeling of computer systems, Volume 42 (Number 1). pp. 595-596. ISBN 9781450327893 . doi:10.1145/2591971.2592038

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Official URL: http://dx.doi.org/10.1145/2591971.2592038

Request Changes to record.

Abstract

TTL caching models have recently regained significant research interest, largely due to their ability to fit popular caching policies such as LRU. In this extended abstract we briefly describe our recent work on two exact methods to analyze TTL cache networks. 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. The obtained results are further generalized, using the second method, to feedforward networks with Markov arrival processes (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 input-output caching operations as proven herein for phase-type TTL distributions. The crucial benefit of the two closure properties is that they jointly enable the first exact analysis of feedforward networks of TTL caches in great generality.

Item Type: Conference Item (Paper)
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Journal or Publication Title: The 2014 ACM international conference on Measurement and modeling of computer systems
Publisher: ACM
ISBN: 9781450327893
Book Title: The 2014 ACM international conference on Measurement and modeling of computer systems - SIGMETRICS '14
Official Date: 2014
Dates:
DateEvent
2014Published
Volume: Volume 42
Number: Number 1
Page Range: pp. 595-596
DOI: 10.1145/2591971.2592038
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Embodied As: 1
Conference Paper Type: Paper
Title of Event: SIGMETRICS '14
Type of Event: Conference
Location of Event: Austin, Texas
Date(s) of Event: 16-20 Jun 2014

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

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