King's College London

Research portal

Learning-based content caching in collaborative edge networks

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

Original languageEnglish
Title of host publication2021 IEEE Wireless Communications and Networking Conference Workshops, WCNCW 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728195070
DOIs
Published29 Mar 2021
Event2021 IEEE Wireless Communications and Networking Conference Workshops, WCNCW 2021 - Nanjing, China
Duration: 29 Mar 2021 → …

Publication series

Name2021 IEEE Wireless Communications and Networking Conference Workshops, WCNCW 2021

Conference

Conference2021 IEEE Wireless Communications and Networking Conference Workshops, WCNCW 2021
CountryChina
CityNanjing
Period29/03/2021 → …

Bibliographical note

Publisher Copyright: © 2021 IEEE. Copyright: Copyright 2021 Elsevier B.V., All rights reserved.

King's Authors

Abstract

Wireless caching techniques are widely adopted in edge computing systems to improve the quality of services at the edge of the network. This paper studies the problem of online content caching and elimination without the in-advance knowledge of content popularity in a collaborative edge caching network, which consists of a set of edge nodes equipped with base stations and storage units. We aim to minimize the content providers' cost while ensuring the quality of service (QoS) in the long run under the uncertainties of requested content. To this end, we formulate the problem of minimizing the system cost consisting of cache cost, migration cost and QoS penalty cost. In order to address this problem, we propose an algorithm for Collaborative Edge Caching based on the Thompson Sampling (CEC-TS) technique to update the caching decisions via adaptive learning of the popularity of requested contents. Simulation results demonstrate that the proposed CEC-TS algorithm achieves lower content providers' and QoS penalty cost against baseline schemes, i.e., the cloud-only and the first-in first-out (FIFO), in the long run.

View graph of relations

© 2020 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454