Joint Content Delivery and Caching Placement via Dynamic Programming
Bojie Lv, Lexiang Huang, Rui Wang

TL;DR
This paper optimizes content delivery and caching in wireless networks using dynamic programming, proposing low-complexity solutions and proactive caching to reduce resource usage and improve performance.
Contribution
It introduces a Markov decision process framework with a novel Bellman's equation and a linear approximation method for efficient caching and delivery optimization.
Findings
Significant resource reduction at the base station.
Effective low-complexity approximation of value functions.
Proactive caching enhances overall network performance.
Abstract
In this paper, downlink delivery of popular content is optimized with the assistance of wireless cache nodes. Specifically, the requests of one file is modeled as a Poisson point process with finite lifetime, and two downlink transmission modes are considered: (1) the base station multicasts file segments to the requesting users and selected cache nodes; (2) the base station proactively multicasts file segments to the selected cache nodes without requests from users. Hence the cache nodes with decoded files can help to offload the traffic upon the next file request via other air interfaces, e.g. WiFi. Without proactive caching placement, we formulate the downlink traffic offloading as a Markov decision process with random number of stages, and propose a revised Bellman's equation to obtain the optimal control policy. In order to address the prohibitively huge state space, we also…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Cooperative Communication and Network Coding · Opportunistic and Delay-Tolerant Networks
