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

Salehi, M. J ; Sharif University of Technology

367 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/TCOMM.2017.2771377
  3. Abstract:
  4. 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 nonredundant 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. IEEE
  5. Keywords:
  6. Cache memories ; 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
  7. Source: IEEE Transactions on Communications ; 2017 ; 00906778 (ISSN)
  8. URL: https://ieeexplore.ieee.org/document/8101487