On the Effective Throughput of Coded Caching: A Game Theoretic Perspective

TL;DR

This paper analyzes the effective throughput of coded caching in wireless networks with heterogeneous user preferences, using game theory and proposing a fair caching scheme to optimize cooperation and throughput gains.

Contribution

It introduces a convex domain characterization of effective throughput and proposes a UPAF caching scheme for multiuser scenarios with heterogeneous preferences.

Findings

Effective throughput domain is convex and can be characterized by its boundary.

UPAF caching scheme ensures fairness and efficiency in heterogeneous user settings.

Users with concentrated preferences achieve higher throughput gains.

Abstract

Recently coded caching has emerged as a promising means to handle continuously increasing wireless traffic. However, coded caching requires users to cooperate in order to minimize the overall transmission rate. How users with heterogeneous preferences cooperate in coded caching and how to calculate the resulting caching gains are still open problems. In this paper, a two-phase cache-aided network is investigated, in which users with heterogeneous preferences are served by a base station through a shared link. Effective throughput is considered as a performance metric. It is proved that the achievable domain of effective throughputs is a convex set and can be characterized by its boundary. A special type of caching schemes, named uncoded placement absolutely-fair (UPAF) caching, is studied. For the two-user case, games are formulated to allocate effective throughput gains for the two users. For the general multiuser case, a UPAF policy is proposed to organize user cooperation. It is shown that users with more concentrated preferences can obtain higher effective throughputs.