On the public citation graph

Adaptive Caching Networks with Optimality Guarantees

0 signed · 90 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.1006/jcss.1995.1073openalex-snapshot

Competitive Algorithms for Distributed Data Management

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/b97441openalex-snapshot

Stochastic Approximation and Recursive Algorithms and Applications

inferredcites →https://doi.org/10.1007/s11134-005-1450-0openalex-snapshot

Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

inferredcites →https://doi.org/10.1016/0022-0000(81)90040-4openalex-snapshot

Explicit constructions of linear-sized superconcentrators

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.1023/b:joco.0000038913.96607.c2openalex-snapshot

Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee

inferredcites →https://doi.org/10.1038/30918openalex-snapshot

Collective dynamics of ‘small-world’ networks

inferredcites →https://doi.org/10.1109/infcom.2009.5061964openalex-snapshot

Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search

inferredcites →https://doi.org/10.1109/infcom.2010.5461964openalex-snapshot

Distributed Caching Algorithms for Content Distribution Networks

inferredcites →https://doi.org/10.1109/infcom.2013.6566874openalex-snapshot

On the steady-state of cache networks

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.2015.7218465openalex-snapshot

On the complexity of optimal routing and content caching in heterogeneous networks

inferredcites →https://doi.org/10.1109/itc.2015.11openalex-snapshot

Designing Adaptive Replication Schemes in Distributed Content Delivery 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.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/tpds.2004.13openalex-snapshot

Second-level buffer cache management

inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot

Emergence of Scaling in Random Networks

inferredcites →https://doi.org/10.1137/080715421openalex-snapshot

Approximation Algorithms for Data Placement Problems

inferredcites →https://doi.org/10.1137/s0895480192243516openalex-snapshot

New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem

inferredcites →https://doi.org/10.1145/1374376.1374389openalex-snapshot

Optimal approximation for the submodular welfare problem in the value oracle model

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/1824777.1824783openalex-snapshot

Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

inferredcites →https://doi.org/10.1145/1921168.1921174openalex-snapshot

Optimal content placement for a large-scale VoD system

inferredcites →https://doi.org/10.1145/2254756.2254764openalex-snapshot

Bipartite graph structures for efficient balancing of heterogeneous loads

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/2591635.2667182openalex-snapshot

Search and replication in unstructured peer-to-peer networks

inferredcites →https://doi.org/10.1145/2637364.2592038openalex-snapshot

Exact analysis of TTL cache networks

inferredcites →https://doi.org/10.1145/2660129.2660151openalex-snapshot

VIP

inferredcites →https://doi.org/10.1145/2896377.2901467openalex-snapshot

Adaptive Caching Networks with Optimality Guarantees

inferredcites →https://doi.org/10.1145/335305.335325openalex-snapshot

The small-world phenomenon

inferredcites →https://doi.org/10.1145/514191.514206openalex-snapshot

Search and replication in unstructured peer-to-peer networks

inferredcites →https://doi.org/10.1145/633025.633043openalex-snapshot

Replication strategies in unstructured peer-to-peer networks

inferredcites →https://doi.org/10.1163/9789004337862_lgbo_com_161117openalex-snapshot

Princeton University Press

inferredcites →https://doi.org/10.4108/valuetools.2012.250250openalex-snapshot

Analysis of TTL-based 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.2139/ssrn.4174814openalex-extracted

A Collaborative Cache Allocation Strategy for Performance and Link Cost in Mobile Edge Computing

inferred← citeshttps://doi.org/10.1007/978-3-030-92511-6_1openalex-snapshot

A TTL-based Approach for Content Placement in Edge Networks

inferred← citeshttps://doi.org/10.1007/s10586-024-04543-yopenalex-snapshot

Soft computing approaches for dynamic multi-objective evaluation of computational offloading: a literature review

inferred← citeshttps://doi.org/10.1016/j.comnet.2017.03.005openalex-snapshot

Enabling opportunistic search and placement in cache networks

inferred← citeshttps://doi.org/10.1016/j.comnet.2023.109654openalex-snapshot

Privacy-preserving edge caching: A probabilistic approach

inferred← citeshttps://doi.org/10.1016/j.comnet.2024.110341openalex-snapshot

Optimistic online caching for batched requests

inferred← citeshttps://doi.org/10.1016/j.peva.2020.102138openalex-snapshot

Fair caching networks

inferred← citeshttps://doi.org/10.1109/cloud.2018.00042openalex-snapshot

Intermediate Data Caching Optimization for Multi-Stage and Parallel Big Data Frameworks

inferred← citeshttps://doi.org/10.1109/cloud53861.2021.00058openalex-snapshot

SODA: A Semantics-Aware Optimization Framework for Data-Intensive Applications Using Hybrid Program Analysis

inferred← citeshttps://doi.org/10.1109/globecom42002.2020.9322369openalex-snapshot

Optimal Proactive Caching Placement for Named Data Networking with Interest Aggregation

inferred← citeshttps://doi.org/10.1109/icc45041.2023.10279235openalex-snapshot

Jointly Optimal Routing and Caching with Bounded Link Capacities

inferred← citeshttps://doi.org/10.1109/iccnc.2019.8685587openalex-snapshot

