Joint Service Scheduling and Content Caching over Unreliable Channels

Tao Nie, Jingiing Luo*, Lin Gao, Fu Chun Zheng, Li Yu

*此作品的通讯作者

科研成果: 期刊稿件会议文章同行评审

3 引用 (Scopus)

摘要

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.

源语言英语
文章编号9322536
期刊Proceedings - IEEE Global Communications Conference, GLOBECOM
DOI
出版状态已出版 - 2020
已对外发布
活动2020 IEEE Global Communications Conference, GLOBECOM 2020 - Virtual, Taipei, 中国台湾
期限: 7 12月 202011 12月 2020

指纹

探究 'Joint Service Scheduling and Content Caching over Unreliable Channels' 的科研主题。它们共同构成独一无二的指纹。

引用此