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
- Junxuan Wang (ORCID: https://orcid.org/0000-0002-5386-9012)
- Yuan Ren (ORCID: https://orcid.org/0000-0003-2520-8388)
- Fan Jiang (ORCID: https://orcid.org/0000-0002-8968-5178)
- Xuewei Zhang (ORCID: https://orcid.org/0000-0003-3713-729X)
- Haishuang Yan (ORCID: https://orcid.org/0009-0006-9880-3152)
Institutions
- Xi’an University of Posts and Telecommunications (CN)
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
- National Natural Science Foundation of China
- Research and Development