IP Library › Granted Patent US 10,853,188
Granted Patent B2
US 10,853,188 · App. 16/395,399 · Granted Dec 1, 2020

System and method for data retention in a decentralized system

Inventors: Si Chen (Shanghai, CN); Zhenzhen Lin (Shanghai, CN); Pengfei Wu (Shanghai, CN); Assaf Natanzon (Tel Aviv, IL)
Assignee: EMC IP Holding Company LLC
G06F11/1453G06F11/1425G06F11/3034G06F16/1748
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 10,853,188
App. No.
16/395,399
Filed
Apr 26, 2019
Granted
Dec 1, 2020
Kind
B2
Examiner
LANE, JOHN A
Art Unit
2139
USPC
711/154
Abstract

A node for use in a data management system includes a persistent storage and a data protection agent. The persistent storage stores data. The data protection agent makes an identification of a data protection strategy change event for the data; in response to the identification: makes a determination that the data protection strategy change event is a scale down event; in response to the determination: identifies a number of replicas of the data in other nodes that are in a predetermined state; makes a second determination that the number of the replicas of the data in the other nodes that are in the predetermined state exceeds a threshold specified by a data protection policy associated with the data protection strategy change event; and reduces the number of replicas that exceed the threshold to be less than the threshold in response to the second determination.

Claims (110)

1. A node for use in a data management system, comprising:

a persistent storage that stores data; and

a data protection agent programmed to:

make an identification of a data protection strategy change event for the data;

in response to the identification:

make a determination that the data protection strategy change event is a scale down event;

in response to the determination:

identify a number of replicas of the data in other nodes that are in a predetermined state;

make a second determination that the number of the replicas of the data in the other nodes that are in the predetermined state exceeds a threshold specified by a data protection policy associated with the data protection strategy change event; and

reduce the number of replicas that exceed the threshold to be less than the threshold in response to the second determination.

2. The node of claim 1 , wherein reducing the number of replicas that exceed the threshold to be less than the threshold comprises:

sending a scale down command to at least one of the number of the replicas that exceeds the threshold,

wherein the scale down command specifies the data.

3. The node of claim 1 , wherein the data protection agent is further programmed to:

make an second identification of a second data protection strategy change event for the data;

in response to the second identification:

make a third determination that the second data protection strategy change event is a global deletion event;

in response to the third determination:

identify a portion of the other nodes that advertise that each respective node of the portion of the nodes stores a replica of the data; and

remove all replicas of the data from the identified portion of the other nodes.

4. The node of claim 3 , wherein removing all replicas of the data from the identified portion of the other nodes:

sending a global deletion request to each of the nodes of the identified portion of the other nodes.

5. The node of claim 1 , wherein the data protection agent is further programmed to:

obtain a state verification request for a state of second data;

make a third determination that the second data is stored in the persistent storage;

indicate that the state is acceptable based on the third determination and in response to the state verification request.

6. The node of claim 5 , wherein the data protection agent is further programmed to:

obtain a second scale down request for the second data;

in response to obtaining the second scale down request:

delete the second data to obtain deleted second data; and

update metadata associated with the deleted second data to specify:

an identifier of the second data, and

that the second data is available; and

advertise that the second data is available after deleting the second data.

7. The node of claim 6 , wherein the data protection agent is further programmed to:

after deleting the second data:

obtain a second state verification request for the state of the second data;

make a fourth determination that the second data is not stored in the persistent storage in response to obtaining the second state verification request;

make a fifth determination that the updated metadata associated with the deleted second data specifies that the second data is available in response to the fourth determination; and

indicate that the state is acceptable based on the fifth determination and in response to the second state verification request.

8. A method for managing a node in a data management system, comprising:

making an identification of a data protection strategy change event for data in a persistent storage of the node;

in response to the identification:

making a determination that the data protection strategy change event is a scale down event;

in response to the determination:

identifying a number of replicas of the data in other nodes that are in a predetermined state;

making a second determination that the number of the replicas of the data in the other nodes that are in the predetermined state exceeds a threshold specified by a data protection policy associated with the data protection strategy change event; and

reducing the number of replicas that exceed the threshold to be less than the threshold in response to the second determination.

9. The method of claim 8 , wherein reducing the number of replicas that exceed the threshold to be less than the threshold comprises:

sending a scale down command to at least one of the number of the replicas that exceeds the threshold,

wherein the scale down command specifies the data.

10. The method of claim 8 , further comprising:

making a second identification of a second data protection strategy change event for the data;

in response to the second identification:

making a third determination that the second data protection strategy change event is a global deletion event;

in response to the third determination:

identifying a portion of the other nodes that advertise that each respective node of the portion of the nodes stores a replica of the data; and

removing all replicas of the data from the identified portion of the other nodes.

11. The method of claim 10 , wherein removing all replicas of the data from the identified portion of the other nodes:

sending a global deletion request to each of the nodes of the identified portion of the other nodes.

12. The method of claim 8 , further comprising:

obtaining a state verification request for a state of second data;

making a third determination that the second data is stored in the persistent storage;

indicating that the state is acceptable based on the third determination and in response to the state verification request.

13. The method of claim 12 , further comprising:

obtaining a second scale down request for the second data;

in response to obtaining the second scale down request:

deleting the second data to obtain deleted second data; and

updating metadata associated with the deleted second data to specify:

an identifier of the second data, and

that the second data is available; and

advertise that the second data is available after deleting the second data.

14. The method of claim 13 , further comprising:

after deleting the second data:

obtaining a second state verification request for the state of the second data;

