Read-if-not-revision-equals protocol message

• US 10,002,047 B2
• Filed: 09/30/2016
• Issued: 06/19/2018
• Est. Priority Date: 06/05/2012
• Status: Expired due to Fees

• Current Assignee: Pure Storage, Inc.
• Original Assignee: International Business Machines Corporation
• Inventors: Dhuse, Greg R., Volvovski, Ilya
• Primary Examiner(s): Dudek, Jr., Edward J
• Assistant Examiner(s): RUSSELL, ANDREW D
• Application Number:
  US15/282,920
• Publication Number:
  US 20170024283A1
• Time in Patent Office: 627 Days
• 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/1092 Rebuilding, e.g. when physically replacing a failing disk
• 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/3055 Monitoring arrangements for monitoring the status of the computing system or of the computing system component, e.g. monitoring if the computing system is on, off, available, not available error or fault processing without redundancy G06F11/0703; error detection or correction by redundancy in data representation G06F11/08; error detection or correction by redundancy in operation G06F11/14; error detection or correction by redundancy in hardware G06F11/16
• CPC Class Codes: H04L 63/0428 wherein the data content is protected, e.g. by encrypting or encapsulating the payload
• CPC Class Codes: H04L 63/101 Access control lists [ACL]

Abstract

A method for a dispersed storage network begins by receiving one of at least a threshold number of DSTN concurrency requests that includes a header section and a payload section. The method continues by determining, in response to the one of at least the threshold number of DSTN concurrency requests, a most recent slice revision number based on a slice name contained in the slice name section. The method continues by determining whether the last known revision number is less than the most recent revision number. The method continues by generating a DSTN concurrency response to return at least one slice of a greater revision number than the last known revision number of the request. The method continues by determining whether an error condition exists and generating an DSTN concurrency response to indicate that an unfavorable revision mismatch does not exist.

Claims

1. A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method comprises:

receiving one of at least a threshold number of DSTN concurrency requests that includes a header section and a payload section, wherein the payload section includes a transaction number, a last known slice revision number, and a slice name section;

determining, in response to the one of at least a threshold number of DSTN concurrency requests, a most recent slice revision number based on a slice name contained in the slice name section;

determining whether the last known slice revision number is less than the most recent slice revision number;

when the last known slice revision number is less than the most recent slice revision number, generating a DSTN concurrency response to return at least one slice of a greater revision number than the last known slice revision number of the DSTN concurrency request, the generating the DSTN concurrency response including generating a header section and a payload section, wherein the payload section includes a favorable slice revision status indication and one or more of;

a slice revision count regarding the slice name and one or more slice revision numbers corresponding to the slice name;

when the last known slice revision number is not less than the most recent slice revision number, generating the DSTN concurrency response to indicate that an unfavorable slice revision mismatch does not exist;

determining whether an error condition exists; and

discarding the DSTN concurrency response when the error condition exists; and

outputting the DSTN concurrency response when the error condition does not exist.

2. The method of claim 1 further comprises accessing an associate memory based on the slice name contained in the slice name section to retrieve a list of slice revision numbers corresponding to the slice name.

3. The method of claim 1 further comprises identifying a greatest slice revision number as the most recent slice revision number.

4. The method of claim 1 further comprises the generating a DSTN concurrency response including generating a response header section and a response payload section, wherein the response payload section includes a slice revision mismatch status indication.

5. The method of claim 4, wherein the slice revision mismatch status indication is based on the last known slice revision number not being current.

6. The method of claim 1 further comprises the generating a DSTN concurrency response including generating a response header section and a response payload section, wherein the response payload section includes a slice revision count regarding the slice name.

7. The method of claim 6, wherein the slice revision count includes a number of available encoded data slices associated with the slice name.

8. The method of claim 1 further comprises the generating a DSTN concurrency response including generating a response header section and a response payload section, wherein the response payload section includes one or more slice revision numbers corresponding to the slice name, one or more slice lengths corresponding to the slice name, or one or more encoded data slices corresponding to the slice name.

9. The method of claim 1 further comprises the generating the DSTN concurrency response including generating a response payload section to include one or more of an encoded data slice corresponding to the most recent slice revision number, all input data slices associated with slice revision numbers that are greater than the last known slice revision number, and all encoded data slices corresponding to the slice name.

10. The method of claim 1 further comprises the generating the DSTN concurrency response including determining which encoded data slices to include in a response payload section based on at least one of:

a predetermination, a response type indicator of the DSTN concurrency request, a difference between the most recent slice revision number and the last known slice revision number, or a system activity level indicator.

11. The method of claim 1 further comprises not returning encoded data slices when the most recent slice revision number is less than or equal to the last known slice revision number.

12. The method of claim 1, wherein each header section includes a payload length field and at least one of:

an operation code field, a protocol class field, or a protocol class version field.

13. The method of claim 12, wherein the payload length field includes a length of the payload section, the operation code field includes a concurrency response operation code, the protocol class field includes a protocol class for the concurrency response operation code, and the protocol class version field includes a version of the concurrency response operation code.

14. The method of claim 1, wherein the discarding the DSTN concurrency response is based on one or more of:

the slice name being associated with a locked encoded data slice state, a transaction number error, the slice name is associated with one or more encoded data slices that are unavailable, or one of at least the threshold number of DSTN concurrency requests is not authorized.

15. A computing device of a group of computing devices of a dispersed storage network (DSN), the computing device comprises:

an interface;

a local memory; and

a processing module operably coupled to the interface and the local memory, wherein the processing module functions to;

receive one of at least a threshold number of DSTN concurrency requests that includes at least a last known slice revision number and a slice name;

determine, in response to the one of at least the threshold number of DSTN concurrency requests, a most recent slice revision number based on the slice name;

determine whether the last known slice revision number is less than the most recent slice revision number;

when the last known slice revision number is less than the most recent slice revision number, generate a DSTN concurrency response to return at least one slice of a greater slice revision number than the last known slice revision number of the DSTN concurrency request, the generating the DSTN concurrency response including generating a header section and a payload section, wherein the payload section includes a favorable slice revision status indication and one or more of;

a slice revision count regarding the slice name and one or more slice revision numbers corresponding to the slice name;

when the last known slice revision number is not less than the most recent slice revision number, generate the DSTN concurrency response to indicate that an unfavorable slice revision mismatch does not exist;

determining whether an error condition exists; and

discarding the DSTN concurrency response when the error condition exists; and

outputting the DSTN concurrency response when the error condition does not exist.

16. The computing device of claim 15 further comprises accessing an associate memory based on the slice name contained in a slice name section to retrieve a list of slice revision numbers corresponding to the slice name.

17. The computing device of claim 15 further comprises identifying a greatest slice revision number as the most recent slice revision number.

18. The computing device of claim 15 further comprises the generating the DSTN concurrency response including generating a header section and a payload section, wherein the payload section includes a slice revision mismatch status indication based on the last known slice revision number not being current.