A Novel Collaborative Edge Caching via User Preference Awareness and Adaptive Clustering in MENs

In this paper, we propose a collaborative caching placement scheme leveraging user preference awareness and adaptive clustering (UPAAC), which jointly considers the heterogeneity of user preferences and user activity to reduce user access latency and improve the quality of service. Specifically, we first utilize Bidirectional Long Short-Term Memory (Bi-LSTM) to capture dynamic user behavior to predict user preferences, and then density-based spatial clustering of applications with noise (DBSCAN) is used to cluster users based on the predicted user preferences for more efficient cache placement. Furthermore, the cache placement optimal problem is defined as the latency reduction maximization problem under the constraint of the cache capacity and latency threshold, and a genetic algorithm (GA) is used to optimize the problem and design the cache placement strategy. The simulation outcomes indicate that the suggested approach outperforms the conventional caching methods by significantly decreasing content access latency and enhancing the cache hit ratio.

Authors

Institutions

Publication Details

Published
2024-09-23
DOI
https://doi.org/10.1109/mass62177.2024.00071
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

A Novel Collaborative Edge Caching via User Preference Awareness and Adaptive Clustering in MENs

Huiling Shi, Mingfa Li, Wei Emma Zhang, Hao Hao et al.
Caching and Content Delivery
article

A Novel Collaborative Edge Caching via User Preference Awareness and Adaptive Clustering in MENs

Huiling Shi, Mingfa Li, Wei Emma Zhang, Hao Hao, Pengfei Gu
article en

Abstract

In this paper, we propose a collaborative caching placement scheme leveraging user preference awareness and adaptive clustering (UPAAC), which jointly considers the heterogeneity of user preferences and user activity to reduce user access latency and improve the quality of service. Specifically, we first utilize Bidirectional Long Short-Term Memory (Bi-LSTM) to capture dynamic user behavior to predict user preferences, and then density-based spatial clustering of applications with noise (DBSCAN) is used to cluster users based on the predicted user preferences for more efficient cache placement. Furthermore, the cache placement optimal problem is defined as the latency reduction maximization problem under the constraint of the cache capacity and latency threshold, and a genetic algorithm (GA) is used to optimize the problem and design the cache placement strategy. The simulation outcomes indicate that the suggested approach outperforms the conventional caching methods by significantly decreasing content access latency and enhancing the cache hit ratio.

Qilu University of Technology (CN), Shandong Academy of Sciences (CN)
Natural Science Foundation of Shandong Province
Openalex Percentile: Top 79%
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.