• Corpus ID: 16690694

Spatial multi-LRU: Distributed Caching for Wireless Networks with Coverage Overlaps

  title={Spatial multi-LRU: Distributed Caching for Wireless Networks with Coverage Overlaps},
  author={Anastasios Giovanidis and Apostolos Avranas},
This article introduces a novel family of decen-tralised caching policies, applicable to wireless networks with finite storage at the edge-nodes (stations). These policies, that are based on the Least-Recently-Used replacement principle, are here referred to as spatial multi-LRU. They update cache inventories in a way that provides content diversity to users who are covered by, and thus have access to, more than one station. Two variations are proposed, the multi-LRU-One and-All, which differ… 

Figures and Tables from this paper

Implicit Coordination of Caches in Small Cell Networks Under Unknown Popularity Profiles
This paper introduces a class of simple and fully distributed caching policies, which require neither direct communication among BSs nor a priori knowledge of content popularity, and proposes a novel approximate analytical methodology to assess the performance of interacting caches under such policies.
Learning to Cooperate in D2D Caching Networks
An online learning algorithm is designed which minimizes the aggregate delivery cost by assisting each node to decide which files to cache and which file to fetch from the BS and other devices.
Cache Optimization Models and Algorithms
A collection of detailed models and algorithms are synthesized to build a powerful analytical framework for caching optimization, ensuring the maximum possible performance and economic benefits from their deployment.
Elastic FemtoCaching: Scale, Cache, and Route
This article jointly considers dynamic cache rental, content placement, and request-cache association in wireless scenarios in order to provide just-in-time CDN services and shows that the proposed algorithm achieves 154% utility compared to similar static cache storage-based algorithms in a representative urban topology.
Spectral Coexistence of 5G Networks and Satellite Communication Systems Enabled by Coordinated Caching and QoS-Aware Resource Allocation
A family of simple cooperative mobile edge caching strategies that create joint transmission opportunities and make use of the non-computational-demanding score-gated least recently used (SG-LRU) caching scheme to achieve high cache hit rate are presented, increasing the sum-SE and reducing both the backhaul traffic and the content access latency.
Online Caching with Optimistic Learning
It is proved that the proposed optimistic learning caching policies can achieve sub-zero performance loss (regret) for perfect predictions, and maintain the best achievable regret bound O ( √ T ) even for arbitrary-bad predictions.
Online Convex Optimization for Caching Networks
The Bipartite Supergradient Caching Algorithm (BSCA) is proposed, the first that draws a connection between the network caching problem and Online Convex Optimization, and its generality is demonstrated by discussing various practical extensions and presenting a trace-driven comparison with state-of-the-art competitors.
Learning to Cache With No Regrets
A novel caching analysis that makes no modeling assumptions for the file request sequence is introduced, and a class of minimum regret caching policies are introduced, which minimize the losses with respect to the best static configuration in hindsight when the request model is unknown.
Stationary Request Sequence Non-Stationary Req . Sequence Local Cache Origin Server Time
  • 2019


Spatial Multi-LRU Caching for Wireless Networks with Coverage Overlaps
A novel family of decentralised caching policies for wireless networks, referred to as spatial multi-LRU, is introduced, which provides content diversity to users that are covered by, and thus have access to, more than one station.
Performance of spatial Multi-LRU caching under traffic with temporal locality
A novel family of decentralised caching policies for wireless networks is introduced, referred to as spatial multi-LRU, which improve cache-hit probability by exploiting multi-coverage and outperform both comparison policies.
Approximation Algorithms for Mobile Data Caching in Small Cell Networks
A novel reduction to a variant of the facility location problem is presented, which allows for algorithms with approximation guarantees for the joint routing and caching problem aiming to maximize the fraction of content requests served locally by the deployed SBSs.
On the Interaction between Content Caching and Request Assignment in Cellular Cache Networks
This work formally introduces an optimization model to address the potential availability of storage space at cellular and femtocell base-stations, and proposes an online algorithm for dynamic caching and request assignment based on a server price signal that jointly reflects content and bandwidth availability.
Performance and Cost Effectiveness of Caching in Mobile Access Networks
Quantifying the tradeoff at each level leads to conclude that limited caching at BS and MCN levels brings significant savings while to store the vast majority of the content catalogue at the Internet edge at the PGW is clearly cost effective.
Cache-enabled small cell networks: modeling and tradeoffs
This work considers a network model where small base stations have caching capabilities as a means to alleviate the backhaul load and satisfy users’ demand, and derives closed-form expressions for the outage probability and the average delivery rate as a function of the signal-to-interference-plus-noise ratio (SINR), SBS density, target file bitrate, storage size, file length, and file popularity.
Optimal geographic caching in cellular networks
Numerical results regarding three different coverage scenarios, show that the optimal policy significantly increases the chances of hit under high-coverage regime, i.e., when the probabilities of coverage by more than just one station are high enough.
Distributed Caching Algorithms for Content Distribution Networks
This paper develops light-weight cooperative cache management algorithms aimed at maximizing the traffic volume served from cache and minimizing the bandwidth cost, and establishes that the performance of the proposed algorithms is guaranteed to be within a constant factor from the globally optimal performance.
Modeling and analysis of content caching in wireless small cell networks
This paper analytically derive a closed form expression of the outage probability as a function of signal-to-interference ratio, cache size, small cell base station density and threshold distance, and derives the probability of finding a specific content within a threshold distance and the optimal small cellbase station density that achieves a given target cache hit probability.
On the complexity of optimal routing and content caching in heterogeneous networks
This work investigates the problem of optimal request routing and content caching in a heterogeneous network supporting in-network content caching with the goal of minimizing average content access delay, and proves that under the congestion-insensitive model the problem can be solved optimally in polynomial time.