IEICE TRANSACTIONS on Fundamentals
Achievable Rate Regions of Cache-Aided Broadcast Networks for Delivering Content with a Multilayer Structure
Summary :
This paper deals with a broadcast network with a server and many users. The server has files of content such as music and videos, and each user requests one of these files, where each file consists of some separated layers like a file encoded by a scalable video coding. On the other hand, each user has a local memory, and a part of information of the files is cached (i.e., stored) in these memories in advance of users' requests. By using the cached information as side information, the server encodes files based on users' requests. Then, it sends a codeword through an error-free shared link for which all users can receive a common codeword from the server without error. We assume that the server transmits some layers up to a certain level of requested files at each different transmission rate (i.e., the codeword length per file size) corresponding to each level. In this paper, we focus on the region of tuples of these rates such that layers up to any level of requested files are recovered at users with an arbitrarily small error probability. Then, we give inner and outer bounds on this region.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.12 pp.2629-2640
- Publication Date
- 2017/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E100.A.2629
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Shannon Theory
Authors
Tetsunao MATSUTA
Tokyo Institute of Technology
Tomohiko UYEMATSU
Tokyo Institute of Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tetsunao MATSUTA, Tomohiko UYEMATSU, "Achievable Rate Regions of Cache-Aided Broadcast Networks for Delivering Content with a Multilayer Structure" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 12, pp. 2629-2640, December 2017, doi: 10.1587/transfun.E100.A.2629.
Abstract: This paper deals with a broadcast network with a server and many users. The server has files of content such as music and videos, and each user requests one of these files, where each file consists of some separated layers like a file encoded by a scalable video coding. On the other hand, each user has a local memory, and a part of information of the files is cached (i.e., stored) in these memories in advance of users' requests. By using the cached information as side information, the server encodes files based on users' requests. Then, it sends a codeword through an error-free shared link for which all users can receive a common codeword from the server without error. We assume that the server transmits some layers up to a certain level of requested files at each different transmission rate (i.e., the codeword length per file size) corresponding to each level. In this paper, we focus on the region of tuples of these rates such that layers up to any level of requested files are recovered at users with an arbitrarily small error probability. Then, we give inner and outer bounds on this region.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.2629/_p
Copy
@ARTICLE{e100-a_12_2629,
author={Tetsunao MATSUTA, Tomohiko UYEMATSU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Achievable Rate Regions of Cache-Aided Broadcast Networks for Delivering Content with a Multilayer Structure},
year={2017},
volume={E100-A},
number={12},
pages={2629-2640},
abstract={This paper deals with a broadcast network with a server and many users. The server has files of content such as music and videos, and each user requests one of these files, where each file consists of some separated layers like a file encoded by a scalable video coding. On the other hand, each user has a local memory, and a part of information of the files is cached (i.e., stored) in these memories in advance of users' requests. By using the cached information as side information, the server encodes files based on users' requests. Then, it sends a codeword through an error-free shared link for which all users can receive a common codeword from the server without error. We assume that the server transmits some layers up to a certain level of requested files at each different transmission rate (i.e., the codeword length per file size) corresponding to each level. In this paper, we focus on the region of tuples of these rates such that layers up to any level of requested files are recovered at users with an arbitrarily small error probability. Then, we give inner and outer bounds on this region.},
keywords={},
doi={10.1587/transfun.E100.A.2629},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - Achievable Rate Regions of Cache-Aided Broadcast Networks for Delivering Content with a Multilayer Structure
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2629
EP - 2640
AU - Tetsunao MATSUTA
AU - Tomohiko UYEMATSU
PY - 2017
DO - 10.1587/transfun.E100.A.2629
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2017
AB - This paper deals with a broadcast network with a server and many users. The server has files of content such as music and videos, and each user requests one of these files, where each file consists of some separated layers like a file encoded by a scalable video coding. On the other hand, each user has a local memory, and a part of information of the files is cached (i.e., stored) in these memories in advance of users' requests. By using the cached information as side information, the server encodes files based on users' requests. Then, it sends a codeword through an error-free shared link for which all users can receive a common codeword from the server without error. We assume that the server transmits some layers up to a certain level of requested files at each different transmission rate (i.e., the codeword length per file size) corresponding to each level. In this paper, we focus on the region of tuples of these rates such that layers up to any level of requested files are recovered at users with an arbitrarily small error probability. Then, we give inner and outer bounds on this region.
ER -
English
