TY - JOUR
T1 - On the Effective Throughput of Coded Caching with Heterogeneous User Preferences
T2 - A Game Theoretic Perspective
AU - Lu, Yawei
AU - Li, Changkun
AU - Chen, Wei
AU - Vincent Poor, H.
N1 - Funding Information:
Manuscript received November 29, 2019; revised May 23, 2020 and September 18, 2020; accepted November 1, 2020. Date of publication November 19, 2020; date of current version March 17, 2021. This research was supported in part by the National Science Foundation of China under Grant No. 61671269, the Chinese National Key Research and Development Program under Grant 2018YFA0701601, and the U.S. National Science Foundation under Grants CCF-0939370 and CCF-1908308. The associate editor coordinating the review of this article and approving it for publication was S. Rini. (Corresponding author: Wei Chen.) Yawei Lu, Changkun Li, and Wei Chen are with the Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, Beijing 100084, China, and also with the Department of Electronic Engineering, Tsinghua University, Beijing 100084, China (e-mail: lyw15@mails.tsinghua.edu.cn; lck19@mails.tsinghua.edu.cn; wchen@tsinghua.edu.cn).
Publisher Copyright:
© 1972-2012 IEEE.
PY - 2021/3
Y1 - 2021/3
N2 - Proactive caching has emerged as a promising means to accommodate increased demands for wireless capacity. However, studies of proactive caching usually focus on minimizing the overall load of cache-Aided networks. How to calculate each user's caching gain is still an open problem. 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, which describes the reduction in each user's transmission cost. All possible values of effective throughputs achieved by legitimate caching policies form an achievable domain. It is proved that the achievable domain is a convex set and can be characterized by its boundary. A special type of caching policies, termed 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.
AB - Proactive caching has emerged as a promising means to accommodate increased demands for wireless capacity. However, studies of proactive caching usually focus on minimizing the overall load of cache-Aided networks. How to calculate each user's caching gain is still an open problem. 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, which describes the reduction in each user's transmission cost. All possible values of effective throughputs achieved by legitimate caching policies form an achievable domain. It is proved that the achievable domain is a convex set and can be characterized by its boundary. A special type of caching policies, termed 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.
KW - Coded caching
KW - effective throughput
KW - game theory
KW - heterogeneous user preferences
UR - http://www.scopus.com/inward/record.url?scp=85096825624&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85096825624&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2020.3039285
DO - 10.1109/TCOMM.2020.3039285
M3 - Review article
AN - SCOPUS:85096825624
SN - 0090-6778
VL - 69
SP - 1387
EP - 1402
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 3
M1 - 9264196
ER -