Open AccessAnalysing the efficiency and robustness of gossip in different propagation processes with simulations
Author(s) -
Ruiqi Yang
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1486/3/032001
Subject(s) - gossip , robustness (evolution) , computer science , information transmission , flooding (psychology) , information loss , transmission (telecommunications) , distributed computing , gossip protocol , computer network , algorithm , telecommunications , artificial intelligence , psychology , social psychology , biochemistry , chemistry , psychotherapist , gene
This paper uses the probability theory to analyse the ultimate consistency of the gossip protocol propagation process by dividing it into two phases. The time complexity and information complexity of the flooding, tree and gossip methods are compared by simulation with different variants. Also, three ways of communication between nodes in the network are introduced: only-push, only-pull, and push-and-pull. The paper analysed the simulated results of variable nodes using those three ways and discussed their corresponding time and information complexity. The simulations and analysis compared performances of information transmission under different transmission loss rates and concluded that the push-and-pull has an effect on transmission structure robustness. Finally, an effective method of information transmission was proposed to deal with transmission loss.