Gossip Protocol Introduction - HTML
Gossip Protocol Introduction - HTML
Home
A and B update their data set by merging it with the received data
Yes, it's all about that. The coreofthe protocol is really simple.
If we start with a single node having a specic data item, it will rst
gossip with another node. Then periodically each node will gossip that
data with one more node creating a doubling eect which will cause the
data to be distributed throughout the system fairly quickly.
Gossip protocols also cope very well with node churning. i.e. In rapidly
changing networks, when continuous node arrival and departure occurs
and even when nodes crash abruptly, gossip protocols perform well due
to the randomized and periodic information exchange. Loss of messages
will also be tolerated due to the fact that copies of same data item will be
received from multiple nodes. Also none of the nodes have specic roles
assigned to them. So a failed node will not prevent other nodes from
continuing sending messages and hence there will be no single point of
failure and there is no need for failure detection or specic recovery
actions.
References:
Add comment
Home
View web version
About Me
Mohamed Nufail
Graduate of Department of Computer Science and Engineering,
University of Moratuwa, Sri Lanka
View my complete prole
Powered by Blogger.