Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

IPTPS
2005
Springer

favoriteEmaildiscussreport

181views Computer Networks» more IPTPS 2005»

High Availability in DHTs: Erasure Coding vs. Replication

13 years 10 months ago

High Availability in DHTs: Erasure Coding vs. Replication

Download iptps05.cs.cornell.edu

High availability in peer-to-peer DHTs requires data redundancy. This paper compares two popular redundancy schemes: replication and erasure coding. Unlike previous comparisons, we take the characteristics of the nodes that comprise the overlay into account, and conclude that in some cases the beneﬁts from coding are limited, and may not be worth its disadvantages.

Rodrigo Rodrigues, Barbara Liskov

Real-time Traffic

Computer Networks | DHTs Requires Data | Erasure Coding | IPTPS 2005 | Popular Redundancy Schemes |

claim paper

Related Content

» Redundancy Schemes for High Availability in DHTs

» Insight into redundancy schemes in DHTs

» Replication Strategies for Highly Available PeertoPeer Storage

» Autonomous Replication for High Availability in Unstructured P2P Systems

» Hybrid Approaches for Distributed Storage Systems

» Improving Availability of P2P Storage Systems

» Data durability in peer to peer storage systems

» Verification of Parity Data in Large Scale Storage Systems

» A Hierarchical TwoTier Information Management Architecture for Mobile AdHoc Grid Environme...

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	IPTPS
Authors	Rodrigo Rodrigues, Barbara Liskov

Comments (0)