Sciweavers

MOBIHOC
2010
ACM
13 years 8 months ago
Data preservation under spatial failures in sensor networks
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
Navid Hamed Azimi, Himanshu Gupta, Xiaoxiao Hou, J...
GLOBECOM
2010
IEEE
13 years 9 months ago
Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and Optimality
Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper intro...
Ahmed Badr, Ashish Khisti, Emin Martinian
CORR
2006
Springer
142views Education» more  CORR 2006»
13 years 11 months ago
Decentralized Erasure Codes for Distributed Networked Storage
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 wit...
Alexandros G. Dimakis, Vinod M. Prabhakaran, Kanna...
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 11 months ago
On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage
The high repair cost of (n, k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off stor...
Changho Suh, Kannan Ramchandran
DSN
2008
IEEE
14 years 20 days ago
Reliability of flat XOR-based erasure codes on heterogeneous devices
XOR-based erasure codes are a computationallyefficient means of generating redundancy in storage systems. Some such erasure codes provide irregular fault tolerance: some subsets o...
Kevin M. Greenan, Ethan L. Miller, Jay J. Wylie
CCGRID
2004
IEEE
14 years 2 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
DSN
2009
IEEE
14 years 2 months ago
An efficient XOR-scheduling algorithm for erasure codes encoding
In large storage systems, it is crucial to protect data from loss due to failures. Erasure codes lay the foundation of this protection, enabling systems to reconstruct lost data w...
Jianqiang Luo, Lihao Xu, James S. Plank
DSN
2007
IEEE
14 years 2 months ago
Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
Jay J. Wylie, Ram Swaminathan
SIGCOMM
1998
ACM
14 years 3 months ago
A Digital Fountain Approach to Reliable Distribution of Bulk Data
—The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the design of new multicast and broadcast protocols. ...
John W. Byers, Michael Luby, Michael Mitzenmacher,...
AC
2003
Springer
14 years 4 months ago
Replication Strategies for Highly Available Peer-to-Peer Storage
We are investigating strategies for using replication to design and implement highly reliable peer-to-peer systems. In particular, we are comparing the use of whole object and blo...
Ranjita Bhagwan, David Moore, Stefan Savage, Geoff...