Efficient Algorithms for Coded Multicasting in Heterogeneous Caching Networks
| dc.contributor.author | Vettigli, Giuseppe | |
| dc.contributor.author | Ji, Mingyue | |
| dc.contributor.author | Shanmugam, Karthikeyan | |
| dc.contributor.author | Llorca, Jaime | |
| dc.contributor.author | Tulino, Antonia M. | |
| dc.contributor.author | Caire, Giuseppe | |
| dc.date.accessioned | 2019-08-26T14:39:23Z | |
| dc.date.available | 2019-08-26T14:39:23Z | |
| dc.date.issued | 2019-03-25 | |
| dc.date.updated | 2019-08-24T09:02:01Z | |
| dc.description.abstract | Coded multicasting has been shown to be a promising approach to significantly improve the performance of content delivery networks with multiple caches downstream of a common multicast link. However, the schemes that have been shown to achieve order-optimal performance require content items to be partitioned into several packets that grows exponentially with the number of caches, leading to codes of exponential complexity that jeopardize their promising performance benefits. In this paper, we address this crucial performance-complexity tradeoff in a heterogeneous caching network setting, where edge caches with possibly different storage capacity collect multiple content requests that may follow distinct demand distributions. We extend the asymptotic (in the number of packets per file) analysis of shared link caching networks to heterogeneous network settings, and present novel coded multicast schemes, based on local graph coloring, that exhibit polynomial-time complexity in all the system parameters, while preserving the asymptotically proven multiplicative caching gain even for finite file packetization. We further demonstrate that the packetization order (the number of packets each file is split into) can be traded-off with the number of requests collected by each cache, while preserving the same multiplicative caching gain. Simulation results confirm the superiority of the proposed schemes and illustrate the interesting request aggregation vs. packetization order tradeoff within several practical settings. Our results provide a compelling step towards the practical achievability of the promising multiplicative caching gain in next generation access networks. | en |
| dc.identifier.eissn | 1099-4300 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/9898 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-8910 | |
| dc.language.iso | en | en |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | en |
| dc.subject.ddc | 003 Systeme | de |
| dc.subject.other | caching networks | en |
| dc.subject.other | random fractional caching | en |
| dc.subject.other | coded caching | en |
| dc.subject.other | coded multicasting | en |
| dc.subject.other | index coding | en |
| dc.subject.other | finite-length analysis | en |
| dc.subject.other | graph coloring | en |
| dc.subject.other | approximation algorithms | en |
| dc.title | Efficient Algorithms for Coded Multicasting in Heterogeneous Caching Networks | en |
| dc.type | Article | en |
| dc.type.version | publishedVersion | en |
| dcterms.bibliographicCitation.articlenumber | 324 | en |
| dcterms.bibliographicCitation.doi | 10.3390/e21030324 | en |
| dcterms.bibliographicCitation.issue | 3 | en |
| dcterms.bibliographicCitation.journaltitle | Entropy | en |
| dcterms.bibliographicCitation.originalpublishername | MDPI | en |
| dcterms.bibliographicCitation.originalpublisherplace | Basel | en |
| dcterms.bibliographicCitation.volume | 21 | en |
| tub.accessrights.dnb | free | en |
| tub.affiliation | Fak. 4 Elektrotechnik und Informatik::Inst. Telekommunikationssysteme::FG Theoretische Grundlagen der Kommunikationstechnik | de |
| tub.affiliation.faculty | Fak. 4 Elektrotechnik und Informatik | de |
| tub.affiliation.group | FG Theoretische Grundlagen der Kommunikationstechnik | de |
| tub.affiliation.institute | Inst. Telekommunikationssysteme | de |
| tub.publisher.universityorinstitution | Technische Universität Berlin | en |