期刊
IEEE COMMUNICATIONS LETTERS
卷 22, 期 2, 页码 236-239出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCOMM.2017.2765629
关键词
Coded caching; placement delivery array; strong edge coloring; bipartite graphs
资金
- National Science Foundation of China (NSFC) [61325005]
- NSFC [61771406]
- Guangxi Natural Science Foundations [2016GXNSFFA380011]
The technique of coded caching proposed by Madddah-Ali and Niesen is a promising approach to alleviate the load of networks during peak-traffic times. Recently, placement delivery array (PDA) was presented to characterize both the placement and delivery phase in a single array for the centralized coded caching algorithm. In this letter, we reinterpret PDA from a new perspective, i.e., the strong edge coloring of bipartite graph (bigraph). We prove that, a PDA is equivalent to a strong edge colored bigraph. Thus, we can construct a class of PDAs from existing structures in bigraphs. The class subsumes the scheme proposed by Maddah-Ali et al. and a more general class of PDAs proposed by Shangguan et al. as special cases.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据