Modelling Chord Routing

Opened: Wednesday, 22 March 2017, 12:00 AM
Due: Friday, 21 April 2017, 1:00 AM

Write a JAVA program which takes in input b, the number of bits for the identi ers of a Chord ring, and n, the number of nodes on the ring, and returns the length distribution for routing on that ring by using the Markov chain model presented in the course.

Plot the resulting probability distribution. Compare the formal results with those obtained from a realimplementation of Chord, for this you can download some open source implementation of Chord (for instance look at https://www.p2p.tu-darmstadt.de/research/gtna/ or at http://peersim.sourceforge.net