Imposter slices

• US 10,067,832 B2
• Filed: 09/30/2016
• Issued: 09/04/2018
• Est. Priority Date: 10/30/2015
• Status: Active Grant

• Current Assignee: Pure Storage, Inc.
• Original Assignee: International Business Machines Corporation
• Inventors: Baptist, Andrew D., Dhuse, Greg R., Khadiwala, Ravi V., Resch, Jason K., Volvovski, Ilya, Wozniak, Ethan S.
• Primary Examiner(s): Rizk, Sam
• Application Number:
  US15/283,241
• Publication Number:
  US 20170123909A1
• Time in Patent Office: 704 Days
• CPC Class Codes: G06F 11/1092 Rebuilding, e.g. when physically replacing a failing disk
• CPC Class Codes: G06F 11/2094 Redundant storage or storage space G06F11/2056 takes precedence
• CPC Class Codes: G06F 2201/805 Real-time
• CPC Class Codes: G06F 3/0604 Improving or facilitating administration, e.g. storage management
• CPC Class Codes: G06F 3/061 Improving I/O performance
• CPC Class Codes: G06F 3/0611 in relation to response time
• CPC Class Codes: G06F 3/0619 in relation to data integrity, e.g. data losses, bit errors
• CPC Class Codes: G06F 3/0635 by changing the path, e.g. traffic rerouting, path reconfiguration
• CPC Class Codes: G06F 3/064 Management of blocks
• CPC Class Codes: G06F 3/0659 Command handling arrangements, e.g. command buffers, queues, command scheduling
• CPC Class Codes: G06F 3/0665 at area level, e.g. provisioning of virtual or logical volumes
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: G06F 3/0689 Disk arrays, e.g. RAID, JBOD
• CPC Class Codes: H03M 13/1515 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 43/0864 Round trip delays
• CPC Class Codes: H04L 43/0876 Network utilisation, e.g. volume of load or congestion level
• CPC Class Codes: H04L 43/16 Threshold monitoring
• CPC Class Codes: H04L 67/1008 based on parameters of servers, e.g. available memory or workload monitoring of computer activity G06F11/30
• 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

Methods and apparatus for accessing dispersed storage error encoded data in a dispersed storage network (DSN). When storing data in available storage units of a DSN, a DS processing unit issues a write slice request that includes a slice name corresponding to the storage unit and a unique encoded data slice of the set of encoded data slices, where each encoded data slice includes an IDA index of the corresponding storage unit. For each unavailable storage unit, the DS processing unit issues a write imposter slice request to a foster storage unit that includes a slice name corresponding to the foster storage unit and imposter encoded data slice corresponding to the unavailable storage unit, where the imposter encoded data slice includes an IDA index corresponding to the unavailable storage unit.

Claims

1. A method of accessing data in a dispersed storage network, the dispersed storage network including a plurality of dispersed storage units, the method comprising:

dispersed storage error encoding a data segment to produce a set of encoded data slices;

sending a first slice write request for receipt by a first dispersed storage unit of the plurality of dispersed storage units, the first slice write request including a first slice name corresponding to the first dispersed storage unit and a first data slice of the set of encoded data slices, wherein the first data slice includes a first information dispersed algorithm index of the first dispersed storage unit; and

sending a second slice write request for receipt by a third dispersed storage unit of the plurality of dispersed storage units when a second dispersed storage unit of the plurality of dispersed storage units is unavailable, the second slice write request including a second slice name corresponding to the third dispersed storage unit and a second data slice of the set of encoded data slices, wherein the second data slice includes a second information dispersed algorithm index of the second dispersed storage unit.

2. The method of claim 1, wherein the first information dispersed algorithm index of the first dispersed storage unit is included in one or more of a header or footer in the first data slice.

3. The method of claim 1, wherein the second information dispersed algorithm index of the second dispersed storage unit is included in one or more of a header or a footer in the second data slice.

4. The method of claim 1, wherein the first information dispersed algorithm index represents a first pillar the first data slice is associated with.

5. The method of claim 1, wherein the second information dispersed algorithm index represents a second pillar the second data slice is associated with.

6. The method of claim 1, further including retrieving the first data slice and the second data slice.

7. The method of claim 6, further including retrieving additional encoded data slices from the plurality of disperse storage units such that a decode threshold number of unique slices is retrieved and disperse storage error decoding the first data slice, the second data slice and the additional encoded data slices.

8. The method of claim 1, further including retrieving the second data slice when the second dispersed storage unit of the plurality of disperse storage units becomes available and sending a third slice write request for receipt by the second dispersed storage unit of the plurality of dispersed storage units, the third slice write request including a third slice name corresponding to the second dispersed storage unit and the second data slice of the set of encoded data slices, wherein the second data slice includes the information dispersed algorithm index of the second dispersed storage unit.

