Gossip Protocol

0.0(0)
studied byStudied by 0 people
GameKnowt Play
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/14

flashcard set

Earn XP

Description and Tags

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

15 Terms

1
New cards

What is the Gossip Protocol?

A communication protocol where nodes randomly share information with other nodes, spreading updates like gossip.

2
New cards

Why is it called "Gossip" protocol?

Because the way information spreads mimics how rumors or gossip spreads in social networks.

3
New cards

What is the main use of gossip protocols?

To achieve eventual consistency and failure detection in distributed systems.

4
New cards

How does gossip protocol improve scalability?

Each node communicates with a few peers, reducing overall network traffic and allowing systems to grow.

5
New cards

What are the two common types of gossip messages?

State dissemination and failure detection.

6
New cards

How often do nodes communicate in gossip protocols?

Periodically, based on a configured heartbeat interval.

7
New cards

What is epidemic-style replication?

Spreading updates from node to node in a way similar to the spread of viruses.

8
New cards

What is the advantage of gossip protocols over centralized systems?

No single point of failure and better fault tolerance.

9
New cards

What is fanout in gossip protocols?

The number of peers a node gossips with during each round.

10
New cards

What happens if a node fails in a gossip protocol?

Other nodes eventually detect the failure through indirect gossip.

11
New cards

What is anti-entropy in gossip protocols?

A process to resolve inconsistencies between node states by reconciling data differences.

12
New cards

What is convergence in gossip protocols?

The state where all nodes have consistent and up-to-date information.

13
New cards

Which systems use gossip protocols?

Cassandra, DynamoDB, Consul, and other distributed databases and service discovery tools.

14
New cards

What is the time complexity for information spread in gossip protocols?

O(log N) rounds to reach all nodes, where N is the number of nodes.

15
New cards

Are gossip protocols suitable for real-time consistency?

No, they are designed for eventual consistency, not strong consistency.