2018/02/21 by Minquan Cheng, Qiaoling Zhang, Cheng, Minquan +6
Computer Science · Mathematics · #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Opportunistic and Delay-Tolerant Networks #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1802.07410
12 pages
openalex publication_date 2018/02/21 · arxiv created 2018/06/27 · arxiv updated 2018/06/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Coded caching has been widely used in the wireless network for shifting the some transmissions during the peak traffic times to the off-peak traffic times. Multi-server coded caching, which can share responsibility for the total amount of transmission in the wireless network during the peak traffic times by means of the collaboration among these servers, can be seen everywhere in our life. The three servers setting (two data servers and one parity check server) is used in practice, e.g. redundant array of independent disks-4. In this scenario, there are total N files which are equally stored in two data servers respectively and K users each of which has the memory size of M files. Each server connects to users by an independently channel. During the off-peak traffic times, two data servers place some parts of each files in each user's cache. In that time, servers do not know users' requests in future. During the peak traffic times each user just requests one file from N files. Luo et al. in 2016 proposed the first coded caching scheme for this setting. In this paper, we proposed some method that further reduces the amount of transmission in each channel when (KM)/(N) is odd. This method also improves the transmission rate for systems with general multiply servers.