Optimal Cache Allocation under Network-Wide Capacity Constraint

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/infocom.2019.8737377openalex-snapshot

Kelly Cache Networks

inferred← citeshttps://doi.org/10.1109/infocom.2019.8737407openalex-snapshot

Cache Network Management Using BIG Cache Abstraction

inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155416openalex-snapshot

Universally Stable Cache Networks

inferred← citeshttps://doi.org/10.1109/infocom42981.2021.9488715openalex-snapshot

Rate Allocation and Content Placement in Cache Networks

inferred← citeshttps://doi.org/10.1109/infocom42981.2021.9488757openalex-snapshot

GRADES: Gradient Descent for Similarity Caching

inferred← citeshttps://doi.org/10.1109/isit.2015.7282567openalex-snapshot

Cache-Aided Interference Channels

inferred← citeshttps://doi.org/10.1109/iwqos65803.2025.11143377openalex-snapshot

AoI-Constrained Scheduling for Information Freshness Over Unreliable Channels

inferred← citeshttps://doi.org/10.1109/jsac.2018.2844943openalex-snapshot

Updating Content in Cache-Aided Coded Multicast

inferred← citeshttps://doi.org/10.1109/jsac.2018.2844981openalex-snapshot

Jointly Optimal Routing and Caching for Arbitrary Network Topologies

inferred← citeshttps://doi.org/10.1109/medcomnet52149.2021.9501272openalex-snapshot

Towards Inference Delivery Networks: Distributing Machine Learning with Optimality Guarantees

inferred← citeshttps://doi.org/10.1109/ojcoms.2021.3075071openalex-snapshot

Trend-Aware Proactive Caching via Tensor Train Decomposition: A Bayesian Viewpoint

inferred← citeshttps://doi.org/10.1109/tcomm.2020.3015478openalex-snapshot

Online Spatiotemporal Popularity Learning via Variational Bayes for Cooperative Caching

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.3015474openalex-snapshot

Counterintuitive Characteristics of Optimal Distributed LRU Caching Over Unreliable Channels

inferred← citeshttps://doi.org/10.1109/tnet.2020.3047940openalex-snapshot

Selfish Caching Games on Directed Graphs

inferred← citeshttps://doi.org/10.1109/tnet.2021.3102518openalex-snapshot

Cache Networks of Counting Queues

inferred← citeshttps://doi.org/10.1109/tnet.2021.3133215openalex-snapshot

Optimal Caching for Low Latency in Distributed Coded Storage Systems

inferred← citeshttps://doi.org/10.1109/tnet.2022.3187044openalex-snapshot

GRADES: Gradient Descent for Similarity Caching

inferred← citeshttps://doi.org/10.1109/tnet.2022.3217012openalex-snapshot

Ascent Similarity Caching With Approximate Indexes

inferred← citeshttps://doi.org/10.1109/tnet.2023.3305922openalex-snapshot

Toward Inference Delivery Networks: Distributing Machine Learning With Optimality Guarantees

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.2023.3334559openalex-snapshot

Management of Caching Policies and Redundancy Over Unreliable Channels

inferred← citeshttps://doi.org/10.1109/wcnc57260.2024.10571283openalex-snapshot

Energy Minimization via Joint Caching and Power Control in Wireless Heterogeneous Networks

inferred← citeshttps://doi.org/10.1145/3224427openalex-snapshot

Practical Bounds on Optimal Caching with Variable Object Sizes

inferred← citeshttps://doi.org/10.1145/3453953.3453973openalex-snapshot

Fair Caching Networks

inferred← citeshttps://doi.org/10.1145/3489048.3522632openalex-snapshot

Online Caching Networks with Adversarial Guarantees

inferred← citeshttps://doi.org/10.1145/3491047openalex-snapshot

Online Caching Networks with Adversarial Guarantees

inferred← citeshttps://doi.org/10.1145/3547353.3522632openalex-snapshot

Online Caching Networks with Adversarial Guarantees

inferred← citeshttps://doi.org/10.1145/3579342.3579348openalex-snapshot

Online Learning for Network Resource Allocation

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.1287/moor.2022.0101openalex-snapshot

(Close to) Optimal Policies for Finite Horizon Restless Bandits

inferred← citeshttps://doi.org/10.1609/aaai.v38i13.29425openalex-snapshot

Online Submodular Maximization via Online Convex Optimization

inferred← citeshttps://doi.org/10.17760/d20398270openalex-snapshot

Optimization of data-intensive computing networks

inferred← citeshttps://doi.org/10.23919/wiopt66569.2025.11123337openalex-snapshot

LOAM: Low-Latency Communication, Caching and Computation in Data-Intensive Computing Networks

inferred← citeshttps://doi.org/10.48550/arxiv.1710.05130openalex-snapshot

MinDelay: Low-latency Forwarding and Caching Algorithms for Information-Centric Networks

inferred← citeshttps://doi.org/10.48550/arxiv.1712.03336openalex-snapshot

Mobile Edge Caching: An Optimal Auction Approach

inferred← citeshttps://doi.org/10.48550/arxiv.1801.02099openalex-snapshot

Joint Data Compression and Caching: Approaching Optimality with Guarantees

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.