TY - JOUR
T1 - Joint Service Scheduling and Content Caching over Unreliable Channels
AU - Nie, Tao
AU - Luo, Jingiing
AU - Gao, Lin
AU - Zheng, Fu Chun
AU - Yu, Li
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020
Y1 - 2020
N2 - To alleviate the ever-increasing data demands, edge caching plays a crucial role in improving the performance of system, especially in data-intensive applications. Previous works mainly focus the caching policy over reliable channels. For unreliable channel scenarios, the system performance is jointly affected by the user preference and the channel reliability, whereas both the user preference and the reliability are unknown commonly. A high retrieval cost may be incurred on unreliable channels even when the requested content is in the nearby cache. To solve the issues mentioned above, we jointly optimize the service scheduling policy and the content caching policy in this paper. We propose a maximal reward priority (MRP) policy to serve user requests, and a collaborative multi-agent actor critic (CMA-AC) policy to update the local cache. Simulation results show that the proposed MRP policy outperforms the shortest distance priority (SDP) policy [4]. And the proposed CMA-AC policy obtains a better performance compared with a distributed multi-agent deep Q-network (DMA-DQN) policy, especially when the number of contents and the capacity of local cache are large. Furthermore, the proposed CMA-AC policy is robust.
AB - To alleviate the ever-increasing data demands, edge caching plays a crucial role in improving the performance of system, especially in data-intensive applications. Previous works mainly focus the caching policy over reliable channels. For unreliable channel scenarios, the system performance is jointly affected by the user preference and the channel reliability, whereas both the user preference and the reliability are unknown commonly. A high retrieval cost may be incurred on unreliable channels even when the requested content is in the nearby cache. To solve the issues mentioned above, we jointly optimize the service scheduling policy and the content caching policy in this paper. We propose a maximal reward priority (MRP) policy to serve user requests, and a collaborative multi-agent actor critic (CMA-AC) policy to update the local cache. Simulation results show that the proposed MRP policy outperforms the shortest distance priority (SDP) policy [4]. And the proposed CMA-AC policy obtains a better performance compared with a distributed multi-agent deep Q-network (DMA-DQN) policy, especially when the number of contents and the capacity of local cache are large. Furthermore, the proposed CMA-AC policy is robust.
KW - Cooperative caching
KW - deep reinforcement learning
KW - service scheduling
KW - unreliable channel
UR - http://www.scopus.com/inward/record.url?scp=85100384615&partnerID=8YFLogxK
U2 - 10.1109/GLOBECOM42002.2020.9322536
DO - 10.1109/GLOBECOM42002.2020.9322536
M3 - Conference article
AN - SCOPUS:85100384615
SN - 2334-0983
JO - Proceedings - IEEE Global Communications Conference, GLOBECOM
JF - Proceedings - IEEE Global Communications Conference, GLOBECOM
M1 - 9322536
T2 - 2020 IEEE Global Communications Conference, GLOBECOM 2020
Y2 - 7 December 2020 through 11 December 2020
ER -