Latency-aware Design for Computation Offloading and Content Caching in F-RANs

This paper investigates the joint computation offloading and content caching scheme in fog radio access networks (F-RANs), where users and fog nodes (FNs) are all endowed with caching and computing capabilities. The Kuhn-Munkres (KM) algorithm is first used to make the user-and-FN matching decisions. We then comprehensively reveal the service modes when a user receives the requested data to perform a computation task. The optimization problem of minimizing the task response latency is formulated under the constraints of limited cache sizes for users and FNs, aiming to yield the optimal decisions for computation offloading and content caching. The formulated problem is NPhard, and transformed into the convex form by introducing the methods of difference of convex (DC) function, successive convex approximation (SCA), and arithmetic geometric mean (AGM) inequality. Simulation results demonstrate the fast convergence speed of the proposed algorithm, and show superior latency performance of our designed scheme to the benchmarks.

Authors

Institutions

Publication Details

Published
2024-09-02
DOI
https://doi.org/10.1109/pimrc59610.2024.10817361
Primary Topic
Caching and Content Delivery
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Latency-aware Design for Computation Offloading and Content Caching in F-RANs

Junxuan Wang, Yuan Ren, Fan Jiang, Xuewei Zhang et al.
Caching and Content Delivery
article

Latency-aware Design for Computation Offloading and Content Caching in F-RANs

Junxuan Wang, Yuan Ren, Fan Jiang, Xuewei Zhang, Haishuang Yan
article en

Abstract

This paper investigates the joint computation offloading and content caching scheme in fog radio access networks (F-RANs), where users and fog nodes (FNs) are all endowed with caching and computing capabilities. The Kuhn-Munkres (KM) algorithm is first used to make the user-and-FN matching decisions. We then comprehensively reveal the service modes when a user receives the requested data to perform a computation task. The optimization problem of minimizing the task response latency is formulated under the constraints of limited cache sizes for users and FNs, aiming to yield the optimal decisions for computation offloading and content caching. The formulated problem is NPhard, and transformed into the convex form by introducing the methods of difference of convex (DC) function, successive convex approximation (SCA), and arithmetic geometric mean (AGM) inequality. Simulation results demonstrate the fast convergence speed of the proposed algorithm, and show superior latency performance of our designed scheme to the benchmarks.

Xi’an University of Posts and Telecommunications (CN)
National Natural Science Foundation of China, Research and Development
Openalex Percentile: Top 71%
Caching and Content Delivery
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Latency-aware Design for Computation Offloading and Content Caching in F-RANs — Junxuan Wang, Yuan Ren, et al. · (2024) | TGRS Research Map | TGRS