A Provably Efficient Online Collaborative Caching Algorithm for Multicell-Coordinated Systems

Document Type

Article

Publication Date

8-1-2016

Abstract

Caching at the base stations brings the contents closer to the users, reduces the traffic through the backhaul links, and reduces the delay experienced by the cellular users. The cellular network operator may charge the content providers for caching their contents. Moreover, content providers may lose their users if the users are not getting their desired quality of service, such as maximum tolerable delay in Video on Demand services. In this paper, we study the collaborative caching problem for a multicell-coordinated system from the point of view of minimizing the total cost paid by the content providers. We formulate the problem as an Integer Linear Program and prove its NP-completeness. We also provide an online caching algorithm that does not require any knowledge about the contents popularities. We prove that the online algorithm achieves a competitive ratio of O(log (n)), and we show that the best competitive ratio that any online algorithm can achieve is Ω(log (n)log log (n)). Therefore, our proposed caching algorithm is provably efficient. Through simulations, we show that our online algorithm performs very close to the optimal offline collaborative scheme, and can outperform it when contents popularities are not properly estimated.

Identifier

84978245727 (Scopus)

Publication Title

IEEE Transactions on Mobile Computing

External Full Text Location

https://doi.org/10.1109/TMC.2015.2474364

ISSN

15361233

First Page

1863

Last Page

1876

Issue

8

Volume

15

Grant

1331018

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS