ISIT 2019, IEEE International Symposium on Information Theory, 7-12 July 2019, Paris, France
The work studies the K-user shared-link broadcast channel with coded caching, where each user’s file-request comes with a certain Quality-of-Service (QoS) requirement, thus
allowing – in the context of multi-layered coding – users to download only those file layers that are necessary to meet their own QoS requirements. The work characterizes the exact optimal worst-case delivery time, under the assumption of uncoded cache placement that is oblivious to the individual QoS requirement of each user. The work derives a new index coding based information theoretic converse, which interestingly tells us exactly
how to optimally cache.
Type:
Conference
City:
Paris
Date:
2019-07-07
Department:
Communication systems
Eurecom Ref:
5890
Copyright:
© 2019 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:
