Virtual multi-cluster clouds

• US 9,405,781 B2
• Filed: 04/09/2014
• Issued: 08/02/2016
• Est. Priority Date: 03/08/2011
• Status: Active Grant

• Current Assignee: Rackspace US Incorporated (Apollo Global Management, Inc.)
• Original Assignee: Rackspace US Incorporated (Apollo Global Management, Inc.)
• Inventors: Holt, Gregory Lee, Gerrard, Clay, Goetz, David Patrick, Barton, Michael
• Primary Examiner(s): Wong, Leslie
• Application Number:
  US14/249,301
• Publication Number:
  US 20140304334A1
• Time in Patent Office: 846 Days
• US Class Current: 1/1
• CPC Class Codes: G06F 11/1004 to protect a block of data words, e.g. CRC or checksum G06F11/1076 takes precedence; security arrangements for protecting computers or computer systems against unauthorized activity G06F21/00
• CPC Class Codes: G06F 11/2097 maintaining the standby controller/processing unit updated initialisation or re-synchronisation thereof G06F11/1658 and subgroups
• CPC Class Codes: G06F 16/1744 using compression, e.g. sparse files
• CPC Class Codes: G06F 16/1748 De-duplication implemented within the file system, e.g. based on file segments de-duplication techniques in storage systems for the management of data blocks G06F3/0641
• CPC Class Codes: G06F 16/178 Techniques for file synchronisation in file systems
• CPC Class Codes: G06F 16/2219 Large Object storage; Management thereof
• CPC Class Codes: G06F 16/2365 Ensuring data consistency and integrity
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: G06F 16/273 Asynchronous replication or reconciliation
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9566 URL specific, e.g. using aliases, detecting broken or misspelled links
• CPC Class Codes: G06F 2201/85 Active fault masking without idle spares active fault masking without idle spare hardware where processing functionality is redundant G06F11/2035
• CPC Class Codes: G06F 3/0619 in relation to data integrity, e.g. data losses, bit errors
• CPC Class Codes: G06F 3/0626 Reducing size or complexity of storage systems
• CPC Class Codes: G06F 3/0644 Management of space entities, e.g. partitions, extents, pools
• CPC Class Codes: G06F 3/065 Replication mechanisms
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: H04L 43/106 using time related information in packets, e.g. by adding timestamps
• CPC Class Codes: H04L 65/403 Arrangements for multi-party communication, e.g. for conferences data switching systems for conference H04L12/18; arrangements for connecting several subscribers to a common circuit, i.e. affording conference facilities H04M3/56; television conferencing systems H04N7/15
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]
• CPC Class Codes: H04L 67/1095 : Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
• 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/5651 : Reducing the amount or size of exchanged application data
• CPC Class Codes: H04L 69/04 : Protocols for data compression, e.g. ROHC

Abstract

An improved scalable object storage system includes methods and systems allowing multiple clusters to work together. Users working with a first cluster, or with a multi-cluster gateway, can ask for services and have the request or data transparently proxied to a second cluster. This gives transparent cross-cluster replication, as well as multi-cluster compute or storage farms based upon spot availability or various provisioning policies. Vendors providing a cloud storage “frontend” can provide multiple backends simultaneously. In one embodiment, a multi-cluster gateway can have a two, three, or higher-level ring that transparently matches an incoming request with the correct cluster. In the ring, a request is first mapped to an abstract “partition” based on a consistent hash function, and then one or more constrained mappings map the partition number to an actual resource. In another embodiment, the multi-cluster gateway is a dumb gateway, and the rings are located only at the cluster level.

Claims

1. A system for coordinating a plurality of clusters, the system comprising:

a first cluster including a first plurality of information processing devices;

a second cluster including a second plurality of information processing devices; and

a multi-cluster gateway coupled to the first and second clusters, wherein the multi-cluster gateway includes a ring that performs a first hashing function and a second hashing function responsive to a request to interact with the system, wherein the request includes an object,

wherein the ring performs the first hashing function on an attribute of the object, and an output of the first hashing function is a partition identifier of a partition corresponding to computing resources available at one of the first cluster and the second cluster, and wherein the partition identifier includes a plurality of portions,

wherein the ring performs the second hashing function on each portion of the plurality of portions, and an output of the second hashing function identifies a storage pool location for a portion of the plurality of portions on which the second hashing function is applied, and wherein the storage pool location is located in a responsive cluster from one of the first cluster and the second cluster, and

wherein the multi-cluster gateway sends a message to the responsive cluster.

2. The system of claim 1, wherein the first hashing function comprises a consistent hashing function.

3. The system of claim 1, wherein the second hashing function comprises a constrained mapping function.

4. The system of claim 1, wherein the output of the second hashing function further identifies a specific resource within the responsive cluster.

5. The system of claim 4, wherein the message to the responsive cluster is addressed to the specific resource within the responsive cluster.

6. The system of claim 1, further comprising a return message from the responsive cluster responsive to the request to interact with the system.

7. The system of claim 1, wherein the multi-cluster gateway further includes a proxy module.

8. The system of claim 7, wherein the proxy module sends a return message from the responsive cluster in response to the request to interact with the system.

9. The system of claim 1, wherein one of the first cluster and the second cluster further comprises a cluster-level ring, wherein the cluster-level ring performs a third hashing function responsive to a message identifying the cluster as a responsive cluster, wherein the output of the third hashing function is a cluster-level partition associated with the resources available within the cluster.

10. The system of claim 9, wherein the cluster-level ring performs a fourth hashing function, wherein the output of the fourth hashing function identifies a specific responsive resource associated with the cluster-level partition.

11. The system of claim 1, wherein the first cluster is controlled by a first party and the second cluster is controlled by a second party.

12. The system of claim 1, wherein the second hashing function uses geographic distance to choose which cluster is the responsive cluster.

13. The system of claim 1, wherein the second hashing function uses network latency to choose which cluster is the responsive cluster.

14. A method of coordinating a plurality of clusters, the method comprising:

receiving a request including an object;

performing a first hashing function on an attribute of the object;

obtaining an output of the first hashing function, the output being a partition identifier of a partition corresponding to computing resources available at one of a first cluster and a second cluster, the partition identifier including a plurality of portions;

performing a second hashing function on a portion of the plurality of portions;

obtaining an output of the second hashing function, the output identifying a storage pool location, the storage pool location being located in a responsive cluster from one of the first cluster and the second cluster; and

sending a message to the responsive cluster.

15. The method of claim 14, further comprising:

receiving a responsive message from a cluster.

16. The method of claim 14, wherein only one of the first cluster and the second cluster is the responsive cluster, and wherein a response to the request is sent by the responsive cluster.

17. The method of claim 14, wherein either of the first cluster and the second cluster can be a responsive cluster, and wherein the first cluster to formulate a response sends the response.

18. The method of claim 14, wherein the sending the message includes sending the message to the cluster that is closer geographically to the source of the request.

19. The method of claim 14, wherein the sending the message includes sending the message to the cluster that has lower latency between the cluster and the source of the request.

20. The method of claim 14, wherein the first cluster is controlled by a first party and the second cluster is controlled by a second party.