On the public citation graph
Practical Bounds on Optimal Caching with Variable Object Sizes
0 signed · 126 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199605)8:3<179::aid-rsa2>3.0.co;2-vopenalex-snapshot
On the distribution of search cost for the move-to-front rule
inferredcites →https://doi.org/10.1002/9781118909690.ch16openalex-snapshot
Overlay Networks: An Akamai Perspective
inferredcites →https://doi.org/10.1006/jagm.2000.1099openalex-snapshot
On-Line Paging Against Adversarially Biased Random Inputs
inferredcites →https://doi.org/10.1007/978-1-4419-7997-1openalex-snapshot
Handbook of Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-1-4612-0801-3_5openalex-snapshot
The Move-To-Front Rule for Self-Organizing Lists with Markov Dependent Requests
inferredcites →https://doi.org/10.1007/978-1-4684-2694-6_18openalex-snapshot
A Unified Approach to the Evaluation of a Class of Replacement Algorithms
inferredcites →https://doi.org/10.1007/978-1-4757-3023-4openalex-snapshot
Handbook of Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-662-48971-0_11openalex-snapshot
General Caching Is Hard: Even with Small Pages
inferredcites →https://doi.org/10.1007/s00453-011-9502-9openalex-snapshot
Caching Is Hard—Even in the Fault Model
inferredcites →https://doi.org/10.1007/s00453-013-9771-6openalex-snapshot
A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
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.2004.01.004openalex-snapshot
Modeling correlations in web traces and implications for designing replacement policies
inferredcites →https://doi.org/10.1016/j.comnet.2007.12.006openalex-snapshot
Approximate analysis of LRU in the case of short term correlations
inferredcites →https://doi.org/10.1016/j.peva.2012.05.008openalex-snapshot
Fluid limit analysis of FIFO and RR caching for independent reference models
inferredcites →https://doi.org/10.1016/j.peva.2013.10.004openalex-snapshot
Performance evaluation of the random replacement policy for networks of caches
inferredcites →https://doi.org/10.1016/j.peva.2014.07.001openalex-snapshot
Exact analysis of TTL cache networks
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/s0166-5316(01)00045-1openalex-snapshot
Probabilistic methods for web caching
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/s0001867800005498openalex-snapshot
The Coupon Collector's Problem Revisited: Asymptotics of the Variance
inferredcites →https://doi.org/10.1017/s0021900200004599openalex-snapshot
The Generalised Coupon Collector Problem
inferredcites →https://doi.org/10.1017/s0021900200008639openalex-snapshot
A Generalized Coupon Collector Problem
inferredcites →https://doi.org/10.1017/s0021900200094870openalex-snapshot
The stationary distribution of an interesting Markov chain
inferredcites →https://doi.org/10.1017/s0021900200103560openalex-snapshot
The performance of the move-to-front scheme under some particular forms of Markov requests
inferredcites →https://doi.org/10.1017/s0021900200118595openalex-snapshot
On a model for storage and search
inferredcites →https://doi.org/10.1017/s096354830400625xopenalex-snapshot
Optimizing LRU Caching for Variable Document Sizes
inferredcites →https://doi.org/10.1103/physreve.80.046110openalex-snapshot
Random graph models for directed acyclic networks
inferredcites →https://doi.org/10.1109/12.286300openalex-snapshot
A comparison of trace-sampling techniques for multi-megabyte caches
inferredcites →https://doi.org/10.1109/99.660313openalex-snapshot
OpenMP: an industry standard API for shared-memory programming
inferredcites →https://doi.org/10.1109/hpca.2015.7056022openalex-snapshot
Talus: A simple way to remove cliffs in cache performance
inferredcites →https://doi.org/10.1109/hpca.2016.7446067openalex-snapshot
Modeling cache performance beyond LRU
inferredcites →https://doi.org/10.1109/infcom.1999.749260openalex-snapshot
Web caching and Zipf-like distributions: evidence and implications
inferredcites →https://doi.org/10.1109/infcom.2001.916636openalex-snapshot
A randomized Web-cache replacement scheme
inferredcites →https://doi.org/10.1109/infcom.2003.1208694openalex-snapshot
Optimal replacement policies for nonuniform cache objects with optional eviction
inferredcites →https://doi.org/10.1109/infocom.2014.6848145openalex-snapshot
A unified approach to the performance analysis of caching systems
inferredcites →https://doi.org/10.1109/infocom.2016.7524381openalex-snapshot
Popularity-driven content caching
inferredcites →https://doi.org/10.1109/infocom.2017.8057192openalex-snapshot
Cache policies for linear utility maximization
inferredcites →https://doi.org/10.1109/isca.2016.17openalex-snapshot
Back to the Future: Leveraging Belady's Algorithm for Improved Cache Replacement
inferredcites →https://doi.org/10.1109/jsac.2002.801752openalex-snapshot
Hierarchical Web caching systems: modeling, design and experimental results
inferredcites →https://doi.org/10.1109/pdp.2014.34openalex-snapshot
TinyLFU: A Highly Efficient Cache Admission Policy
inferredcites →https://doi.org/10.1109/tc.1973.5009115openalex-snapshot
A Unified Approach to the Evaluation of a Class of Replacement Algorithms
inferredcites →https://doi.org/10.1109/tc.2002.1047757openalex-snapshot
PC-OPT: optimal offline prefetching and caching for parallel I/O systems
inferredcites →https://doi.org/10.1109/tmc.2016.2610978openalex-snapshot
Optimal Device-Aware Caching
inferredcites →https://doi.org/10.1109/tnet.2017.2783623openalex-snapshot
Cache Policies for Linear Utility Maximization
inferredcites →https://doi.org/10.1109/wsc.2016.7822347openalex-snapshot
Simulation and optimization of Content Delivery Networks considering user profiles and preferences of Internet Service Providers
inferredcites →https://doi.org/10.1137/1.9781611974317.13openalex-snapshot
A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem
inferredcites →https://doi.org/10.1145/1374376.1374441openalex-snapshot
Faster approximate lossy generalized flow via interior point algorithms
inferredcites →https://doi.org/10.1145/170035.170081openalex-snapshot
The LRU-K page replacement algorithm for database disk buffering
inferredcites →https://doi.org/10.1145/170036.170081openalex-snapshot
The LRU-K page replacement algorithm for database disk buffering
inferredcites →https://doi.org/10.1145/2254756.2254810openalex-snapshot
Performance evaluation of the random replacement policy for networks of caches
inferredcites →https://doi.org/10.1145/2318857.2254810openalex-snapshot
Performance evaluation of the random replacement policy for networks of caches
inferredcites →https://doi.org/10.1145/2517349.2522722openalex-snapshot
An analysis of Facebook photo caching
inferredcites →https://doi.org/10.1145/258533.258666openalex-snapshot
Page replacement with multi-size pages and applications to Web caching
inferredcites →https://doi.org/10.1145/2637364.2592038openalex-snapshot
Exact analysis of TTL cache networks
inferredcites →https://doi.org/10.1145/2745844.2745850openalex-snapshot
Transient and Steady-state Regime of a Family of List-based Cache Replacement Algorithms
inferredcites →https://doi.org/10.1145/2805789.2805800openalex-snapshot
Algorithmic Nuggets in Content Delivery
inferredcites →https://doi.org/10.1145/2825236.2825259openalex-snapshot
Maximizing Cache Hit Ratios by Variance Reduction
inferredcites →https://doi.org/10.1145/2896377.2901459openalex-snapshot
Optimizing TTL Caches under Heavy-Tailed Demands
inferredcites →https://doi.org/10.1145/2896377.2901467openalex-snapshot
Adaptive Caching Networks with Optimality Guarantees
inferredcites →https://doi.org/10.1145/2964791.2901459openalex-snapshot
Optimizing TTL Caches under Heavy-Tailed Demands
inferredcites →https://doi.org/10.1145/2964791.2901467openalex-snapshot
Adaptive Caching Networks with Optimality Guarantees
inferredcites →https://doi.org/10.1145/300515.300518openalex-snapshot
An optimality proof of the LRU- K page replacement algorithm
inferredcites →https://doi.org/10.1145/3017992openalex-snapshot
Some Mathematical Facts About Optimal Cache Replacement
inferredcites →https://doi.org/10.1145/321623.321632openalex-snapshot
Principles of Optimal Page Replacement
inferredcites →https://doi.org/10.1145/3592626.3592635openalex-snapshot
Caching Proxies: Limitations and Potentials
inferredcites →https://doi.org/10.1145/502102.502107openalex-snapshot
A unified approach to approximating resource allocation and scheduling
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.1147/sj.52.0078openalex-snapshot
A study of replacement algorithms for a virtual-storage computer
inferredcites →https://doi.org/10.1147/sj.92.0078openalex-snapshot
Evaluation techniques for storage hierarchies
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.1214/aoap/1177005586openalex-snapshot
The Height of a Random Partial Order: Concentration of Measure
inferredcites →https://doi.org/10.1214/aoms/1177730150openalex-snapshot
A Non-Parametric Test of Independence
inferredcites →https://doi.org/10.1239/jap/1324046020openalex-snapshot
A Generalized Coupon Collector Problem
inferredcites →https://doi.org/10.1239/jap/1437658606openalex-snapshot
New Results on a Generalized Coupon Collector Problem Using Markov Chains
inferredcites →https://doi.org/10.1287/opre.13.4.609openalex-snapshot
On Serial Files with Relocatable Records
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.2307/2980979openalex-snapshot
An Introduction to Probability Theory and its Applications.
inferredcites →https://doi.org/10.48550/arxiv.1202.3974openalex-snapshot
A versatile and accurate approximation for LRU cache performance
inferredcites →https://doi.org/10.48550/arxiv.1312.3905openalex-snapshot
A Combinatorial $\tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem
inferredcites →https://doi.org/10.48550/arxiv.1402.5245openalex-snapshot
New results on a generalized coupon collector problem using Markov chains
inferredcites →https://doi.org/10.5555/3042094.3042485openalex-snapshot
Simulation and optimization of content delivery networks considering user profiles and preferences of internet service providers
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-3-030-78618-2_8openalex-snapshot
SACache: Size-Aware Load Balancing for Large-Scale Storage Systems
inferred← citeshttps://doi.org/10.1016/j.comnet.2020.107332openalex-snapshot
On formulation of online algorithm and framework of near-optimally tractable eviction for nonuniform caches
inferred← citeshttps://doi.org/10.1016/j.comnet.2023.109607openalex-snapshot
DySO: Enhancing application offload efficiency on programmable switches
inferred← citeshttps://doi.org/10.1016/j.comnet.2025.111335openalex-snapshot
MoTor: Resource-efficient cloud-native network acceleration with programmable switches
inferred← citeshttps://doi.org/10.1016/j.peva.2020.102149openalex-snapshot
Prefetching and caching for minimizing service costs: Optimal and approximation strategies
inferred← citeshttps://doi.org/10.1016/j.peva.2025.102488openalex-snapshot
Optimizing latency for caching with delayed hits in non-stationary environment
inferred← citeshttps://doi.org/10.1016/j.peva.2026.102586openalex-snapshot
Quantized Online Gradient Descent for constant-time caching with dynamic regret guarantees
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.036openalex-snapshot
Finding optimal non-datapath caching strategies via network flow
inferred← citeshttps://doi.org/10.1109/globecom48099.2022.10001030openalex-snapshot
End-to-End Deep Learning Proactive Content Caching Framework
inferred← citeshttps://doi.org/10.1109/hpca61900.2025.00060openalex-snapshot
From Optimal to Practical: Efficient Micro-op Cache Replacement Policies for Data Center Applications
inferred← citeshttps://doi.org/10.1109/iccc56324.2022.10065823openalex-snapshot
ARC-learning: A Self-tuning Cache Policy under Dynamic Popularity
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00373openalex-snapshot
LBSC: A Cost-Aware Caching Framework for Cloud Databases
inferred← citeshttps://doi.org/10.1109/infocom.2019.8737363openalex-snapshot
Counterintuitive Characteristics of Optimal Distributed LRU Caching Over Unreliable Channels
inferred← citeshttps://doi.org/10.1109/noms59830.2024.10575387openalex-snapshot
Latency-Aware Cache Mechanism for Resolver Service of Domain Name Systems
inferred← citeshttps://doi.org/10.1109/tcc.2025.3612700openalex-snapshot
Cloud Data Optimization: Lightweight Caching With Precise Bounds and Post-Cloud Metrics
inferred← citeshttps://doi.org/10.1109/tnet.2020.3015474openalex-snapshot
Counterintuitive Characteristics of Optimal Distributed LRU Caching Over Unreliable Channels
inferred← citeshttps://doi.org/10.1109/tnet.2024.3495522openalex-snapshot
Smoothed Online Decision Making in Communication: Algorithms and Applications
inferred← citeshttps://doi.org/10.1109/tnsm.2021.3053645openalex-snapshot
PA-Cache: Evolving Learning-Based Popularity- Aware Content Caching in Edge Networks
inferred← citeshttps://doi.org/10.1109/tpds.2024.3452096openalex-snapshot
Beyond Belady to Attain a Seemingly Unattainable Byte Miss Ratio for Content Delivery Networks
inferred← citeshttps://doi.org/10.1145/3286062.3286082openalex-snapshot
Towards Lightweight and Robust Machine Learning for CDN Caching
inferred← citeshttps://doi.org/10.1145/3305218.3305253openalex-snapshot
Maximizing Page-Level Cache Hit Ratios in LargeWeb Services
inferred← citeshttps://doi.org/10.1145/3379472openalex-snapshot
Optimal Data Placement for Heterogeneous Cache, Memory, and Storage Systems
inferred← citeshttps://doi.org/10.1145/3393691.3394229openalex-snapshot
Optimal Data Placement for Heterogeneous Cache, Memory, and Storage Systems
inferred← citeshttps://doi.org/10.1145/3410048.3410098openalex-snapshot
Optimal Data Placement for Heterogeneous Cache, Memory, and Storage Systems
inferred← citeshttps://doi.org/10.1145/3453953.3453985openalex-snapshot
A New Upper Bound on Cache Hit Probability for Non-anticipative Caching Policies
inferred← citeshttps://doi.org/10.1145/3485983.3494855openalex-snapshot
Learning from optimal caching for content delivery
inferred← citeshttps://doi.org/10.1145/3507920openalex-snapshot
Lightweight Robust Size Aware Cache Management
inferred← citeshttps://doi.org/10.1145/3547332openalex-snapshot
A New Upper Bound on Cache Hit Probability for Non-Anticipative Caching Policies
inferred← citeshttps://doi.org/10.1145/3558481.3591085openalex-snapshot
Increment - and - Freeze: Every Cache, Everywhere, All of the Time
inferred← citeshttps://doi.org/10.1145/3629526.3645037openalex-snapshot
A Learning-Based Caching Mechanism for Edge Content Delivery
inferred← citeshttps://doi.org/10.1145/3639297openalex-snapshot
PreVision: An Out-of-Core Matrix Computation System with Optimal Buffer Replacement
inferred← citeshttps://doi.org/10.1145/3700426openalex-snapshot
ScaleOPT: A Scalable Optimal Page Replacement Policy Simulator
inferred← citeshttps://doi.org/10.21203/rs.3.rs-8013149/v1openalex-snapshot
Characterizing Attention-Based Sequence Models for WirelessEdge Cache Replacement: A Short-Horizon Steady-StateBaseline
inferred← citeshttps://doi.org/10.25148/etd.fidc009577openalex-snapshot
A Study of Non-datapath Cache Replacement Algorithms
inferred← citeshttps://doi.org/10.4236/jsea.2026.193006openalex-snapshot
Investigation of Object-Based Web Caching Using a Framework Model for User Request Access Patterns
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.