Abstract
We consider private information retrieval (PIR) in a content delivery scenario where, to reduce the backhaul usage, data is cached using maximum distance separable codes in a number of small-cell base stations (SBSs). We present a PIR protocol that allows the user to retrieve files of different popularities from the network without revealing the identity of the desired file to curious SBSs that potentially collaborate. We formulate an optimization problem to optimize the content placement and the number of queries of the protocol such that the backhaul rate is minimized. We further prove that, contrary to the case of no PIR, uniform content placement is optimal. Compared to a recently proposed protocol by Kumar et al. the presented protocol gives a reduced backhaul rate.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
