K Users Caching Two Files: An Improved Achievable Rate

Caching is an approach to smoothen the variability of traffic over time. Recently it has been proved that the local memories at the users can be exploited for reducing the peak traffic in a much more efficient way than previously believed. In this work we improve upon the existing results and introduce a novel caching strategy that takes advantage of simultaneous coded placement and coded delivery in order to decrease the worst case achievable rate with $2$ files and $K$ users. We will show that for any cache size $\frac{1}{K} < M < 1$ our scheme outperforms the state of the art.


Published in:
2016 Annual Conference On Information Science And Systems (Ciss)
Presented at:
50th Annual Conference on Information Sciences and Systems (CISS), Princeton, New Jersey, USA, March 16-18, 2016
Year:
2016
Publisher:
New York, Ieee
ISBN:
978-1-4673-9457-4
Keywords:
Laboratories:




 Record created 2016-04-08, last modified 2018-10-07

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)