Erasure broadcast networks with receiver caching

Shirin Saeedi Bidokhti; Michele Wigger; Roy Timo

doi:10.1109/ISIT.2016.7541613

Erasure broadcast networks with receiver caching

Shirin Saeedi Bidokhti, Michele Wigger, Roy Timo

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study the capacity of a broadcast packet-erasure network with receiver caching. The receivers in the network are divided into two groups: A group of strong receivers with small packet erasure probabilities, and a group of weak receivers with large packet erasure probabilities. The weak receivers are provided with local cache memories as compensation for their poor channels. Achievable (lower) and converse (upper) bounds for the optimal capacity-memory tradeoff are derived. The lower bounds are proved using new joint cache-channel coding schemes that significantly outperform naive separate cache-channel coding schemes. For the case of two receivers, the capacity-memory tradeoff is completely characterized for a range of useful cache memory sizes.

Original language	English
Title of host publication	Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1819-1823
Number of pages	5
ISBN (Electronic)	9781509018062
DOIs	https://doi.org/10.1109/ISIT.2016.7541613
Publication status	Published - 10 Aug 2016
Externally published	Yes
Event	2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: 10 Jul 2016 → 15 Jul 2016

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2016-August
ISSN (Print)	2157-8095

Conference

Conference	2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/Territory	Spain
City	Barcelona
Period	10/07/16 → 15/07/16

Access to Document

10.1109/ISIT.2016.7541613

Cite this

Bidokhti, S. S., Wigger, M., & Timo, R. (2016). Erasure broadcast networks with receiver caching. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (pp. 1819-1823). Article 7541613 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541613

@inproceedings{b2a4603d3bea4074a18d5c8c9d6fbb28,

title = "Erasure broadcast networks with receiver caching",

abstract = "We study the capacity of a broadcast packet-erasure network with receiver caching. The receivers in the network are divided into two groups: A group of strong receivers with small packet erasure probabilities, and a group of weak receivers with large packet erasure probabilities. The weak receivers are provided with local cache memories as compensation for their poor channels. Achievable (lower) and converse (upper) bounds for the optimal capacity-memory tradeoff are derived. The lower bounds are proved using new joint cache-channel coding schemes that significantly outperform naive separate cache-channel coding schemes. For the case of two receivers, the capacity-memory tradeoff is completely characterized for a range of useful cache memory sizes.",

author = "Bidokhti, \{Shirin Saeedi\} and Michele Wigger and Roy Timo",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",

year = "2016",

month = aug,

day = "10",

doi = "10.1109/ISIT.2016.7541613",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1819--1823",

booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",

}

Bidokhti, SS, Wigger, M & Timo, R 2016, Erasure broadcast networks with receiver caching. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory., 7541613, IEEE International Symposium on Information Theory - Proceedings, vol. 2016-August, Institute of Electrical and Electronics Engineers Inc., pp. 1819-1823, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 10/07/16. https://doi.org/10.1109/ISIT.2016.7541613

Erasure broadcast networks with receiver caching. / Bidokhti, Shirin Saeedi; Wigger, Michele; Timo, Roy.
Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. p. 1819-1823 7541613 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Erasure broadcast networks with receiver caching

AU - Bidokhti, Shirin Saeedi

AU - Wigger, Michele

AU - Timo, Roy

PY - 2016/8/10

Y1 - 2016/8/10

N2 - We study the capacity of a broadcast packet-erasure network with receiver caching. The receivers in the network are divided into two groups: A group of strong receivers with small packet erasure probabilities, and a group of weak receivers with large packet erasure probabilities. The weak receivers are provided with local cache memories as compensation for their poor channels. Achievable (lower) and converse (upper) bounds for the optimal capacity-memory tradeoff are derived. The lower bounds are proved using new joint cache-channel coding schemes that significantly outperform naive separate cache-channel coding schemes. For the case of two receivers, the capacity-memory tradeoff is completely characterized for a range of useful cache memory sizes.

AB - We study the capacity of a broadcast packet-erasure network with receiver caching. The receivers in the network are divided into two groups: A group of strong receivers with small packet erasure probabilities, and a group of weak receivers with large packet erasure probabilities. The weak receivers are provided with local cache memories as compensation for their poor channels. Achievable (lower) and converse (upper) bounds for the optimal capacity-memory tradeoff are derived. The lower bounds are proved using new joint cache-channel coding schemes that significantly outperform naive separate cache-channel coding schemes. For the case of two receivers, the capacity-memory tradeoff is completely characterized for a range of useful cache memory sizes.

U2 - 10.1109/ISIT.2016.7541613

DO - 10.1109/ISIT.2016.7541613

M3 - Conference contribution

AN - SCOPUS:84985953039

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1819

EP - 1823

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016

Y2 - 10 July 2016 through 15 July 2016

ER -

Erasure broadcast networks with receiver caching

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this