Year: 2003
Type: dissertation
Abstract: This thesis presents a new design and implementation of the DHash distributed hash table based on erasure encoding. This design is both more robust and more efficient than the previous replication-based implementation [15]. DHash uses erasure coding to store each block as a set of fragments. Erasure coding increases availability while saving storage and communication costs compared to a replication based design. DHash combines Chord’s synthetic coordinates with the the set of fragments to implement server selection on block retrieval. DHash enhances robustness by implementing efficient fragment maintenance protocols. These protocols restore missing or misplaced fragments caused by hosts joining and leaving the system.
Author: Josh Cates
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2225692292