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 systems. Furthermore, we propose a hybrid redundancy scheme of replication and erasure coding. Experiment results show that replication scheme saves more bandwidth than erasure coding scheme, although it requires more storage space, when average node availability is higher than 48%. Our hybrid scheme saves more maintenance bandwidth with acceptable redundancy factor.

• Type: Conference
• Year: 2005
• Where: ISPA
• Authors: Fan Wu, Tongqing Qiu, YueQuan Chen, Guihai Chen
• Keywords: Erasure Coding, Hybrid Redundancy Scheme, ISPA 2005, Redundancy Scheme