On the public citation graph

On the Convergence of the TTL Approximation for an LRU Cache under Independent Stationary Request Processes

https://doi.org/10.1145/3239164
0 signed · 60 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-9464-8openalex-snapshot
Probability Theory I
inferredcites →https://doi.org/10.1007/978-3-642-46124-8openalex-snapshot
Introduction to Analytic Number Theory
inferredcites →https://doi.org/10.1007/978-3-662-11657-9openalex-snapshot
Elements of Queueing Theory
inferredcites →https://doi.org/10.1007/978-3-662-28579-4openalex-snapshot
Introduction to Analytic Number Theory
inferredcites →https://doi.org/10.1016/0166-218x(92)90177-copenalex-snapshot
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
inferredcites →https://doi.org/10.1016/j.comnet.2014.03.006openalex-snapshot
Performance evaluation of hierarchical TTL-based cache networks
inferredcites →https://doi.org/10.1016/j.peva.2017.09.002openalex-snapshot
TTL approximations of the cache replacement algorithms LRU(m) and h-LRU
inferredcites →https://doi.org/10.1016/j.tcs.2004.07.029openalex-snapshot
Least-recently-used caching with dependent requests
inferredcites →https://doi.org/10.1016/s0022-0000(77)80014-7openalex-snapshot
Asymptotic miss ratios over independent references
inferredcites →https://doi.org/10.1016/s0167-6377(99)00037-1openalex-snapshot
Performance of the move-to-front algorithm with Markov-modulated request sequences
inferredcites →https://doi.org/10.1017/s000186780005045xopenalex-snapshot
A fluid limit for a cache algorithm with general request processes
inferredcites →https://doi.org/10.1017/s0021900200002394openalex-snapshot
Critical sizing of LRU caches with dependent requests
inferredcites →https://doi.org/10.1017/s0021900200118595openalex-snapshot
On a model for storage and search
inferredcites →https://doi.org/10.1109/infcom.2010.5461936openalex-snapshot
Approximate Models for General Cache Networks
inferredcites →https://doi.org/10.1109/jsac.2002.801752openalex-snapshot
Hierarchical Web caching systems: modeling, design and experimental results
inferredcites →https://doi.org/10.1137/0208007openalex-snapshot
Heuristics That Dynamically Organize Data Structures
inferredcites →https://doi.org/10.1137/15m1041444openalex-snapshot
Modeling LEAST RECENTLY USED caches with Shot Noise request processes
inferredcites →https://doi.org/10.1145/2500098.2500106openalex-snapshot
Check before storing
inferredcites →https://doi.org/10.1145/2591971.2592038openalex-snapshot
Exact analysis of TTL cache networks
inferredcites →https://doi.org/10.1145/2637364.2592038openalex-snapshot
Exact analysis of TTL cache networks
inferredcites →https://doi.org/10.1145/2810156.2810161openalex-snapshot
On the Analysis of Caches with Pending Interest Tables
inferredcites →https://doi.org/10.1145/2896377.2901459openalex-snapshot
Optimizing TTL Caches under Heavy-Tailed Demands
inferredcites →https://doi.org/10.1145/2896380openalex-snapshot
A Unified Approach to the Performance Analysis of Caching Systems
inferredcites →https://doi.org/10.1145/98457.98525openalex-snapshot
An approximate analysis of the LRU and FIFO buffer replacement schemes
inferredcites →https://doi.org/10.1214/aoap/1029962750openalex-snapshot
Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
inferredcites →https://doi.org/10.1287/opre.1090.0761openalex-snapshot
Analysis of Page Replacement Policies in the Fluid Limit
inferredcites →https://doi.org/10.4108/icst.valuetools.2014.258168openalex-snapshot
On the Performance of General Cache Networks
inferredcites →https://doi.org/10.48550/arxiv.1202.3974openalex-snapshot
A versatile and accurate approximation for LRU cache performance

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-981-96-0850-8_21openalex-snapshot
Semantic-Integrated Online Audit Log Reduction for Efficient Forensic Analysis
inferred← citeshttps://doi.org/10.1007/s11134-022-09834-yopenalex-snapshot
Why (and when) do asymptotic methods work so well?
inferred← citeshttps://doi.org/10.1016/j.comnet.2020.107379openalex-snapshot
Network cache design under stationary requests: Exact analysis and Poisson approximation
inferred← citeshttps://doi.org/10.1016/j.comnet.2023.109583openalex-snapshot
An overview of analysis methods and evaluation results for caching strategies
inferred← citeshttps://doi.org/10.1016/j.comnet.2024.110206openalex-snapshot
TTL model for an LRU-based similarity caching policy
inferred← citeshttps://doi.org/10.1016/j.peva.2020.102081openalex-snapshot
On the effectiveness of the PIT in reducing upstream demand in an NDN router
inferred← citeshttps://doi.org/10.1016/j.peva.2020.102138openalex-snapshot
Fair caching networks
inferred← citeshttps://doi.org/10.1109/globecom46510.2021.9685954openalex-snapshot
Taking two Birds with one k-NN Cache
inferred← citeshttps://doi.org/10.1109/globecom48099.2022.10000890openalex-snapshot
Computing the Hit Rate of Similarity Caching
inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155221openalex-snapshot
Similarity Caching: Theory and Algorithms
inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155538openalex-snapshot
Flow Table Security in SDN: Adversarial Reconnaissance and Intelligent Attacks
inferred← citeshttps://doi.org/10.1109/infocom42981.2021.9488697openalex-snapshot
Attack Resilience of Cache Replacement Policies
inferred← citeshttps://doi.org/10.1109/ipdps57955.2024.00017openalex-snapshot
Tackling Cold Start in Serverless Computing with Multi-Level Container Reuse
inferred← citeshttps://doi.org/10.1109/mascots.2018.00033openalex-snapshot
Network Cache Design Under Stationary Requests: Exact Analysis and Poisson Approximation
inferred← citeshttps://doi.org/10.1109/tcomm.2021.3061685openalex-snapshot
Jointly Optimizing Throughput and Content Delivery Cost Over Lossy Cache Networks
inferred← citeshttps://doi.org/10.1109/tnet.2020.3047940openalex-snapshot
Selfish Caching Games on Directed Graphs
inferred← citeshttps://doi.org/10.1109/tnet.2021.3099717openalex-snapshot
Flow Table Security in SDN: Adversarial Reconnaissance and Intelligent Attacks
inferred← citeshttps://doi.org/10.1109/tnet.2021.3126368openalex-snapshot
Similarity Caching: Theory and Algorithms
inferred← citeshttps://doi.org/10.1109/tnet.2022.3171720openalex-snapshot
Attack Resilience of Cache Replacement Policies: A Study Based on TTL Approximation
inferred← citeshttps://doi.org/10.1109/tnet.2022.3207914openalex-snapshot
Time-to-Live Caching With Network Delays: Exact Analysis and Computable Approximations
inferred← citeshttps://doi.org/10.1145/3309697.3331491openalex-snapshot
A TTL-based Approach for Data Aggregation in Geo-distributed Streaming Analytics
inferred← citeshttps://doi.org/10.1145/3323679.3326499openalex-snapshot
How Bad is Selfish Caching?
inferred← citeshttps://doi.org/10.1145/3341617.3326144openalex-snapshot
A TTL-based Approach for Data Aggregation in Geo-distributed Streaming Analytics
inferred← citeshttps://doi.org/10.1145/3445814.3446757openalex-snapshot
FaasCache: keeping serverless computing alive with greedy-dual caching
inferred← citeshttps://doi.org/10.1145/3491047openalex-snapshot
Online Caching Networks with Adversarial Guarantees
inferred← citeshttps://doi.org/10.1145/3582014openalex-snapshot
CacheSack: Theory and Experience of Google’s Admission Optimization for Datacenter Flash Caches
inferred← citeshttps://doi.org/10.1145/3605209openalex-snapshot
No-regret Caching via Online Mirror Descent
inferred← citeshttps://doi.org/10.1145/3626111.3628211openalex-snapshot
Caching and Neutrality
inferred← citeshttps://doi.org/10.17760/d20581912openalex-snapshot
Submodularity in cache networks
inferred← citeshttps://doi.org/10.48550/arxiv.1912.03888openalex-snapshot
Similarity Caching: Theory and Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2101.12588openalex-snapshot
No-Regret Caching via Online Mirror Descent
inferred← citeshttps://doi.org/10.48550/arxiv.2111.01594openalex-snapshot
Mean Field and Refined Mean Field Approximations for Heterogeneous Systems: It Works!
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.