9. A dispersed storage processing unit for use in a dispersed storage network, the dispersed storage network including a plurality of dispersed storage units, the dispersed storage processing unit comprising:

a communications interface;

a memory; and

a processor;

wherein the memory includes a data segment and wherein the memory further includes instructions for causing the processor to;

dispersed storage error encode the data segment to produce a set of encoded data slices;

send a first slice write request for receipt by a first dispersed storage unit of the plurality of dispersed storage units, the first slice write request including a first slice name corresponding to the first dispersed storage unit and a first data slice of the set of encoded data slices, wherein the first data slice includes a first information dispersed algorithm index of the first dispersed storage unit; and

send a second slice write request for receipt by a third dispersed storage unit of the plurality of dispersed storage units when a second dispersed storage unit of the plurality of dispersed storage units is unavailable, the second slice write request including a second slice name corresponding to the third dispersed storage unit and a second data slice of the set of encoded data slices, wherein the second data slice includes a second information dispersed algorithm index of the second dispersed storage unit.

10. The dispersed storage processing unit of claim 9, wherein the first information dispersed algorithm index of the first dispersed storage unit is included in one or more of a header or footer in the first data slice.

11. The dispersed storage processing unit of claim 9, wherein the second information dispersed algorithm index of the second dispersed storage unit is included in one or more of a header or a footer in the second data slice.

12. The dispersed storage processing unit of claim 9, wherein the first information dispersed algorithm index represents a first pillar the first data slice is associated with.

13. The dispersed storage processing unit of claim 9, wherein the second information dispersed algorithm index represents a second pillar the second data slice is associated with.

14. The dispersed storage processing unit of claim 9, wherein the memory further includes instructions for causing the processor to retrieve the first data slice and the second data slice.

15. The dispersed storage processing unit of claim 14, wherein the memory further includes instructions for causing the processor to retrieve additional encoded data slices from the plurality of disperse storage units such that a decode threshold number of unique slices is retrieved and disperse storage error decode the first data slice, the second data slice and the additional encoded data slices.

16. The dispersed storage processing unit of claim 9, wherein the memory further includes instructions for causing the processor to retrieve the second data slice when the second dispersed storage unit of the plurality of disperse storage units becomes available and send a third slice write request for receipt by the second dispersed storage unit of the plurality of dispersed storage units, the third slice write request including a third slice name corresponding to the second dispersed storage unit and the second data slice of the set of encoded data slices, wherein the second data slice includes the information dispersed algorithm index of the second dispersed storage unit.

17. A dispersed storage network comprising:

a plurality of dispersed storage units including a first dispersed storage unit, a second dispersed storage unit and a third dispersed storage unit; and

a dispersed storage processing unit, the dispersed storage processing unit including;

a communications interface;

a memory; and

a processor;

wherein the memory includes a data segment and wherein the memory further includes instructions for causing the processor to;

dispersed storage error encode the data segment to produce a set of encoded data slices;

send a first slice write request to the first dispersed storage unit of the plurality of dispersed storage units, the first slice write request including a first slice name corresponding to the first dispersed storage unit and a first data slice of the set of encoded data slices, wherein the first data slice includes a first information dispersed algorithm index of the first dispersed storage unit; and

send a second slice write request to the third dispersed storage unit of the plurality of dispersed storage units when the second dispersed storage unit of the plurality of dispersed storage units is unavailable, the second slice write request including a second slice name corresponding to the third dispersed storage unit and a second data slice of the set of encoded data slices, wherein the second data slice includes a second information dispersed algorithm index of the second dispersed storage unit.

18. The dispersed storage network of claim 17, wherein the memory further includes instructions for causing the processor to retrieve the first data slice and the second data slice.

19. The dispersed storage network of claim 18, wherein the memory further includes instructions for causing the processor to retrieve additional encoded data slices from the plurality of disperse storage units such that a decode threshold number of unique slices is retrieved and disperse storage error decode the first data slice, the second data slice and the additional encoded data slices.

20. The dispersed storage network of claim 17, wherein the memory further includes instructions for causing the processor to retrieve the second data slice when the second dispersed storage unit of the plurality of disperse storage units becomes available and send a third slice write request for receipt by the second dispersed storage unit of the plurality of dispersed storage units, the third slice write request including a third slice name corresponding to the second dispersed storage unit and the second data slice of the set of encoded data slices, wherein the second data slice includes the information dispersed algorithm index of the second dispersed storage unit.