Optimal Cache Strategy for Offshore Edge Computing Cell Collaboration

With the increasing frequency of marine activities and the rapid growth of the marine economy, the diversified task demands put forward by ship users have caused significant pressure on offshore networks. In response to this issue, a collaborative architecture for offshore edge caching is proposed, which utilizes intelligent relay nodes at sea to cache tasks. By constraining the clustering of relay nodes and caching costs, an optimization problem is formulated to minimize the long-term average delay for users. Lyapunov optimization is employed to convert the original long-term optimization problem into multiple instantaneous problems. The Bender decomposition method is then used to decompose each instantaneous problem into two subproblems: service caching and intelligent relay node clustering. Ultimately, optimal clustering and caching decisions are obtained through solution. Simulation experiments verify that the proposed algorithm can effectively reduce delay and caching costs.

Authors

Institutions

Publication Details

Published
2024-12-27
DOI
https://doi.org/10.1145/3718491.3718566
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Cache Strategy for Offshore Edge Computing Cell Collaboration

Y. Wu, Huogen Yang
IoT and Edge/Fog Computing
article

Optimal Cache Strategy for Offshore Edge Computing Cell Collaboration

Y. Wu, Huogen Yang
article en

Abstract

With the increasing frequency of marine activities and the rapid growth of the marine economy, the diversified task demands put forward by ship users have caused significant pressure on offshore networks. In response to this issue, a collaborative architecture for offshore edge caching is proposed, which utilizes intelligent relay nodes at sea to cache tasks. By constraining the clustering of relay nodes and caching costs, an optimization problem is formulated to minimize the long-term average delay for users. Lyapunov optimization is employed to convert the original long-term optimization problem into multiple instantaneous problems. The Bender decomposition method is then used to decompose each instantaneous problem into two subproblems: service caching and intelligent relay node clustering. Ultimately, optimal clustering and caching decisions are obtained through solution. Simulation experiments verify that the proposed algorithm can effectively reduce delay and caching costs.

Jiangxi University of Science and Technology (CN)
Openalex Percentile: Top 66%
IoT and Edge/Fog Computing
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.