This Is AuburnElectronic Theses and Dissertations

Show simple item record

Heuristics in Distributing Data and Parity with Distributed Hash Tables


Metadata FieldValueLanguage
dc.contributor.advisorQin, Xiao
dc.contributor.authorEarp, Damon
dc.date.accessioned2021-11-30T20:07:19Z
dc.date.available2021-11-30T20:07:19Z
dc.date.issued2021-11-30
dc.identifier.urihttps://etd.auburn.edu//handle/10415/8001
dc.description.abstractWe compare multiple methods of distributing data and error correcting code across distributed hash tables. We focus on the scaling of distributed hash tables and at which methods moved the least amount of data while maintaining an even distribution. A common technique is to use erasure coding and storing pieces of files on separate hardware. This approach makes placement of pieces dependent on earlier placements. We identify several rules that when applied to standard methods reduces the amount of data moved while scaling dramatically. Even though CRUSH [28] includes these heuristics we found that tweaking its approach allowed it to migrate less data when changing the cluster layout.en_US
dc.subjectComputer Science and Software Engineeringen_US
dc.titleHeuristics in Distributing Data and Parity with Distributed Hash Tablesen_US
dc.typeMaster's Thesisen_US
dc.embargo.statusNOT_EMBARGOEDen_US
dc.embargo.enddate2021-11-30en_US

Files in this item

Show simple item record