Coded caching schemes are used to reduce computer network traffics in peak time. To determine the efficiency of the schemes, \cite{MN} defined the information rate of the schemes and gave a construction of optimal coded caching schemes. However, their construction needs to split the data into a large number of packets which may cause constraints in real applications. Many researchers then constructed new coded caching schemes to reduce the number of packets but that increased the information rate. We define an optimization of coded caching schemes under the limitation of the number of packets which may be used to verify the efficiency of these schemes. We also give some constructions for several infinite classes of optimal coded caching schemes under the new definition.

翻译：编码缓存方案用于减少网络高峰时段的计算机流量。为了确定方案的效率，文献\cite{MN}定义了这些方案的信息速率，并给出了一种最优编码缓存方案的构造方法。然而，他们的构造需要将数据分割成大量数据包，这在实际应用中可能导致限制。许多研究者随后构建了新的编码缓存方案以减少数据包数量，但这增加了信息速率。我们定义了在数据包数量限制下编码缓存方案的优化问题，该优化可用于验证这些方案的效率。同时，我们还在新定义下给出了若干无限类最优编码缓存方案的构造方法。