Abstract
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 benefits from coding are limited, and may not be worth its disadvantages. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Rodrigues, R., & Liskov, B. (2005). High availability in DHTs: Erasure coding vs. replication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3640 LNCS, pp. 226–239). https://doi.org/10.1007/11558989_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
