Gossip Algorithm Implementation for Network Protocol

Gossip Algorithm is an algorithm which regulates the data exchange process between interconnected nodes. All of the nodes are configured to run the active and passive thread, and there is no node acting as a client or server. The active thread is initiated by choosing an IP address randomly. A node with the chosen IP address will be engaged to conduct the data exchange process. Whereas, the passive thread will wait until there is an invitation from another node to carry out the data exchange process. This work implements the Gossip algorithm into hardware such as Raspberry Pi which represents nodes. The connection between the nodes which exchange data can be represented in a form of graph. When there is a turned-off node, the other node connected to it can automatically detect the turn off and find a substitute node for the data exchange process. The same thing happens when there is a node which has just been active, the node will automatically find another node randomly to do the data exchange process. The result of the implementation of gossip algorithm is shown by a graph presenting that all of the nodes are interconnected to one another and the data contained in every node has the same value. The possibility of the formation of two separated graph can be overcome by adding more protection on the process of neighbor-election.