Abstract
To satisfy diverse use cases and business models in fifth generation (5G) wireless communication, network slicing in fog radio access networks (F-RANs) is proposed, which provides a cost efficient networking in a convenient way. However, the resource management for network slices is challenging, especially when the edge caching is utilized to alleviate the fronthaul burden and reduce the delay. In this paper, we investigate the joint sub-carrier allocation and caching placement for two network slices, and an average delay optimization problem for one slice with user data rate guarantee for the other slice is formulated, which can be solved by a two-step iterative algorithm. The core idea is to optimize decoupled variables iteratively via Hungarian method, linear integer programming, and geometric programming(GP) with the help of decomposition. Simulation results reveal a fast convergence speed and a near-optimal performance of the proposed algorithm.
Sign-in/Register to access full text options 
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.
