Stateless technique for distributing data uploads

• US 10,033,817 B2
• Filed: 11/17/2017
• Issued: 07/24/2018
• Est. Priority Date: 04/08/2015
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Inc.
• Inventors: Bashir, Ahmed M., Hong, Theodore
• Primary Examiner(s): Nguyen, Kim T
• Application Number:
  US15/817,108
• Publication Number:
  US 20180084061A1
• Time in Patent Office: 249 Days
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 67/142 Managing session states for stateless protocols; Signalling session states; State transitions; Keeping-state mechanisms

Abstract

The embodiments set forth a technique for providing a stateless technique for distributing uploads. According to some embodiments, a system can include various computing devices, authorization servers, and storage destinations. Within the system, an authorization server assigns weight properties to each storage destination, and generates a set of tokens for subsequent assignment to the different storage destinations in accordance with their weight properties. More specifically, the authorization server is configured to perform an initial token drafting process that involves assigning the tokens to different storage destinations. As the current health of each storage destination changes over time, the authorization server is also configured to periodically perform (e.g., at a set interval) a supplemental token drafting process that involves updating the weight properties of each storage destination and redistributing the tokens in view of the updated weight properties.

Claims

1. A method for distributing data uploads, the method comprising:

at a storage destination configured to interface with a plurality of computing devices and an authorization server;

receiving, from the authorization server, an indication of a number of token requests to be issued by the storage destination;

establishing a pseudorandom number generator, wherein a unique identifier (ID) associated with the storage destination is used as a seed for the pseudorandom number generator; and

for each token request;

issuing, to the authorization server, a request for a token, wherein the request includes a next value produced by the pseudorandom number generator, and

receiving, from the authorization server, a notification that indicates whether the token is assigned to the storage destination.

2. The method of claim 1, wherein, for each token request, when the notification indicates that the token is not assigned to the storage destination, the method further comprises:

issuing, to the authorization server, a supplemental request for a token, wherein the supplemental request includes a next value produced by the pseudorandom number generator.

3. The method of claim 1, wherein the storage destination issues each request for a token in response to receiving, from the authorization server, an indication to issue the request.

4. The method of claim 1, wherein, for each token request, a mathematical function is performed on the next value prior to issuing the request for the token.

5. The method of claim 4, wherein, for each token request, the mathematical function comprises performing a modulo function using the next value and a predefined number.

6. The method of claim 4, wherein, for each token request, and subsequent to performing the mathematical function on the next value, the next value corresponds to a unique token identifier (ID) associated with the token being requested.

7. The method of claim 1, further comprising:

receiving, from a storage destination of the plurality of computing devices, a request to upload content to the authorization server, wherein the request is based on the token; and

receiving the content from the storage destination.

8. At least one non-transitory computer readable storage medium configured to store instructions that, when executed by at least one processor included in a storage destination, cause the storage destination to distribute data uploads, by carrying out steps that include:

receiving, from an authorization server, an indication of a number of token requests to be issued by the storage destination;

establishing a pseudorandom number generator, wherein a unique identifier (ID) associated with the storage destination is used as a seed for the pseudorandom number generator; and

for each token request;

issuing, to the authorization server, a request for a token, wherein the request includes a next value produced by the pseudorandom number generator, and

receiving, from the authorization server, a notification that indicates whether the token is assigned to the storage destination.

9. The at least one non-transitory computer readable storage medium of claim 8, wherein, for each token request, when the notification indicates that the token is not assigned to the storage destination, the steps further include:

issuing, to the authorization server, a supplemental request for a token, wherein the supplemental request includes a next value produced by the pseudorandom number generator.

10. The at least one non-transitory computer readable storage medium of claim 8, wherein the storage destination issues each request for a token in response to receiving, from the authorization server, an indication to issue the request.

11. The at least one non-transitory computer readable storage medium of claim 8, wherein, for each token request, a mathematical function is performed on the next value prior to issuing the request for the token.

12. The at least one non-transitory computer readable storage medium of claim 11, wherein, for each token request, the mathematical function comprises performing a modulo function using the next value and a predefined number.

13. The at least one non-transitory computer readable storage medium of claim 11, wherein, for each token request, and subsequent to performing the mathematical function on the next value, the next value corresponds to a unique token identifier (ID) associated with the token being requested.

14. The at least one non-transitory computer readable storage medium of claim 8, wherein the steps further include:

receiving, from a computing device of a plurality of computing devices, a request to upload content to the authorization server, wherein the request is based on the token; and

receiving the content from the storage destination.

15. A storage destination configured to distribute data uploads, the storage destination comprising:

at least one processor; and

at least one memory storing instructions that, when executed by the at least one processor, cause the storage destination to;

receive, from an authorization server, an indication of a number of token requests to be issued by the storage destination;

establish a pseudorandom number generator, wherein a unique identifier (ID) associated with the storage destination is used as a seed for the pseudorandom number generator; and

for each token request;

issue, to the authorization server, a request for a token, wherein the request includes a next value produced by the pseudorandom number generator, and

receive, from the authorization server, a notification that indicates whether the token is assigned to the storage destination.

16. The storage destination of claim 15, wherein, for each token request, when the notification indicates that the token is not assigned to the storage destination, the at least one processor further causes the storage destination to:

issue, to the authorization server, a supplemental request for a token, wherein the supplemental request includes a next value produced by the pseudorandom number generator.

17. The storage destination of claim 15, wherein the storage destination issues each request for a token in response to receiving, from the authorization server, an indication to issue the request.

18. The storage destination of claim 15, wherein, for each token request, a mathematical function is performed on the next value prior to issuing the request for the token.

19. The storage destination of claim 18, wherein, for each token request, the mathematical function comprises performing a modulo function using the next value and a predefined number.

20. The storage destination of claim 18, wherein, for each token request, and subsequent to performing the mathematical function on the next value, the next value corresponds to a unique token identifier (ID) associated with the token being requested.