Philipp Gland

Learn More
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 <i>exact</i> methods to analyze TTL cache networks. The first method generalizes existing results for line networks under renewal requests to(More)
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(More)
  • 1