Efficient Algorithms for Coded Multicasting in Heterogeneous Caching Networks

dc.contributor.authorVettigli, Giuseppe
dc.contributor.authorJi, Mingyue
dc.contributor.authorShanmugam, Karthikeyan
dc.contributor.authorLlorca, Jaime
dc.contributor.authorTulino, Antonia M.
dc.contributor.authorCaire, Giuseppe
dc.date.accessioned2019-08-26T14:39:23Z
dc.date.available2019-08-26T14:39:23Z
dc.date.issued2019-03-25
dc.date.updated2019-08-24T09:02:01Z
dc.description.abstractCoded 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.eissn1099-4300
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/9898
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-8910
dc.language.isoenen
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en
dc.subject.ddc003 Systemede
dc.subject.othercaching networksen
dc.subject.otherrandom fractional cachingen
dc.subject.othercoded cachingen
dc.subject.othercoded multicastingen
dc.subject.otherindex codingen
dc.subject.otherfinite-length analysisen
dc.subject.othergraph coloringen
dc.subject.otherapproximation algorithmsen
dc.titleEfficient Algorithms for Coded Multicasting in Heterogeneous Caching Networksen
dc.typeArticleen
dc.type.versionpublishedVersionen
dcterms.bibliographicCitation.articlenumber324en
dcterms.bibliographicCitation.doi10.3390/e21030324en
dcterms.bibliographicCitation.issue3en
dcterms.bibliographicCitation.journaltitleEntropyen
dcterms.bibliographicCitation.originalpublishernameMDPIen
dcterms.bibliographicCitation.originalpublisherplaceBaselen
dcterms.bibliographicCitation.volume21en
tub.accessrights.dnbfreeen
tub.affiliationFak. 4 Elektrotechnik und Informatik>Inst. Telekommunikationssysteme>FG Theoretische Grundlagen der Kommunikationstechnikde
tub.affiliation.facultyFak. 4 Elektrotechnik und Informatikde
tub.affiliation.groupFG Theoretische Grundlagen der Kommunikationstechnikde
tub.affiliation.instituteInst. Telekommunikationssystemede
tub.publisher.universityorinstitutionTechnische Universität Berlinen
Files
Original bundle
Now showing 1 - 1 of 1
Loading…
Thumbnail Image
Name:
entropy-21-00324-v2.pdf
Size:
1.11 MB
Format:
Adobe Portable Document Format
Description:
Collections