English
Related papers

Related papers: Lowest Density MDS Array Codes for Reliable Smart …

200 papers

This paper investigates the use of redundancy and self repairing against node failures in distributed storage systems, using various strategies. In replication method, access to one replication node is sufficient to reconstruct a lost node,…

Information Theory · Computer Science 2011-10-03 Abbas Kiani , Soroush Akhlaghi

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 this paper, we consider the update bandwidth in distributed storage systems~(DSSs). The update bandwidth, which measures the transmission efficiency of the update process in DSSs, is defined as the total amount of data symbols…

Information Theory · Computer Science 2020-05-26 Zhengrui Li , Sian-Jheng Lin , Po-Ning Chen , Yunghsiang S. Han , Hanxu Hou

This paper presents a construction for high-rate MDS codes that enable bandwidth-efficient repair of a single node. Such MDS codes are also referred to as the minimum storage regenerating (MSR) codes in the distributed storage literature.…

Information Theory · Computer Science 2016-01-26 Ankit Singh Rawat , O. Ozan Koyluoglu , Sriram Vishwanath

We address the use of maximum distance separable (MDS) codes for distributed storage (DS) to enable efficient content delivery in wireless networks. Content is stored in a number of the mobile devices and can be retrieved from them using…

Information Theory · Computer Science 2016-08-30 Amina Piemontese , Alexandre Graell i Amat

In a distributed storage systems (DSS) with $k$ systematic nodes, robustness against node failure is commonly provided by storing redundancy in a number of other nodes and performing repair mechanism to reproduce the content of the failed…

Information Theory · Computer Science 2018-01-01 Kaveh Mahdaviani , Soheil Mohajer , Ashish Khisti

Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing…

Networking and Internet Architecture · Computer Science 2008-03-06 Alexandros G. Dimakis , P. Brighten Godfrey , Yunnan Wu , Martin J. Wainwright , Kannan Ramchandran

The minimum storage rack-aware regenerating (MSRR) code is a variation of regenerating codes that achieves the optimal repair bandwidth for a single node failure in the rack-aware model. The authors in~\cite{Chen-Barg2019}…

Information Theory · Computer Science 2021-09-20 Jiaojiao Wang , Dabin Zheng , Shenghua Li

In this paper, we propose locally repairable codes (LRCs) with optimal minimum distance for distributed storage systems (DSS). A two-layer encoding structure is employed to ensure data reconstruction and the designated repair locality. The…

Information Theory · Computer Science 2014-08-15 Hongmei Xie , Zhiyuan Yan

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

MDS array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with $r$ redundancy nodes can correct any $r$ node erasures by accessing all the remaining information…

Information Theory · Computer Science 2016-03-04 Zhiying Wang , Itzhak Tamo , Jehoshua Bruck

Under conditions of high penetration of renewables, the low-voltage (LV) distribution network needs to be carefully managed. In such a scenario, an accurate real-time low-voltage power network model is an important prerequisite, which opens…

Optimization and Control · Mathematics 2019-06-19 Sergey Iakovlev , Robin J. Evans , Iven Mareels

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

Large-scale distributed storage systems typically use erasure codes to provide durability of data in the face of failures. A set of $k$ blocks to be stored is encoded using an $[n, k]$ code to generate $n$ blocks that are then stored on…

Information Theory · Computer Science 2019-07-31 Francisco Maturana , K. V. Rashmi

This short note revisits the problem of designing secure minimum storage regenerating (MSR) codes for distributed storage systems. A secure MSR code ensures that a distributed storage system does not reveal the stored information to a…

Information Theory · Computer Science 2016-08-08 Ankit Singh Rawat

A network coding-based scheme is proposed to improve the energy efficiency of distributed storage systems in WSNs (wireless sensor networks), which mainly focuses on two problems: firstly, consideration is given to effective distributed…

Networking and Internet Architecture · Computer Science 2013-04-08 Wang Lei , Yang Yuwang , Zhao Wei , Lu Wei

In a distributed storage system based on erasure coding, an important problem is the \emph{repair problem}: If a node storing a coded piece fails, in order to maintain the same level of reliability, we need to create a new encoded piece and…

Information Theory · Computer Science 2016-11-17 Yunnan Wu

Distributed storage systems employ codes to provide resilience to failure of multiple storage disks. Specifically, an $(n, k)$ MDS code stores $k$ symbols in $n$ disks such that the overall system is tolerant to a failure of up to $n-k$…

Information Theory · Computer Science 2013-05-16 Sreechakra Goparaju , Itzhak Tamo , Robert Calderbank

Regenerating codes for distributed storage have attracted much research interest in the past decade. Such codes trade the bandwidth needed to repair a failed node with the overall amount of data stored in the network. Minimum storage…

Information Theory · Computer Science 2016-02-16 Sreechakra Goparaju , Arman Fazeli , Alexander Vardy

Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes…