English
Related papers

Related papers: MDS-Coded Distributed Storage for Low Delay Wirele…

200 papers

We investigate the use of maximum distance separable (MDS) codes to cache popular content to reduce the download delay of wireless content delivery. In particular, we consider a cellular system where devices roam in an out of a cell…

Information Theory · Computer Science 2017-01-09 Amina Piemontese , Alexandre Graell i Amat

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

We consider the use of distributed storage (DS) to reduce the communication cost of content delivery in wireless networks. Content is stored (cached) in a number of mobile devices using an erasure correcting code. Users retrieve content…

Information Theory · Computer Science 2016-09-28 Jesper Pedersen , Alexandre Graell i Amat , Iryna Andriyanova , Fredrik Brännström

We consider distributed storage (DS) for a wireless network where mobile devices arrive and depart according to a Poisson random process. Content is stored in a number of mobile devices, using an erasure correcting code. When requesting a…

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

We consider distributed and dynamic caching of coded content at small base stations (SBSs) in an area served by a macro base station (MBS). Specifically, content is encoded using a maximum distance separable code and cached according to a…

Maximum-distance-separable (MDS) codes are a class of erasure codes that are widely adopted to enhance the reliability of distributed storage systems (DSS). In (n, k) MDS coded DSS, the original data are stored into n distributed nodes in…

Information Theory · Computer Science 2017-06-16 Sheng Guan , Haibin Kan , Xin Wang

Distributed storage systems (DSSs) have gained a lot of interest recently, thanks to their robustness and scalability compared to single-device storage. Majority of the related research has exclusively concerned the network layer. At the…

Information Theory · Computer Science 2014-04-29 Camilla Hollanti , David Karpuk , Amaro Barreal , Hsiao-feng Francis Lu

The paper presents techniques for analyzing the expected download time in distributed storage systems that employ systematic availability codes. These codes provide access to hot data through the systematic server containing the object and…

Performance · Computer Science 2021-03-11 Mehmet Fatih Aktas , Swanand Kadhe , Emina Soljanin , Alex Sprintson

In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes, which provide the same level of reliability as replication…

Information Theory · Computer Science 2013-11-12 Nihar B. Shah , Kangwook Lee , Kannan Ramchandran

This paper describes a non-homogeneous distributed storage systems (DSS), where there is one super node which has a larger storage size and higher reliability and availability than the other storage nodes. We propose three distributed…

Information Theory · Computer Science 2012-08-13 Vo Tam Van , Chau Yuen , Jing Li

Maximum distance separable (MDS) array codes are widely employed in modern distributed storage systems to provide high data reliability with small storage overhead. Compared with the data access latency of the entire file, the data access…

Information Theory · Computer Science 2025-01-22 Hao Shi , Zhengyi Jiang , Zhongyi Huang , Linqi Song , Hanxu Hou

In \textit{Distributed Storage Systems} (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of \textit{Fractional Repetition} (FR) codes have been introduced, in which, data is…

Information Theory · Computer Science 2017-11-27 Krishna Gopal Benerjee , Manish K Gupta

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,…

Information Theory · Computer Science 2020-05-29 Mozhgan Bayat , Ratheesh K. Mungara , Giuseppe Caire

The distributed data storage systems are constructed by large number of nodes which are interconnected over a network. Each node in such peer-to-peer network is vulnerable and at a potential risk for attack. The attackers can eavesdrop the…

Information Theory · Computer Science 2016-02-08 Ninoslav Marina , Aneta Velkoska , Natasa Paunkoska

Content caching at small-cell base stations (SBSs) is a promising method to mitigate the excessive backhaul load and delay, particularly for on-demand video streaming applications. A cache-enabled heterogeneous cellular network architecture…

Information Theory · Computer Science 2019-07-10 Emre Ozfatura , Deniz Gunduz

Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code with the property of degraded-read friendly (DRF) is…

Information Theory · Computer Science 2021-02-05 Ting-Yi Wu , Yunghsiang S. Han , Zhengrui Li , Bo Bai , Gong Zhang , Liang Chen , Xiang Wu

In heterogeneous cellular networks with caching capability, due to mobility of users and storage constraints of small-cell base stations (SBSs), users may not be able to download all of their requested content from the SBSs within the delay…

Information Theory · Computer Science 2017-11-22 Emre Ozfatura , Deniz Gündüz

We consider distributed caching of content across several small base stations (SBSs) in a wireless network, where the content is encoded using a maximum distance separable code. Specifically, we apply soft time-to-live (STTL) cache…

Information Theory · Computer Science 2021-04-15 Jesper Pedersen , Alexandre Graell i Amat , Fredrik Brännström , Eirik Rosnes

In this paper, we investigate maximum distance separable (MDS) codes based group coded caching in fog radio access networks (F-RANs). The goal is to minimize the average fronthaul rate under nonuniform file popularity. Firstly, an MDS codes…

Information Theory · Computer Science 2022-06-24 Qianli Tan , Yanxiang Jiang , Fu-Chun Zheng , Mehdi Bennis , Xiaohu You

Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundancy but also achieve low computational complexity. They are…

Information Theory · Computer Science 2019-06-24 Hanxu Hou , Yunghsiang Han , Patrick P. C. Lee , Yuchong Hu , Hui Li
‹ Prev 1 2 3 10 Next ›