NDLI: An efficient coded multicasting scheme preserving the multiplicative caching gain

Content Provider	IEEE Xplore Digital Library
Author	Vettigli, G. Mingyue Ji Tulino, A.M. Llorca, J. Festa, P.
Copyright Year	2015
Description	Author affiliation: Bell Labs., Alcatel Lucent, NJ, USA (Llorca, J.) \|\| EE Dept., Univ. of Southern California, Los Angeles, CA, USA (Mingyue Ji) \|\| Univ. di Napoli Federico II, Naples, Italy (Vettigli, G.; Tulino, A.M.; Festa, P.)
Abstract	Coded multicasting has been shown to be a promising approach to significantly improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link. However, achievable schemes proposed to date have been shown to achieve the proved order-optimal performance only in the asymptotic regime in which the number of packets per requested item goes to infinity. In this paper, we first extend the asymptotic analysis of the achievable scheme in [1], [2] to the case of heterogeneous cache sizes and demand distributions, providing the best known upper bound on the fundamental limiting performance when the number of packets goes to infinity. We then show that the scheme achieving this upper bound quickly loses its multiplicative caching gain for finite content packetization. To overcome this limitation, we design a novel polynomial-time algorithm based on random greedy graph-coloring that, while keeping the same finite content packetization, recovers a significant part of the multiplicative caching gain. Our results show that the order-optimal coded multicasting schemes proposed to date, while useful in quantifying the fundamental limiting performance, must be properly designed for practical regimes of finite packetization.
Starting Page	251
Ending Page	256
File Size	410307
Page Count	6
File Format	PDF
ISBN	9781467371315
DOI	10.1109/INFCOMW.2015.7179393
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-04-26
Publisher Place	Hong Kong
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Upper bound Conferences Color Multicast communication Encoding Complexity theory Indexes
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An efficient multiple-groupcast coded multicasting scheme for finite fractional caching

Caching-aided coded multicasting with multiple random requests

An Efficient Coded Multicasting Scheme Preserving the Multiplicative Caching Gain

On the average performance of caching and coded multicasting with random demands

Fundamental limits of caching

An Efficient Delivery Scheme for Coded Caching

Minimum cost caching-aided multicast under arbitrary demand

Coded caching with nonuniform demands

Throughput bound of XOR coded wireless multicasting to three clients

An efficient coded multicasting scheme preserving the multiplicative caching gain

Similar Documents

An efficient multiple-groupcast coded multicasting scheme for finite fractional caching

Caching-aided coded multicasting with multiple random requests

An Efficient Coded Multicasting Scheme Preserving the Multiplicative Caching Gain

On the average performance of caching and coded multicasting with random demands

Fundamental limits of caching

An Efficient Delivery Scheme for Coded Caching

Minimum cost caching-aided multicast under arbitrary demand

Coded caching with nonuniform demands

Throughput bound of XOR coded wireless multicasting to three clients

An efficient coded multicasting scheme preserving the multiplicative caching gain