Cache placement in Fog-RANs

From centralized to distributed algorithms

Juan Liu, Bo Bai, Jun Zhang, Khaled Letaief

Research output: Contribution to journalArticle

43 Citations (Scopus)

Abstract

To deal with the rapid growth of high-speed and/or ultra-low latency data traffic for massive mobile users, fog radio access networks (Fog-RANs) have emerged as a promising architecture for next-generation wireless networks. In Fog-RANs, the edge nodes and user terminals possess storage, computation and communication functionalities to various degrees, which provide high flexibility for network operation, i.e., from fully centralized to fully distributed operation. In this paper, we study the cache placement problem in Fog-RANs, by taking into account flexible physical-layer transmission schemes and diverse content preferences of different users. We develop both centralized and distributed transmission aware cache placement strategies to minimize users' average download delay subject to the storage capacity constraints. In the centralized mode, the cache placement problem is transformed into a matroid constrained submodular maximization problem, and an approximation algorithm is proposed to find a solution within a constant factor to the optimum. In the distributed mode, a belief propagation-based distributed algorithm is proposed to provide a suboptimal solution, with iterative updates at each BS based on locally collected information. Simulation results show that by exploiting caching and cooperation gains, the proposed transmission aware caching algorithms can greatly reduce the users' average download delay.

Original languageEnglish
Article number2737015
Pages (from-to)7039-7051
Number of pages13
JournalIEEE Transactions on Wireless Communications
Volume16
Issue number11
DOIs
Publication statusPublished - 1 Nov 2017
Externally publishedYes

Fingerprint

Fog
Distributed Algorithms
Parallel algorithms
Cache
Placement
Caching
Approximation algorithms
Telecommunication traffic
Wireless networks
Belief Propagation
Capacity Constraints
Storage Capacity
Matroid
Communication
Wireless Networks
Latency
Approximation Algorithms
High Speed
Update
Flexibility

Keywords

  • Belief propagation
  • Content placement
  • Fog-RAN
  • Submodular optimization

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

Cache placement in Fog-RANs : From centralized to distributed algorithms. / Liu, Juan; Bai, Bo; Zhang, Jun; Letaief, Khaled.

In: IEEE Transactions on Wireless Communications, Vol. 16, No. 11, 2737015, 01.11.2017, p. 7039-7051.

Research output: Contribution to journalArticle

@article{a6adebe875c74ade82de344638bc8c32,
title = "Cache placement in Fog-RANs: From centralized to distributed algorithms",
abstract = "To deal with the rapid growth of high-speed and/or ultra-low latency data traffic for massive mobile users, fog radio access networks (Fog-RANs) have emerged as a promising architecture for next-generation wireless networks. In Fog-RANs, the edge nodes and user terminals possess storage, computation and communication functionalities to various degrees, which provide high flexibility for network operation, i.e., from fully centralized to fully distributed operation. In this paper, we study the cache placement problem in Fog-RANs, by taking into account flexible physical-layer transmission schemes and diverse content preferences of different users. We develop both centralized and distributed transmission aware cache placement strategies to minimize users' average download delay subject to the storage capacity constraints. In the centralized mode, the cache placement problem is transformed into a matroid constrained submodular maximization problem, and an approximation algorithm is proposed to find a solution within a constant factor to the optimum. In the distributed mode, a belief propagation-based distributed algorithm is proposed to provide a suboptimal solution, with iterative updates at each BS based on locally collected information. Simulation results show that by exploiting caching and cooperation gains, the proposed transmission aware caching algorithms can greatly reduce the users' average download delay.",
keywords = "Belief propagation, Content placement, Fog-RAN, Submodular optimization",
author = "Juan Liu and Bo Bai and Jun Zhang and Khaled Letaief",
year = "2017",
month = "11",
day = "1",
doi = "10.1109/TWC.2017.2737015",
language = "English",
volume = "16",
pages = "7039--7051",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - Cache placement in Fog-RANs

T2 - From centralized to distributed algorithms

AU - Liu, Juan

AU - Bai, Bo

AU - Zhang, Jun

AU - Letaief, Khaled

PY - 2017/11/1

Y1 - 2017/11/1

N2 - To deal with the rapid growth of high-speed and/or ultra-low latency data traffic for massive mobile users, fog radio access networks (Fog-RANs) have emerged as a promising architecture for next-generation wireless networks. In Fog-RANs, the edge nodes and user terminals possess storage, computation and communication functionalities to various degrees, which provide high flexibility for network operation, i.e., from fully centralized to fully distributed operation. In this paper, we study the cache placement problem in Fog-RANs, by taking into account flexible physical-layer transmission schemes and diverse content preferences of different users. We develop both centralized and distributed transmission aware cache placement strategies to minimize users' average download delay subject to the storage capacity constraints. In the centralized mode, the cache placement problem is transformed into a matroid constrained submodular maximization problem, and an approximation algorithm is proposed to find a solution within a constant factor to the optimum. In the distributed mode, a belief propagation-based distributed algorithm is proposed to provide a suboptimal solution, with iterative updates at each BS based on locally collected information. Simulation results show that by exploiting caching and cooperation gains, the proposed transmission aware caching algorithms can greatly reduce the users' average download delay.

AB - To deal with the rapid growth of high-speed and/or ultra-low latency data traffic for massive mobile users, fog radio access networks (Fog-RANs) have emerged as a promising architecture for next-generation wireless networks. In Fog-RANs, the edge nodes and user terminals possess storage, computation and communication functionalities to various degrees, which provide high flexibility for network operation, i.e., from fully centralized to fully distributed operation. In this paper, we study the cache placement problem in Fog-RANs, by taking into account flexible physical-layer transmission schemes and diverse content preferences of different users. We develop both centralized and distributed transmission aware cache placement strategies to minimize users' average download delay subject to the storage capacity constraints. In the centralized mode, the cache placement problem is transformed into a matroid constrained submodular maximization problem, and an approximation algorithm is proposed to find a solution within a constant factor to the optimum. In the distributed mode, a belief propagation-based distributed algorithm is proposed to provide a suboptimal solution, with iterative updates at each BS based on locally collected information. Simulation results show that by exploiting caching and cooperation gains, the proposed transmission aware caching algorithms can greatly reduce the users' average download delay.

KW - Belief propagation

KW - Content placement

KW - Fog-RAN

KW - Submodular optimization

UR - http://www.scopus.com/inward/record.url?scp=85029152643&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029152643&partnerID=8YFLogxK

U2 - 10.1109/TWC.2017.2737015

DO - 10.1109/TWC.2017.2737015

M3 - Article

VL - 16

SP - 7039

EP - 7051

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 11

M1 - 2737015

ER -