Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Kota Srinivas Reddy"'
We consider the multi-access coded caching problem, which contains a central server with $N$ files, $K$ caches with $M$ units of memory each and $K$ users where each one is connected to $L (\geq 1)$ consecutive caches, with a cyclic wrap-around. Cach
Externí odkaz:
http://arxiv.org/abs/2305.05514
Publikováno v:
IEEE Journal on Selected Areas in Information Theory. 2:1266-1281
Index coding and coded caching are two active research topics in information theory with strong ties to each other. Motivated by the multi-access coded caching problem, we study a new class of structured index coding problems (ICPs) which are formed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb7d048fc243356c0f6aca17d0794ba0
https://doi.org/10.1109/jsait.2021.3126663
https://doi.org/10.1109/jsait.2021.3126663
Publikováno v:
ISIT
We study a multi-access variant of the popular coded caching framework, which consists of a central server with a catalog of $N$ files, $K$ caches with limited memory $M$, and $K$ users such that each user has access to $L$ consecutive caches with a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a893d9b8e0c198df0f8769152c79dff3
https://doi.org/10.1109/tcomm.2020.2980817
https://doi.org/10.1109/tcomm.2020.2980817
Publikováno v:
ISIT
An Index Coding Problem (ICP) has a central server that possesses files and is connected to multiple users through a shared link. Each user demands a subset of files and possesses another subset of files as side-information. The files which are neith
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b5d39d6acf6403ffe5889bb189c92e7
https://doi.org/10.1109/isit45174.2021.9517865
https://doi.org/10.1109/isit45174.2021.9517865
Publikováno v:
ITW
Index coding and coded caching are two active research topics in information theory with strong ties to each other. Motivated by the multi-access coded caching problem, we study a new class of structured index coding problems (ICPs) which are formed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16c6075e49872a98842c480075675406
https://doi.org/10.1109/itw46852.2021.9457671
https://doi.org/10.1109/itw46852.2021.9457671
Publikováno v:
SPCOM
Content Delivery Networks (CDNs) are an essential component of Video on Demand (VoD) services. We consider a content delivery system comprising a central server connected to several co-located caches, each with limited storage and service capabilitie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::191d8bddcdd2a352af32d6e0d4e6343f
https://doi.org/10.1109/spcom50965.2020.9179501
https://doi.org/10.1109/spcom50965.2020.9179501
Publikováno v:
ISIT
We consider the problem of identifying the subset $S$ γ P of elements in the support of an underlying distribution $P$ whose probability value is larger than a given threshold γ, by actively querying an oracle to gain information about a sequence $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad73f268e2451ac52e2a00dfcbca338c
Publikováno v:
COMSNETS
We study storage policies for a two-cache system where each request for a file arrives at one of the two caches. A request can be served by either one of the two caches or a central server. Serving a request using the cache at which it is received is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dda59de5464508495c0ea623599f7a4b
https://doi.org/10.1109/comsnets.2019.8711318
https://doi.org/10.1109/comsnets.2019.8711318
Publikováno v:
WiOpt
In this work, we focus on distributed cache systems with non-uniform storage capacity across caches. We compare the performance of our system with the performance of a system with the same cumulative storage distributed evenly across the caches. We c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1ba408f497cb8e6d940fe620298945a
http://arxiv.org/abs/1809.09877
http://arxiv.org/abs/1809.09877
Publikováno v:
SPCOM
We study a cache-aided content delivery network consisting of a central server which hosts a catalog of $N$ files, and $K$ caches each with limited memory $M$ which store content related to the files. There are $K$ users, each of which requests a fil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7c92e7f3a03d43ee9e8280236c73ad0
https://doi.org/10.1109/spcom.2018.8724457
https://doi.org/10.1109/spcom.2018.8724457