FAULT TOLERANT AND SCALABLE LOAD DISTRIBUTION OF RESOURCES

• US 20110153826A1
• Filed: 12/22/2009
• Published: 06/23/2011
• Est. Priority Date: 12/22/2009
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: NARAYANAN, SANKARAN, ANANTHANARAYANAN, KRISHNAN, COX, SHAUN D., EYDELMAN, VADIM
• Application Number:
  US12/644,620
• Publication Number:
  US 20110153826A1
• Time in Patent Office: Days
• US Class Current: 709/226
• CPC Class Codes: G06F 11/0709 in a distributed system consisting of a plurality of standalone computer nodes, e.g. clusters, client-server systems
• CPC Class Codes: G06F 11/0757 by exceeding a time limit, i.e. time-out, e.g. watchdogs
• CPC Class Codes: G06F 11/1438 Restarting or rejuvenating
• CPC Class Codes: G06F 11/1482 by means of middleware or OS functionality
• CPC Class Codes: G06F 11/202 where processing functionality is redundant redundant communication control functionality G06F11/2005, redundant storage control functionality G06F11/2089
• CPC Class Codes: G06F 9/5077 Logical partitioning of resources; Management or configuration of virtualized resources specific details on emulation or internal functioning of virtual machines G06F9/455
• CPC Class Codes: G06F 9/5083 Techniques for rebalancing the load in a distributed system

Abstract

A resource is located on a server using a distributed resource algorithm that is executing on each server within a cluster of servers. A request for a resource is received at a server in the cluster. The server executes the distributed resource algorithm to determine the server that owns the requested resource. The distributed resource algorithm automatically adapts itself to servers being added or removed within the cluster and is directed at evenly distributing resources across the available servers within the cluster.

Claims

1. A method for determining a server from a cluster of servers to handle a resource request, comprising:

receiving a request for a resource on a server within the cluster of servers;

executing a distributed algorithm on the server receiving the request for the resource to determine a server that handles the resource;

wherein the distributed algorithm is also performed on each of the other servers within the cluster when one of the other servers receives the request for the resource;

wherein the distributed algorithm uses a list of logical servers and a mapping of the logical servers to the servers within the cluster that are active;

forwarding the request to the determined server when the resource is not handled by the server; and

responding to the request for the resource when the server receiving the request handles the resource.

2. The method of claim 1, further comprising assigning a resource to a list of logical servers that indicates a preferred server for handling the resource and when the preferred server is not available another predetermined logical server handling the resource.

3. The method of claim 1, wherein a number of logical servers within the cluster is a fixed number and wherein a number of the servers within the cluster is equal to or less than the number of logical servers.

4. The method of claim 1, wherein the mapping of the logical servers to the servers within the cluster is updated periodically.

5. The method of claim 1, wherein each of the servers periodically exchange health information with each other.

6. The method of claim 4, wherein the mapping is updated based on a health of the servers within the cluster.

7. The method of claim 1, further comprising determining when a server is added to the cluster and in response to the server being added, each server within the cluster re-evaluating its assigned resources.

8. The method of claim 1, further comprising determining when a server is removed from the cluster and in response to the server being removed, assigning the resources that are assigned to the removed server to other servers within the cluster based on the list of logical servers.

9. The method of claim 1, wherein the resources are uniformly distributed to the servers using a distributed hash table.

10. A non-transitory computer-readable storage medium having computer-executable instructions for determining a server from a cluster of servers to handle a resource request, comprising:

receiving at a server within the cluster a request for a resource;

on the server, executing a distributed algorithm to determine a server that handles the resource;

wherein the distributed algorithm is also performed on each of the other servers within the cluster in response to another request for the resource;

wherein the distributed algorithm uses a unique identifier that is associated with the resource, a list of logical servers and a mapping of the logical servers to the servers within the cluster that are active;

wherein the resource is assigned a sequence indicating a priority among the servers within the cluster to handle the request;

forwarding the request to the determined server when the resource is not handled by the server; and

responding to the request for the resource when the server receiving the request owns the resource.

11. The computer-readable storage medium of claim 10, wherein a number of logical servers within the cluster is a fixed number and wherein a number of the servers within the cluster is equal to or less than the number of logical servers during a runtime operation and wherein the mapping of the logical servers to the servers within the cluster is updated periodically during the runtime.

12. The computer-readable storage medium of claim 10, wherein each of the servers periodically exchange health information with each other to determine when a server is removed from the cluster and when a server is added to the cluster.

13. The computer-readable storage medium of claim 12, in response to the server being added and the server being removed, each server within the cluster re-evaluating and re-balancing its assigned resources with the other servers within the cluster.

14. The computer-readable storage medium of claim 10, wherein the resources are uniformly distributed to the servers within the cluster using a distributed hash function.

15. The computer-readable storage medium of claim 10, wherein the resources handled by the servers are users within a VoIP communication system.

16. A system for determining a server from a cluster of servers to handle a resource request, comprising:

a network connection that is configured to connect to the IP network;

a processor and a computer-readable medium;

an operating environment stored on the computer-readable medium and executing on the processor; and

a resource manager operating under the control of the operating environment and operative to;

receive a request for a resource;

execute a distributed algorithm to determine the server within the cluster that handles the resource;

wherein the distributed algorithm is also performed on each of the other servers within the cluster in response to another request for the resource;

wherein the distributed algorithm uses a unique identifier that is associated with the resource, a list of logical servers and a mapping of the logical servers to the servers within the cluster that are active;

wherein the resource is assigned a sequence indicating a priority among the servers within the cluster to handle the request;

forward the request to the determined server when the resource is not handled by the server receiving the request; and

respond to the request for the resource when the server receiving the request owns the resource.

17. The system of claim 16, wherein a number of logical servers within the cluster is a fixed number that does not change during a runtime and wherein a number of the servers within the cluster is equal to or less than the number of logical servers during the runtime and wherein the mapping of the logical servers to the servers within the cluster is updated periodically during the runtime.

18. The system of claim 16, wherein the resource manager further comprises periodically exchanging health information with the servers within the cluster to determine when a server is removed from the cluster and when a server is added to the cluster.

19. The system of claim 16, in response to a server being added and the server being removed, each server within the cluster re-evaluating and re-balancing its assigned resources with the other servers within the cluster.

20. The system of claim 16, wherein the resources are uniformly distributed to the servers within the cluster using a hash function.