On the optimality of 0-1 data placement in cache networks

Salehi, M. J ; Sharif University of Technology | 2018

302 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/TCOMM.2017.2771377
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2018
  4. Abstract:
  5. Considering cache enabled networks, optimal content placement minimizing the total cost of communication in such networks is studied, leading to a surprising fundamental 0-1 law for non-redundant cache placement strategies, where the total cache sizes associated with each file does not exceed the file size. In other words, for such strategies, we prove that any non-redundant cache placement strategy can be transformed, with no additional cost, to a strategy in which at every node, each file is either cached completely or not cached at all. Moreover, we obtain a sufficient condition under which the optimal cache placement strategy is in fact non-redundant. This result together with the 0-1 law reveals that situations exist, where optimal content placement is achieved just by uncoded placement of whole files in caches. © 1972-2012 IEEE
  6. Keywords:
  7. Cache memories ; Codes ; Data management ; Buffer storage ; Cache memory ; Computer networks ; Additional costs ; Cache placement ; Cache size ; Codes ; Data placement in caches ; Non-redundant ; Optimal content ; Optimality ; Information management
  8. Source: IEEE Transactions on Communications ; Volume 66, Issue 3 , March , 2018 , Pages 1053-1063 ; 00906778 (ISSN)
  9. URL: https://ieeexplore.ieee.org/document/8101487