English
Related papers

Related papers: Maximum Lifetime for Data Regeneration in Wireless…

200 papers

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

Erasure coding techniques are getting integrated in networked distributed storage systems as a way to provide fault-tolerance at the cost of less storage overhead than traditional replication. Redundancy is maintained over time through…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-06-12 Lluis Pamies-Juarez , Frédérique Oggier , Anwitaman Datta

Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a…

Information Theory · Computer Science 2009-10-06 K. V. Rashmi , Nihar B. Shah , P. Vijay Kumar , Kannan Ramchandran

Peer-to-peer distributed storage systems provide reliable access to data through redundancy spread over nodes across the Internet. A key goal is to minimize the amount of bandwidth used to maintain that redundancy. Storing a file using an…

Information Theory · Computer Science 2007-07-13 Alexandros G. Dimakis , P. Brighten Godfrey , Martin J. Wainwright , Kannan Ramchandran

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

Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures during…

Information Theory · Computer Science 2015-03-20 K. V. Rashmi , Nihar B. Shah , Kannan Ramchandran , P. Vijay Kumar

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

Erasure coding is a storage-efficient alternative to replication for achieving reliable data backup in distributed storage systems. During the storage process, traditional erasure codes require a unique source node to create and upload all…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-03-19 Lluis Pamies-Juarez , Anwitaman Datta , Frédérique Oggier

In order to provide high data reliability, distributed storage systems disperse data with redundancy to multiple storage nodes. Regenerating codes is a new class of erasure codes to introduce redundancy for the purpose of improving the data…

Information Theory · Computer Science 2015-03-18 Kenneth W. Shum , Yuchong Hu

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The…

Information Theory · Computer Science 2016-11-17 K. V. Rashmi , Nihar B. Shah , P. Vijay Kumar

The amount of digital data is rapidly growing. There is an increasing use of a wide range of computer systems, from mobile devices to large-scale data centers, and important for reliable operation of all computer systems is mitigating the…

Information Theory · Computer Science 2018-03-06 Katina Kralevska

Data availability is critical in distributed storage systems, especially when node failures are prevalent in real life. A key requirement is to minimize the amount of data transferred among nodes when recovering the lost or unavailable data…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-06-07 Runhui Li , Jian Lin , Patrick P. C. Lee

The explosion of the amount of data stored in cloud systems calls for more efficient paradigms for redundancy. While replication is widely used to ensure data availability, erasure correcting codes provide a much better trade-off between…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-03-16 Steve Jiekak , Anne-Marie Kermarrec , Nicolas Le Scouarnec , Gilles Straub , Alexandre Van Kempen

Recent advances in wireless sensor networks (WSNs) have led to many new promissing applications. However data communication between nodes consumes a large portion of the total energy of WSNs. Consequently efficient data aggregation…

Distributed, Parallel, and Cluster Computing · Computer Science 2010-10-06 Punit Sharma , Partha Sarathi Mandal

Distributed storage systems introduce redundancy to protect data from node failures. After a storage node fails, the lost data should be regenerated at a replacement storage node as soon as possible to maintain the same level of redundancy.…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-06-19 Qingyuan Gong , Jiaqi Wang , Yan Wang , Dongsheng Wei , Jin Wang , Xin Wang

We study the repair problem of distributed storage systems in erasure networks where the packets transmitted from surviving nodes to the new node might be lost. The fundamental storage-bandwidth tradeoff is calculated by multicasting…

Information Theory · Computer Science 2013-01-30 Majid Gerami , Ming Xiao

Scientific computing workflows generate enormous distributed data that is short-lived, yet critical for job completion time. This class of data is called intermediate data. A common way to achieve high data availability is to replicate…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-14 Zhe Zhang , Brian Bockelman , Derek Weitzel , David Swanson

Cloud computing facilitates the access of applications and data from any location by a distributed storage system. Erasure codes offer better data replication technique with reduced storage costs for more reliability. This paper considers…

Information Theory · Computer Science 2021-02-04 Srujan Teja Thomdapu , Ketan Rajawat

Maximum distance separable erasure coding has been introduced in wireless networks based on random medium access protocols in order to recover collided and erased packets. So, this help to avoid retransmission process which weaken the…

Signal Processing · Electrical Eng. & Systems 2020-10-13 Mohamed Lamine Boucenna , Malek Benslama

Erasure coding is widely used for massive storage in data centers to achieve high fault tolerance and low storage redundancy. Since the cross-rack communication cost is often high, it is critical to design erasure codes that minimize the…

Information Theory · Computer Science 2019-02-26 Hanxu Hou , Patrick P. C. Lee , Kenneth W. Shum , Yuchong Hu
‹ Prev 1 2 3 10 Next ›