Resource affinity in a dynamic resource pool

• US 10,097,628 B2
• Filed: 01/29/2014
• Issued: 10/09/2018
• Est. Priority Date: 01/29/2014
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Inventors: Xu, Qi, Shipp, Neil L.
• Primary Examiner(s): Zele, Krista M
• Assistant Examiner(s): SOWA, TIMOTHY JOHN
• Application Number:
  US14/167,283
• Publication Number:
  US 20150215229A1
• Time in Patent Office: 1,714 Days
• Field of Search: 709226
• CPC Class Codes: G06F 16/00 Information retrieval; Database structures therefor; File system structures therefor
• CPC Class Codes: H04L 67/1027 Persistence of sessions during load balancing
• CPC Class Codes: H04L 67/1031 Controlling of the operation of servers by a load balancer, e.g. adding or removing servers that serve requests

Abstract

Techniques disclosed herein describe methods for achieving resource affinity and scalability in dynamic environments by calculating the modulus of a numeric request identifier against a fixed selection of numbers. Using the proposed techniques yields a numeric request identifier and resource identifier combination that ensures a given resource possesses the unique state applicable to that user'"'"'s request. Using a fixed selection of numbers thus maintains resource affinity while achieving scalability as resources are added to or subtracted from a pool of resources.

Claims

1. A method of facilitating resource affinity in a dynamic resource pool, the method comprising:

receiving a request for access to content, the content being stored in a distributed or cloud computing environment on an associated server resource of a changing group of server resources, the changing of the changing group of server resources occurring through adding or removing one or more server resources to or from the changing group;

mapping the request to the associated server resource, wherein the mapping comprises;

calculating a modulus on a request identifier with at least a first number in a predefined list of numbers to generate a resource identifier identifying the associated server resource, wherein each modulus result is a resource identifier that identifies possible server resources in the changing group, wherein at least one of the possible server resources is possible to be the associated server resource; and

communicating with the associated server resource corresponding to the resource identifier.

2. The method of claim 1, further comprising performing a hash function of a request key to generate the request identifier.

3. The method of claim 2, wherein the wherein the request key comprises a string.

4. The method of claim 1, wherein the largest number in the predefined list is selected to be equal to or greater than an expected maximum number of server resources in the changing group of server resources.

5. The method of claim 1, wherein when calculating the modulus of the request identifier with at least the first number in the predefined list of numbers, the predefined list of numbers is traversed sequentially until a resource identifier to a valid available associated server resource is achieved.

6. The method of claim 5, wherein a next number in the predefined list is not used until a current number does not return the resource identifier to the valid available associated server resource.

7. The method of claim 1, further comprising maintaining a resource list;

and determining a status of a particular server resource of the changing group of server resources by reviewing the resource list based on the resource identifier before communicating with the associated server resource.

8. The method of claim 1, further comprising:

communicating with the associated server resource identified by the resource identifier to determine its availability; and

in response to receiving a status of available, communicating the request to the associated server resource;

in response to receiving a status of not available, communicating with a next associated server resource identified by another resource identifier generated by calculating the modulus on the request identifier with a next number in the predefined list of numbers.

9. An apparatus comprising:

one or more computer readable storage media;

a predefined list of numbers stored on at least one of the one or more computer readable storage media; and

program instructions stored on at least one of the one or more computer readable media that, when executed by a processing system, direct the processing system to;

receive a request for access to content, the content being stored in a distributed or cloud computing environment on an associated server resource of a changing group of server resources, the changing of the changing group of server resources occurring through adding or removing one or more server resources to or from the changing group;

map the request to the associated server resource, the map comprising;

calculating a modulus on a request identifier with at least a first number in the predefined list of numbers to generate a resource identifier identifying the associated server resource, wherein each modulus result is a resource identifier that identifies possible server resources in the changing group, wherein at least one of the possible server resources is possible to be the associated server resource; and

communicating with the associated server resource corresponding to the resource identifier.

10. The apparatus of claim 9, further comprising instructions stored on at least one of the one or more computer readable media that, when executed by the processing system, direct the processing system to:

in response to receiving a request, perform a hash function of a request key of the request to generate the request identifier.

11. The apparatus of claim 9, wherein the predefined list of numbers consists of prime numbers.

12. The apparatus of claim 9, wherein the predefined list of numbers is arranged with numbers in descending order.

13. The apparatus of claim 9, wherein the largest number in the predefined list is equal to or greater than an expected maximum number of server resources of the changing group of server resources.

14. The apparatus of claim 9, further comprising:

a resource list stored on at least one of the one or more computer readable storage media, the resource list indicating a status of server resources of the changing group of server resources according to the resource identifier; and

instructions stored on at least one of the one or more computer readable storage media that, when executed by the processing system, direct the processing system to;

maintain the resource list; and

determine a status of the associated server resource identified by the resource identifier before communicating with the associated server resource.

15. The apparatus of claim 9, further comprising:

instructions stored on at least one of the one or more computer readable storage media that, when executed by the processing system, direct the processing system to;

communicate with the associated server resource identified by the resource identifier to determine its availability; and

in response to receiving a status of available, communicate the request to the associated server resource;

in response to receiving a status of not available, calculate the modulus on the request identifier with at least a next number in the predefined list of numbers.

16. A resource locator comprising:

one or more computer readable storage media;

a predefined list of numbers stored on at least one of the one or more computer readable storage media, the predefined list of numbers comprising a plurality of prime numbers; and

program instructions stored on at least one of the one or more computer readable storage media that, when executed by a processing system, direct the processing system to;

receive requests for access to content, the content being stored in a distributed or cloud computing environment on associated server resources of a changing group of server resources, the changing of the changing group of server resources occurring through adding or removing one or more server resources to or from the changing group;

map the requests to the associated server resources, wherein for each request, the program instructions direct the processing system to;

obtain a numeric identifier (x) from the request;

retrieve at least a first number (n) in the predefined list of numbers;

calculate x mod n to generate a resource identifier, the resource identifier being the modulus result of x mod n;

determine whether the resource identifier identifies an available associated server resource or an unavailable associated server resource; and

in response to a determination that the resource identifier identifies the available associated server resource, communicate the request to the available associated server resource;

in response to a determination that the resource identifier identifies the unavailable associated server resource, traverse the predefined list of numbers to retrieve a next number (m), calculate x mod m, and determine whether a resulting resource identifier identifies the available server associated resource or the unavailable associated server resource until the resource identifier identifies the available associated server resource.

17. The resource locator of claim 16, wherein the numeric identifier is obtained by performing a hash function of a request key of the request.

18. The resource locator of claim 16, further comprising instructions stored on at least one of the one or more computer readable storage media that, when executed by the processing system, direct the processing system to:

in response to receiving a request that comprises an actual identifier of the associated server resource, first use the actual identifier to communicate the request to the associated server resource; and

if the associated server resource is not available, then obtain the numeric identifier and calculate the x mod n to generate the resource identifier.

19. The resource locator of claim 16, wherein the distributed or cloud computing environment is an email server environment, the server resources are email servers, and the content is email information.

20. The resource locator of claim 16, wherein the distributed or cloud computing environment is a distributed cache environment, the server resources are cache servers, and the content is cached data.