English
Related papers

Related papers: Caching at the Edge with Fountain Codes

200 papers

Coded-caching is a promising technique to reduce the peak rate requirement of backhaul links during high traffic periods. In this letter, we study the effect of adaptive transmission on the performance of coded-caching based networks.…

Information Theory · Computer Science 2021-03-15 Behrooz Makki , Mohamed-Slim Alouini

Rate splitting (RS) and wireless edge caching are essential means for meeting the quality of service requirements of future wireless networks. In this work, we focus on the cross-layer co-design of wireless edge caching schemes with…

Signal Processing · Electrical Eng. & Systems 2021-10-27 Eleni Demarchou , Constantinos Psomas , Ioannis Krikidis

We consider the canonical {\em shared link network} formed by a source node, hosting a library of $m$ information messages (files), connected via a noiseless common link to $n$ destination nodes (users), each with a cache of size M files.…

Information Theory · Computer Science 2015-02-12 Mingyue Ji , Antonia M. Tulino , Jaime Llorca , Giuseppe Caire

Satellite networks provide unique challenges that can restrict users' quality of service. For example, high packet erasure rates and large latencies can cause significant disruptions to applications such as video streaming or voice-over-IP.…

Networking and Internet Architecture · Computer Science 2015-06-23 Jason Cloud , Muriel Medard

For a network with one sender, $n$ receivers (users) and $m$ possible messages (files), caching side information at the users allows to satisfy arbitrary simultaneous demands by sending a common (multicast) coded message. In the worst-case…

Information Theory · Computer Science 2014-07-04 Mingyue Ji , Antonia M. Tulino , Jaime Llorca , Giuseppe Caire

A centralized coded caching system, consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link, is considered. It is assumed that each user is equipped with a local cache memory with…

Information Theory · Computer Science 2016-12-15 Mohammad Mohammadi Amiri , Deniz Gunduz

Caching of popular contents at cellular base stations, i.e., edge caching, in order to eliminate duplicate transmission through the backhaul can reduce the latency of data delivery in $5$G networks. However, since caching can only reduce…

Information Theory · Computer Science 2018-02-14 Tachporn Sanguanpuak , Sudarshan Guruacharya , Ekram Hossain , Dusit Niyato , Nandana Rajatheva , Matti Latva-aho

One key requirement for storage clouds is to be able to retrieve data quickly. Recent system measurements have shown that the data retrieving delay in storage clouds is highly variable, which may result in a long latency tail. One crucial…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-17 Yin Sun , Zizhan Zheng , C. Emre Koksal , Kyu-Han Kim , Ness B. Shroff

Coded caching (CC) schemes exploit the cumulative cache memory of the users and simple linear coding to turn unicast traffic (individual file requests) into a multicast transmission. For the originally proposed $K$-user single-server/single…

Information Theory · Computer Science 2024-03-12 Kagan Akcay , MohammadJavad Salehi , Giuseppe Caire

A multistatic radar set-up is considered in which distributed receive antennas are connected to a Fusion Center (FC) via limited-capacity backhaul links. Similar to cloud radio access networks in communications, the receive antennas…

Statistics Theory · Mathematics 2015-06-23 Shahrouz Khalili , Osvaldo Simeone , Alexander M. Haimovich

We study the throughput and delay characteristics of wireless caching networks, where users are mainly interested in retrieving content stored in the network, rather than in maintaining source-destination communication. Nodes are assumed to…

Networking and Internet Architecture · Computer Science 2017-04-25 Milad Mahdian , Edmund Yeh

This work investigates a system where each user aims to retrieve a scalar linear function of the files of a library, which are Maximum Distance Separable coded and stored at multiple distributed servers. The system needs to guarantee robust…

Information Theory · Computer Science 2021-08-24 Qifa Yan , Daniela Tuninetti

Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for proving some network capacity theorems: structured coding…

Information Theory · Computer Science 2008-02-05 Bobak Nazer , Michael Gastpar

Caching popular contents at edge devices is an effective solution to alleviate the burden of the backhaul networks. Earlier investigations commonly neglected the storage cost in caching. More recently, retention-aware caching, where both…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-01-10 Ghafour Ahani , Di Yuan

Mobile networks are experiencing tremendous increase in data volume and user density. An efficient technique to alleviate this issue is to bring the data closer to the users by exploiting the caches of edge network nodes, such as fixed or…

Networking and Internet Architecture · Computer Science 2021-05-18 Nikolaos Nomikos , Spyros Zoupanos , Themistoklis Charalambous , Ioannis Krikidis , Athina Petropulu

Cellular data traffic almost doubles every year, greatly straining network capacity. The main driver for this development is wireless video. Traditional methods for capacity increase (like using more spectrum and increasing base station…

Information Theory · Computer Science 2014-05-23 Andreas F. Molisch , Giuseppe Caire , David Ott , Jeffrey R. Foerster , Dilip Bethanabhotla , Mingyue Ji

Wireless edge caching is a popular strategy to avoid backhaul congestion in the next generation networks, where the content is cached in advance at base stations to serve redundant requests during peak congestion periods. In the edge…

Information Theory · Computer Science 2022-03-01 Navneet Garg , Tharmalingam Ratnarajah

We consider the caching of content in the mobile devices in a dense wireless network using maximum distance separable (MDS) codes. We focus on an area, served by a base station (BS), where mobile devices move around according to a random…

Information Theory · Computer Science 2018-11-01 Jesper Pedersen , Alexandre Graell i Amat , Iryna Andriyanova , Fredrik Brännström

This paper studies edge caching in fog computing networks, where a capacity-aware edge caching framework is proposed by considering both the limited fog cache capacity and the connectivity capacity of base stations (BSs). By allowing…

Networking and Internet Architecture · Computer Science 2020-02-07 Qiang Li , Yuanmei Zhang , Yingyu Li , Yong Xiao , Xiaohu Ge

In this paper, we proposed an effective and efficient multi-core shared-cache design optimization approach based on reuse-distance analysis of the data traces of target applications. Since data traces are independent of system hardware…

Performance · Computer Science 2021-09-13 Hsin-Yu Ho , Ren-Song Tsay