Abstract

The proliferation of multimedia services creates an explosive growth of video traffic in cellular networks, which is oftentimes caused by requests from different users of the same (popular) video content. We model the problem of optimal placement of popular video files in the cache of small cells as a 0/1 Knapsack problem, and use dynamic programming to solve it. The performance of the obtained optimal solution is evaluated and compared with that of other ad-hoc placement strategies. Useful guidelines for the design of cache-enabled cellular networks are also given.

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 call

Similar Papers

Paper Title
Journal
Date
Author

More From: IEEE Networking Letters

Paper Title
Journal
Date
Author

Disclaimer: 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.