Optimal Error Correcting Delivery Scheme for an Optimal Coded Caching Scheme with Small Buffers

TL;DR

This paper develops an optimal error correcting delivery scheme for coded caching with small buffers, building on the CFL scheme, and provides closed-form expressions for its average and peak rates under error-prone delivery conditions.

Contribution

It introduces a novel error correcting delivery scheme for CFL-based caching, with explicit formulas for average and peak rates, enhancing robustness in error-prone networks.

Findings

Closed-form expressions for average and peak rates are derived.

An optimal error correcting delivery scheme is proposed for CFL prefetching.

The scheme improves robustness during error-prone delivery phases.

Abstract

Optimal delivery scheme for coded caching problems with small buffer sizes and the number of users no less than the amount of files in the server was proposed by Chen, Fan and Letaief ["Fundamental limits of caching: improved bounds for users with small buffers," (IET Communications), 2016]. This scheme is referred to as the CFL scheme. In this paper, the link between the server and the users is assumed to be error prone only during the delivery phase. Closed form expressions for average rate and peak rate of error correcting delivery scheme for CFL prefetching scheme is obtained. An optimal error correcting delivery scheme for caching problems employing CFL prefetching is proposed.