Provisioning Cost-Effective Mobile Video Caching

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

6 Citations (Scopus)
277 Downloads (Pure)

Abstract

The exploding volumes of mobile video traffic call for deploying content caches inside mobile operators network. With in-network caching, users’ requests for popular content can be served from a content cache deployed at mobile gateways in vicinity to the end user, therefore considerably reducing the load on the content servers and the backbone of operator’s network. In practice, content caches can be installed at multiple levels inside an operator’s network (e.g., serving gateway, packet data network gateway, RAN, etc.), leading to an idea of hierarchical in-network video caching. In order to evaluate the pros and cons of hierarchical caching, in this paper we formulate a
cache provisioning problem which aims to find the best tradeoff between the cost of cache storage and bandwidth savings from hierarchical caching. More specifically, we aim to find the optimal size of video caches at different layers of a hierarchical in-network caching architecture which minimizes the ratio of transmission bandwidth cost to storage cost. We overcome the complexity of our problem which is formulated as a binary integer programming (BIP) by using canonical duality theory (CDT). Numerical results obtained using the invasive weed optimization (IWO) show that important gains can be achieved, with benefit-cost ratio and cost efficiency improvements of more than 43% and 38%, respectively
Original languageEnglish
Title of host publicationIEEE International Conference on Communications (ICC) 2016
Number of pages7
ISBN (Electronic)1938-1883
DOIs
Publication statusPublished - 14 Jul 2016

Keywords

  • Cache storage, canonical duality, hierarchical in-network caching, invasive weed optimization, mobile video delivery.

Fingerprint

Dive into the research topics of 'Provisioning Cost-Effective Mobile Video Caching'. Together they form a unique fingerprint.

Cite this