Sciweavers

52 search results - page 6 / 11
» Heterogeneity-Aware Erasure Codes for Peer-to-Peer Storage S...
Sort
View
ISPA
2005
Springer
14 years 1 months ago
Redundancy Schemes for High Availability in DHTs
High availability in peer-to-peer DHTs requires data redundancy. This paper takes user download behavior into account to evaluate redundancy schemes in data storage and share syste...
Fan Wu, Tongqing Qiu, YueQuan Chen, Guihai Chen
MOBIHOC
2010
ACM
13 years 5 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...
INFOCOM
2007
IEEE
14 years 1 months ago
Network Coding for Distributed Storage Systems
—Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-pee...
Alexandros G. Dimakis, Brighten Godfrey, Martin J....
GLOBECOM
2010
IEEE
13 years 5 months ago
Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy
Distributed and peer-to-peer storage systems are foreseen as an alternative to the traditional data centers and in-house backup solutions. In the past few years many peerto-peer st...
Frédéric Giroire, Julian Monteiro, S...
PDPTA
2004
13 years 9 months ago
Verification of Parity Data in Large Scale Storage Systems
Highly available storage uses replication and other redundant storage to recover from a component failure. If parity data calculated from an erasure correcting code is not updated...
Thomas J. E. Schwarz