# Optimal Cache Leasing from a Mobile Network Operator to a Content Provider

@article{Krolikowski2018OptimalCL,
title={Optimal Cache Leasing from a Mobile Network Operator to a Content Provider},
author={Jonatan Krolikowski and Anastasios Giovanidis and Marco di Renzo},
journal={IEEE INFOCOM 2018 - IEEE Conference on Computer Communications},
year={2018},
pages={2744-2752}
}
• Published 24 January 2018
• Computer Science
• IEEE INFOCOM 2018 - IEEE Conference on Computer Communications
Caching popular content at the wireless edge is recently proposed as a means to reduce congestion at the backbone of cellular networks. The two main actors involved are Mobile Network Operators (MNOs) and Content Providers (CPs). In this work, we consider the following arrangement: an MNO pre-installs memory on its wireless equipment (e.g. Base Stations) and invites a unique CP to use them, with monetary cost. The CP will lease memory space and place its content; the MNO will associate network…
15 Citations

## Figures from this paper

A Decomposition Framework for Optimal Edge-Cache Leasing
• Computer Science
IEEE Journal on Selected Areas in Communications
• 2018
This paper studies the following arrangement: a mobile network operator pre-installs memory on its wireless equipment, sets a price, and invites a unique content provider (CP) to invest, which forms an optimization problem, which maximizes offloading with minimum leasing costs for the CP.
Optimal Content Management and Dimensioning in Wireless Networks. (Gestion de contenu optimale et dimensionnement de mémoire dans les réseaux sans fil)
The thesis proposes an original decentralized algorithm for user association called Generalized Bucket-filling that allows gains beyond maximizing the hit ratio and widens the focus to the interaction between several CPs and one MNO.
Consistent User-Traffic Allocation and Load Balancing in Mobile Edge Caching
• Computer Science
IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
• 2020
This work formulate the user-traffic allocation problem in DNS-based mobile edge caching, aiming at maximizing QoS gain and allocation consistency while maintaining load balance, and presents a simple greedy algorithm which gives a more consistent solution when user-Traffic changes dynamically.
Delay and Power Tradeoff With Consideration of Caching Capabilities in Dense Wireless Networks
• Computer Science
IEEE Transactions on Wireless Communications
• 2019
An iterative algorithm is proposed and proved to be an $\epsilon$ -optimal, in which the primal problem and the master problem are solved iteratively to approach the optimal solution.
Cost-Oriented Mobility-Aware Caching Strategies in D2D Networks With Delay Constraint
• Computer Science
IEEE Access
• 2019
Simulation results show that the proposed mobility-aware caching strategy can reduce the average cost by 46% when the user speed is high, and an iterative caching algorithm is proposed with the successive convex approximation method to lower the complexity.
Incentivizing Mobile Edge Caching and Sharing: An Evolutionary Game Approach
• Computer Science
2021 IEEE Global Communications Conference (GLOBECOM)
• 2021
This work studies a novel mobile edge caching framework, which enables mobile devices to cache and share popular contents with each other via device-to-device (D2D) links, and introduces the evolutionary game theory, an effective tool for analyzing large-scale dynamic systems, to analyze the mobile users' content caching and sharing strategies.
SOBA: Session optimal MDP-based network friendly recommendations
• Computer Science
IEEE INFOCOM 2021 - IEEE Conference on Computer Communications
• 2021
This work focuses on the problem of optimal policy design for Network Friendly Recommendations (NFR), and proposes a Markov Decision Process (MDP) formulation, which outperforms myopic algorithms both in session cost as well as in offered recommendation quality.
Online Service Caching and Routing at the Edge with Switching Cost
• Computer Science
ArXiv
• 2021
This paper proposes an online two-stage algorithm and its randomized variant of service routing, which has low complexity and achieves sublinear regret, and results show that these algorithms significantly outperform other state-of-the-art policies.
Consistent Dynamic Server Assignment in Content Delivery Network
• Computer Science
ArXiv
• 2019
Theoretical analysis proves that the proposed greedy algorithm has considerable optimality guarantees, and evaluation shows that DynDNS can avoid about 50% unnecessary shift in demand allocation and yield more stable cache hit ratio.
Caching at Base Stations With Heterogeneous User Demands and Spatial Locality
• Computer Science
IEEE Transactions on Communications
• 2019
A framework to optimize caching policy for base stations exploiting heterogeneous user preference, activity level, and spatial locality is established and results show that exploiting individual user behavior can improve both network performance and user fairness.

## References

SHOWING 1-10 OF 22 REFERENCES
Approximation Algorithms for Mobile Data Caching in Small Cell Networks
• Computer Science
IEEE Transactions on Communications
• 2014
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.
Mobile Data Offloading Through Caching in Residential 802.11 Wireless Networks
• Computer Science
IEEE Transactions on Network and Service Management
• 2016
This work proposes leasing wireless bandwidth and cache space of residential 802.11 (WiFi) access points for offloading mobile data, and introduces a framework for the joint optimization of incentive, caching, and routing policies.
Fair distributed user-traffic association in cache equipped cellular networks
• Computer Science
2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
• 2017
This work proposes an efficient distributed algorithm to control and balance the association of cache-related traffic among cellular cache memories that allows the network to achieve the globally optimal solution and can be executed on base stations using a limited amount of information exchange between them.
On the complexity of optimal routing and content caching in heterogeneous networks
• Computer Science
2015 IEEE Conference on Computer Communications (INFOCOM)
• 2015
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.
On the Interaction between Content Caching and Request Assignment in Cellular Cache Networks
• Computer Science
AllThingsCellular@SIGCOMM
• 2015
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.
Cache-enabled small cell networks: modeling and tradeoffs
• Computer Science
2014 11th International Symposium on Wireless Communications Systems (ISWCS)
• 2014
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
• Computer Science
2015 IEEE International Conference on Communications (ICC)
• 2015
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.
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
• Computer Science
IEEE Transactions on Information Theory
• 2013
This work shows that the uncoded optimum file assignment is NP-hard, and develops a greedy strategy that is provably within a factor 2 of the optimum, and provides an efficient algorithm achieving a provably better approximation ratio of 1-1/d d, where d is the maximum number of helpers a user can be connected to.
Caching games between Content Providers and Internet Service Providers
• Computer Science
Perform. Evaluation
• 2016
This model captures not only the case of non-overlapping contents among the CPs, but also the more challenging case of overlapping contents; for the latter case, a non-cooperative game among theCPs is introduced and analyzed to capture the negative externality on the demand of a particular CP when caches for other CPs are deployed.
Cache Placement in Fog-RANs: From Centralized to Distributed Algorithms
• Computer Science
IEEE Transactions on Wireless Communications
• 2017
Simulation results show that by exploiting caching and cooperation gains, the proposed transmission aware caching algorithms can greatly reduce the users’ average download delay.