# US 2015/0039936 A1 · Distributed storage network with alternative foster storage approaches and methods for use therewith

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0039936 A1
- Document ID: US20150039936A1
- Status: Published application
- Kind: A1
- Application number: 14/287,401
- Filed: 2014-05-27
- Published: 2015-02-05
- Earliest claimed: 2013-07-31
- Assignees: Cleversafe, Inc.
- Applicants: Cleversafe, Inc.
- Inventors: Asimuddin Kazi; Jason K. Resch
- Web page: https://patentgrep.com/patent/US20150039936A1

## CPC

- 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]
- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 3/0614: {Improving the reliability of storage systems}
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/0646: {Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems}
- G06F 3/065: {Replication mechanisms}
- G06F 3/0668: {adopting a particular infrastructure}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 3/0683: {Plurality of storage devices}
- G06F 3/0689: {Disk arrays, e.g. RAID, JBOD}
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/5066: {Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs (mappping at compile time, see G06F8/451)}
- G06F 11/07: Responding to the occurrence of a fault, e.g. fault tolerance
- G06F 11/1092: {Rebuilding, e.g. when physically replacing a failing disk}
- G06F 11/1448: {Management of the data involved in backup or backup restore}
- G06F 11/1458: {Management of the backup or restore process}
- G06F 16/10: File systems; File servers
- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F 2209/5017: Task decomposition
- G06F 2211/1028: Distributed, i.e. distributed RAID systems with parity
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method includes encoding input data into a plurality of slices. The plurality of slices are sent to a plurality of distributed storage and task execution units for storage, the plurality of distributed storage and task execution units being located at a corresponding plurality of sites A storage failure is detected corresponding to at least one of the plurality of slices corresponding to at least one of the plurality of the distributed storage and task execution units and at least one of the corresponding plurality of sites A foster storage approach is determined. At least one alternative distributed storage and task execution unit is selected in accordance with the foster storage approach. At least one foster slice is generated corresponding to the at least one of the plurality of slices. The at least one foster slice is sent to the at least one alternative distributed storage and task execution unit.

## Claims

### Claim 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:
encoding input data into a plurality of slices;
sending the plurality of slices to a plurality of distributed storage and task execution units for storage, the plurality of distributed storage and task execution units being located at a corresponding plurality of sites;
detecting a storage failure corresponding to at least one of the plurality of slices corresponding to at least one of the plurality of the distributed storage and task execution units and at least one of the corresponding plurality of sites;
determining a foster storage approach;
selecting at least one alternative distributed storage and task execution unit in accordance with the foster storage approach;
generating at least one foster slice corresponding to the at least one of the plurality of slices; and
sending the at least one foster slice to the at least one alternative distributed storage and task execution unit.

### Claim 2 (depends on 1)

The method of claim 1 wherein determining the foster storage approach includes determining one of: a performance optimized mode, and a reliability optimized mode.

### Claim 3 (depends on 2)

The method of claim 2 wherein, when the foster storage approach corresponds to the performance optimized mode, the at least one alternative distributed storage and task execution unit is selected at the at least one of corresponding plurality of sites.

### Claim 4 (depends on 2)

The method of claim 2 wherein, when the foster storage approach corresponds to the reliability optimized mode, the at least one alternative distributed storage and task execution unit is selected at least one alternative site that is disassociated from the corresponding plurality of sites.

### Claim 5 (depends on 1)

The method of claim 1 further comprising:
updating slice location information corresponding to the input data when the at least one foster slice is successfully stored in the at least one alternative distributed storage and task execution unit.

### Claim 6 (depends on 1)

The method of claim 1 wherein detecting a storage failure corresponding to at least one of the plurality of slices includes at least one of: detecting a device failure in the at least one of the plurality of the distributed storage and task execution units; and detecting a communication failure to the at least one of the plurality of the distributed storage and task execution units.

### Claim 7 (depends on 1)

The method of claim 1 wherein the foster storage approach is determined based on at least one of: a predetermined mode selection; a vault identifier, a data type corresponding to the input data, an estimated time of storage of the input data, an estimated frequency of retrieval of the input data, a reliability requirement of the input data, and a retrieval performance requirement of the input data.

### Claim 8

