Sciweavers

175 search results - page 6 / 35
» Decentralized Erasure Codes for Distributed Networked Storag...
Sort
View
CORR
2010
Springer
72views Education» more  CORR 2010»
14 years 11 months ago
Rebuilding for Array Codes in Distributed Storage Systems
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 repa...
Zhiying Wang, Alexandros G. Dimakis, Jehoshua Bruc...
CCGRID
2004
IEEE
15 years 3 months ago
Data durability in peer to peer storage systems
In this paper we present a quantitative study of data survival in peer to peer storage systems. We first recall two main redundancy mechanisms: replication and erasure codes, whic...
G. Utard, Antoine Vernois
SAC
2010
ACM
15 years 6 months ago
Infrastructureless storage in dynamic environments
This paper studies the use of highly dynamic networks as infrastructures for persistent storage of data that offer services at specific geographical zones in a decentralized and...
Jose Luis Fernandez-Marquez, Josep Lluís Ar...
INFOCOM
2003
IEEE
15 years 5 months ago
A Multicast Transmission Schedule for Scalable Multi-Rate Distribution of Bulk Data Using Non-Scalable Erasure-Correcting Codes
–This paper addresses the efficient multicast dissemination of bulk data from a single server to numerous clients. The challenge is complex: a client may commence reception at ar...
Yitzhak Birk, Diego Crupnicoff
ICDCS
2006
IEEE
15 years 5 months ago
PRINS: Optimizing Performance of Reliable Internet Storages
Distributed storage systems employ replicas or erasure code to ensure high reliability and availability of data. Such replicas create great amount of network traffic that negative...
Qing Yang, Weijun Xiao, Jin Ren