On the public citation graph
Fundamental Limits on the Regret of Online Network-Caching
0 signed · 70 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.1007/3-540-48228-8_12openalex-snapshot
Role of Aging, Frequency, and Size in Web Cache Replacement Policies
inferredcites →https://doi.org/10.1007/3-540-49543-6_13openalex-snapshot
“Balls into Bins” — A Simple and Tight Analysis
inferredcites →https://doi.org/10.1007/s10994-007-5016-8openalex-snapshot
Logarithmic regret algorithms for online convex optimization
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.spl.2013.01.023openalex-snapshot
A sharp estimate of the binomial mean absolute deviation with applications
inferredcites →https://doi.org/10.1017/cbo9780511546921openalex-snapshot
Prediction, Learning, and Games
inferredcites →https://doi.org/10.1109/icme.2001openalex-snapshot
IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.
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.2013.6566874openalex-snapshot
On the steady-state of cache networks
inferredcites →https://doi.org/10.1109/infocom.2019.8737446openalex-snapshot
Learning to Cache With No Regrets
inferredcites →https://doi.org/10.1109/jiot.2019.2935742openalex-snapshot
Joint Caching and Routing in Congestible Networks of Arbitrary Topology
inferredcites →https://doi.org/10.1109/mcom.2016.7537173openalex-snapshot
Coding for caching: fundamental limits and practical challenges
inferredcites →https://doi.org/10.1109/msst.2010.5496972openalex-snapshot
The Hadoop Distributed File System
inferredcites →https://doi.org/10.1109/spawc.2015.7227127openalex-snapshot
On the fundamental limits of caching in combination networks
inferredcites →https://doi.org/10.1109/tit.2010.2054295openalex-snapshot
Network Coding for Distributed Storage Systems
inferredcites →https://doi.org/10.1109/tit.2013.2281606openalex-snapshot
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
inferredcites →https://doi.org/10.1109/tit.2014.2306938openalex-snapshot
Fundamental Limits of Caching
inferredcites →https://doi.org/10.1109/tit.2015.2504556openalex-snapshot
Fundamental Limits of Caching in Wireless D2D Networks
inferredcites →https://doi.org/10.1109/tmm.2015.2458043openalex-snapshot
Unravelling the Impact of Temporal and Geographical Locality in Content Caching Systems
inferredcites →https://doi.org/10.1109/tpds.2007.1119openalex-snapshot
rStream: Resilient and Optimal Peer-to-Peer Streaming with Rateless Codes
inferredcites →https://doi.org/10.1145/1005686.1005722openalex-snapshot
The output of a cache under the independent reference model
inferredcites →https://doi.org/10.1145/1453175.1453203openalex-snapshot
Characterizing the miss sequence of the LRU cache
inferredcites →https://doi.org/10.1145/2805789.2805800openalex-snapshot
Algorithmic Nuggets in Content Delivery
inferredcites →https://doi.org/10.1145/301453.301487openalex-snapshot
On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies
inferredcites →https://doi.org/10.1145/3097895.3097902openalex-snapshot
VR/AR Immersive Communication
inferredcites →https://doi.org/10.1145/3219617.3219627openalex-snapshot
Practical Bounds on Optimal Caching with Variable Object Sizes
inferredcites →https://doi.org/10.1145/322248.322254openalex-snapshot
Expected Length of the Longest Probe Sequence in Hash Code Searching
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.1561/0100000104openalex-snapshot
Cache Optimization Models and Algorithms
inferredcites →https://doi.org/10.1561/2200000018openalex-snapshot
Online Learning and Online Convex Optimization
inferredcites →https://doi.org/10.17487/rfc6330openalex-snapshot
RaptorQ Forward Error Correction Scheme for Object Delivery
inferredcites →https://doi.org/10.23919/ifipnetworking.2017.8264840openalex-snapshot
Model-based design and analysis of cache hierarchies
inferredcites →https://doi.org/10.5555/2627435.2670328openalex-snapshot
Beyond the regret minimization barrier
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-031-31234-2_17openalex-snapshot
Renting Edge Computing Resources for Service Hosting
inferred← citeshttps://doi.org/10.1016/j.comnet.2024.110341openalex-snapshot
Optimistic online caching for batched requests
inferred← citeshttps://doi.org/10.1016/j.comnet.2025.111743openalex-snapshot
Low-Complexity online learning for caching
inferred← citeshttps://doi.org/10.1016/j.peva.2023.102367openalex-snapshot
On the regret of online edge service hosting
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.1109/cncit65643.2025.11282800openalex-snapshot
Modeling and Optimizing Latency for Delayed Hit Caching with Stochastic Miss Latency
inferred← citeshttps://doi.org/10.1109/comsnets63942.2025.10885656openalex-snapshot
Regret-Optimal Policies for Rental Caches
inferred← citeshttps://doi.org/10.1109/icassp48485.2024.10446753openalex-snapshot
Online Caching With Switching Cost and Operational Long-Term Constraints: An Online Learning Approach
inferred← citeshttps://doi.org/10.1109/iscc61673.2024.10733714openalex-snapshot
SwiftOGA: An Efficient and Swift Online Gradient Ascent Algorithm for Caching Replacement
inferred← citeshttps://doi.org/10.1109/itw61385.2024.10806966openalex-snapshot
On the Regret of Coded Caching with Adversarial Requests
inferred← citeshttps://doi.org/10.1109/lnet.2024.3516321openalex-snapshot
SAcache: A Strongly Adaptive Online Caching Scheme for Non-Stationary Environments
inferred← citeshttps://doi.org/10.1109/lnet.2025.3529461openalex-snapshot
Efficient Regret-Optimal Online Caching
inferred← citeshttps://doi.org/10.1109/main71116.2026.11622383openalex-snapshot
Optimistic Online Caching with Switching Costs and Dynamic Batched Requests
inferred← citeshttps://doi.org/10.1109/ncc60321.2024.10485776openalex-snapshot
On the Regret of Online Coded Caching
inferred← citeshttps://doi.org/10.1109/tmc.2023.3317943openalex-snapshot
Online Caching With no Regret: Optimistic Learning via Recommendations
inferred← citeshttps://doi.org/10.1109/tnet.2021.3077115openalex-snapshot
Asymptotically Optimal Online Caching on Multiple Caches With Relaying and Bypassing
inferred← citeshttps://doi.org/10.1109/tnet.2021.3105880openalex-snapshot
Learning to Cache and Caching to Learn: Regret Analysis of Caching Algorithms
inferred← citeshttps://doi.org/10.1109/tnet.2022.3217012openalex-snapshot
Ascent Similarity Caching With Approximate Indexes
inferred← citeshttps://doi.org/10.1109/tnet.2024.3417351openalex-snapshot
Whittle Index-Based Q-Learning for Wireless Edge Caching With Linear Function Approximation
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/tsc.2023.3303344openalex-snapshot
Scheduling Multi-Server Jobs With Sublinear Regrets via Online Learning
inferred← citeshttps://doi.org/10.1109/tsc.2024.3451163openalex-snapshot
Optimal Caching for Partial-Observation Regime and Beyond
inferred← citeshttps://doi.org/10.1109/vcc60689.2023.10474978openalex-snapshot
No- Regret Caching with Noisy Request Estimates
inferred← citeshttps://doi.org/10.1109/wf-iot62078.2024.10811458openalex-snapshot
Cloud-Edge Resource Management and Migration: Leveraging Online Learning for Digital Twin Re-placement
inferred← citeshttps://doi.org/10.1145/3491047openalex-snapshot
Online Caching Networks with Adversarial Guarantees
inferred← citeshttps://doi.org/10.1145/3595244.3595257openalex-snapshot
On the Regret of Online Edge Service Hosting
inferred← citeshttps://doi.org/10.1145/3605209openalex-snapshot
No-regret Caching via Online Mirror Descent
inferred← citeshttps://doi.org/10.23919/wiopt58741.2023.10349889openalex-snapshot
Age-Based Cache Updating Under Timestomping
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.