FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
Top Cited Papers
- 16 September 2013
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (12), 8402-8413
- https://doi.org/10.1109/tit.2013.2281606
Abstract
Video on-demand streaming from Internet-based servers is becoming one of the most important services offered by wireless networks today. In order to improve the area spectral efficiency of video transmission in cellular systems, small cells heterogeneous architectures (e.g., femtocells, WiFi off-loading) are being proposed, such that video traffic to nomadic users can be handled by short-range links to the nearest small cell access points (referred to as “helpers”). As the helper deployment density increases, the backhaul capacity becomes the system bottleneck. In order to alleviate such bottleneck we propose a system where helpers with low-rate backhaul but high storage capacity cache popular video files. Files not available from helpers are transmitted by the cellular base station. We analyze the optimum way of assigning files to the helpers, in order to minimize the expected downloading time for files. We distinguish between the uncoded case (where only complete files are stored) and the coded case, where segments of Fountain-encoded versions of the video files are stored at helpers. We show that the uncoded optimum file assignment is NP-hard, and develop a greedy strategy that is provably within a factor 2 of the optimum. Further, for a special case we provide an efficient algorithm achieving a provably better approximation ratio of 1-(1-1/d )d, where d is the maximum number of helpers a user can be connected to. We also show that the coded optimum cache assignment problem is convex that can be further reduced to a linear program. We present numerical results comparing the proposed schemes.Keywords
Other Versions
This publication has 31 references indexed in Scilit:
- Proactive selective neighbor caching for enhancing mobility support in information-centric networksPublished by Association for Computing Machinery (ACM) ,2012
- A survey on content-centric technologies for the current Internet: CDN and P2P solutionsComputer Communications, 2012
- EXtending Mobility to Publish/Subscribe Systems Using a Pro-Active Caching ApproachMobile Information Systems, 2010
- Characteristics of YouTube network traffic at a campus network – Measurements, models, and implicationsComputer Networks, 2009
- Approximation Algorithms for Data Placement ProblemsSIAM Journal on Computing, 2008
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)Published by Springer Science and Business Media LLC ,2007
- Improving Wireless Sensor Network Lifetime through Power Aware OrganizationWireless Networks, 2005
- Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance GuaranteeJournal of Combinatorial Optimization, 2004
- Consistent hashing and random treesPublished by Association for Computing Machinery (ACM) ,1997
- An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 1978