NK

Author Archives: NK

Gossip Protocol Explained

You can subscribe to the system design newsletter to excel in system design interviews and software architectureThe original article was published on systemdesign.one website.



What Is Gossip Protocol?

The typical problems in a distributed system are the following [1], [11]:

  • maintaining the system state (liveness of nodes)
  • communication between nodes

The potential solutions to these problems are as follows [1]:

  • centralized state management service
  • peer-to-peer state management service

Consistent hashing algorithm

 

This is a guest article by NK. You can view the original article Consistent hashing explained on systemdesign.one website.

At a high level, consistent hashing performs the following operations:

  1. The output of the hash function is placed on a virtual ring structure (known as the hash ring)
  2. The hashed IP addresses of the nodes are used to assign a position for the nodes on the hash ring
  3. The key of a data object is hashed using the same hash function to find the position of the key on the hash ring
  4. The hash ring is traversed in the clockwise direction starting from the position of the key until a node is found
  5. The data object is stored or retrieved from the node that was found