Efficient Caching in Cyber-Physical-Social Systems Based on Social-Aware and Popularity Prediction

Cyber-Physical-Social Systems (CPSS) aim to enhance societal efficiency by integrating intelligent, interactive systems. To support CPSS, data is often gathered from the cloud, but non-real-time cloud-user connections affect Quality-of-Service (QoS). To solve this, we propose offloading storage to the edge, caching popular content near users. We select cluster heads using local clustering, social intimacy, and betweenness centrality. Then, we group users using the Pairwise Constrained K-Means-Monotonic (PCKMM) algorithm based on distance, relationships, and content preferences. Using unsupervised recurrent federated learning (URFL), we predict content popularity and adjust clusters dynamically. Content is cached with a popularity-driven greedy strategy, reducing access latency.

Authors

Institutions

Publication Details

Published
2024-12-20
DOI
https://doi.org/10.1109/msn63567.2024.00168
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

Efficient Caching in Cyber-Physical-Social Systems Based on Social-Aware and Popularity Prediction

Huiling Shi, Xintao Sun, Wei Zhang, Hao Hao
Caching and Content Delivery
article

Efficient Caching in Cyber-Physical-Social Systems Based on Social-Aware and Popularity Prediction

Huiling Shi, Xintao Sun, Wei Zhang, Hao Hao
article en

Abstract

Cyber-Physical-Social Systems (CPSS) aim to enhance societal efficiency by integrating intelligent, interactive systems. To support CPSS, data is often gathered from the cloud, but non-real-time cloud-user connections affect Quality-of-Service (QoS). To solve this, we propose offloading storage to the edge, caching popular content near users. We select cluster heads using local clustering, social intimacy, and betweenness centrality. Then, we group users using the Pairwise Constrained K-Means-Monotonic (PCKMM) algorithm based on distance, relationships, and content preferences. Using unsupervised recurrent federated learning (URFL), we predict content popularity and adjust clusters dynamically. Content is cached with a popularity-driven greedy strategy, reducing access latency.

Qilu University of Technology (CN), Shandong Academy of Sciences (CN)
Reduced inequalities
Openalex Percentile: Top 64%
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.