A Converse Bound for Cache-Aided Interference Networks

A Converse Bound for Cache-Aided Interference Networks

In this paper, an interference network with arbitrary number of transmitters and receivers is studied, where each transmitter is equipped with a finite size cache. We obtain an information-theoretic lower bound on both the peak normalized delivery time (NDT), and the \textit{expected} NDT of cache-a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2018-12
Hauptverfasser: Girgis, Antonious M, Ercetin, Ozgur, Nafie, Mohammed, ElBatt, Tamer
Format: Artikel
Sprache:eng
Schlagworte:
Information theory
Interference
Lower bounds
Transmitters
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Girgis, Antonious M
Ercetin, Ozgur
Nafie, Mohammed
ElBatt, Tamer
description In this paper, an interference network with arbitrary number of transmitters and receivers is studied, where each transmitter is equipped with a finite size cache. We obtain an information-theoretic lower bound on both the peak normalized delivery time (NDT), and the \textit{expected} NDT of cache-aided interference networks with uniform content popularity. For the peak NDT, we show that our lower bound is strictly tighter than the bound in the literature for small cache sizes. Moreover, we show that the feasibility region on the expected NDT is bigger than that of the peak NDT.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2151579100</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2151579100</sourcerecordid><originalsourceid>FETCH-proquest_journals_21515791003</originalsourceid><addsrcrecordid>eNqNyrEKwjAUQNEgCBbtPwScA8mLaXWsQdHFyb2U5hWtkuhLor-vgx_gdIdzJ6wArZVYrwBmrIxxlFJCVYMxumBVw23wL6SIfBuyd3wIxG3XX1A0V4eOH31CGpDQ98hPmN6BbnHBpkN3j1j-OmfL_e5sD-JB4ZkxpnYMmfyXWlBGmXqjpNT_XR9l_zSN</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2151579100</pqid></control><display><type>article</type><title>A Converse Bound for Cache-Aided Interference Networks</title><source>Free E- Journals</source><creator>Girgis, Antonious M ; Ercetin, Ozgur ; Nafie, Mohammed ; ElBatt, Tamer</creator><creatorcontrib>Girgis, Antonious M ; Ercetin, Ozgur ; Nafie, Mohammed ; ElBatt, Tamer</creatorcontrib><description>In this paper, an interference network with arbitrary number of transmitters and receivers is studied, where each transmitter is equipped with a finite size cache. We obtain an information-theoretic lower bound on both the peak normalized delivery time (NDT), and the \textit{expected} NDT of cache-aided interference networks with uniform content popularity. For the peak NDT, we show that our lower bound is strictly tighter than the bound in the literature for small cache sizes. Moreover, we show that the feasibility region on the expected NDT is bigger than that of the peak NDT.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Information theory ; Interference ; Lower bounds ; Transmitters</subject><ispartof>arXiv.org, 2018-12</ispartof><rights>2018. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Girgis, Antonious M</creatorcontrib><creatorcontrib>Ercetin, Ozgur</creatorcontrib><creatorcontrib>Nafie, Mohammed</creatorcontrib><creatorcontrib>ElBatt, Tamer</creatorcontrib><title>A Converse Bound for Cache-Aided Interference Networks</title><title>arXiv.org</title><description>In this paper, an interference network with arbitrary number of transmitters and receivers is studied, where each transmitter is equipped with a finite size cache. We obtain an information-theoretic lower bound on both the peak normalized delivery time (NDT), and the \textit{expected} NDT of cache-aided interference networks with uniform content popularity. For the peak NDT, we show that our lower bound is strictly tighter than the bound in the literature for small cache sizes. Moreover, we show that the feasibility region on the expected NDT is bigger than that of the peak NDT.</description><subject>Information theory</subject><subject>Interference</subject><subject>Lower bounds</subject><subject>Transmitters</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNyrEKwjAUQNEgCBbtPwScA8mLaXWsQdHFyb2U5hWtkuhLor-vgx_gdIdzJ6wArZVYrwBmrIxxlFJCVYMxumBVw23wL6SIfBuyd3wIxG3XX1A0V4eOH31CGpDQ98hPmN6BbnHBpkN3j1j-OmfL_e5sD-JB4ZkxpnYMmfyXWlBGmXqjpNT_XR9l_zSN</recordid><startdate>20181206</startdate><enddate>20181206</enddate><creator>Girgis, Antonious M</creator><creator>Ercetin, Ozgur</creator><creator>Nafie, Mohammed</creator><creator>ElBatt, Tamer</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20181206</creationdate><title>A Converse Bound for Cache-Aided Interference Networks</title><author>Girgis, Antonious M ; Ercetin, Ozgur ; Nafie, Mohammed ; ElBatt, Tamer</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_21515791003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Information theory</topic><topic>Interference</topic><topic>Lower bounds</topic><topic>Transmitters</topic><toplevel>online_resources</toplevel><creatorcontrib>Girgis, Antonious M</creatorcontrib><creatorcontrib>Ercetin, Ozgur</creatorcontrib><creatorcontrib>Nafie, Mohammed</creatorcontrib><creatorcontrib>ElBatt, Tamer</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Girgis, Antonious M</au><au>Ercetin, Ozgur</au><au>Nafie, Mohammed</au><au>ElBatt, Tamer</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>A Converse Bound for Cache-Aided Interference Networks</atitle><jtitle>arXiv.org</jtitle><date>2018-12-06</date><risdate>2018</risdate><eissn>2331-8422</eissn><abstract>In this paper, an interference network with arbitrary number of transmitters and receivers is studied, where each transmitter is equipped with a finite size cache. We obtain an information-theoretic lower bound on both the peak normalized delivery time (NDT), and the \textit{expected} NDT of cache-aided interference networks with uniform content popularity. For the peak NDT, we show that our lower bound is strictly tighter than the bound in the literature for small cache sizes. Moreover, we show that the feasibility region on the expected NDT is bigger than that of the peak NDT.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2018-12
issn 2331-8422
language eng
recordid cdi_proquest_journals_2151579100
source Free E- Journals
subjects Information theory
Interference
Lower bounds
Transmitters
title A Converse Bound for Cache-Aided Interference Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T08%3A28%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=A%20Converse%20Bound%20for%20Cache-Aided%20Interference%20Networks&rft.jtitle=arXiv.org&rft.au=Girgis,%20Antonious%20M&rft.date=2018-12-06&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2151579100%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2151579100&rft_id=info:pmid/&rfr_iscdi=true