Chapter 22: Open Problems

Learning Objectives

• Identify the gap between MAN optimality (uncoded placement) and unknown coded-placement optimum
• Understand the heterogeneous-cache open problem and known bounds
• Characterize finite-blocklength penalties in coded caching
• Assess the gap between shared-link and wireless coded caching results
• Overview open integration problems with modern architectures (Open RAN, edge computing, ISAC)
• Position the CommIT research agenda for the next decade