Sciweavers

175 search results - page 7 / 35
» Decentralized Erasure Codes for Distributed Networked Storag...
Sort
View
ISPA
2005
Springer
15 years 5 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
ANSS
2008
IEEE
15 years 6 months ago
SCAR - Scattering, Concealing and Recovering Data within a DHT
This paper describes a secure and reliable method for storing data in a distributed hash table (DHT) leveraging the inherent properties of the DHT to provide a secure storage subs...
Bryan N. Mills, Taieb Znati
MM
2005
ACM
179views Multimedia» more  MM 2005»
15 years 5 months ago
rStream: resilient peer-to-peer streaming with rateless codes
The inherent instability and unreliability of peer-to-peer networks introduce several fundamental engineering challenges to multimedia streaming over peer-to-peer networks. First,...
Chuan Wu, Baochun Li
ASPLOS
2004
ACM
15 years 5 months ago
D-SPTF: decentralized request distribution in brick-based storage systems
Distributed Shortest-Positioning Time First (D-SPTF) is a request distribution protocol for decentralized systems of storage servers. D-SPTF exploits high-speed interconnects to d...
Christopher R. Lumb, Richard A. Golding
CLOUD
2010
ACM
15 years 4 months ago
RACS: a case for cloud storage diversity
The increasing popularity of cloud storage is leading organizations to consider moving data out of their own data centers and into the cloud. However, success for cloud storage pr...
Hussam Abu-Libdeh, Lonnie Princehouse, Hakim Weath...