A dispersed storage and task (DST) processing unit comprises:
at least one module, when operable within a computing device, that causes the computing device to:
encode input data into a plurality of slices;
send the plurality of slices to a plurality of distributed storage and task execution units for storage, the plurality of distributed storage and task execution units being located at a corresponding plurality of sites;
detect a storage failure corresponding to at least one of the plurality of slices corresponding to at least one of the plurality of the distributed storage and task execution units and at least one of the corresponding plurality of sites;
determine a foster storage approach;
select at least one alternative distributed storage and task execution unit in accordance with the foster storage approach;
generate at least one foster slice corresponding to the at least one of the plurality of slices; and
send the at least one foster slice to the at least one alternative distributed storage and task execution unit.

### Claim 9 (depends on 8)

The DST processing unit of claim 8 wherein determining the foster storage approach includes determining one of: a performance optimized mode, and a reliability optimized mode.

### Claim 10 (depends on 9)

The DST processing unit of claim 9 wherein, when the foster storage approach corresponds to the performance optimized mode, the at least one alternative distributed storage and task execution unit is selected at the at least one of corresponding plurality of sites.

### Claim 11 (depends on 9)

The DST processing unit of claim 9 wherein, when the foster storage approach corresponds to the reliability optimized mode, the at least one alternative distributed storage and task execution unit is selected at least one alternative site that is disassociated from the corresponding plurality of sites.

### Claim 12 (depends on 8)

The DST processing unit of claim 8 the at least one module, when operable within a computing device, further causes the computing device to:
update slice location information corresponding to the input data when the at least one foster slice is successfully stored in the at least one alternative distributed storage and task execution unit.

### Claim 13 (depends on 8)

The DST processing unit of claim 8 wherein detecting a storage failure corresponding to at least one of the plurality of slices includes at least one of: detecting a device failure in the at least one of the plurality of the distributed storage and task execution units; and detecting a communication failure to the at least one of the plurality of the distributed storage and task execution units.

### Claim 14 (depends on 8)

The DST processing unit of claim 8 wherein the foster storage approach is determined based on at least one of: a predetermined mode selection; a vault identifier, a data type corresponding to the input data, an estimated time of storage of the input data, an estimated frequency of retrieval of the input data, a reliability requirement of the input data, and a retrieval performance requirement of the input data.

### Claim 15

A computer readable storage medium comprises:
at least one memory section that stores operational instructions that, when executed by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), causes the one or more computing devices to:
encode input data into a plurality of slices;
send the plurality of slices to a plurality of distributed storage and task execution units for storage, the plurality of distributed storage and task execution units being located at a corresponding plurality of sites;
detect a storage failure corresponding to at least one of the plurality of slices corresponding to at least one of the plurality of the distributed storage and task execution units and at least one of the corresponding plurality of sites;
determine a foster storage approach;
select at least one alternative distributed storage and task execution unit in accordance with the foster storage approach;
generate at least one foster slice corresponding to the at least one of the plurality of slices; and
send the at least one foster slice to the at least one alternative distributed storage and task execution unit.

### Claim 16 (depends on 15)

The computer readable storage medium of claim 15 wherein determining the foster storage approach includes determining one of: a performance optimized mode, and a reliability optimized mode.

### Claim 17 (depends on 16)

The computer readable storage medium of claim 16 wherein, when the foster storage approach corresponds to the performance optimized mode, the at least one alternative distributed storage and task execution unit is selected at the at least one of corresponding plurality of sites.

### Claim 18 (depends on 16)

The computer readable storage medium of claim 16 wherein, when the foster storage approach corresponds to the reliability optimized mode, the at least one alternative distributed storage and task execution unit is selected at least one alternative site that is disassociated from the corresponding plurality of sites.

### Claim 19 (depends on 15)

The computer readable storage medium of claim 15 wherein detecting a storage failure corresponding to at least one of the plurality of slices includes at least one of: detecting a device failure in the at least one of the plurality of the distributed storage and task execution units; and
detecting a communication failure to the at least one of the plurality of the distributed storage and task execution units.

### Claim 20 (depends on 15)

The computer readable storage medium of claim 15 wherein the foster storage approach is determined based on at least one of: a predetermined mode selection; a vault identifier, a data type corresponding to the input data, an estimated time of storage of the input data, an estimated frequency of retrieval of the input data, a reliability requirement of the input data, and a retrieval performance requirement of the input data.
