Content size-aware edge caching: a size-weighted popularity-based approach

Qiang Li, Wennian Shi, Yong Xiao, Xiaohu Ge, Ashish Pandharipande

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

11 Downloads (Pure)

Abstract

In this paper, content caching is considered at the edge of the network with an objective of offloading recurrent traffic on the capacity-stringent backhaul links to the vicinity of end users. A radio access network equipped with edge servers is considered for caching contents of various sizes, based on which problems of maximizing the edge cache-hit-ratio and minimizing the average content-provisioning cost are respectively formulated. To solve the underlying 0-1 Knapsack problem, a size-weighted popularity (SWP)-based caching framework is proposed, where both content popularity and content size are taken into account when determining the contents to be cached. Depending on the available knowledge and the manner in which the contents are pre-fetched and cached at the edge servers, two algorithms: proactive and reactive, are proposed for the implementation of SWP-based caching. Simulation results are presented to evaluate the performance of our proposed algorithms. We observe a fundamental tradeoff between the average content-provisioning cost and the cache-hit-ratio, and the proactive algorithm outperforms the reactive algorithm.

Original languageEnglish
Title of host publication2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Number of pages5
ISBN (Electronic)978-1-5386-4727-1
ISBN (Print)978-1-5386-4728-8
DOIs
Publication statusPublished - 20 Feb 2019
Event2018 IEEE Global Communications Conference, GLOBECOM 2018 - Abu Dhabi, United Arab Emirates
Duration: 9 Dec 201813 Dec 2018

Conference

Conference2018 IEEE Global Communications Conference, GLOBECOM 2018
Abbreviated titleGLOBECOM 2018
CountryUnited Arab Emirates
CityAbu Dhabi
Period9/12/1813/12/18

Fingerprint

Caching
Servers
provisioning
Hits
Telecommunication traffic
Cache
Telecommunication links
Costs
Server
costs
Knapsack Problem
tradeoffs
traffic
Trade-offs
Traffic
Evaluate

Keywords

  • cache-hit-ratio
  • content popularity
  • content size
  • Edge caching
  • proactive and reactive

Cite this

Li, Q., Shi, W., Xiao, Y., Ge, X., & Pandharipande, A. (2019). Content size-aware edge caching: a size-weighted popularity-based approach. In 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings [8647794] Piscataway: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/GLOCOM.2018.8647794
Li, Qiang ; Shi, Wennian ; Xiao, Yong ; Ge, Xiaohu ; Pandharipande, Ashish. / Content size-aware edge caching : a size-weighted popularity-based approach. 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings. Piscataway : Institute of Electrical and Electronics Engineers, 2019.
@inproceedings{3740ae2c9e304f239a51d864a8bc4ac6,
title = "Content size-aware edge caching: a size-weighted popularity-based approach",
abstract = "In this paper, content caching is considered at the edge of the network with an objective of offloading recurrent traffic on the capacity-stringent backhaul links to the vicinity of end users. A radio access network equipped with edge servers is considered for caching contents of various sizes, based on which problems of maximizing the edge cache-hit-ratio and minimizing the average content-provisioning cost are respectively formulated. To solve the underlying 0-1 Knapsack problem, a size-weighted popularity (SWP)-based caching framework is proposed, where both content popularity and content size are taken into account when determining the contents to be cached. Depending on the available knowledge and the manner in which the contents are pre-fetched and cached at the edge servers, two algorithms: proactive and reactive, are proposed for the implementation of SWP-based caching. Simulation results are presented to evaluate the performance of our proposed algorithms. We observe a fundamental tradeoff between the average content-provisioning cost and the cache-hit-ratio, and the proactive algorithm outperforms the reactive algorithm.",
keywords = "cache-hit-ratio, content popularity, content size, Edge caching, proactive and reactive",
author = "Qiang Li and Wennian Shi and Yong Xiao and Xiaohu Ge and Ashish Pandharipande",
year = "2019",
month = "2",
day = "20",
doi = "10.1109/GLOCOM.2018.8647794",
language = "English",
isbn = "978-1-5386-4728-8",
booktitle = "2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers",
address = "United States",

}

Li, Q, Shi, W, Xiao, Y, Ge, X & Pandharipande, A 2019, Content size-aware edge caching: a size-weighted popularity-based approach. in 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings., 8647794, Institute of Electrical and Electronics Engineers, Piscataway, 2018 IEEE Global Communications Conference, GLOBECOM 2018, Abu Dhabi, United Arab Emirates, 9/12/18. https://doi.org/10.1109/GLOCOM.2018.8647794

Content size-aware edge caching : a size-weighted popularity-based approach. / Li, Qiang; Shi, Wennian; Xiao, Yong; Ge, Xiaohu; Pandharipande, Ashish.

2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings. Piscataway : Institute of Electrical and Electronics Engineers, 2019. 8647794.

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

TY - GEN

T1 - Content size-aware edge caching

T2 - a size-weighted popularity-based approach

AU - Li, Qiang

AU - Shi, Wennian

AU - Xiao, Yong

AU - Ge, Xiaohu

AU - Pandharipande, Ashish

PY - 2019/2/20

Y1 - 2019/2/20

N2 - In this paper, content caching is considered at the edge of the network with an objective of offloading recurrent traffic on the capacity-stringent backhaul links to the vicinity of end users. A radio access network equipped with edge servers is considered for caching contents of various sizes, based on which problems of maximizing the edge cache-hit-ratio and minimizing the average content-provisioning cost are respectively formulated. To solve the underlying 0-1 Knapsack problem, a size-weighted popularity (SWP)-based caching framework is proposed, where both content popularity and content size are taken into account when determining the contents to be cached. Depending on the available knowledge and the manner in which the contents are pre-fetched and cached at the edge servers, two algorithms: proactive and reactive, are proposed for the implementation of SWP-based caching. Simulation results are presented to evaluate the performance of our proposed algorithms. We observe a fundamental tradeoff between the average content-provisioning cost and the cache-hit-ratio, and the proactive algorithm outperforms the reactive algorithm.

AB - In this paper, content caching is considered at the edge of the network with an objective of offloading recurrent traffic on the capacity-stringent backhaul links to the vicinity of end users. A radio access network equipped with edge servers is considered for caching contents of various sizes, based on which problems of maximizing the edge cache-hit-ratio and minimizing the average content-provisioning cost are respectively formulated. To solve the underlying 0-1 Knapsack problem, a size-weighted popularity (SWP)-based caching framework is proposed, where both content popularity and content size are taken into account when determining the contents to be cached. Depending on the available knowledge and the manner in which the contents are pre-fetched and cached at the edge servers, two algorithms: proactive and reactive, are proposed for the implementation of SWP-based caching. Simulation results are presented to evaluate the performance of our proposed algorithms. We observe a fundamental tradeoff between the average content-provisioning cost and the cache-hit-ratio, and the proactive algorithm outperforms the reactive algorithm.

KW - cache-hit-ratio

KW - content popularity

KW - content size

KW - Edge caching

KW - proactive and reactive

UR - http://www.scopus.com/inward/record.url?scp=85063426512&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2018.8647794

DO - 10.1109/GLOCOM.2018.8647794

M3 - Conference contribution

AN - SCOPUS:85063426512

SN - 978-1-5386-4728-8

BT - 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

ER -

Li Q, Shi W, Xiao Y, Ge X, Pandharipande A. Content size-aware edge caching: a size-weighted popularity-based approach. In 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings. Piscataway: Institute of Electrical and Electronics Engineers. 2019. 8647794 https://doi.org/10.1109/GLOCOM.2018.8647794