Coded caching schemes exploit the cumulative cache memory of the users by using simple linear encoders, outperforming uncoded schemes where cache contents are only used locally. Considering multi-AP WLANs and video-on-demand (VoD) applications where users stream videos by sequentially requesting video ``chunks", we apply existing coded caching techniques with reduced subpacketization order, and obtain a computational method to determine the theoretical throughput region of the users' content delivery rates, calculated as the number of chunks delivered per unit of time per user. We then solve the fairness scheduling problem by maximizing the desired fairness metric over the throughput region. We also provide two heuristic methods with reduced complexity, where one of them maximizes the desired fairness metric over a smaller region than the throughput region, and the other uses a greedy algorithmic approach to associate users with APs in a fair way.

翻译：编码缓存方案利用用户累积缓存内存，通过简单的线性编码器实现性能提升，优于仅本地使用缓存内容的非编码方案。针对多接入点无线局域网（WLAN）和视频点播（VoD）应用中用户通过顺序请求视频“块”来流式播放视频的场景，我们应用了子包化阶数降低的现有编码缓存技术，并得到一种计算方法来确定用户内容交付速率的理论吞吐量区域（以每个用户每单位时间交付的块数衡量）。随后，我们通过在吞吐量区域上最大化所需的公平性度量来解决公平调度问题。我们还提供了两种复杂度较低的启发式方法：一种方法在比吞吐量区域更小的区域上最大化所需的公平性度量；另一种方法采用贪心算法方法以公平方式将用户与接入点相关联。