Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Attend a technical seminar exploring advanced content caching strategies using restless multi-armed bandit algorithms for dynamic content delivery systems. Learn how to optimize content fetching and caching decisions at base stations when contents are continuously updated at central servers, balancing fixed fetching costs against aging costs proportional to content age-of-version. Discover the mathematical formulation of this optimization problem as a continuous time restless multi-armed bandit process, where each content represents an arm, and understand the proof of indexability for single content problems. Explore Whittle index-based solutions for joint optimization problems and examine how introducing a "wait" option for base stations affects system dynamics and caching policies. Compare proposed policies against recent research and analyze their near-optimal performance through simulation results. The presentation covers communication networks, edge caching, edge computing, and optimization techniques relevant to modern content delivery networks.
