Multipurpose storage system based upon a distributed hashing mechanism with transactional support and failover capability

• US 8,429,444 B2
• Filed: 12/17/2009
• Issued: 04/23/2013
• Est. Priority Date: 12/18/2008
• Status: Active Grant

• Current Assignee: Scality, S.A. (Scality, Inc.)
• Original Assignee: Scality, S.A. (Scality, Inc.)
• Inventors: Rancurel, Vianney, Lemarie, Olivier, Regni, Giorgio, Tauch, Alain, Artuso, Benoit, Gramain, Jonathan, Demiddelaer, Bertrand
• Primary Examiner(s): TRUONG, LOAN
• Application Number:
  US12/640,373
• Publication Number:
  US 20100162035A1
• Time in Patent Office: 1,223 Days
• Field of Search: 714/4.11, 714/4.1, 714/4.4, 714/6.2
• US Class Current: 714/4.1
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes

Abstract

A multipurpose storage system based upon a distributed hashing mechanism with transactional support and failover capability is disclosed. According to one embodiment, a system comprises a client system in communication with a network, a secondary storage system in communication with the network, and a supervisor system in communication with the network. The supervisor system assigns a unique identifier to a first node system and places the first node system in communication with the network in a location computed by using hashing. The client system stores a data object on the first node system.

Claims

1. A system, comprising:

a client system in communication with a network;

a secondary storage system in communication with the network; and

a supervisor system in communication with the network, wherein the supervisor system assigns a unique identifier to a first node system; and

places the first node system in communication with the network in a location computed by using hashing, wherein the client system stores a data object on the first node system,

wherein the supervisor system detects overlap of data storage on the first and second node systems; and

wherein the supervisor system sends correct data object range information to the first and second node systems.

3. The system of claim 1, wherein the network is a Chord based network.

4. The system of claim 1, wherein the secondary storage system is a Chord based network.

5. The system of claim 1, wherein the first node system detects and recovers from a plurality of node system failures over the network.

6. The system of claim 1, wherein one or more replicas of the data object are generated and stored on a second node system in communication with the network.

7. The system of claim 6, wherein unique identifiers are computed by the client system and assigned to the object and the one or more replicas of the data object.

8. The system of claim 6, wherein the client system initiates a transaction intended for the data object and a replica of the data object.

9. The system of claim 8 wherein the transaction is one of put, get, or delete operations.

10. The system of claim 6, wherein the first node system synchronizes the data object and the one or more replicas of the data object without a central component.

11. The system of claim 10 wherein the first node rebuilds a missing replica of the one or more replicas of the data object.

12. The system of claim 1, wherein the data object is stored in the secondary storage system.

13. The system of claim 1, wherein the data object is retrieved from the secondary storage system.

14. The system of claim 6, wherein the data object and the one or more replicas of the data object are retrieved from the first and second node systems.

2. A computer implemented method comprising:

assigning a unique identifier to a first node system;

placing the first node system in communication with a network in a location computed by using hashing, wherein a client system stores a data object on the first node system;

detecting overlap of data storage on the first and second node systems; and

sending correct data object range information to the first and second node systems.

15. The computer implemented method of claim 2, wherein the network is a Chord based network.

16. The computer implemented method of claim 2, wherein a secondary storage system in communication with the network is a Chord based network.

17. The computer implemented method of claim 2, wherein the first node system detects and recovers from a plurality of node system failures over the network.

18. The computer implemented method of claim 2, wherein one or more replicas of the data object are generated and stored on a second node system in communication with the network.

19. The computer implemented method of claim 18, wherein unique identifiers are computed by the client system and assigned to the data object and the one or more replicas of the data object.

20. The computer implemented method of claim 18, wherein the client system initiates a transaction intended for the data object and a replica of the data object.

21. The computer implemented method of claim 20 wherein the transaction is one of put, get, or delete operations.

22. The computer implemented method of claim 18, wherein the first node system synchronizes the data object and the one or more replicas of the data object without a central component.

23. The computer implemented method of claim 2, further comprising detecting overlap of data storage on the first and second node systems.

24. The computer implemented method of claim 22 wherein the first node rebuilds a missing replica of the one or more replicas of the data object.

25. The computer implemented method of claim 23, further comprising sending correct data object range information to the first and second node systems.

26. The computer implemented method of claim 2, wherein the data object is stored in the secondary storage system.

27. The computer implemented method of claim 26, wherein the data object is retrieved from the secondary storage system.

28. The computer implemented method of claim 18, wherein the data object and the one or more replicas of the data object are retrieved from the first and second node systems.