Extensive-Form Game Theory-Based Content Caching in Edge Networks

Multi-access Edge Computing (MEC) enhances user experience by caching content at nearby base stations or edge servers, thereby reducing repetitive data retrieval and latency. However, edge servers face challenges such as high data storage costs and stringent network requirements, which conflict with their limited performance capabilities. To address these issues, cooperative caching among servers has emerged as a pivotal research area. In this paper, we first establish a model that links the quality of experience (QoE) with the quality of service (QoS). Then, queuing theory is used to estimate the impact of access rate on QoE. Second, we describe the server file caching decision issue as a type of extensive game problem. Finally, we propose an improved discrete binary particle swarm optimization (BPSO) algorithm to solve the optimal decision. Simulation results indicate that our algorithm ensures a higher hit rate and achieves the highest QoE compared to existing algorithms.

Authors

Institutions

Publication Details

Journal
IEEE Multimedia
Published
2025-04-01
DOI
https://doi.org/10.1109/mmul.2025.3558248
Primary Topic
Caching and Content Delivery
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Extensive-Form Game Theory-Based Content Caching in Edge Networks

Weihua Cao, Zhicheng Zhao
IEEE Multimedia
Caching and Content Delivery
article

Extensive-Form Game Theory-Based Content Caching in Edge Networks

Weihua Cao, Zhicheng Zhao
article en

Abstract

Multi-access Edge Computing (MEC) enhances user experience by caching content at nearby base stations or edge servers, thereby reducing repetitive data retrieval and latency. However, edge servers face challenges such as high data storage costs and stringent network requirements, which conflict with their limited performance capabilities. To address these issues, cooperative caching among servers has emerged as a pivotal research area. In this paper, we first establish a model that links the quality of experience (QoE) with the quality of service (QoS). Then, queuing theory is used to estimate the impact of access rate on QoE. Second, we describe the server file caching decision issue as a type of extensive game problem. Finally, we propose an improved discrete binary particle swarm optimization (BPSO) algorithm to solve the optimal decision. Simulation results indicate that our algorithm ensures a higher hit rate and achieves the highest QoE compared to existing algorithms.

IEEE MultimediaVol. 32(2)
China University of Geosciences (CN), Shandong Institute of Automation (CN)
Openalex Percentile: Top 93%
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.