Coded Caching in a Multi-Server System with Random Topology

Mital, Nitish; Gündüz, Deniz; Ling, Cong

doi:10.48550/arxiv.1712.00649

Cited by 3 publications

(5 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to calculate the conditional average interference term in (15), we apply Campbell theorem [24, Theorem 4.1] and, for η > 2, we obtain…”

Section: System Performance Analysismentioning

confidence: 99%

“…Plugging ( 16) in (15), we obtain the quasi-lower bound 3 on the ergodic achievable rate in the form…”

Section: System Performance Analysismentioning

confidence: 99%

“…A particularly relevant topology for the present paper is the so-called combination network, formed by the server, a layer of N E intermediate nodes acting as relays, and the users. There are exactly K = N E L users, each of which is connected to a distinct subset of L out of N E relays (from which the name "combination" network) [11][12][13][14][15]. Both the single bottleneck link network and the combination network are deterministic error-free models.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Achieving Spatial Scalability for Coded Caching via Coded Multipoint Multicasting

Bayat

Mungara

Caire

2019

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

The coded caching scheme proposed by Maddah-Ali and Niesen considers the delivery of files in a given content library to users through a deterministic error-free network where a common multicast message is sent to all users at a fixed rate, independent of the number of users. In order to apply this paradigm to a wireless network, it is important to make sure that the common multicast rate does not vanish as the number of users increases. This paper focuses on a variant of coded caching successively proposed for the so-called combination network, where the multicast message is further encoded by a Maximum Distance Separable (MDS) code and the MDS-coded blocks are simultaneously transmitted from different Edge Nodes (ENs) (e.g., base stations or access points). Each user is equipped with multiple antennas and can select to decode a desired number of EN transmissions, while either nulling of treating as noise the others, depending on their strength. The system is reminiscent of the so-called evolved Multimedia Broadcast Multicast Service (eMBMS), in the sense that the fundamental underlying transmission mechanism is multipoint multicasting, where each user can independently and individually (in a user-centric manner) decide which EN to decode, without any explicit association of users to ENs.We study the performance of the proposed system when users and ENs are distributed according to homogeneous Poisson Point Processes in the plane and the propagation is affected by Rayleigh fading and distance dependent pathloss. Our analysis allows the system optimization with respect to the MDS coding rate. Also, we show that the proposed system is fully scalable, in the sense that it can support an arbitrarily large number of users, while maintaining a non-vanishing per-user delivery rate.

show abstract

“…In order to calculate the conditional average interference term in (15), we apply Campbell theorem [24, Theorem 4.1] and, for η > 2, we obtain…”

Section: System Performance Analysismentioning

confidence: 99%

“…Plugging ( 16) in (15), we obtain the quasi-lower bound 3 on the ergodic achievable rate in the form…”

Section: System Performance Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Achieving Spatial Scalability for Coded Caching via Coded Multipoint Multicasting

Bayat

Mungara

Caire

2019

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…We denote such amount by R M N (K, M N ). So MN scheme has been extensively employed in practical scenarios, such as device to device networks [3], hierarchical networks [4], security [8], multi-servers setting [5], [7], [9] and so on. There are also many results following MN scheme in [2], [10], [11], [14]- [17] etc.…”

Section: Introductionmentioning

confidence: 99%

Reduced Transmission in Multi-server Coded Caching

Cheng

Zhang

Jiang

et al. 2018

Internet and Distributed Computing Systems

View full text Add to dashboard Cite

Coded caching has been widely used in the wireless network for shifting the some transmissions during the peak traffic times to the off-peak traffic times. Multi-server coded caching, which can share responsibility for the total amount of transmission in the wireless network during the peak traffic times by means of the collaboration among these servers, can be seen everywhere in our life. The three servers setting (two data servers and one parity check server) is used in practice, e.g. redundant array of independent disks-4. In this scenario, there are total N files which are equally stored in two data servers respectively and K users each of which has the memory size of M files. Each server connects to users by an independently channel. During the off-peak traffic times, two data servers place some parts of each files in each user's cache. In that time, servers do not know users' requests in future. During the peak traffic times each user just requests one file from N files. Luo et al. in 2016 proposed the first coded caching scheme for this setting. In this paper, we proposed some method that further reduces the amount of transmission in each channel when KM N is odd. This method also improves the transmission rate for systems with general multiply servers. I. INTRODUCTIONPredominantly driven by video content demand, there is a dramatic increase in wireless traffic now. The high temporal variability of network traffic results in communication systems that are congested during peak-traffic times and underutilized during off-peak times. Caching is a natural strategy to cope with this high temporal variability by shifting some transmissions from peak to off-peak times with the help of cache memories at the network edge.Maddah-Ali and Niesen in [6] proved that coded caching does not only shift some transmissions from peak to off-peak times, but also further reduces the amount of transmission during the peak traffic times by exploiting caches to create multicast opportunities. The first caching scenario focused in [6] is: a single server containing N files with the same length connects to K users over a shared link and each user has a cache memory of size M files. During the off-peak traffic times the server places some contents to each user's cache. In this phase the server does not known what each user will require next. During the peak traffic times, each user requires a file from server randomly. Then according to each user's cache, the server sends a coded signal (XOR of some required packets) to the users such that various user demands are satisfied. The first determined coded caching scheme, which is called MN scheme in this paper, was proposed in [6]. It is worth mentioning that the broadcasted amount of MN scheme for the worst request, where all the requirements are different from each other, is at most four times larger than the lower bound when K ≤ N [2]. We denote such amount by R M N (K, M N ). So MN scheme has been extensively employed in practical scenarios, such as device to device networks [3], hie...

show abstract

“…In this section with use the "hat" notation A to indicate blocks A of symbols over Fq, whose length | A| is given by the number of finite-field symbols 2. This can be implemented by intra-session random linear network coding[24]-[26] or algebraic MDS codes, as long as an MDS code with parameters (F , yF ) over F2q exists.…”

mentioning

confidence: 99%

Coded Caching over Multicast Routing Networks

Bayat¹,

Wan²,

Caire³

2020

Preprint

View full text Add to dashboard Cite

The coded caching scheme originally proposed by Maddah-Ali and Niesen (MAN) transmits coded multicast messages from a server to users equipped with caches via a capacitated shared-link and was shown to be information theoretically optimal within a constant multiplicative factor. This work extends the MAN scheme to a class of two-hop wired-wireless networks including one server connected via fronthaul links to a layer of H helper nodes (access points/base stations), which in turns communicate via a wireless access network to K users, each equipped with its own cache. Two variants are considered, which differ in the modeling of the access segment. Both models should be regarded as abstractions at the "network layer" for physical scenarios such as local area networks and cellular networks, spatially distributed over a certain coverage area. The key focus of our approach consists of routing MAN-type multicast messages through the network and formulating the optimal routing scheme as an optimization problem that can be solved exactly or for which we give powerful heuristic algorithms. Our approach solves at once many of the open practical problems identified as stumbling blocks for the application of coded caching in practical scenarios, namely: asynchronous streaming sessions, finite file size, scalability of the scheme to large and spatially distributed networks, user mobility and random activity (users joining and leaving the system at arbitrary times), decentralized prefetching of the cache contents, end-to-end encryption of HTTPS requests, which renders the helper nodes oblivious of the user demands.

show abstract

Coded Caching in a Multi-Server System with Random Topology

Cited by 3 publications

References 0 publications

Achieving Spatial Scalability for Coded Caching via Coded Multipoint Multicasting

Achieving Spatial Scalability for Coded Caching via Coded Multipoint Multicasting

Reduced Transmission in Multi-server Coded Caching

Coded Caching over Multicast Routing Networks

Contact Info

Product

Resources

About