On the public citation graph
Access-Time-Aware Cache Algorithms
0 signed · 52 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/11561071_61openalex-snapshot
Online Primal-Dual Algorithms for Covering and Packing Problems
inferredcites →https://doi.org/10.1016/0196-6774(91)90041-vopenalex-snapshot
Competitive paging algorithms
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/s0022-0000(77)80014-7openalex-snapshot
Asymptotic miss ratios over independent references
inferredcites →https://doi.org/10.1016/s0166-5316(01)00045-1openalex-snapshot
Probabilistic methods for web caching
inferredcites →https://doi.org/10.1017/s096354830400625xopenalex-snapshot
Optimizing LRU Caching for Variable Document Sizes
inferredcites →https://doi.org/10.1108/k.2009.06738aae.003openalex-snapshot
Encyclopedia of Algorithms
inferredcites →https://doi.org/10.1109/2.675641openalex-snapshot
Advances in disk technology: performance issues
inferredcites →https://doi.org/10.1109/infcomw.2012.6193511openalex-snapshot
Impact of traffic mix on caching performance in a content-centric network
inferredcites →https://doi.org/10.1109/infocom.2014.6847938openalex-snapshot
Multi-Terabyte and multi-Gbps information centric routers
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.7524380openalex-snapshot
Placing dynamic content in caches with small population
inferredcites →https://doi.org/10.1109/infocom.2017.8057192openalex-snapshot
Cache policies for linear utility maximization
inferredcites →https://doi.org/10.1109/itc-28.2016.127openalex-snapshot
Access-Time Aware Cache Algorithms
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/tnet.2016.2541320openalex-snapshot
Coordinated Selfish Distributed Caching for Peering Content-Centric Networks
inferredcites →https://doi.org/10.1109/tpds.2015.2433296openalex-snapshot
Cost-Aware Caching: Caching More (Costly Items) for Less (ISPs Operational Expenditures)
inferredcites →https://doi.org/10.1145/2541468.2541470openalex-snapshot
Temporal locality in today's content caching
inferredcites →https://doi.org/10.1145/2805789.2805800openalex-snapshot
Algorithmic Nuggets in Content Delivery
inferredcites →https://doi.org/10.1145/2896380openalex-snapshot
A Unified Approach to the Performance Analysis of Caching Systems
inferredcites →https://doi.org/10.1145/301453.301482openalex-snapshot
Modeling and optimizing I/O throughput of multiple disks on a bus
inferredcites →https://doi.org/10.23919/wiopt47501.2019.9144104openalex-snapshot
The 17th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2019)
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-032-05792-1_12openalex-snapshot
A Product-Form Model for Systems with Aging Objects and Similarities
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.110341openalex-snapshot
Optimistic online caching for batched requests
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.2025.102488openalex-snapshot
Optimizing latency for caching with delayed hits in non-stationary environment
inferred← citeshttps://doi.org/10.1109/bdcat50828.2020.00020openalex-snapshot
AGAMI: Scalable Visual Analytics over Multidimensional Data Streams
inferred← citeshttps://doi.org/10.1109/globecom46510.2021.9686003openalex-snapshot
Caching Heterogeneous Size Content in Small Cell Networks with CoMP Joint Transmissions
inferred← citeshttps://doi.org/10.1109/icc42927.2021.9500487openalex-snapshot
No-Regret Caching via Online Mirror Descent
inferred← citeshttps://doi.org/10.1109/icc45041.2023.10278692openalex-snapshot
Optimistic Online Caching for Batched Requests
inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155221openalex-snapshot
Similarity Caching: Theory and Algorithms
inferred← citeshttps://doi.org/10.1109/jsyst.2020.2991928openalex-snapshot
PPO-DFK: A Privacy-Preserving Optimization of Distributed Fractional Knapsack With Application in Secure Footballer Configurations
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/tmc.2020.3045104openalex-snapshot
Optimal Scheduling of Age-Centric Caching: Tractability and Computation
inferred← citeshttps://doi.org/10.1109/tnet.2019.2913677openalex-snapshot
A Utility Optimization Approach to Network Cache Design
inferred← citeshttps://doi.org/10.1109/tnet.2020.2980105openalex-snapshot
Elastic Provisioning of Cloud Caches: A Cost-Aware TTL Approach
inferred← citeshttps://doi.org/10.1109/tnet.2021.3062269openalex-snapshot
Caching Policies for Delay Minimization in Small Cell Networks With Coordinated Multi-Point Joint Transmissions
inferred← citeshttps://doi.org/10.1109/tnet.2021.3126368openalex-snapshot
Similarity Caching: Theory and Algorithms
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.1109/vcc60689.2023.10474978openalex-snapshot
No- Regret Caching with Noisy Request Estimates
inferred← citeshttps://doi.org/10.1145/3308897.3308958openalex-snapshot
Feedforward Neural Networks for Caching
inferred← citeshttps://doi.org/10.1145/3345022openalex-snapshot
Generalization of LRU Cache Replacement Policy with Applications to Video Streaming
inferred← citeshttps://doi.org/10.1145/3507920openalex-snapshot
Lightweight Robust Size Aware Cache Management
inferred← citeshttps://doi.org/10.1145/3572778openalex-snapshot
Boosting Cache Performance by Access Time Measurements
inferred← citeshttps://doi.org/10.1145/3605209openalex-snapshot
No-regret Caching via Online Mirror Descent
inferred← citeshttps://doi.org/10.48550/arxiv.1810.06930openalex-snapshot
Feedforward Neural Networks for Caching: Enough or Too Much?
inferred← citeshttps://doi.org/10.48550/arxiv.2010.10562openalex-snapshot
NV-Fogstore : Device-aware hybrid caching in fog computing environments
inferred← citeshttps://doi.org/10.48550/arxiv.2101.12588openalex-snapshot
No-Regret Caching via Online Mirror Descent
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.