English
Related papers

Related papers: Locality and Availability of Array Codes Construct…

200 papers

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 accommodate the ever-growing data from various, possibly independent, sources and the dynamic nature of data usage rates in practical applications, modern cloud data storage systems are required to be scalable, flexible, and…

Information Theory · Computer Science 2019-05-08 Siyi Yang , Ahmed Hareedy , Robert Calderbank , Lara Dolecek

The majority of works in distributed storage networks assume a simple network model with a collection of identical storage nodes with the same communication cost between the nodes. In this paper, we consider a realistic multi-rack…

Information Theory · Computer Science 2019-03-11 Ali Tebbi , Terence H. Chan , Chi Wan Sung

Data Availability Sampling (DAS), a central component of Ethereum's roadmap, enables clients to verify data availability without requiring any single client to download the entire dataset. DAS operates by having clients randomly retrieve…

Data Structures and Algorithms · Computer Science 2025-04-24 Dankrad Feist , Gottfried Herold , Mark Simkin , Benedikt Wagner

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

In distributed storage systems that use coding, the issue of minimizing the communication required to rebuild a storage node after a failure arises. We consider the problem of repairing an erased node in a distributed storage system that…

Information Theory · Computer Science 2010-09-20 Zhiying Wang , Alexandros G. Dimakis , Jehoshua Bruck

In large scale distributed storage systems (DSS) deployed in cloud computing, correlated failures resulting in simultaneous failure (or, unavailability) of blocks of nodes are common. In such scenarios, the stored data or a content of a…

Information Theory · Computer Science 2017-02-22 Gokhan Calis , O. Ozan Koyluoglu

We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes with limited memory and k<n sources generating the data. We…

Information Theory · Computer Science 2016-11-15 Alexandros G. Dimakis , Vinod Prabhakaran , Kannan Ramchandran

Data storage in Distributed Storage Systems (DSSs) is a multidimensional optimization problem. Using network coding, one wants to provide reliability, scalability, security, reduced storage overhead, reduced bandwidth for repair and minimal…

Information Theory · Computer Science 2016-09-13 Shreyansh A. Prajapati , Manish K. Gupta

Regenerating codes and codes with locality are two schemes that have recently been proposed to ensure data collection and reliability in a distributed storage network. In a situation where one is attempting to repair a failed node,…

Information Theory · Computer Science 2013-02-05 Govinda M. Kamath , N. Prakash , V. Lalitha , P. Vijay Kumar

MDS (maximum distance separable) 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 erasures by accessing (reading)…

Information Theory · Computer Science 2011-07-11 Zhiying Wang , Itzhak Tamo , Jehoshua Bruck

In this paper, we discuss codes for distributed storage systems with hierarchical repair properties. Specifically, we devote attention to the repair problem of the rack-aware storage model with locality, aiming to enhance the system's…

Information Theory · Computer Science 2024-01-30 Yumeng Yang , Han Cai , Xiaohu Tang

This chapter deals with the topic of designing reliable and efficient codes for the storage and retrieval of large quantities of data over storage devices that are prone to failure. For long, the traditional objective has been one of…

Information Theory · Computer Science 2020-10-06 Vinayak Ramkumar , Myna Vajha , S. B. Balaji , M. Nikhil Krishnan , Birenjith Sasidharan , P. Vijay Kumar

In this paper, we introduce a model of a distributed storage system that is locally recoverable from any single server failure. Unlike the usual local recovery model of codes for distributed storage, this model accounts for the fact that…

Information Theory · Computer Science 2020-07-01 Arya Mazumdar

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

When a node in a distributed storage system fails, it needs to be promptly repaired to maintain system integrity. While typical erasure codes can provide a significant storage advantage over replication, they suffer from poor repair…

Information Theory · Computer Science 2018-07-10 Geonu Kim , Jungwoo Lee

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

Distributed storage systems often introduce redundancy to increase reliability. When coding is used, the repair problem arises: if a node storing encoded information fails, in order to maintain the same level of reliability we need to…

Information Theory · Computer Science 2010-04-27 Alexandros G. Dimakis , Kannan Ramchandran , Yunnan Wu , Changho Suh

We consider the problem of geographically distributed data storage in a network of servers (or nodes) where the nodes are connected to each other via communication links having certain round-trip times (RTTs). Each node serves a specific…

Information Theory · Computer Science 2024-05-14 Srivathsa Acharya , P. Vijay Kumar , Viveck R. Cadambe

As consumers are increasingly engaged in social networking and E-commerce activities, businesses grow to rely on Big Data analytics for intelligence, and traditional IT infrastructures continue to migrate to the cloud and edge, these trends…

Networking and Internet Architecture · Computer Science 2020-05-25 Vaneet Aggarwal , Tian Lan