2009 International Conference on Parallel Processing (2009)
Sept. 22, 2009 to Sept. 25, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPP.2009.15
Peer-to-peer (P2P) storage systems rely on data redundancy to obtain high levels of data availability. Among the existing data redundancy schemes, erasure coding is a widely adopted scheme in existing P2P storage systems. By properly tunning its parameters, erasure codes can minimize the required data redundancy, which reduces both the storage and the network overheads. However, to perform this optimization, storage systems need to measured the obtained data availability. Existing P2P storage systems assume homogeneous node availabilities in order to simplify this measurement. As we will prove, this assumption entails efficiency losses when real node availabilities are highly heterogeneous. In this work, we analyze how erasure codes can be optimized in an availability-aware fashion. We propose an analytical framework able to measure data availability more precisely than existing works. As a result, we can optimize the erasure code deployment while reducing its associated overheads. Our experiments show how by considering real node availabilities it is possible to reduce data redundancy about 50% and up to 80% in some specific scenarios.
erasure codes, peer-to-peer, availability, storage, backup
L. Pamies-Juarez, P. García-López and M. Sánchez-Artigas, "Heterogeneity-Aware Erasure Codes for Peer-to-Peer Storage Systems," 2009 International Conference on Parallel Processing(ICPP), Vienna, Austria, 2009, pp. 412-419.