Wireless coded caching can overcome the worst-user bottleneck by exploiting finite file sizes

We address the worst-user bottleneck of wireless coded caching, which is known to severely diminish cache-aided multicasting gains due to the fundamental worst-channel limitation of multicasting transmission. We consider the quasi-static Rayleigh fading Broadcast Channel, for which we first show tha...

Descripción completa

Detalles Bibliográficos
Autores: Zhao, Hui, Bazco-Nogueras, Antonio, Elia, Petros
Tipo de recurso: artículo
Fecha de publicación:2022
País:España
Institución:IMDEA Networks Institute
Repositorio:IMDEA Networks Institute Digital Repository
Idioma:inglés
OAI Identifier:oai:dspace.networks.imdea.org:20.500.12761/1553
Acceso en línea:http://hdl.handle.net/20.500.12761/1553
Access Level:acceso abierto
Palabra clave:coded caching, cache-aided communications, worst-user bottleneck, shared caches, multicast transmission
id ES_9717d89e2d69cf2e009ca1af867fcc81
oai_identifier_str oai:dspace.networks.imdea.org:20.500.12761/1553
network_acronym_str ES
network_name_str España
repository_id_str
spelling Wireless coded caching can overcome the worst-user bottleneck by exploiting finite file sizesZhao, HuiBazco-Nogueras, AntonioElia, Petroscoded caching, cache-aided communications, worst-user bottleneck, shared caches, multicast transmissionWe address the worst-user bottleneck of wireless coded caching, which is known to severely diminish cache-aided multicasting gains due to the fundamental worst-channel limitation of multicasting transmission. We consider the quasi-static Rayleigh fading Broadcast Channel, for which we first show that the effective coded caching gain of the XOR-based standard coded-caching scheme completely vanishes in the low-SNR regime. Then, we reveal that this collapse is not intrinsic to coded caching. We do so by presenting a novel scheme that can fully recover the coded caching gains by capitalizing on one aspect that has to date remained unexploited: the shared side information brought about by the effectively unavoidable file-size constraint. As a consequence, the worst-user effect is dramatically ameliorated, as it is substituted by a much more subtle worst-group-of-users effect, where the suggested grouping is fixed, and it is decided before the channel or the demands are known. In some cases, the theoretical gains are completely recovered, and this is done without any user selection technique. We analyze the achievable rate performance of the proposed scheme and derive insightful performance approximations which prove to be very precise.TRUEpubIEEE20222022-01-13journal articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articlehttp://hdl.handle.net/20.500.12761/1553reponame:IMDEA Networks Institute Digital Repositoryinstname:IMDEA Networks InstituteInglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:dspace.networks.imdea.org:20.500.12761/15532026-06-06T12:35:51Z
dc.title.none.fl_str_mv Wireless coded caching can overcome the worst-user bottleneck by exploiting finite file sizes
title Wireless coded caching can overcome the worst-user bottleneck by exploiting finite file sizes
spellingShingle Wireless coded caching can overcome the worst-user bottleneck by exploiting finite file sizes
Zhao, Hui
coded caching, cache-aided communications, worst-user bottleneck, shared caches, multicast transmission
title_short Wireless coded caching can overcome the worst-user bottleneck by exploiting finite file sizes
title_full Wireless coded caching can overcome the worst-user bottleneck by exploiting finite file sizes
title_fullStr Wireless coded caching can overcome the worst-user bottleneck by exploiting finite file sizes
title_full_unstemmed Wireless coded caching can overcome the worst-user bottleneck by exploiting finite file sizes
title_sort Wireless coded caching can overcome the worst-user bottleneck by exploiting finite file sizes
dc.creator.none.fl_str_mv Zhao, Hui
Bazco-Nogueras, Antonio
Elia, Petros
author Zhao, Hui
author_facet Zhao, Hui
Bazco-Nogueras, Antonio
Elia, Petros
author_role author
author2 Bazco-Nogueras, Antonio
Elia, Petros
author2_role author
author
dc.subject.none.fl_str_mv coded caching, cache-aided communications, worst-user bottleneck, shared caches, multicast transmission
topic coded caching, cache-aided communications, worst-user bottleneck, shared caches, multicast transmission
description We address the worst-user bottleneck of wireless coded caching, which is known to severely diminish cache-aided multicasting gains due to the fundamental worst-channel limitation of multicasting transmission. We consider the quasi-static Rayleigh fading Broadcast Channel, for which we first show that the effective coded caching gain of the XOR-based standard coded-caching scheme completely vanishes in the low-SNR regime. Then, we reveal that this collapse is not intrinsic to coded caching. We do so by presenting a novel scheme that can fully recover the coded caching gains by capitalizing on one aspect that has to date remained unexploited: the shared side information brought about by the effectively unavoidable file-size constraint. As a consequence, the worst-user effect is dramatically ameliorated, as it is substituted by a much more subtle worst-group-of-users effect, where the suggested grouping is fixed, and it is decided before the channel or the demands are known. In some cases, the theoretical gains are completely recovered, and this is done without any user selection technique. We analyze the achievable rate performance of the proposed scheme and derive insightful performance approximations which prove to be very precise.
publishDate 2022
dc.date.none.fl_str_mv 2022
2022-01-13
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv http://hdl.handle.net/20.500.12761/1553
url http://hdl.handle.net/20.500.12761/1553
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv IEEE
publisher.none.fl_str_mv IEEE
dc.source.none.fl_str_mv reponame:IMDEA Networks Institute Digital Repository
instname:IMDEA Networks Institute
instname_str IMDEA Networks Institute
reponame_str IMDEA Networks Institute Digital Repository
collection IMDEA Networks Institute Digital Repository
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869414035908198400
score 15,300724

Similares en LA Referencia