Benefits of Cache Assignment on Degraded Broadcast Channels

Degraded K-user broadcast channels (BCs) are studied when the receivers are facilitated with cache memories. Lower and upper bounds are derived on the capacity-memory tradeoff, i.e., on the largest rate of reliable communication over the BC as a function of the receivers' cache sizes, and the b...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 65; no. 11; pp. 6999 - 7019
Main Authors:	Saeedi Bidokhti, Shirin, Wigger, Michele, Yener, Aylin
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Subjects:	Broadcast channel (BC) Budgets Cache memory Caching capacity-memory tradeoff Channel coding Channels Computer Science Decoding Gaussian channels Information Theory joint source-channel coding Lower bounds Noise measurement Optimization Receivers Servers Tradeoffs Upper bound Upper bounds Index Terms-Broadcast channel (BC) joint source-channel coding caching Gaussian channels capacity- memory tradeoff
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Degraded K-user broadcast channels (BCs) are studied when the receivers are facilitated with cache memories. Lower and upper bounds are derived on the capacity-memory tradeoff, i.e., on the largest rate of reliable communication over the BC as a function of the receivers' cache sizes, and the bounds are shown to match for interesting special cases. The lower bounds are achieved by two new coding schemes that benefit from nonuniform cache assignments. Lower and upper bounds are also established on the global capacity-memory tradeoff, i.e., on the largest capacity-memory tradeoff that can be attained by optimizing the receivers' cache sizes subject to a total cache memory budget. The bounds coincide when the total cache memory budget is sufficiently small or sufficiently large, where the thresholds depend on the BC statistics. For small cache memories, it is optimal to assign all the cache memory to the weakest receiver. In this regime, the global capacity-memory tradeoff grows by the total cache memory budget divided by the number of files in the system. In other words, a perfect global caching gain is achievable in this regime and the performance corresponds to a system where all the cache contents in the network are available to all receivers. For large cache memories, it is optimal to assign a positive cache memory to every receiver, such that the weaker receivers are assigned larger cache memories compared to the stronger receivers. In this regime, the growth rate of the global capacity-memory tradeoff is further divided by the number of users, which corresponds to a local caching gain. It is observed numerically that a uniform assignment of the total cache memory is suboptimal in all regimes, unless the BC is completely symmetric. For erasure BCs, this claim is proved analytically in the regime of small cache sizes.
AbstractList	Degraded K-user broadcast channels (BCs) are studied when the receivers are facilitated with cache memories. Lower and upper bounds are derived on the capacity-memory tradeoff, i.e., on the largest rate of reliable communication over the BC as a function of the receivers’ cache sizes, and the bounds are shown to match for interesting special cases. The lower bounds are achieved by two new coding schemes that benefit from nonuniform cache assignments . Lower and upper bounds are also established on the global capacity-memory tradeoff, i.e., on the largest capacity-memory tradeoff that can be attained by optimizing the receivers’ cache sizes subject to a total cache memory budget. The bounds coincide when the total cache memory budget is sufficiently small or sufficiently large, where the thresholds depend on the BC statistics. For small cache memories, it is optimal to assign all the cache memory to the weakest receiver. In this regime, the global capacity-memory tradeoff grows by the total cache memory budget divided by the number of files in the system. In other words, a perfect global caching gain is achievable in this regime and the performance corresponds to a system where all the cache contents in the network are available to all receivers. For large cache memories, it is optimal to assign a positive cache memory to every receiver, such that the weaker receivers are assigned larger cache memories compared to the stronger receivers. In this regime, the growth rate of the global capacity-memory tradeoff is further divided by the number of users, which corresponds to a local caching gain. It is observed numerically that a uniform assignment of the total cache memory is suboptimal in all regimes, unless the BC is completely symmetric. For erasure BCs, this claim is proved analytically in the regime of small cache sizes.
Author	Saeedi Bidokhti, Shirin Wigger, Michele Yener, Aylin
Author_xml	– sequence: 1 givenname: Shirin orcidid: 0000-0002-3790-202X surname: Saeedi Bidokhti fullname: Saeedi Bidokhti, Shirin email: saeedi@seas.upenn.edu organization: Department of Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, PA, USA – sequence: 2 givenname: Michele orcidid: 0000-0002-6737-5427 surname: Wigger fullname: Wigger, Michele email: michele.wigger@telecom-paristech.fr organization: LTCI, Télécom Paris, IP Paris, Paris, France – sequence: 3 givenname: Aylin orcidid: 0000-0003-0820-3390 surname: Yener fullname: Yener, Aylin email: yener@engr.psu.edu organization: Department of Electrical Engineering, School of Electrical Engineering and Computer Science, Pennsylvania State University, State College, PA, USA
BackLink	https://hal.science/hal-02439575$$DView record in HAL
BookMark	eNp9kE1LAzEQhoNUsFbvgpcFTx625nOT4KldP1ooeKnnkGZn2y1tUpOt4L93S6sHD56GGZ53eHkuUc8HDwjdEDwkBOuH-XQ-pJjoIdW0kISfoT4RQua6ELyH-hgTlWvO1QW6TGndrVwQ2kePY_BQN23KQp2V1q0gG6XULP0WfJsFnz3BMtoKqmwcg62cTW1Wrqz3sElX6Ly2mwTXpzlA7y_P83KSz95ep-VoljtWyDZnwFjtsLCcWYlrQbUmFQVXL6wtmLKCE7oQTmiKF4VbYC2UIhKEoEw5WQEboPvj35XdmF1stjZ-mWAbMxnNzOGGKWdaSPFJOvbuyO5i-NhDas067KPv6hnKsKRack07qjhSLoaUItTGNa1tm-DbaJuNIdgcpJpOqjlINSepXRD_Cf70-Sdye4w0APCLKymEKhT7BqIBgT0
CODEN	IETTAW
CitedBy_id	crossref_primary_10_1109_TIT_2023_3321918 crossref_primary_10_1109_TWC_2019_2962686 crossref_primary_10_1109_TWC_2022_3140895 crossref_primary_10_1109_TIT_2021_3054518
Cites_doi	10.1109/ISIT.2015.7282744 10.1109/ISTC.2016.7593135 10.1109/ISIT.2016.7541276 10.1109/WCNC.2017.7925533 10.1109/TIT.2016.2605123 10.1109/NETCOD.2015.7176789 10.1109/TIT.2018.2888615 10.1109/TIT.2017.2725272 10.1109/TCOMM.2017.2734767 10.1109/ITW.2016.7606818 10.1109/TIT.2018.2856885 10.1109/TIT.2018.2835507 10.1109/ISWCS.2015.7454328 10.1109/ITA.2018.8503143 10.1017/CBO9781139030687 10.1109/ISIT.2017.8006555 10.1109/ISTC.2016.7593139 10.1109/ISIT.2017.8006558 10.1109/TIT.1974.1055184 10.1109/TIT.2017.2785237 10.1109/ISIT.2016.7541414 10.1109/ALLERTON.2015.7447138 10.1109/TIT.2006.871609 10.1109/TIT.2018.2794543 10.1109/TIT.2014.2306938 10.1109/WCNC.2017.7925535 10.1109/TIT.2017.2674668 10.1109/JSAC.2016.2577198 10.1109/TCOMM.2018.2834364 10.1109/ACSSC.2017.8335595 10.23919/WIOPT.2018.8362888 10.1109/TIT.2018.2800059 10.1049/iet-com.2015.1205 10.1109/ICC.2017.7997394 10.1109/ITA.2016.7888186 10.1109/ISIT.2017.8007039 10.1109/CISS.2016.7460574 10.1109/ICC.2017.7996417 10.1109/TIT.2017.2705166
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019 Attribution
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019 – notice: Attribution
DBID	97E ESBDL RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D 1XC VOOES
DOI	10.1109/TIT.2019.2926714
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1557-9654
EndPage	7019
ExternalDocumentID	oai:HAL:hal-02439575v1 10_1109_TIT_2019_2926714 8755868
Genre	orig-research
GrantInformation_xml	– fundername: National Science Foundation grantid: 1850356 funderid: 10.13039/100000001 – fundername: H2020 European Research Council grantid: 715111 funderid: 10.13039/100010663
GroupedDBID	-~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD ESBDL F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D RIG 1XC VOOES
ID	FETCH-LOGICAL-c367t-3e33fc05a43a70f52991d2ecfbaa638a5412b5c5920b6cb0958817e55238c7de3
IEDL.DBID	RIE
ISICitedReferencesCount	11
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000507921700009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0018-9448
IngestDate	Tue Oct 14 20:29:11 EDT 2025 Sun Jun 29 12:28:34 EDT 2025 Tue Nov 18 22:35:39 EST 2025 Sat Nov 29 03:31:42 EST 2025 Wed Aug 27 02:43:05 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	11
Keywords	Index Terms-Broadcast channel (BC) joint source-channel coding caching Gaussian channels capacity- memory tradeoff
Language	English
License	https://creativecommons.org/licenses/by/4.0/legalcode Attribution: http://creativecommons.org/licenses/by
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c367t-3e33fc05a43a70f52991d2ecfbaa638a5412b5c5920b6cb0958817e55238c7de3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-3790-202X 0000-0002-6737-5427 0000-0003-0820-3390
OpenAccessLink	https://ieeexplore.ieee.org/document/8755868
PQID	2307297492
PQPubID	36024
PageCount	21
ParticipantIDs	crossref_citationtrail_10_1109_TIT_2019_2926714 hal_primary_oai_HAL_hal_02439575v1 ieee_primary_8755868 proquest_journals_2307297492 crossref_primary_10_1109_TIT_2019_2926714
PublicationCentury	2000
PublicationDate	2019-11-01
PublicationDateYYYYMMDD	2019-11-01
PublicationDate_xml	– month: 11 year: 2019 text: 2019-11-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on information theory
PublicationTitleAbbrev	TIT
PublicationYear	2019
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) – name: Institute of Electrical and Electronics Engineers
References	ref35 ref13 ref34 ref12 ref37 ref36 ref14 cover (ref45) 2006 ref31 ref30 ref33 ref11 ref32 ref10 ref2 ref1 ref39 ref17 ref16 ref19 gallager (ref38) 1974; 10 shanmugam (ref43) 2017 ref24 ref23 ref26 ref25 ref20 ref42 huang (ref18) 2015; abs 1504 1452 ref22 ref44 ref21 ref28 wang (ref15) 2015; abs 1504 1123 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 wigger (ref41) 2016
References_xml	– ident: ref10 doi: 10.1109/ISIT.2015.7282744 – ident: ref35 doi: 10.1109/ISTC.2016.7593135 – ident: ref3 doi: 10.1109/ISIT.2016.7541276 – year: 2006 ident: ref45 publication-title: Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) – ident: ref19 doi: 10.1109/WCNC.2017.7925533 – ident: ref26 doi: 10.1109/TIT.2016.2605123 – ident: ref9 doi: 10.1109/NETCOD.2015.7176789 – start-page: 1237 year: 2017 ident: ref43 article-title: Coded caching with linear subpacketization is possible using Ruzsa-Szeméredi graphs publication-title: Proc ISIT – ident: ref30 doi: 10.1109/TIT.2018.2888615 – ident: ref42 doi: 10.1109/TIT.2017.2725272 – ident: ref14 doi: 10.1109/TCOMM.2017.2734767 – ident: ref6 doi: 10.1109/ITW.2016.7606818 – ident: ref37 doi: 10.1109/TIT.2018.2856885 – ident: ref22 doi: 10.1109/TIT.2018.2835507 – ident: ref21 doi: 10.1109/ISWCS.2015.7454328 – ident: ref33 doi: 10.1109/ITA.2018.8503143 – ident: ref40 doi: 10.1017/CBO9781139030687 – ident: ref36 doi: 10.1109/ISIT.2017.8006555 – ident: ref29 doi: 10.1109/ISTC.2016.7593139 – ident: ref20 doi: 10.1109/ISIT.2017.8006558 – ident: ref39 doi: 10.1109/TIT.1974.1055184 – ident: ref7 doi: 10.1109/TIT.2017.2785237 – ident: ref13 doi: 10.1109/ISIT.2016.7541414 – ident: ref25 doi: 10.1109/ALLERTON.2015.7447138 – ident: ref34 doi: 10.1109/TIT.2006.871609 – ident: ref5 doi: 10.1109/TIT.2018.2794543 – ident: ref1 doi: 10.1109/TIT.2014.2306938 – ident: ref16 doi: 10.1109/WCNC.2017.7925535 – ident: ref27 doi: 10.1109/TIT.2017.2674668 – volume: 10 start-page: 185 year: 1974 ident: ref38 article-title: Capacity and coding for degraded broadcast channels publication-title: Probl Peredachi Inf – ident: ref24 doi: 10.1109/JSAC.2016.2577198 – ident: ref8 doi: 10.1109/TCOMM.2018.2834364 – ident: ref31 doi: 10.1109/ACSSC.2017.8335595 – ident: ref32 doi: 10.23919/WIOPT.2018.8362888 – ident: ref44 doi: 10.1109/TIT.2018.2800059 – ident: ref2 doi: 10.1049/iet-com.2015.1205 – volume: abs 1504 1452 year: 2015 ident: ref18 article-title: The performance analysis of coded cache in wireless fading channel publication-title: CoRR – ident: ref17 doi: 10.1109/ICC.2017.7997394 – start-page: 335 year: 2016 ident: ref41 article-title: Complete interference mitigation through receiver-caching in Wyner's networks publication-title: Proc IEEE Inf Theory Workshop – ident: ref12 doi: 10.1109/ITA.2016.7888186 – volume: abs 1504 1123 year: 2015 ident: ref15 article-title: Fundamental limits of heterogenous cache publication-title: CoRR – ident: ref28 doi: 10.1109/ISIT.2017.8007039 – ident: ref4 doi: 10.1109/CISS.2016.7460574 – ident: ref23 doi: 10.1109/ICC.2017.7996417 – ident: ref11 doi: 10.1109/TIT.2017.2705166
SSID	ssj0014512
Score	2.3869588
Snippet	Degraded K-user broadcast channels (BCs) are studied when the receivers are facilitated with cache memories. Lower and upper bounds are derived on the...
SourceID	hal proquest crossref ieee
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database Publisher
StartPage	6999
SubjectTerms	Broadcast channel (BC) Budgets Cache memory Caching capacity-memory tradeoff Channel coding Channels Computer Science Decoding Gaussian channels Information Theory joint source-channel coding Lower bounds Noise measurement Optimization Receivers Servers Tradeoffs Upper bound Upper bounds
Title	Benefits of Cache Assignment on Degraded Broadcast Channels
URI	https://ieeexplore.ieee.org/document/8755868 https://www.proquest.com/docview/2307297492 https://hal.science/hal-02439575
Volume	65
WOSCitedRecordID	wos000507921700009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1RS8MwED7c8EEfnDrF6ZQgvgh2a9OmSfBJp6Igw4cJvpU0TXUgnWzV3-8l7cpAEXwr5QJHvl7urrn7DuAsTrVPpWZenurUQ0uMPeVYRKmKhFR20GTmhk3w8Vi8vMinNbhoemGMMa74zAzso7vLz2b60_4qG2JszUQsWtDiPK56tZobg4gFFTN4gAaMOcfyStKXw8nDxNZwyQGVNHb9OisuqPVmCyDdZJUfx7HzMXed_2m3DVt1LEmuKvB3YM0Uu9BZzmkgtdnuwuYK6WAXLq_xeMun5YLMcjKyfM4EMZq-urIAMivIjeWPyExGMEVXmVaLktgehAK96B48391ORvdePULB02HMSy80YZhrn6koVNzPGTqfIKNG56lSaHmKRQFNmWaS-mmsU4y3hAi4YZieCs0zE-5Du5gV5gAI-nEuMo7izESaKWlUTCNBlTK4qTrowXC5q4mu-cXtmIv3xOUZvkwQh8TikNQ49OC8WfFRcWv8IXuKQDVilhT7_uoxse8sp6LEqPMLVehaWBqpGpEe9Je4JrWFLhJbAE8xmZL08PdVR7BhFaj6DvvQLuef5hjW9Vc5XcxP3Mf3Da5A058
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB58gXrwLa7PIF4E67Zp0yZ40tVlxXXxsIK3kKapLkhX3Orvd5J2i6AI3kqZwJCvk5lpZr4BOIlT7VOhmZenOvXQEmNPORZRqiIulB00mblhE8lgwJ-exMMMnDW9MMYYV3xmzu2ju8vPxvrD_iprY2zNeMxnYZ5FEfWrbq3mziBiQcUNHqAJY9YxvZT0RXt4O7RVXOKcChq7jp1vTmj2xZZAutkqPw5k52W6q__Tbw1W6miSXFbwr8OMKTZgdTqpgdSGuwHL32gHN-HiCg-4fFROyDgnHcvoTBCl0bMrDCDjglxbBonMZASTdJVpNSmJ7UIo0I9uwWP3ZtjpefUQBU-HcVJ6oQnDXPtMRaFK_Jyh-wkyanSeKoW2p1gU0JRpJqifxjrFiIvzIDEME1Suk8yE2zBXjAuzAwQ9ecKzBMWZiTRTwqiYRpwqZXBTddCC9nRXpa4Zxu2gi1fpMg1fSMRBWhxkjUMLTpsVbxW7xh-yxwhUI2ZpsXuXfWnfWVZFgXHnJ6qwaWFppGpEWrA_xVXWNjqRtgSeYjol6O7vq45gsTe878v-7eBuD5asMlUX4j7Mle8f5gAW9Gc5mrwfug_xC9uk1uY
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Benefits+of+Cache+Assignment+on+Degraded+Broadcast+Channels&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Saeedi+Bidokhti%2C+Shirin&rft.au=Wigger%2C+Michele&rft.au=Yener%2C+Aylin&rft.date=2019-11-01&rft.pub=IEEE&rft.issn=0018-9448&rft.volume=65&rft.issue=11&rft.spage=6999&rft.epage=7019&rft_id=info:doi/10.1109%2FTIT.2019.2926714&rft.externalDocID=8755868
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon