Approximation caching and routing algorithms for massive mobile data delivery
Small cells constitute a promising solution for managing the mobile data growth that has overwhelmed network operators. Local caching of popular content items at the small cell base stations has been proposed in order to decrease the capacity-and hence the cost- of the backhaul links that connect these base stations with the core network. However, deriving the optimal caching policy remains a challenging open problem especially if one considers realistic parameters such as the bandwidth limitation of the base stations. The latter constraint is particularly important for cases when users requests are massive. We consider such a scenario and formulate the joint caching and routing problem aiming to maximize the fraction of content requests served by the deployed small cell base stations. This is an NP-hard problem and hence we cannot obtain an exact optimal solution. Thus, we present a novel approximation framework based on a reduction to a well known variant of the facility location problem. This allows us to exploit the rich literature in facility location problems, in order to establish bounded approximation algorithms for our problem. © 2013 IEEE.