z-logo
Premium
A user‐centric cooperative edge caching scheme for minimizing delay in 5G content delivery networks
Author(s) -
Tang Shiyu,
Alnoman Ali,
Anpalagan Alagan,
Woungang Isaac
Publication year - 2018
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.3461
Subject(s) - computer science , computer network , base station , cache , provisioning , leverage (statistics) , enhanced data rates for gsm evolution , scheme (mathematics) , bandwidth (computing) , content delivery , content delivery network , distributed computing , server , telecommunications , mathematical analysis , mathematics , machine learning
This paper investigates the problem of user‐centric cooperative edge caching in content delivery networks to leverage service provisioning at the network edge and to improve the quality of experience by minimizing the end‐to‐end delay. By taking advantage of the major characteristics in fifth‐generation networks, users can access contents not only from the nearest small base station (SBS) but also from other SBSs in the vicinity that have the requested precached contents. In the proposed scheme, a user‐centric delivery approach is considered in such a way that the base station can respond to the user request as long as it has enough resources. To this end, a caching algorithm is introduced whereby a group of SBSs cooperatively share storage and decide on the caching policy together aiming to cache as much contents as possible under the capacity constraint. Moreover, a modified matching theory is used for content delivery taking the bandwidth requirements into account. Simulation results show that the proposed scheme can achieve 99.5% local serve ratio when the SBS has a caching capacity of 40 % the overall file size, and 20 available communication channels for content distribution.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here