Results 191 to 200 of about 838 (226)
Some of the next articles are maybe not open access.
Decentralized Coded Caching for Shared Caches
IEEE Communications Letters, 2021The demands of the clients in the client-server framework exhibit temporal variance leading to congestion in the network at random intervals. To alleviate this problem, popular data is loaded in cache memories scattered across the network. In the conventional cache framework, each user has an associated cache and cache loading is centrally coordinated.
Monolina Dutta, Anoop Thomas
openaire +1 more source
2017 IEEE International Symposium on Information Theory (ISIT), 2017
Coded caching is a technique that promises huge reductions in network traffic in content-delivery networks. However, the original formulation and several subsequent contributions in the area, assume that the file requests from the users are synchronized, i.e., they arrive at the server at the same time.
Hooshang Ghasemi, Aditya Ramamoorthy
openaire +2 more sources
Coded caching is a technique that promises huge reductions in network traffic in content-delivery networks. However, the original formulation and several subsequent contributions in the area, assume that the file requests from the users are synchronized, i.e., they arrive at the server at the same time.
Hooshang Ghasemi, Aditya Ramamoorthy
openaire +2 more sources
2016 IEEE International Symposium on Information Theory (ISIT), 2016
Cache-aided network architectures are emerging as an innovative solution able to harness device memory, a cheap and widely available resource, into bandwidth, so as to meet the predicted dramatic increase of user data traffic generated by on-demand multi-media. In this paper, starting from the previously proposed and widely studied femtocaching network,
Xinping Yi, Giuseppe Caire
openaire +1 more source
Cache-aided network architectures are emerging as an innovative solution able to harness device memory, a cheap and widely available resource, into bandwidth, so as to meet the predicted dramatic increase of user data traffic generated by on-demand multi-media. In this paper, starting from the previously proposed and widely studied femtocaching network,
Xinping Yi, Giuseppe Caire
openaire +1 more source
Erasure Coding for Decentralized Coded Caching
2018 IEEE International Symposium on Information Theory (ISIT), 2018Coded caching can significantly decrease the communication load in peak hours of the network. The gain of caching is maximized in a centralized setting, where the cache content of users are opportunistically designed. In the absence of a centralized placement, users' caches are filled with randomly selected packets of the files.
Hadi Reisizadeh +2 more
openaire +1 more source
Coded Cache Placement for Heterogeneous Cache Sizes
2018 IEEE Information Theory Workshop (ITW), 2018We focus on the coded caching problem of N files and K users with heterogeneous cache sizes. By utilizing coded caching placement, we improve upon existing schemes in terms of the delivery rate. This is done by first finding an optimal caching and delivery scheme for some special heterogeneous-cache-size cases where L out of K users has no cache and ...
Deyao Zhang, Nan Liu 0001
openaire +1 more source
Centralized Coded Caching with Heterogeneous Cache Sizes
2017 IEEE Wireless Communications and Networking Conference (WCNC), 2017Coded caching can improve fundamental limits of communication, utilizing storage memory at individual users. This paper considers a centralized coded caching system, introducing heterogeneous cache sizes at the users, i.e., the users' cache memories are of different size.
Abdelrahman M. Ibrahim +2 more
openaire +1 more source
Coded Caching with Optimized Shared-Cache Sizes
2019 IEEE Information Theory Workshop (ITW), 2019This work studies the K-user broadcast channel where each user is assisted by one of $\Lambda$ caches with a cumulative memory constraint that is equal to t times the size of the library, and where each cache serves an arbitrary number of users. In this setting, under the assumption of uncoded cache placement, no prior scheme is known to achieve a sum ...
Emanuele Parrinello, Petros Elia
openaire +1 more source
On the greedy coded caching scheme
2016 8th International Conference on Wireless Communications & Signal Processing (WCSP), 2016Coded caching is a technique that receives much attention in the network literature, since it is able to achieve significant gains compared to the conventional uncoded caching schemes. In this paper, we first identify a family of placement and delivery schemes. Then we derive a lower bound on the average rate for the identified schemes.
Qifa Yan +2 more
openaire +1 more source