Optimal and Practical Algorithms for Implementing Wireless CDN Based on Base Stations

Jiayi Liu, Qinghai Yang, Gwendal Simon · 2016

The development of Network Function Virtualization (NFV) and Software Defined Networks (SDN) standards is an opportunity for Mobile Network Operators (MNOs) to deploy Content Delivery Network (CDN) functionalities into the mobile network edge, such as Base Stations (BSs). In this paper, we investigated the content placement problem for the BS-based wireless CDN system. We call the storage resources implemented on BSs as storage helpers. Due to the limited helper storage capacity and the limited user population served per BS, helpers exhibit low hit ratio comparing to traditional CDN edge servers serving a wide area. Then, cooperation is a suitable means to enhance the performance of the wireless CDN system. We propose that BSs close to each other cooperate in replicating content and replying user requests. We formulate the optimum content placement problem to minimize the traffic pressure on mobile network gateways, and show the problem complexity is NP-Hard. We then transform the problem into a multiple-Maximum Weighted Independent Set problem, and propose a heuristic algorithm. The evaluation shows that the hit ratio is improved by our algorithm comparing to the traditional Least Frequently Used (LFU) policy without cooperation.

Read the paper · More papers on PaperTik