The DOI matches its Crossref record, with a small difference in title or year; 1 of the 1 references it cites were found in a registry or an index.
Performance aspects of distributed caches using TTL-based consistency
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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 [15]
Citations
Cites
Hypertext Transfer Protocol -- HTTP/1.1
Fielding, R., Gettys, J., Mogul, J., Frystyk, H., Masinter, L., Leach, P., & Berners-Lee, T. (1999) · doi:10.17487/rfc2616 · Cited by 1,218
Flagged first, then by citations
Research works printed but not linked: 11
- T. Berners-Lee, R. Fielding, H. Frystyk, Hypertext Transfer Protocol—HTTP/1.0. RFC 1945, 1996. · DOI
- E. Cohen, E. Halperin, H. Kaplan, Performance aspects of distributed caches using TTL-based consistency, in: Proc. 28th Internat. Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 2076, Springer, Berlin, 2001, pp. 744–756.
- E. Cohen, H. Kaplan, The age penalty and its effect on cache performance, in: Proc. 3rd USENIX Symp. on Internet Technologies and Systems, 2001.
- E. Cohen, H. Kaplan, Aging through cascaded caches: performance issues in the distribution of web content, in: Proc. ACM SIGCOMM Conf. ACM, New York, 2001, pp. 41–53. · DOI
- Y. Hou, J. Pan, B. Li, X. Tang, S. Panwar, Modeling and analysis of an expiration-based hierarchical caching system, in: Proc. IEEE Globecom Internet Performance Symp., IEEE, New York, 2002. · DOI
- Y. Hou, J. Pan, C. Wang, B. Li, On prefetching in hierarchical caching systems, in: Proc. IEEE ICC Global Services and Infrastructure for Next Generation Networking Symp., IEEE, New York, 2003. · DOI
- J. Jung, A. Berger, H. Balakrishnan, Modeling TTL-based internet caches, in: Proc. IEEE Infocom, 2003. · DOI · Paper page
- J. Jung, E. Sit, H. Balakrishnan, R. Morris, Dns performance and the effectiveness of caching, in: Proc. ACM SIGCOMM Internet Measurement Workshop, 2001. · DOI
- P. Mockapetris, Domain names—concepts and facilities, RFC 1034, 1987. · DOI
- P. Mockapetris, Domain names—implementation and specification, RFC 1035, 1987. · DOI
- A.C.-C. Yao, Probabilistic computations: towards a unified measure of complexity, in: Proc. 17th Annual IEEE Symp. on Foundations of Computer Science, 1977, pp. 222–227. · DOI
Cited by
Sorted by citations
Continuum: Efficient and Robust Multi-Turn LLM Agent Scheduling with KV Cache Time-to-Live
Li, H., He, R., Mang, Q., Zhang, Q., Mao, H., Chen, X., Zhou, H., Zhang, H., Cheung, A., Gonzalez, J., et al. (2025) · arXiv · doi:10.48550/arxiv.2511.02230
“…in Computer Systems: Time-to-live (TTL) is a longstanding abstraction in computer systems de-sign, widely used in DNS resolvers, distributed caches, CDN edge nodes, and consistency protocols to bound staleness and prevent unbounded resource retention [11, 15, 21, 22, 25, 27, 32, 42, 43, 58].”
Metadata
- Authors
- Cohen, E., Halperin, E., & Kaplan, H.
- Affiliations
- AT&T (United States) (US)
- Tel Aviv University (IL)
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2005-02
- Volume
- 331
- Issue
- 1
- Pages
- 73-96
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W1509161927
- Cited by
- 22
- References
- 1
- Citations by year
- 2025: 1 · 2024: 2 · 2023: 1 · 2021: 2 · 2020: 1 · 2015: 1 · 2014: 5 · 2012: 1
- FWCI
- 1.18
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Theoretical Computer Science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance
- Physical Sciences › Computer Science › Computer Networks and Communications › Age of Information Optimization
- Keywords
- distributed caching, time-to-live, weak consistency, origin server, cache performance, consistency models
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
