Joint Service Scheduling and Content Caching over Unreliable Channels

  • Tao Nie
  • , Jingiing Luo*
  • , Lin Gao
  • , Fu Chun Zheng
  • , Li Yu
  • *Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number9322536
JournalProceedings - IEEE Global Communications Conference, GLOBECOM
DOIs
Publication statusPublished - 2020
Externally publishedYes
Event2020 IEEE Global Communications Conference, GLOBECOM 2020 - Virtual, Taipei, Taiwan, Province of China
Duration: 7 Dec 202011 Dec 2020

Keywords

  • Cooperative caching
  • deep reinforcement learning
  • service scheduling
  • unreliable channel

Fingerprint

Dive into the research topics of 'Joint Service Scheduling and Content Caching over Unreliable Channels'. Together they form a unique fingerprint.

Cite this