Cache Subsidies for an Optimal Memory for Bandwidth Tradeoff in the Access Network

While the cost of the access network could be considerably reduced by the use of caching, this is not currently happening because content providers (CPs), who alone have the detailed demand data required for optimal content placement, have no natural incentive to use them to minimize access network...

Full description

Saved in:
Bibliographic Details
Published inIEEE journal on selected areas in communications Vol. 38; no. 4; pp. 736 - 749
Main Authors Ahmadi, Mahdieh, Roberts, James, Leonardi, Emilio, Movaghar, Ali
Format Journal Article
LanguageEnglish
Published New York IEEE 01.04.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Bandwidth
Bandwidths
Base stations
cache subsidy
Caching
content distribution
Economics
Game theory
Google
Internet
Network economics
Network topology
Subsidies
Telecommunications
Tradeoffs
Online AccessGet full text

Cover

More Information
Summary:While the cost of the access network could be considerably reduced by the use of caching, this is not currently happening because content providers (CPs), who alone have the detailed demand data required for optimal content placement, have no natural incentive to use them to minimize access network operator (ANO) expenditure. We argue that ANOs should therefore provide such an incentive in the form of direct subsidies paid to the CPs in proportion to the realized savings. We apply coalition game theory to design the required subsidy framework and propose a distributed algorithm, based on Lagrangian decomposition, allowing ANOs and CPs to collectively realize the optimal memory for bandwidth tradeoff. The considered access network is a cache hierarchy with per-CP central office caches, accessed by all ANOs, at the apex, and per-ANO dedicated bandwidth and storage resources at the lower levels, including wireless base stations, that must be shared by multiple CPs.
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2020.2971806