English
Related papers

Related papers: Secure Regenerating Codes for Reducing Storage and…

200 papers

Blockchain technologies are one possible avenue for increasing the resilience of the Smart Grid, by decentralizing the monitoring and control of system-level objectives such as voltage stability protection. They furthermore offer benefits…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-06-29 Kimia Honari , Xiaotian Zhou , Sara Rouhani , Scott Dick , Hao Liang , James Miller Li , James Miller

Blockchain is an incrementally updated ledger maintained by distributed nodes rather than centralized organizations. The current blockchain technology faces scalability issues, which include two aspects: low transaction throughput and high…

Cryptography and Security · Computer Science 2020-11-02 Xiangyu Wang , Ting Yang , Yu Wang

Modern distributed storage systems apply redundancy coding techniques to stored data. One form of redundancy is based on regenerating codes, which can minimize the repair bandwidth, i.e., the amount of data transferred when repairing a…

Information Theory · Computer Science 2013-01-23 Yuchong Hu , Patrick P. C. Lee , Kenneth W. Shum

To recover simultaneous multiple failures in erasure coded storage systems, Patrick Lee et al introduce concurrent repair based minimal storage regenerating codes to reduce repair traffic. The architecture of this approach is simpler and…

Information Theory · Computer Science 2016-04-25 Huayu Zhang , Hui Li , Hanxu Hou , K. W. Shum , ShuoYen Robert Li

Network codes designed specifically for distributed storage systems have the potential to provide dramatically higher storage efficiency for the same availability. One main challenge in the design of such codes is the exact repair problem:…

Information Theory · Computer Science 2011-09-02 Dimitris S. Papailiopoulos , Jianqiang Luo , Alexandros G. Dimakis , Cheng Huang , Jin Li

We consider the problem of designing codes for distributed storage that protect user data against eavesdroppers that can gain access to network links as well as individual nodes. Our goal is to achieve weak security (also known as block…

Information Theory · Computer Science 2017-10-19 Swanand Kadhe , Alex Sprintson

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

Distributed storage systems with replication are well known for storing large amount of data. A large number of replication is done in order to provide reliability. This makes the system expensive. Various methods have been proposed over…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-10-01 Mit Sheth , Krishna Gopal Benerjee , Manish K. Gupta

In modern practical data centers, storage nodes are usually organized into equally sized groups, which is called racks. The cost of cross-rack communication is much more expensive compared with the intra-rack communication cost. The codes…

Information Theory · Computer Science 2019-11-20 Lingfei Jin , Gaojun Luo , Chaoping Xing

High availability of containerized applications requires to perform robust storage of applications' state. Since basic replication techniques are extremely costly at scale, storage space requirements can be reduced by means of erasure or…

Information Theory · Computer Science 2017-11-09 Francesco De Pellegrini , Rachid El Azouzi , Alonso Silva , and Olfa Hassani

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

Classical erasure codes, e.g. Reed-Solomon codes, have been acknowledged as an efficient alternative to plain replication to reduce the storage overhead in reliable distributed storage systems. Yet, such codes experience high overhead…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-06-20 Anne-Marie Kermarrec , Erwan Le Merrer , Gilles Straub , Alexandre van Kempen

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

Regenerating codes are a class of codes for distributed storage networks that provide reliability and availability of data, and also perform efficient node repair. Another important aspect of a distributed storage network is its security.…

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

In a modern distributed storage system, storage nodes are organized in racks, and the cross-rack communication dominates the system bandwidth. In We study the rack-aware storage system where all storage nodes are organized in racks and…

Information Theory · Computer Science 2022-07-18 Liyang Zhou , Zhifang Zhang

Storage scalability is paramount in the era of big data blockchain. A storage-scalable blockchain can effectively scale out state storage to an arbitrary number of nodes and reduce the storage pressure on each, similar to distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-26 Guangda Sun , Jialin Li

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

Regenerating codes are efficient methods for distributed storage in storage networks, where node failures are common. They guarantee low cost data reconstruction and repair through accessing only a predefined number of arbitrarily chosen…

Information Theory · Computer Science 2017-11-09 Kaveh Mahdaviani , Ashish Khisti , Soheil Mohajer

A passive adversary can eavesdrop stored content or downloaded content of some storage nodes, in order to learn illegally about the file stored across a distributed storage system (DSS). Previous work in the literature focuses on code…

Information Theory · Computer Science 2014-02-19 Son Hoang Dau , Wentu Song , Chau Yuen

Distributed storage systems need to store data redundantly in order to provide some fault-tolerance and guarantee system reliability. Different coding techniques have been proposed to provide the required redundancy more efficiently than…

Information Theory · Computer Science 2016-11-15 Lluis Pamies-Juarez , Henk D. L. Hollmann , Frédérique Oggier