P2P Graph Simulator - Part 3 - Ring Network

I’ve added the Ring Network protocol described in this paper¹ to the P2P graph simulator. I’ve also set a limit on the number of neigbours purely because the ring becomes really hard to visualize when there are a lot of neighbours. The neighbour limit can be set by clicking the buttons numbered from 1 to 4 on the top left.

The result of limiting the neighbour count to 1:

The result of limiting the neighbour count to 2:

The result of limiting the neighbour count to 3:

The result of limiting the neighbour count to 4:

I’ve also added a tool to connect two separate networks.

You can see the code in its public repo or try the simulator on its page (hosted by GitHub Pages).

What I’m planning on doing next is adding more protocols (maybe Chord) and a counter to see how many messages were sent in average by each node.

1. (A. Shaker and D. S. Reeves, “Self-stabilizing structured ring topology P2P systems,” Fifth IEEE International Conference on Peer-to-Peer Computing (P2P’05), 2005) ↩