Till KTH:s startsida Till KTH:s startsida

Ändringar mellan två versioner

Här visas ändringar i "Chordy - a distributed hash table" mellan 2016-08-29 18:57 av Vladimir Vlassov och 2016-10-04 14:13 av Vladimir Vlassov.

Visa < föregående ändring.

Chordy - a distributed hash table

construction.gifIn this homework assignment you are required to implement a distributed hash table following the Chord scheme. In order to understand what you're about to do you should have a basic understanding of Chord and preferably have read the original paper.

The task is to implement the distributed hash table up to the point where you have added the store and done some smaller experiments (section 1 and 2). Write up your results and experience in a report and hand it in at the corresponding reporting seminar.


* Chordy - a distributed hash table
* Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications
Some code that might come in handy when testing the system.


* test.erl
At the corresponding reporting seminar you are required to present and demonstrate results of your homework, discuss your findings and problems (if any) you have faced, pros and cons of your solution, and your suggestions on how it can be improved. Specifically for this homework, be prepared to build a small ring (dht) and discuss how to handle possible failures.