Fundamental limits of caching: improved bounds for users with small buffers. Issue 17 (1st November 2016)

• Record Type: Journal Article
• Authors: Chen, Zhi; Fan, Pingyi; Letaief, Khaled Ben
• Is Part Of: IET communications. Volume 10:Issue 17(2016)
• Page Start: 2315
• Page End: 2318
• Publication Date: 2016-11-01
• Subjects: cache storage -- file servers -- network coding; caching problem -- fundamental limits -- improved user bounds -- buffer sizes -- file server -- cut‐set bound; Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/iet-com.2015.1205
• Languages: English
• ISSNs: 1751-8628

Abstract

Abstract : In this study, the caching problem is investigated. Assuming that the users are only equipped with buffer of small sizes, the peak rate of caching problem is investigated in this study. In contrast to recent results in the literature, this study shows that under some specific condition, i.e. if the number of users is no less than the amount of files in the server, a lower peak rate of caching is achievable. Furthermore, this new presented peak rate of caching is demonstrated to coincide with the well‐known cut‐set bound.