• Tidak ada hasil yang ditemukan

New Results on Optimal Schemes for Coded Caching

N/A
N/A
Protected

Academic year: 2023

Membagikan "New Results on Optimal Schemes for Coded Caching"

Copied!
1
0
0

Teks penuh

(1)

INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI SHORT ABSTRACT OF THESIS

Name of the Student : Vijith Kumar K P

Roll Number : 146102006

Programme of Study : Ph.D.

Thesis Title: New Results on Optimal Schemes for Coded Caching

Name of Thesis Supervisor(s) : Dr. Tony Jacob Thesis Submitted to the Department/ Center : EEE

Date of completion of Thesis Viva-Voce Exam : 11-05-2022

Key words for description of Thesis Work : Information theory, coded caching, exact optimality, Pareto optimality.

SHORT ABSTRACT

The 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 multi- objective 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.

Abstract-TH-2693_146102006

Referensi

Dokumen terkait

Tapas K Mandal Thesis Submitted to the Department/ Center : Chemical Engineering Date of completion of Thesis Viva-Voce Exam : 30-05-2022 Key words for description of Thesis Work :