making a fourth determination that the second data is not stored in the persistent storage in response to obtaining the second state verification request;

making a fifth determination that the updated metadata associated with the deleted second data specifies that the second data is available in response to the fourth determination; and

indicating that the state is acceptable based on the fifth determination and in response to the second state verification request.

15. A non-transitory computer readable medium comprising computer readable program code, which when executed by a computer processor enables the computer processor to perform a method for managing a node in a data management system, the method comprising:

making an identification of a data protection strategy change event for data in a persistent storage of the node;

in response to the identification:

making a determination that the data protection strategy change event is a scale down event;

in response to the determination:

identifying a number of replicas of the data in other nodes that are in a predetermined state;

making a second determination that the number of the replicas of the data in the other nodes that are in the predetermined state exceeds a threshold specified by a data protection policy associated with the data protection strategy change event; and

reducing the number of replicas that exceed the threshold to be less than the threshold in response to the second determination.

16. The non-transitory computer readable medium of claim 15 , wherein reducing the number of replicas that exceed the threshold to be less than the threshold comprises:

sending a scale down command to at least one of the number of the replicas that exceeds the threshold,

wherein the scale down command specifies the data.

17. The non-transitory computer readable medium of claim 15 , wherein the method further comprises:

making a second identification of a second data protection strategy change event for the data;

in response to the second identification:

making a third determination that the second data protection strategy change event is a global deletion event;

in response to the third determination:

identifying a portion of the other nodes that advertise that each respective node of the portion of the nodes stores a replica of the data; and

removing all replicas of the data from the identified portion of the other nodes.

18. The non-transitory computer readable medium of claim 17 , wherein removing all replicas of the data from the identified portion of the other nodes:

sending a global deletion request to each of the nodes of the identified portion of the other nodes.

19. The non-transitory computer readable medium of claim 15 , wherein the method further comprises:

obtaining a state verification request for a state of second data;

making a third determination that the second data is stored in the persistent storage;

indicating that the state is acceptable based on the third determination and in response to the state verification request.

20. The non-transitory computer readable medium of claim 19 , wherein the method further comprises:

obtaining a second scale down request for the second data;

in response to obtaining the second scale down request:

deleting the second data to obtain deleted second data; and

updating metadata associated with the deleted second data to specify:

an identifier of the second data, and

that the second data is available; and

advertise that the second data is available after deleting the second data.

Assignments (9)
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (050724/0466) Recorded Jun 23, 2022
From: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT
To: DELL PRODUCTS L.P.; EMC CORPORATION; EMC IP HOLDING COMPANY LLC; DELL MARKETING CORPORATION (SUCCESSOR-IN-INTEREST TO WYSE TECHNOLOGY L.L.C.)
Reel/Frame 060753/0486 →
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053546/0001) Recorded Jun 23, 2022
From: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT
To: DELL MARKETING L.P. (ON BEHALF OF ITSELF AND AS SUCCESSOR-IN-INTEREST TO CREDANT TECHNOLOGIES, INC.); DELL INTERNATIONAL L.L.C.; DELL PRODUCTS L.P.; DELL USA L.P.; EMC CORPORATION; DELL MARKETING CORPORATION (SUCCESSOR-IN-INTEREST TO FORCE10 NETWORKS, INC. AND WYSE TECHNOLOGY L.L.C.); EMC IP HOLDING COMPANY LLC
Reel/Frame 071642/0001 →
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053311/0169) Recorded Jun 23, 2022
From: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT
To: DELL PRODUCTS L.P.; EMC CORPORATION; EMC IP HOLDING COMPANY LLC
Reel/Frame 060438/0742 →
RELEASE OF SECURITY INTEREST AT REEL 050405 FRAME 0534 Recorded Nov 2, 2021
From: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
To: DELL PRODUCTS L.P.; EMC CORPORATION; EMC IP HOLDING COMPANY LLC; WYSE TECHNOLOGY L.L.C.
Reel/Frame 058001/0001 →
SECURITY INTEREST Recorded Jun 5, 2020
From: DELL PRODUCTS L.P.; EMC CORPORATION; EMC IP HOLDING COMPANY LLC
To: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS COLLATERAL AGENT
Reel/Frame 053311/0169 →
SECURITY AGREEMENT Recorded Apr 22, 2020
From: CREDANT TECHNOLOGIES INC.; DELL INTERNATIONAL L.L.C.; DELL MARKETING L.P.; DELL PRODUCTS L.P.; DELL USA L.P.; EMC CORPORATION; FORCE10 NETWORKS, INC.; WYSE TECHNOLOGY L.L.C.; EMC IP HOLDING COMPANY LLC
To: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A.
Reel/Frame 053546/0001 →
PATENT SECURITY AGREEMENT (NOTES) Recorded Oct 15, 2019
From: DELL PRODUCTS L.P.; EMC CORPORATION; EMC IP HOLDING COMPANY LLC; WYSE TECHNOLOGY L.L.C.
To: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS COLLATERAL AGENT
Reel/Frame 050724/0466 →
SECURITY AGREEMENT Recorded Sep 17, 2019
From: DELL PRODUCTS L.P.; EMC CORPORATION; EMC IP HOLDING COMPANY LLC; WYSE TECHNOLOGY L.L.C.
To: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
Reel/Frame 050405/0534 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 30, 2019
From: CHEN, SI; LIN, ZHENZHEN; WU, PENGFEI; NATANZON, ASSAF
To: EMC IP HOLDING COMPANY LLC
Reel/Frame 049041/0364 →
Continuity (1)
Related Publication 20200341856A1 · Oct 29, 2020