Coded caching for combination networks with cache-aided relays

Zewail, Ahmed A.; Yener, Aylin

doi:10.1109/isit.2017.8006966

Cited by 40 publications

(96 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, for a given user cache capacity M U , the minimum server storage capacity that would allow the reconstruction of any demand combination is given by M S = N −M U ρ . In this case, we cache the same M U N fraction of the library in all the user caches during the placement phase, and deliver the remaining fraction of the demands from the servers, which is identical to the scheme in [13] when the user and its connected servers have just enough space to store the entire March 12, 2020 DRAFT Fig. 3: An example 7 × 5 incidence matrix (P = 7, K = 5) with ρ = 4.…”

Section: A Redundancy In Server Storage Capacitymentioning

confidence: 99%

Coded caching in a multi-server system with random topology

Mital

Gündüz

Ling

2018

2018 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

Coded caching, distributed storage, partial connectivity, multi-server caching, femtocaching. AbstractCache-aided content delivery is studied in a multi-server system with P servers and K users, each equipped with a local cache memory. In the delivery phase, each user connects randomly to any ρ out of P servers. Thanks to the availability of multiple servers, which model small-cell base stations (SBSs), demands can be satisfied with reduced storage capacity at each server and reduced delivery rate per server; however, this also leads to reduced multicasting opportunities compared to the single-server scenario. A joint storage and proactive caching scheme is proposed, which exploits coded storage across the servers, uncoded cache placement at the users, and coded delivery. The delivery latency is studied for both successive and parallel transmissions from the servers. It is shown that, with successive transmissions the achievable average delivery latency is comparable to the one achieved in the single-server scenario, while the gap between the two depends on ρ, the available redundancy across the servers, and can be reduced by increasing the storage capacity at the SBSs. The optimality of the proposed scheme with uncoded cache placement and MDS-coded server storage is also proved for successive transmissions.

show abstract

Section: A Redundancy In Server Storage Capacitymentioning

confidence: 99%

Coded caching in a multi-server system with random topology

Mital

Gündüz

Ling

2018

2018 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

show abstract

“…Remark 5. The proposed caching and delivery optimization framework can be extended to integrate (centralized and decentralized) coded caching at the end users [11]- [15]. For example, multicast codewords can be cooperatively transmitted by a subset of the BSs if these BSs have cached the subfiles required for coded multicast transmission.…”

Section: Optimal Delivery Solutionmentioning

confidence: 99%

“…Recently, wireless caching has been proposed as a viable solution to enhance the capacity of small cell backhauling [5]- [15]. Built upon the content-centric networking paradigm, in wireless caching, the most popular contents are pre-stored at the access points or BSs in close proximity of the user equipments (UEs).…”

mentioning

confidence: 99%

See 1 more Smart Citation

Secure Video Streaming in Heterogeneous Small Cell Networks With Untrusted Cache Helpers

Xiang

Schober

et al. 2018

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-This paper studies secure video streaming in cacheenabled small cell networks, where some of the cache-enabled small cell base stations (BSs) helping in video delivery are untrusted. Unfavorably, caching improves the eavesdropping capability of these untrusted helpers as they may intercept both the cached and the delivered video files. To address this issue, we propose joint caching and scalable video coding (SVC) of video files to enable secure cooperative multiple-input multipleoutput (MIMO) transmission and, at the same time, exploit the cache memory of both the trusted and untrusted BSs for improving the system performance. Considering imperfect channel state information (CSI) at the transmitters, we formulate a two-timescale non-convex mixed-integer robust optimization problem to minimize the total transmit power required for guaranteeing the quality of service (QoS) and secrecy during video streaming. We develop an iterative algorithm based on a modified generalized Benders decomposition (GBD) to solve the problem optimally, where the caching and the cooperative transmission policies are determined via offline (long-timescale) and online (short-timescale) optimization, respectively. Furthermore, inspired by the optimal algorithm, a low-complexity suboptimal algorithm based on a greedy heuristic is proposed. Simulation results show that the proposed schemes achieve significant gains in power efficiency and secrecy performance compared to several baseline schemes.

show abstract

“…The server transmit one different MDS coded symbol for each MAN multicast message to each relay, which then forwards it to the connected users. In [7], the authors improved the coded caching scheme in [6] by using the network topology information. Notice that while the MDS coded scheme of [6] applies to any network topology as long as each user can receive from at least L relays, the scheme of [7] critically hinges on the combination network topology and therefore does not generalize to networks with random topology, which is the focus of this work.…”

Section: Introductionmentioning

confidence: 99%

Routing-Based Delivery in Combination-Type Networks with Random Topology

Bayat

Wan

Caire

2019

2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

View full text Add to dashboard Cite

The coded caching scheme proposed by Maddah-Ali and Niesen (MAN) transmits coded multicast messages to users equipped with caches and it is known to be optimal within a constant factor. This work extends this caching scheme to two-hop relay networks with one main server with access to a library of N files, and H relays communicating with K users with cache, each of which is connected to a random subset of relays. This topology can be considered as a generalized version of a celebrated family of networks, referred to as combination networks. Our approach is simply based on routing MAN packets through the network. The optimization of the routing can be formulated as a Linear Program (LP). In addition, to reduce the computation complexity, a dynamic algorithm is proposed to approach the LP solution. Numerical simulations show that the proposed scheme outperforms the existing caching schemes for this class of networks.

show abstract

Coded caching for combination networks with cache-aided relays

Cited by 40 publications

References 7 publications

Coded caching in a multi-server system with random topology

Coded caching in a multi-server system with random topology

Secure Video Streaming in Heterogeneous Small Cell Networks With Untrusted Cache Helpers

Routing-Based Delivery in Combination-Type Networks with Random Topology

Contact Info

Product

Resources

About