High Availability in DHTs: Erasure Coding vs. Replication

  • Rodrigo Rodrigues
  • Barbara Liskov
Conference paper

DOI: 10.1007/11558989_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3640)
Cite this paper as:
Rodrigues R., Liskov B. (2005) High Availability in DHTs: Erasure Coding vs. Replication. In: Castro M., van Renesse R. (eds) Peer-to-Peer Systems IV. IPTPS 2005. Lecture Notes in Computer Science, vol 3640. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Rodrigo Rodrigues
    • 1
  • Barbara Liskov
    • 2
  1. 1.INESC-ID / Instituto Superior TécnicoLisbonPortugal
  2. 2.MIT Computer Science and Artificial Intelligence LaboratoryCambridgeUSA

Personalised recommendations