A Low-Complexity User-Preference-Aware Decentralized Coded Caching Based on User Pairing

doi:10.1109/JIOT.2024.3425637

	A Low-Complexity User-Preference-Aware Decentralized Coded Caching Based on User Pairing
	Xing, Wang 1,2; Liu, Ling 1,2; Zhou, Yiqing 1,2; Shi, Jinglin 1,2
	2024-10-15
发表期刊	IEEE INTERNET OF THINGS JOURNAL
ISSN	2327-4662
卷号	11 期号:20 页码:33120-33132
摘要	Decentralized coded caching (DCC) is promising to relieve the load pressure of the networks (i.e., reducing the delivery rate) by creating multicast opportunities for a group of users. However, DCC suffers from high complexity (i.e., exponential of user number) because multicast opportunities are obtained by traversing all the possible user subsets. Considering individual user preferences, this article proposes a low-complexity user-pair-based modified DCC scheme (UP-MDCC). It only traverses user subsets with two users (i.e., user-pair) to generate coded subpackages, while obtaining similar delivery rate performance as DCC. To achieve this, we first update the traditional DCC to modified DCC (MDCC). Different to DCC which caches all N contents uniformly, MDCC can choose the favorite $N_{s}$ contents to cache, such that more caching capacity can be allocated to the contents with higher requesting probability. Then, given MDCC, the relationship between the delivery rate and the number of cached contents is derived. It is revealed that when the favorite contents are entirely cached for each user, more than 99% of the delivery rate gain is generated by the user subsets containing only two users. Therefore, a low-complexity UP-MDCC can be proposed by limiting MDCC to traverse only the user subsets containing two users. Moreover, to find the optimal user-pairs to provide the minimum delivery rate for UP-MDCC, a graph-partitioning-based user-pairing strategy (GP-UPS) is proposed. Simulations verify that with GP-UPS, UP-MDCC can achieve similar delivery rate as that of uncoded placement absolutely fair (UPAF) caching and MDCC with a gap of less than 1%. Moreover, compared to DCC, the number of user subsets traversed is significantly reduced in UP-MDCC and the complexity is reduced from exponential to square of user number.
关键词	Unicast Internet of Things Servers Probability distribution Computational complexity Tin Simulation Coded caching computational complexity delivery rate individual user preferences multicast
DOI	10.1109/JIOT.2024.3425637
收录类别	SCI
语种	英语
资助项目	National Key Research and Development Program of China[2020YFB1806904] ; National Natural Science Foundation of China[U21A20449] ; Jiangsu Provincial Key Research and Development Program[BE2021013-2]
WOS研究方向	Computer Science ; Engineering ; Telecommunications
WOS类目	Computer Science, Information Systems ; Engineering, Electrical & Electronic ; Telecommunications
WOS记录号	WOS:001330865200017
出版者	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
引用统计
文献类型	期刊论文
条目标识符	http://119.78.100.204/handle/2XEOYT63/39526
专题	中国科学院计算技术研究所期刊论文_英文
通讯作者	Zhou, Yiqing
作者单位	1.Chinese Acad Sci, Inst Comp Technol, State Key Lab Processors, Beijing 100864, Peoples R China 2.Univ Chinese Acad Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Xing, Wang,Liu, Ling,Zhou, Yiqing,et al. A Low-Complexity User-Preference-Aware Decentralized Coded Caching Based on User Pairing[J]. IEEE INTERNET OF THINGS JOURNAL,2024,11(20):33120-33132.
APA	Xing, Wang,Liu, Ling,Zhou, Yiqing,&Shi, Jinglin.(2024).A Low-Complexity User-Preference-Aware Decentralized Coded Caching Based on User Pairing.IEEE INTERNET OF THINGS JOURNAL,11(20),33120-33132.
MLA	Xing, Wang,et al."A Low-Complexity User-Preference-Aware Decentralized Coded Caching Based on User Pairing".IEEE INTERNET OF THINGS JOURNAL 11.20(2024):33120-33132.