Multi-Server Coded Caching

Shariatpanahi, Seyed Pooya; Motahari, Seyed Abolfazl; Khalaj, Babak Hossein

doi:10.48550/arxiv.1503.00265

Cited by 9 publications

(24 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a result, there have been significant interests in both academia and industry in characterizing the impact of caching on the performance of communication networks (see, e.g. [1][2][3][4][5][6][7][8][9][10][11][12][13]). In particular, in a network with only one transmitter broadcasting to several receivers, it was shown in [2] that local delivery attains only a small fraction of the gain that caching can offer, and by designing a particular pattern in cache placement at the users and exploiting coding in delivery, a significantly larger global throughput gain can be achieved, which is a function of the entire cache throughout the network.…”

Section: Introductionmentioning

confidence: 99%

Fundamental limits of cache-aided interference management

Naderializadeh

Maddah-Ali

Avestimehr

2016

2016 IEEE International Symposium on Information Theory (ISIT)

160

View full text Add to dashboard Cite

We consider a system, comprising a library of N files (e.g., movies) and a wireless network with KT transmitters, each equipped with a local cache of size of MT files, and KR receivers, each equipped with a local cache of size of MR files. Each receiver will ask for one of the N files in the library, which needs to be delivered. The objective is to design the cache placement (without prior knowledge of receivers' future requests) and the communication scheme to maximize the throughput of the delivery. In this setting, we show that the sum degrees-of-freedom (sum-DoF) of min, KR is achievable, and this is within a factor of 2 of the optimum, under one-shot linear schemes. This result shows that (i) the one-shot sum-DoF scales linearly with the aggregate cache size in the network (i.e., the cumulative memory available at all nodes), (ii) the transmitters' caches and receivers' caches contribute equally in the one-shot sum-DoF, and (iii) caching can offer a throughput gain that scales linearly with the size of the network.To prove the result, we propose an achievable scheme that exploits the redundancy of the content at transmitters' caches to cooperatively zero-force some outgoing interference, and availability of the unintended content at the receivers' caches to cancel (subtract) some of the incoming interference. We develop a particular pattern for cache placement that maximizes the overall gains of cache-aided transmit and receive interference cancellations. For the converse, we present an integer optimization problem which minimizes the number of communication blocks needed to deliver any set of requested files to the receivers. We then provide a lower bound on the value of this optimization problem, hence leading to an upper bound on the linear one-shot sum-DoF of the network, which is within a factor of 2 of the achievable sum-DoF.

show abstract

Section: Introductionmentioning

confidence: 99%

Fundamental limits of cache-aided interference management

Naderializadeh

Maddah-Ali

Avestimehr

2016

2016 IEEE International Symposium on Information Theory (ISIT)

160

View full text Add to dashboard Cite

show abstract

“…Then, we have Finally, (c) is obtained by plugging in (17), (18). Applying the union bound over all k ∈ S and S ⊆ [K], we thus have…”

Section: Decentralized Schemementioning

confidence: 99%

“…The results of [10], [11] on coded caching have been extended in several other directions as well, ranging from heterogeneous cache sizes [19], unequal file sizes [21], to improved converse arguments [2], [7], [16]. Content caching and delivery has also been studied in the context of device-to-device networks, multi-server topologies, and heterogeneous wireless networks in [9], [18], and [8] respectively. The work closest to ours is [15], which considers the problem of secure coded caching, where the goal is to protect information about the files from an eavesdropper which can listen to the server transmissions.…”

Section: Introductionmentioning

confidence: 99%

Private Coded Caching

Ravindrakumar

Panda

Karamchandani

et al. 2018

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

Recent work by Maddah-Ali and Niesen (2014) introduced coded caching which demonstrated the benefits of joint design of storage and transmission policies in content delivery networks. They studied a setup where a server communicates with a set of users, each equipped with a local cache, over a shared error-free link and proposed an order-optimal caching and delivery scheme. In this paper, we introduce the problem of private coded caching where we impose the additional constraint that a user should not be able to learn anything, from either the content stored in its cache or the server transmissions, about a file it did not request. We propose a feasible scheme for this setting and demonstrate its order-optimality by deriving information-theoretic lower bounds. I. INTRODUCTIONBroadband data consumption has grown at a rapid pace over last couple of decades, owing in great part to multimedia applications such as Video-on-Demand [1]. Content delivery networks attempt to mitigate this extra load on the communication network by deploying storage units or caches where some of the popular content can be pre-fetched during the off-peak hours.Content caching and delivery has been studied extensively in the literature, see for example [20], [4], [3] and references therein. However, most of the work proposes caching schemes where those parts of the requested files that are available at nearby caches are served locally and the remaining parts are served by a remote server via separate unicast transmissions to the users. In contrast, recent work [10], [11] has studied an information-theoretic formulation of the problem and proposed the idea of coded caching which uses the available cache memory to not only provide local access to content but to also generate coded-multicasting opportunities among users with different demands. The setup studied in [10], [11] consists of a server communicating to a set of users, each equipped with a cache of uniform size, over a broadcast link and the objective

show abstract

“…online caching policies [33], multi-servers [34], multi-library [35] and multihop wireless networks with cooperative caching [36]. More recently, it has been shown that in order to achieve such "order of K" gain over conventional unicast (with possible legacy uncoded caching) systems, the content objects must be split into an O(exp(K)) number of subpackets; for networks of practical size this gain is not achievable.…”

Section: Wireless Caching Lies Both At Network and Phy Layersmentioning

confidence: 99%

Wireless Caching: Technical Misconceptions and Business Barriers

Paschos,

Baştuğ,

Land

et al. 2016

Preprint

View full text Add to dashboard Cite

Caching is a hot research topic and poised to develop into a key technology for the upcoming 5G wireless networks. The successful implementation of caching techniques however, crucially depends on joint research developments in different scientific domains such as networking, information theory, machine learning, and wireless communications. Moreover, there exist business barriers related to the complex interactions between the involved stakeholders, the users, the cellular operators, and the Internet content providers. In this article we discuss several technical misconceptions with the aim to uncover enabling research directions for caching in wireless systems. Ultimately we make a speculative stakeholder analysis for wireless caching in 5G.

show abstract

Multi-Server Coded Caching

Cited by 9 publications

References 0 publications

Fundamental limits of cache-aided interference management

Fundamental limits of cache-aided interference management

Private Coded Caching

Wireless Caching: Technical Misconceptions and Business Barriers

Contact Info

Product

Resources

About