{"title":"Innovative edge caching: A multi-agent deep reinforcement learning approach for cooperative replacement strategies","authors":"","doi":"10.1016/j.comnet.2024.110694","DOIUrl":null,"url":null,"abstract":"<div><p>Cooperative edge caching has emerged as a promising solution to alleviate the traffic burden of backhaul and improve the Quality of Service of 5G applications in the 5G era. Several cooperative edge caching methods alleviate the traffic burden of backhaul by transmitting contents between edge nodes cooperatively, thereby reducing the delay of content transmission. However, these methods have a limited ability to handle complex information in multi-edge scenarios, and they mainly focus on cooperation in content transmission while scarcely considering cooperation in cache replacement. As a result, they cannot effectively utilize the cache space of collaborative edges, leading to suboptimal system utility. In this paper, we propose a cache replacement strategy for cooperative edge caching based on a novel multi-agent deep reinforcement learning network. Firstly, we present a cooperative edge caching model aimed at maximizing the system throughput. Then, we formulate the cache replacement process in the cooperative edge caching system as a Markov Game (MG) model. Finally, we design a Discrete MADDPG algorithm based on a discrete multi-agent actor-critic network to derive the cache replacement strategy and effectively manage content redundancy within the system. Simulation results demonstrate that our proposed algorithm achieves higher system throughput while effectively controlling content redundancy.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624005267","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
Cooperative edge caching has emerged as a promising solution to alleviate the traffic burden of backhaul and improve the Quality of Service of 5G applications in the 5G era. Several cooperative edge caching methods alleviate the traffic burden of backhaul by transmitting contents between edge nodes cooperatively, thereby reducing the delay of content transmission. However, these methods have a limited ability to handle complex information in multi-edge scenarios, and they mainly focus on cooperation in content transmission while scarcely considering cooperation in cache replacement. As a result, they cannot effectively utilize the cache space of collaborative edges, leading to suboptimal system utility. In this paper, we propose a cache replacement strategy for cooperative edge caching based on a novel multi-agent deep reinforcement learning network. Firstly, we present a cooperative edge caching model aimed at maximizing the system throughput. Then, we formulate the cache replacement process in the cooperative edge caching system as a Markov Game (MG) model. Finally, we design a Discrete MADDPG algorithm based on a discrete multi-agent actor-critic network to derive the cache replacement strategy and effectively manage content redundancy within the system. Simulation results demonstrate that our proposed algorithm achieves higher system throughput while effectively controlling content redundancy.
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.