IP Library Granted Patent US 8,429,444
Granted Patent B2
US 8,429,444 · App. 12/640,373 · Granted Apr 23, 2013

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

Inventors: Vianney Rancurel (La Frette sur Seine, FR); Olivier Lemarie (Sunnyvale, CA); Giorgio Regni (Paris, FR); Alain Tauch (Montrouge, FR); Benoit Artuso (Paris, FR); Jonathan Gramain (Paris, FR); Bertrand Demiddelaer (Levaillois-Perret, FR)
Assignee: Scality, S.A.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,429,444
App. No.
12/640,373
Granted
Apr 23, 2013
Kind
B2
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 (37)

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.

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.

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.

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.

Assignments (2)
CHANGE OF NAME Recorded Aug 14, 2012
From: BIZANGA STORE, S.A.R.L.
To: SCALITY, S.A.
Reel/Frame 028782/0309 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 17, 2009
From: RANCUREL, VIANNEY; LEMARIE, OLIVIER; REGNI, GIORGIO; TAUCH, ALAIN; ARTUSO, BENOIT; GRAMAIN, JONATHAN; DEMIDDELAER, BERTRAND
To: BIZANGA STORE, S.A.R.L.
Reel/Frame 023669/0356 →
Continuity (2)
Provisional Application 61138759 · Dec 18, 2008
Related Publication 20100162035A1 · Jun 24, 2010