Implementasi Algoritma Gosip sebagai Protokol Jaringan

Abstract

Gossip algorithm is an algorithm that manages the process of data exchange among connected nodes. In this algorithm all nodes run an identical function or in other words there is no client/server. The advantage of this algorithm is simple and quick in spreading an information. This algorithm found a lot usability on distributed system. This thesis is about gossip algorithm implementation, where Raspberry Pi is used for node which will run either active thread or passive thread. Active thread is assigned to select the nodes that will be invited to exchange data, while passive thread waits for invitation from neighbor to exchange data. With the connected node it will occur the process of sending and updating data from each node. After all nodes run active thread, it will form a graph showing the connection that occurs between the nodes which exchange data. When there is a node that go off, the node which connected to it will automatically search other nodes to exchange data. Likewise, when a new node is active, the node will automatically search for other nodes to exchange data. All the process for selecting the other nodes to exchange data are randomly generated. The result of gossip algorithm implementation can be represented by a graph which all nodes are connected each other and the data is similar in each node. The possibility of double graph formation can be solved with protection in the selections of neighbor. The communication beetwen nodes run perfectly. When there is a node that go off, nodes which connected with that node is able to choose the other node randomly. Likewise, when there is a new node that active it can be randomly connected with the other node.