Efficient Updates in Highly Available Distributed Random Access Memory
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Redundancy and distributed caching in mobile DTNs
Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture
Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Decentralized coding algorithms for distributed storage in wireless sensor networks
IEEE Journal on Selected Areas in Communications
Maintaining and checking parity in highly available Scalable Distributed Data Structures
Journal of Systems and Software
Robust Redundancy Scheme for the Repair Process: Hierarchical Codes in the Bandwidth-Limited Systems
Journal of Grid Computing
Hi-index | 0.00 |
In this paper, we describe the design of a highlyavailable Grid data storage system. Increased availability is ensured by data redundancy and file striping. Redundant data is computed using Reed-Solomon (RS) codes. The level of availability can be chosen for each individual file. Storage overhead is minimal compared to traditional redundancy strategies based on complete replication. Our prototype uses existing Grid data management tools (GridFTP) for communication, and the RS encoding and decoding is embedded in the client software. Performance measurements in wide area network prove the efficiency of our design for high-availability and striped file transfers.