Authors
Lluis Pamies-Juarez, Pedro Garcia-Lopez, Marc Sanchez-Artigas
Publication date
2009/9/22
Conference
Parallel Processing, 2009. ICPP’09. International Conference on
Pages
412-419
Publisher
IEEE
Description
Abstract: 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.
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.
38th International Conference on Parallel Processing (ICPP).
Viena.