Abstract
In this letter, we study the optimization for cache content placement to minimize the backhaul load subject to cache capacity constraints for caching enabled small cell networks with heterogeneous file and cache sizes. Multicast content delivery is adopted to reduce the backhaul rate exploiting the independence among maximum distance separable coded packets.
Highlights
T O ACHIEVE the targets of the fifth-generation (5G) cellular communication systems, an effective solution is to cache popular files at the network edge before users request them
We utilize the independence among maximum distance separable (MDS) coded packets and a near-optimal solution is obtained using a specific solver for mixed integer linear program (MILP) after a series of reformulations
We consider a small cell network comprising a single macro base station (MBS), and K small cells each consisting of a single small-cell base stations (SBSs) and Ik users among which each SBS can only answer to the requests of a maximum of I (I ≥ Ik, ∀k) users at the same time
Summary
T O ACHIEVE the targets of the fifth-generation (5G) cellular communication systems, an effective solution is to cache popular files at the network edge before users request them. This letter aims to obtain the optimal (offline) cache content placement for minimizing the backhaul rate subject to cache capacity constraints for small cell networks in which maximum distance separable (MDS) codes are adopted.. Unlike [8] considering an unlikely setting of identical content placement in all caches with homogeneous settings, we consider a more practical scenario with heterogeneous file and cache sizes, and in this case the content placement in different caches will not always be the same and it is no longer available for the macro base station (MBS) to deliver the uncached content via a shared link To tackle this problem, we utilize the independence among MDS coded packets and a near-optimal solution is obtained using a specific solver for mixed integer linear program (MILP) after a series of reformulations.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
