Load balancing and fault tolerant service in a distributed data system

Patent metadata

Field	Value
Publication number	US-11681566-B2
Application number	US-202117391122-A
Country	US
Kind code	B2
Filing date	Aug 2, 2021
Priority date	Feb 12, 2015
Publication date	Jun 20, 2023
Grant date	Jun 20, 2023

Abstract

Techniques for load balancing and fault tolerant service are described. An apparatus may comprise load balancing and fault tolerant component operative to execute a load balancing and fault tolerant service in a distributed data system. The load balancing and fault tolerant service distributes a load of a task to a first node in a cluster of nodes using a routing table. The load balancing and fault tolerant service stores information to indicate the first node from the cluster of nodes is assigned to perform the task. The load balancing and fault tolerant service detects a failure condition for the first node. The load balancing and fault tolerant service moves the task to a second node from the cluster of nodes to perform the task for the first node upon occurrence of the failure condition.

First claim

The invention claimed is:

1. A method, comprising:
determining performance states of nodes within a cluster;
identifying healthy nodes having a healthy state and unhealthy nodes having an unhealthy state based upon the performance states;
generating a list of new nodes to add to the cluster; and
redistributing relationships of the unhealthy nodes to other nodes within the cluster, wherein the other nodes include at least one node selected from the list of new nodes.

2. The method of claim 1 , comprising:
utilizing a replicated database (RDB) ring of a current user space process to detect the unhealthy nodes.

3. The method of claim 1 , comprising:
reassigning the relationships to the nodes within the list of new nodes.

4. The method of claim 1 , comprising:
adding a node on the list of new nodes to the cluster.

5. The method of claim 4 , comprising:
determining whether the node added to the cluster is a most recent node responsible for a relationship.

6. The method of claim 1 , comprising:
reassigning idle relationships to the nodes within the list of new nodes.

7. The method of claim 1 , comprising:
restarting a task performed by a node within the cluster based upon occurrence of a failure condition of the node.

8. The method of claim 1 , comprising:
adding nodes on the list of new nodes to the cluster.

9. A computing device, comprising:
a memory comprising instructions; and
a processor coupled with the memory, the processor configured to execute the instructions to cause the processor to:
determine performance states of nodes within a cluster;
identify healthy nodes having a healthy state and unhealthy nodes having an unhealthy state based upon the performance states;
generate a list of new nodes to add to the cluster; and
redistribute relationships of the unhealthy nodes to other nodes within the cluster, wherein the other nodes include at least one node selected from the list of new nodes.

10. The computing device of claim 9 , the instructions to cause the processor to:
utilize a replicated database (RDB) ring of a current user space process to detect the unhealthy nodes.

11. The computing device of claim 9 , the instructions to cause the processor to:
reassign the relationships to the nodes within the list of new nodes.

12. The computing device of claim 9 , the instructions to cause the processor to:
add a node on the list of new nodes to the cluster.

13. The computing device of claim 12 , the instructions to cause the processor to:
determine whether the node added to the cluster is a most recent node responsible for a relationship.

14. The computing device of claim 9 , the instructions to cause the processor to:
reassign idle relationships to the nodes within the list of new nodes.

15. The computing device of claim 9 , the instructions to cause the processor to:
restart a task performed by a node within the cluster based upon occurrence of a failure condition of the node.

16. The computing device of claim 9 , the instructions to cause the processor to:
add nodes on the list of new nodes to the cluster.

17. A non-transitory computer-readable storage medium comprising instructions that, when executed by a processor, cause the processor to:
determine performance states of nodes within a cluster;
identify healthy nodes having a healthy state and unhealthy nodes having an unhealthy state based upon the performance states;
generate a list of new nodes to add to the cluster; and
redistribute relationships of the unhealthy nodes to other nodes within the cluster, wherein the other nodes include at least one node selected from the list of new nodes.

18. The non-transitory computer-readable storage medium of claim 17 , the instructions to cause the processor to:
utilize a replicated database (RDB) ring of a current user space process to detect the unhealthy nodes.

19. The non-transitory computer-readable storage medium of claim 17 , the instructions to cause the processor to:
reassign the relationships to the nodes within the list of new nodes.

20. The non-transitory computer-readable storage medium of claim 17 , the instructions to cause the processor to:
add a node on the list of new nodes to the cluster.

Assignees

• Netapp Inc

Inventors

• Karnawat Rakshit
• Ts Veena
• Marappa Ganesh

Classifications

• G06F11/2035

  without idle spare hardware · CPC title

• G06F11/1425

  by reconfiguration of node membership · CPC title

• G06F11/1484

  involving virtual machines · CPC title

• G06F11/3433

  for load management (allocation of a server based on load conditions G06F9/505; load rebalancing G06F9/5083; redistributing the load in a network by a load balancer H04L67/1029) · CPC title

• G06F2201/805

  Real-time · CPC title