Sciweavers

Share
TJS
2008

Insight into redundancy schemes in DHTs

8 years 6 months ago
Insight into redundancy schemes in DHTs
In order to provide high data availability in peer-to-peer (P2P) DHTs, proper data redundancy schemes are required. This paper compares two popular schemes: replication and erasure coding. Unlike previous comparison, we take user download behavior into account. Furthermore, we propose a hybrid redundancy scheme, which shares user downloaded files for subsequent accesses and utilizes erasure coding to adjust file availability. Comparison experiments of three schemes show that replication saves more bandwidth than erasure coding, although it requires more storage space, when average node availability is higher than 47%; moreover, our hybrid scheme saves more maintenance bandwidth with acceptable redundancy factor. Keywords Peer-to-peer
Guihai Chen, Tongqing Qiu, Fan Wu
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TJS
Authors Guihai Chen, Tongqing Qiu, Fan Wu
Comments (0)
books