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 negatively impacts storage performance, particularly for distributed storage systems that are geographically dispersed over a wide area network (WAN). This paper presents a performance study of our new data replication methodology that minimizes network traffic for data replications. The idea is to replicate the parity of a data block upon each write operation instead of the data block itself. The data block will be recomputed back at the replica storage site upon receiving the parity. We name the new methodology PRINS (Parity Replication in IP-Network Storages). PRINS trades off highspeed computation for communication that is costly and more likely to be the performance bottleneck for distributed storages. By leveraging the parity computation that exists in common storage systems (RAID), our PRINS does not introduce...

• Type: Conference
• Year: 2006
• Where: ICDCS
• Authors: Qing Yang, Weijun Xiao, Jin Ren
• Keywords: Data Block, Distributed And Parallel Computing, ICDCS 2006, Network Traffic, Storage Systems