CoChat
Sign Up
Cited by 155Caching and Content DeliveryNetwork Traffic and Congestion ControlNetwork Packet Processing and Optimization

The DOI matches its Crossref record.

Modeling TTL-based Internet caches

Jung, J., Berger, A.W., Hari Balakrishnan·2004·IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
DOI 10.1109/infcom.2003.1208693
Open this paper in CoChat — free account

Abstract

This paper presents a way of modeling the hit rates of caches that use a time-to-live (TTL)-based consistency policy. TTL-based consistency, as exemplified by DNS and Web caches, is a policy in which a data item, once retrieved, remains valid for a period known as the "time-to-live". Cache systems using large TTL periods are known to have high hit rates and scale well, but the effects of using shorter TTL periods are not well understood. We model hit rate as a function of request arrival times and the choice of TTL, enabling us to better understand cache behavior for shorter TTL periods. Our formula for the hit rate is closed form and relies upon a simplifying assumption about the interarrival times of requests for the data item in question: that these requests can be modeled as a sequence of independent and identically distributed random variables. Analyzing extensive DNS traces, we find that the results of the formula match observed statistics surprisingly well; in particular, the analysis is able to adequately explain the somewhat counterintuitive empirical finding of Jung et al. that the cache hit rate for DNS accesses rapidly increases as a function of TTL, exceeding 80% for a TTL of 15 minutes.

Overview

Integrity signals

Registry

Crossref · 10.1109/infcom.2003.1208693

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Continnum is the first system to use TTL to regulate LLM KV cache as a function of predicted tool-call durations, scheduling-side delay propagation, and workload pattern.

    “To our knowledge, Continnum is the first system to use TTL to regulate LLM KV cache as a function of predicted toolcall durations, scheduling-side delay propagation, and workload pattern.”

    From Continuum: Efficient and Robust Multi-Turn LLM Agent Scheduling with KV Cache Time-to-Live (2025) · cites this paper as [25]

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 18

  1. 10.1093/biomet/66.3.605 · DOI
  2. ross, 1996, Stochastic Processes, 1
  3. 10.1080/00401706.1990.10484683 · DOI
  4. 10.1109/90.330413 · DOI
  5. 10.1109/90.392383 · DOI
  6. heyman, 1983, Stochastic Models in Operations Research, 1
  7. 2001, Fminsearch (Matlab Function Reference)
  8. 10.1137/S1052623496303470 · DOI
  9. williams, 1996, Removal policies in network caches for world-wide web documents, Proc ACM SIGCOMM 96 Conf
  10. 10.1145/52324.52338 · DOI
  11. 10.1145/510726.510748 · DOI
  12. 10.1002/047120644X.ch15 · DOI
  13. 10.1007/3-540-48224-5_61 · DOI
  14. 10.1145/383059.383063 · DOI
  15. 10.1109/INFCOM.1999.749260 · DOI
  16. arlitt, 1998, Performance evaluation of web proxy cache replacement policies, Proc Performance Tools 98
  17. 10.1145/98460.98525 · DOI
  18. king, 1971, Analysis of demand paging algorithms, Information Processing, 485

Cited by

Sorted by citations

Metadata

Authors
Jung, J., Berger, A. W., & Balakrishnan, H.
Affiliations
Massachusetts Institute of Technology (US)
ORCID
Venue
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
Publisher
IEEE
Published
2004-03-22
Volume
1
Pages
417-426
DOI
10.1109/infcom.2003.1208693
OpenAlex
W2168282297
Cited by
155
References
0
Citations by year
2026: 2 · 2025: 2 · 2024: 8 · 2023: 3 · 2022: 4 · 2021: 6 · 2020: 13 · 2019: 6 · 2018: 13 · 2017: 8 · 2016: 15 · 2015: 7 · 2014: 14 · 2013: 9 · 2012: 7
FWCI
3.32
Type
conference paper
Language
en
Open access
closed
Locations
IEEE Conference on Computer Communications (INFOCOM) (publishedVersion)
Funders
ExxonMobil Research and Engineering Company
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
  • Physical Sciences › Computer Science › Hardware and Architecture › Network Packet Processing and Optimization
Keywords
time-to-live, cache hit rate, DNS caching, web caching

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review