Optimizing CDN Modeling with API Integration Using Time To- Live (TTL) Caching Technique
Open accessAbstract
This research examines the implementation of Time-To-Live (TTL) caching within a Content Delivery Network (CDN) model that incorporates API integration, structured to simulate a hierarchical configuration of CDN edge servers across Indonesia's administrative tiers. The analysis centers on the influence of TTL configurations on critical performance metrics—namely latency, cache hit ratio, throughput, and bandwidth consumption. Special focus is placed on scenarios in which a 1 MB data object originating from the Central Government (Level 1) is primarily accessed through edge servers positioned at the village level (Level 5). The simulation envisions a CDN architecture where in the Central Government functions as the Main Server/Origin Server, with edge servers extending across 38 provinces (Level 2), 514 regencies (Level 3), 7,277 districts (Level 4), and 83,763 villages (Level 5).
Integrity signals
Registry
Cites
Statistics
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 [21]
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].”
- Authors
- Hendri, H., Hartati, R. S., Linawati, L., & Wiharta, D. M.
- Affiliations
- Udayana University (ID)
- Venue
- Jurnal Ekonomi Manajemen Sistem Informasi
- Published
- 2024-12-05
- Volume
- 6
- Issue
- 2
- Pages
- 929-943
- ISSN
- 2686-4916 (ISSN-L)
- 2686-5238
- OpenAlex
- W4405050095
- Cited by
- 0
- References
- 0
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- diamond
- doi.org
- Locations
- Jurnal Ekonomi Manajemen Sistem Informasi (publishedVersion, cc-by)
- 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 › Computer Networks and Communications › Software System Performance and Reliability
- Keywords
- content delivery networks, API integration, edge servers, network hierarchy, latency, cache hit rate, throughput, bandwidth consumption, origin server
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
