Understanding gossip protocols
Flix Lpez Luis offers an introduction to gossip protocols, using a simulator to demonstrate how they behave when there are challenges like network partitions and faulty nodes.
| Talk Title | Understanding gossip protocols |
| Speakers | Félix López Luis (Google) |
| Conference | O’Reilly Velocity Conference |
| Conf Tag | Build systems that drive business |
| Location | London, United Kingdom |
| Date | October 31-November 2, 2018 |
| URL | Talk Page |
| Slides | Talk Slides |
| Video | |
In large distributed systems, knowing the state of the whole system is a difficult task that becomes harder as you increment the number of nodes. There are too many nodes to communicate with, and many algorithms that solve the problem tend to grow linearly with the number of nodes. Since the underlying network is a problem, you can’t rely on hardware solutions, such as multicast, as they wouldn’t be available in the cloud. In addition, maintaining an updated graph of nodes—or even storing the graph itself—is a complex undertaking in large systems. Many distributed systems now rely on gossip protocols—a way of multicasting messages, inspired by epidemics, human gossip, and social networks—to share the state of the system among the nodes, because they avoid these problems. Félix López Luis offers an introduction to gossip protocols, using a simulator to demonstrate how they behave when there are challenges like network partitions and faulty nodes.
