Gossip-Based Algorithms

1186 WordsJan 28, 20185 Pages
1. INTRODUCTION Gossip-based algorithm plays a major part for distributing simple and efficient information in large networks. One of the examples of gossip-based algorithm is rumor –spreading model. It is also called as rumor mongering. It is introduced by Daley & Kendall (D K model) in the context of duplicated databases. The rumor spreading algorithm is an example of epidemic process. It is mainly used to examine in the view of mathematics. The algorithm follows synchronous rounds. The main aim of rumor spreading is to spread a rumor to all nodes in a social network in small no of rounds. At the beginning of the round, the information is sent to initial node known as start node. Then the information is sent to all nodes. The node having information will not accept to receive the information again. While executing the algorithm the graph and degree of nodes must be constant. In case of dynamic networks, an evolving graph is introduced to study the behavior of graph and nodes. Fig. 1 Graph connected with rumors 1.1. Problem statement: To begin with the rumor spreading algorithm mainly concentrates the broadcasting of message that is the information should reach all nodes of a graph. Secondly it concerns about the completion time i.e., within how many rounds the information is reached to all nodes. From the above research the problem can be stated as :each node transfers the rumor what has but in cases the node might not be knowing what information that the neighbour
Open Document