Processing data access transactions in a dispersed storage network using source revision indicators

• US 10,339,003 B2
• Filed: 06/01/2017
• Issued: 07/02/2019
• Est. Priority Date: 06/01/2017
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Dhuse, Greg R., Khadiwala, Ravi V.
• Primary Examiner(s): Alphonse, Fritz
• Application Number:
  US15/611,027
• Publication Number:
  US 20180349223A1
• Time in Patent Office: 761 Days
• Field of Search: 714764, 714766, 714763, 714768
• CPC Class Codes: G06F 11/1076 Parity data used in redundant arrays of independent storages, e.g. in RAID systems
• CPC Class Codes: G06F 11/1402 Saving, restoring, recovering or retrying
• CPC Class Codes: G06F 11/3006 where the computing system is distributed, e.g. networked systems, clusters, multiprocessor systems multiprogramming arrangements G06F9/46; allocation of resources G06F9/50
• CPC Class Codes: G06F 11/3034 where the computing system component is a storage system, e.g. DASD based or network based digital input from or digital output to record carriers G06F3/06; digital recording or reproducing G11B20/18; 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], H04L67/1097
• CPC Class Codes: G06F 11/3495 for systems
• CPC Class Codes: G06F 3/0604 Improving or facilitating administration, e.g. storage management
• CPC Class Codes: G06F 3/0611 in relation to response time
• CPC Class Codes: G06F 3/0652 Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
• CPC Class Codes: G06F 3/0659 Command handling arrangements, e.g. command buffers, queues, command scheduling
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: H03M 13/1515 Reed-Solomon codes
• CPC Class Codes: H03M 13/373 with erasure correction and erasure determination, e.g. for packet loss recovery or setting of erasures for the decoding of Reed-Solomon codes
• CPC Class Codes: H03M 13/3761 using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes
• CPC Class Codes: H04L 63/101 Access control lists [ACL]
• 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]

Abstract

A method by a dispersed storage (DS) processing unit of a dispersed storage network (DSN) begins by sending a set of data access requests regarding a data access transaction to a set of storage units of the DSN. The method continues by receiving from each of at least some storage units, a storage-revision indicator which includes a content-revision field, a delete-counter field, and a contest-counter field. The method continues by generating an anticipated storage-revision indicator based on a current revision level of the set of encoded data slices and based on a data access type of the data access transaction. The method continues by comparing the anticipated storage-revision indicator with the storage-revision indicators. When a threshold number of the storage-revision indicators received from the at least some storage units substantially match the anticipated storage-revision indicator, the method continues by executing the data access transaction.

Claims

1. A method comprises:

sending, by a dispersed storage (DS) processing unit of a dispersed storage network (DSN), a set of data access requests to a set of storage units of the DSN, wherein the set of data access requests is regarding a data access transaction involving a set of encoded data slices, wherein a data segment of a data object is dispersed storage error encoded into the set of encoded data slices, and wherein the set of storage units stores, or is to store, the set of encoded data slices;

receiving, by the DS processing unit from each of at least some storage units of the set of storage units, a storage-revision indicator, wherein the storage-revision indicator includes a content-revision field, a delete-counter field, and a contest-counter field, wherein the content-revision uniquely identifies content of an encoded data slice of the set of encoded data slices, wherein the delete-counter indicates a number of times the encoded data slice has been deleted, and wherein the contest-counter indicates a number of data access contests the encoded data slice has participated in;

generating, by the DS processing unit, an anticipated storage-revision indicator for the data access transaction based on a current revision level of the set of encoded data slices and based on a data access type of the data access transaction;

comparing, by the DS processing unit, the anticipated storage-revision indicator with the storage-revision indicators received from the at least some storage units; and

when a threshold number of the storage-revision indicators received from the at least some storage units substantially match the anticipated storage-revision indicator, executing, by the DS processing unit, the data access transaction.

2. The method of claim 1 further comprises:

when a threshold number of the storage-revision indicators received from the at least some storage units does not substantially match the anticipated storage-revision indicator, re-trying, by the DS processing unit, the data access transaction in accordance with a retry protocol.

3. The method of claim 1, wherein the data access transaction comprises one of:

a write operation;

a delete operation; and

an ensure operation.

4. The method of claim 1, wherein an ensure operation comprises:

verifying a revision level of a second data object prior to executing the data access transaction.

5. The method of claim 1 further comprises:

when the data access transaction is a write operation, generating the anticipated storage-revision indicator by;

changing information in the content-revision field;

leaving, unchanged, information in the delete-counter field; and

resetting the contest counter field to zero.

6. The method of claim 1 further comprises:

when the data access transaction is a delete operation, generating the anticipated storage-revision indicator by;

resetting information in the content-revision field to null;

incrementing information in the delete-counter field; and

resetting the contest counter field to zero.

7. The method of claim 1 further comprises:

when the data access transaction is an ensure operation, generating the anticipated storage-revision indicator by;

leaving, unchanged, information in the content-revision field;

leaving, unchanged, information in the delete-counter field; and

incrementing information in the contest counter field.

8. A dispersed storage (DS) processing unit of a dispersed storage network (DSN), comprises:

memory;

an interface; and

a processing module operably coupled to the memory and the interface, wherein the processing module is operable to;

send a set of data access requests to a set of storage units of the DSN, wherein the set of data access requests is regarding a data access transaction involving a set of encoded data slices, wherein a data segment of a data object is dispersed storage error encoded into the set of encoded data slices, and wherein the set of storage units stores, or is to store, the set of encoded data slices;

receive from each of at least some storage units of the set of storage units, a storage-revision indicator, wherein the storage-revision indicator includes a content-revision field, a delete-counter field, and a contest-counter field, wherein the content-revision uniquely identifies content of an encoded data slice of the set of encoded data slices, wherein the delete-counter indicates a number of times the encoded data slice has been deleted, and wherein the contest-counter indicates a number of data access contests the encoded data slice has participated in;

generate an anticipated storage-revision indicator for the data access transaction based on a current revision level of the set of encoded data slices and based on a data access type of the data access transaction;

compare the anticipated storage-revision indicator with the storage-revision indicators received from the at least some storage units; and

when a threshold number of the storage-revision indicators received from the at least some storage units substantially match the anticipated storage-revision indicator, execute the data access transaction.

9. The DS processing unit of claim 8, wherein the processing module is further operable to:

when a threshold number of the storage-revision indicators received from the at least some storage units does not substantially match the anticipated storage-revision indicator, re-try, by the DS processing unit, the data access transaction in accordance with a retry protocol.

10. The DS processing unit of claim 8, wherein the data access transaction comprises one of:

a write operation;

a delete operation; and

an ensure operation.

11. The DS processing unit of claim 8, wherein the processing module is further operable to perform an ensure operation by:

verifying a revision level of a second data object prior to executing the data access transaction.

12. The DS processing unit of claim 8, wherein the processing module is further operable to:

when the data access transaction is a write operation, generate the anticipated storage-revision indicator by;

changing information in the content-revision field;

leaving, unchanged, information in the delete-counter field; and

resetting the contest counter field to zero.

13. The DS processing unit of claim 8, wherein the processing module is further operable to:

when the data access transaction is a delete operation, generate the anticipated storage-revision indicator by;

resetting information in the content-revision field to null;

incrementing information in the delete-counter field; and

resetting the contest counter field to zero.

14. The DS processing unit of claim 8, wherein the processing module is further operable to:

when the data access transaction is an ensure operation, generate the anticipated storage-revision indicator by;

leaving, unchanged, information in the content-revision field;

leaving, unchanged, information in the delete-counter field; and

incrementing information in the contest counter field.