期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 66, 期 6, 页码 3407-3416出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2020.2964762
关键词
Private information retrieval (PIR); uncoded caching; heterogeneous cache sizes; capacity
资金
- NSF [CNS 15-26608, CCF 17-13977, ECCS 18-07348]
We consider private information retrieval (PIR) of a single file out of K files from N non-colluding databases with heterogeneous storage constraints m = (m(1), ... , m(N)). The aim of this work is to jointly design the content placement phase and the information retrieval phase in order to minimize the download cost in the PIR phase. We characterize the optimal PIR download cost as a linear program. By analyzing the structure of the optimal solution of this linear program, we show that, surprisingly, the optimal download cost in our heterogeneous case matches its homogeneous counterpart where all databases have the same average storage constraint mu = 1/N Sigma(N)(n=1) m(n). Thus, we show that there is no loss in the PIR capacity due to heterogeneity of storage spaces of the databases. We provide the optimum content placement explicitly for N = 3.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据