Results 231 to 240 of about 1,793 (257)
Some of the next articles are maybe not open access.
Understand how to make wireless communication networks, digital storage systems and computer networks robust and reliable in the first unified, comprehensive treatment of erasure correcting codes. Data loss is unavoidable in modern computer networks; as such, data recovery can be crucial and these codes can play a central role.
Enrico Paolini +3 more
openaire +1 more source
Enrico Paolini +3 more
openaire +1 more source
HoVer Erasure Codes For Disk Arrays
International Conference on Dependable Systems and Networks (DSN'06), 2006We present a new family of XOR-based erasure codes primarily targeted for use in disk arrays. These codes have a unique data/parity layout, with both horizontal and vertical parity arrangements giving rise to the name HoVer codes. We give constructions that tolerate up to four disk failures.
openaire +1 more source
Erasure Coding in Object Stores
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018Recent years have seen a tremendous growth in the popularity of online services accessed over the Internet. Our daily lives are becoming more and more dependent on these online services, which generate and/or rely on huge amount of data. One core technique to deal with the unprecedented amount of data is the distributed storage systems that allow users/
openaire +2 more sources
2019
IPFS (Interplanetary File System) is a peer to peer method of storing content addressable data in distributed file system. To provide Fault Tolerance to important files, IPFS copies them on at least 3 nodes in different geographical areas. To store a file safely, IPFS consumes at least 3X more space. This is inefficient and can be reduced significantly
openaire +1 more source
IPFS (Interplanetary File System) is a peer to peer method of storing content addressable data in distributed file system. To provide Fault Tolerance to important files, IPFS copies them on at least 3 nodes in different geographical areas. To store a file safely, IPFS consumes at least 3X more space. This is inefficient and can be reduced significantly
openaire +1 more source
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory, 2002T J Richardson, R L Urbanke
exaly
Efficient multicast stream authentication using erasure codes
ACM Transactions on Information and System Security, 2003Howard Siegel, Edwin K P Chong
exaly
Design of LT Codes with Equal and Unequal Erasure Protection over Binary Erasure Channels
IEEE Communications Letters, 2013Lars Kildehøj, Ming Xiao
exaly
Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and Optimality
IEEE Journal on Selected Areas in Communications, 2011Ashish Khisti, Ahmed Badr
exaly
On endurance and performance of erasure codes in SSD-based storage systems
Microelectronics Reliability, 2015Saeideh Alinezhad Chamazcoti +2 more
exaly