New Results on Optimal Schemes for Coded Caching

dc.contributor.authorKumar, Vijith K P
dc.date.accessioned2022-08-12T13:10:54Z
dc.date.accessioned2023-10-20T07:27:32Z
dc.date.available2022-08-12T13:10:54Z
dc.date.available2023-10-20T07:27:32Z
dc.date.issued2022
dc.descriptionSupervisor: Tony Jacoben_US
dc.description.abstractThe notion of coded caching for the content distribution networks was introduced by Maddah-Ali and Niesen. We looked into several aspects of optimal coded caching schemes as part of my doctoral thesis. We studied the multiobjective nature of the caching problem in detail and demonstrated that a universal scheme that simultaneously achieves optimal rates for all demand types does not exist. Motivated by this result, we introduced the notion of Pareto optimal schemes in coded caching and demonstrated that two previously known schemes are Pareto optimal. The exact optimality of a scheme for a particular demand-type was another aspect we looked into. We proposed a new caching scheme and derived a set of new lower bounds to prove the optimality of the scheme.en_US
dc.identifier.otherROLL NO.146102006
dc.identifier.urihttps://gyan.iitg.ac.in/handle/123456789/2149
dc.language.isoenen_US
dc.relation.ispartofseriesTH-2693;
dc.subjectELECTRONICS AND ELECTRICAL ENGINEERINGen_US
dc.titleNew Results on Optimal Schemes for Coded Cachingen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
Abstract-TH-2693_146102006.pdf
Size:
86.01 KB
Format:
Adobe Portable Document Format
Description:
ABSTRACT
No Thumbnail Available
Name:
TH-2693_146102006.pdf
Size:
981.3 KB
Format:
Adobe Portable Document Format
Description:
THESIS
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: