On the public citation graph

Online Caching Networks with Adversarial Guarantees

https://doi.org/10.1145/3491047
0 signed · 67 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-3-540-72792-7_15openalex-snapshot
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-642-17572-5_20openalex-snapshot
Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms
inferredcites →https://doi.org/10.1007/bf01588971openalex-snapshot
An analysis of approximations for maximizing submodular set functions—I
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.comnet.2017.11.009openalex-snapshot
Joint cache resource allocation and request routing for in-network caching services
inferredcites →https://doi.org/10.1016/j.cosrev.2009.04.002openalex-snapshot
The -server problem
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.peva.2016.01.001openalex-snapshot
Performance models for hierarchy of caches: Application to modern DNS caches
inferredcites →https://doi.org/10.1016/j.peva.2020.102138openalex-snapshot
Fair caching networks
inferredcites →https://doi.org/10.1016/j.tcs.2009.01.016openalex-snapshot
Exploration–exploitation tradeoff using variance estimates in multi-armed bandits
inferredcites →https://doi.org/10.1016/s0022-0000(77)80014-7openalex-snapshot
Asymptotic miss ratios over independent references
inferredcites →https://doi.org/10.1017/cbo9780511546921openalex-snapshot
Prediction, Learning, and Games
inferredcites →https://doi.org/10.1023/b:joco.0000038913.96607.c2openalex-snapshot
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee
inferredcites →https://doi.org/10.1090/dimacs/001openalex-snapshot
Polyhedral Combinatorics
inferredcites →https://doi.org/10.1109/cloud.2018.00042openalex-snapshot
Intermediate Data Caching Optimization for Multi-Stage and Parallel Big Data Frameworks
inferredcites →https://doi.org/10.1109/focs.2010.60openalex-snapshot
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
inferredcites →https://doi.org/10.1109/icc42927.2021.9500487openalex-snapshot
No-Regret Caching via Online Mirror Descent
inferredcites →https://doi.org/10.1109/infcom.2010.5461964openalex-snapshot
Distributed Caching Algorithms for Content Distribution Networks
inferredcites →https://doi.org/10.1109/infocom.2016.7524445openalex-snapshot
A utility optimization approach to network cache design
inferredcites →https://doi.org/10.1109/infocom.2018.8486316openalex-snapshot
DR-Cache: Distributed Resilient Caching with Latency Guarantees
inferredcites →https://doi.org/10.1109/infocom48880.2022openalex-snapshot
IEEE INFOCOM 2022 - IEEE Conference on Computer Communications
inferredcites →https://doi.org/10.1109/isit45174.2021.9517925openalex-snapshot
Online Caching with Optimal Switching Regret
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/jsac.2002.801752openalex-snapshot
Hierarchical Web caching systems: modeling, design and experimental results
inferredcites →https://doi.org/10.1109/jsac.2018.2844981openalex-snapshot
Jointly Optimal Routing and Caching for Arbitrary Network Topologies
inferredcites →https://doi.org/10.1109/jsac.2018.2844982openalex-snapshot
Implicit Coordination of Caches in Small Cell Networks Under Unknown Popularity Profiles
inferredcites →https://doi.org/10.1109/jstsp.2015.2404790openalex-snapshot
Online Convex Optimization in Dynamic Environments
inferredcites →https://doi.org/10.1109/pccc.2004.1395054openalex-snapshot
Meta algorithms for hierarchical Web caches
inferredcites →https://doi.org/10.1109/tit.2013.2281606openalex-snapshot
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
inferredcites →https://doi.org/10.1109/tnet.2018.2793581openalex-snapshot
Adaptive Caching Networks With Optimality Guarantees
inferredcites →https://doi.org/10.1109/twc.2016.2514418openalex-snapshot
Exploiting Caching and Multicast for 5G Wireless Networks
inferredcites →https://doi.org/10.1109/twc.2017.2772897openalex-snapshot
Energy Efficiency in Cache-Enabled Small Cell Networks With Adaptive User Clustering
inferredcites →https://doi.org/10.1137/080733991openalex-snapshot
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
inferredcites →https://doi.org/10.1137/130920277openalex-snapshot
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
inferredcites →https://doi.org/10.1145/1374376.1374475openalex-snapshot
Multi-armed bandits in metric spaces
inferredcites →https://doi.org/10.1145/1390156.1390255openalex-snapshot
Learning diverse rankings with multi-armed bandits
inferredcites →https://doi.org/10.1145/146585.146588openalex-snapshot
An optimal on-line algorithm for metrical task system
inferredcites →https://doi.org/10.1145/1658939.1658941openalex-snapshot
Networking named content
inferredcites →https://doi.org/10.1145/1811039.1811075openalex-snapshot
Distributed caching over heterogeneous mobile networks
inferredcites →https://doi.org/10.1145/2494232.2465533openalex-snapshot
A tale of two metrics
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/2964791.2901467openalex-snapshot
Adaptive Caching Networks with Optimality Guarantees
inferredcites →https://doi.org/10.1145/3239164openalex-snapshot
On the Convergence of the TTL Approximation for an LRU Cache under Independent Stationary Request Processes
inferredcites →https://doi.org/10.1145/3392143openalex-snapshot
Fundamental Limits on the Regret of Online Network-Caching
inferredcites →https://doi.org/10.1145/62212.62243openalex-snapshot
Competitive algorithms for on-line problems
inferredcites →https://doi.org/10.1145/633025.633043openalex-snapshot
Replication strategies in unstructured peer-to-peer networks
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/moor.2016.0807openalex-snapshot
Chasing Demand: Learning and Earning in a Changing Environment
inferredcites →https://doi.org/10.1287/opre.30.2.223openalex-snapshot
Poisson Arrivals See Time Averages
inferredcites →https://doi.org/10.1561/2200000018openalex-snapshot
Online Learning and Online Convex Optimization
inferredcites →https://doi.org/10.1561/2200000050openalex-snapshot
Convex Optimization: Algorithms and Complexity
inferredcites →https://doi.org/10.21236/ada476748openalex-snapshot
An Online Algorithm for Maximizing Submodular Functions
inferredcites →https://doi.org/10.23919/itc2941110.2017openalex-snapshot
2017 29th International Teletraffic Congress (ITC 29)
inferredcites →https://doi.org/10.4086/toc.2012.v008a006openalex-snapshot
inferredcites →https://doi.org/10.5555/1756006.1859902openalex-snapshot
Near-optimal Regret Bounds for Reinforcement Learning

What points at this work

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

inferred← citeshttps://doi.org/10.1016/j.comnet.2024.110341openalex-snapshot
Optimistic online caching for batched requests
inferred← citeshttps://doi.org/10.1109/cic56439.2022.00013openalex-snapshot
Leveraging Synergies Between AI and Networking to Build Next Generation Edge Networks
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/itw54588.2022.9965906openalex-snapshot
Universal Caching
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.2022.3217012openalex-snapshot
Ascent Similarity Caching With Approximate Indexes
inferred← citeshttps://doi.org/10.1145/3508038openalex-snapshot
Robustness and Consistency in Linear Quadratic Control with Untrusted Predictions
inferred← citeshttps://doi.org/10.1145/3570606openalex-snapshot
Enabling Long-term Fairness in Dynamic Resource Allocation
inferred← citeshttps://doi.org/10.1145/3570608openalex-snapshot
Optimistic No-regret Algorithms for Discrete Caching
inferred← citeshttps://doi.org/10.1145/3605209openalex-snapshot
No-regret Caching via Online Mirror Descent
inferred← citeshttps://doi.org/10.23919/ifipnetworking55013.2022.9829806openalex-snapshot
Online Caching with Optimistic Learning
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.