Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Optimal Content Caching based on Content Popularity for Content Delivery Networks

Not Accessible

Your library or personal account may give you access

Abstract

We consider optimal content caching based on their popularity so as to minimize the content delivery latency. We develop an Integer Linear Programming (ILP) optimization model and a heuristic algorithm to choose cached contents at each local server.

© 2015 Optical Society of America

PDF Article
More Like This
Caching Strategies for Storage-Shared Content Delivery Networks

Ning Wang, Sanjay Kumar Bose, and Gangxiang Shen
Su1L.4 Asia Communications and Photonics Conference (ACP) 2017

Optimal Replica Servers Placement for Content Delivery Networks (Invited)

Xiang Li, Xuejiao Zhao, Sanjay K. Bose, Bowen Chen, Mingyi Gao, and Gangxiang Shen
AS2D.2 Asia Communications and Photonics Conference (ACP) 2016

MixCo: Optimal Cooperative Caching for Mobile Edge Computing in Fiber-Wireless Access Networks

Ning Wang, Weidong Shao, Sanjay K. Bose, and Gangxiang Shen
Th1B.6 Optical Fiber Communication Conference (OFC) 2018

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved