Open AccessFundamental limits of caching: improved bounds for users with small buffers
Author(s) -
Chen Zhi,
Fan Pingyi,
Letaief Khaled Ben
Publication year - 2016
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2015.1205
Subject(s) - computer science , set (abstract data type) , upper and lower bounds , computer network , cache , buffer (optical fiber) , algorithm , mathematics , telecommunications , mathematical analysis , programming language
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.