# US 2017/0286226 A1 · Maintaining storage thresholds in a distributed storage network

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

- Number: US 2017/0286226 A1
- Document ID: US20170286226A1
- Status: Published application
- Kind: A1
- Application number: 15/399,871
- Filed: 2017-01-06
- Published: 2017-10-05
- Earliest claimed: 2016-03-29
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Greg R. Dhuse; Ravi V. Khadiwala; Jason K. Resch; Ilya Volvovski
- Web page: https://patentgrep.com/patent/US20170286226A1

## CPC

- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 3/061: {Improving I/O performance}
- G06F 3/0611: {in relation to response time}
- G06F 3/0631: {by allocating resources to storage systems}
- G06F 3/0635: {by changing the path, e.g. traffic rerouting, path reconfiguration}
- G06F 3/064: {Management of blocks}
- G06F 3/0644: {Management of space entities, e.g. partitions, extents, pools}
- G06F 3/0647: {Migration mechanisms}
- G06F 3/0659: {Command handling arrangements, e.g. command buffers, queues, command scheduling}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 8/65: Updates (security arrangements therefor G06F21/57)
- G06F 9/485: {Task life-cycle, e.g. stopping, restarting, resuming execution (G06F9/4881 takes precedence)}
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F 11/1092: {Rebuilding, e.g. when physically replacing a failing disk}
- G06F 21/31: User authentication
- H03M 13/05: using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits {(H03M13/2906 takes precedence)}
- H04L 61/10: of different types
- H04L 61/50: Address allocation
- H04L 63/08: {for authentication of entities (cryptographic mechanisms or cryptographic arrangements for entity authentication H04L9/32)}
- H04L 63/104: {Grouping of entities}
- H04L 63/108: {when the policy decisions are valid for a limited amount of time}
- 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]
- H04L 67/56: Provisioning of proxy services (store-and-forward switching systems in data switching networks H04L12/54)
- G06F 2221/2133: Verifying human interaction, e.g., Captcha
- H03M 13/1515: {Reed-Solomon 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}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method begins by a processing module of a dispersed storage network (DSN), in response to issuing a write slice request for a send threshold number of encoded data slices (EDSs) to a set of storage units, receiving access responses from the set of storage units. The method continues with the processing module receiving less than a send threshold number of access responses within a first predetermined amount of time and issuing one or more additional write slice requests to one or more storage units of the set of storage units. When a send threshold number of EDSs have been stored in storage units of the set of storage units the method continues by determining a preservation threshold number of EDSs, where the preservation threshold number of EDSs is a number of EDSs of the set of EDSs that will be stored for at least a second predetermined amount of time, and the preservation threshold number of EDSs is less than the send threshold number of EDSs.

## 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 a data segment to produce a set of encoded data slices (EDSs), wherein a decode threshold number of EDSs of the set of EDSs is required to recover the data segment;
issuing a write slice request for a send threshold number of EDSs to storage units of a set of storage units, wherein the send threshold number of EDSs is the number of EDSs slices that are transmitted by the one or more computing devices of the DSN in an initial write slice request;
determining a preservation threshold number of EDSs, wherein the preservation threshold number of EDSs is a number of EDSs of the set of EDSs that will be stored for at least a first predetermined amount of time, wherein the preservation threshold number of EDSs is less than the send threshold number of EDSs;
receiving a plurality of access responses from the storage units of a set of storage units; and
when receiving less than a preservation threshold number of access responses within a second predetermined amount of time, issuing one or more additional write slice requests to one or more storage units of the set of storage units, wherein the preservation threshold number of access responses is equal to the preservation threshold number of EDSs.

### Claim 2 (depends on 1)

The method of claim 1, wherein the send threshold number of EDSs is less than an Information Dispersal Algorithm (IDA) width.

### Claim 3 (depends on 1)

The method of claim 1, further comprising: based on a change to the DSN, changing the number of EDSs of the preservation threshold number of EDSs.

### Claim 4 (depends on 3)

The method of claim 3, wherein the change to the DSN is a change in a DSN traffic rate.

### Claim 5 (depends on 3)

The method of claim 3, wherein the change to the DSN is a change in system performance of the DSN.

### Claim 6 (depends on 1)

The method of claim 1 further comprises: generating, by the one or more processing modules of one or more computing devices of the DSN, one or more additional sets of encoded data slices and sending the additional sets of encoded data slices to a second distributed storage unit of the DSN when a first distributed storage unit has a performance below a predetermined performance level.

### Claim 7 (depends on 1)

The method of claim 1, wherein the first predetermined amount of time is based on a long-term storage of the preservation threshold number of EDSs.

### Claim 8

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 a data segment to produce a set of encoded data slices (EDSs), wherein a decode threshold number of EDSs of the set of EDSs is required to recover the data segment;
determining a preservation threshold number of EDSs, wherein the preservation threshold number of EDSs is a number of EDSs of the set of EDSs that will be stored for at least a predetermined amount of time;
storing a preservation threshold number of EDSs in storage units of a set of storage units;
detecting that a number of EDSs stored in storage units of the set of storage units is less than or equal to a delayed rebuild threshold number of EDSs, wherein the delayed rebuild threshold number of EDSs is equal to or greater than the decode threshold number EDS; and
when a number of EDSs stored in storage units of the set of storage units is less than or equal to the delayed rebuild threshold number of EDSs; initiating the rebuild of one or more EDSs, such that the number of EDSs stored in storage units of the set of storage units is equal to or greater than the preservation threshold number of EDSs.

### Claim 9 (depends on 8)

The method of claim 8 further comprises: rebuilding, by the one or more processing modules of one or more computing devices of the DSN, one or more missing encoded data slices of the set of encoded data slices and sending one or more write slice requests to one or more storage units of the set of storage units.

### Claim 10 (depends on 9)

The method of claim 9, wherein each of the one or more write slice requests includes the rebuilt one or more missing encoded data slices of the set of encoded data slices.

### Claim 11 (depends on 10)

The method of claim 10 further comprises:
receiving one or more access responses from the one or more storage units of the set of storage units;
based on the access responses, determining a number of successfully stored encoded data slices of the set of EDSs; and
continuing to store the rebuilt one or more missing encoded data slices until the preservation threshold number of EDSs is successfully stored.

### Claim 12 (depends on 9)

The method of claim 9, wherein one or more of the rebuilt one or more missing encoded data slices of the set of encoded data slices is stored in a second premises, wherein the second premises is remotely located from a first premises, and the first premises is a location of the EDSs transmitted by the one or more computing devices of the DSN in an initial write slice request.

### Claim 13 (depends on 12)

The method of claim 12 further comprises: when detecting that the number of EDSs stored in the first location is less than or equal to a delayed rebuild threshold number of EDSs, transmitting one or more EDSs from the second premises to the first premises.

### Claim 14 (depends on 8)

The method of claim 8, wherein a difference between the preservation threshold number of EDSs and the rebuild threshold number of EDSs comprises a Rebuild Traffic Reduction Factor (RTRF) and the RTRF is used by the one or more processing modules of one or more computing devices of the DSN to manage DNS traffic.

### Claim 15

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 a data segment to produce a set of encoded data slices (EDSs), wherein a decode threshold number of EDSs of the set of EDSs is required to recover the data segment;
determining a plurality of parameters and a plurality of parameter values for storing the EDSs, wherein each parameter has a corresponding parameter value;
sending one or more write slice data requests to a first plurality of distributed storage units within the DSN, wherein the one or more write slice data requests include one or more parameter values of the plurality of parameter values for storing the EDSs;
wherein the parameter values for storing the EDSs comprise:
a parameter value of EDSs required by dispersed error encoding parameters;
a parameter value of EDSs to be stored longer than a predetermined period of time;
a parameter value of EDSs to be transmitted by the DSN based on an initial write request;
a parameter value of a maximum number of EDSs that can be transmitted by the plurality of distributed storage units;
wherein the parameter value for EDSs to be transmitted by the DSN based on an initial write request is greater than or equal to the parameter value of EDSs to be stored longer than a predetermined period of time; and
wherein the parameter value of a maximum number of EDSs that can be transmitted by the plurality of distributed storage units is greater than or equal to the parameter value for EDSs to be transmitted by the DSN based on an initial write request.

### Claim 16 (depends on 15)

The method of claim 15, wherein the plurality of parameter values, other than the parameter value of the maximum number of encoded data slices that can be transmitted by the plurality of distributed storage units distributed storage units, are a minimum threshold number.

### Claim 17 (depends on 15)

The method of claim 15, wherein the maximum number of encoded data slices that can be transmitted by the plurality of distributed storage units is equal to an Information Dispersal Algorithm (IDA) width.

### Claim 18 (depends on 15)

The method of claim 15, further comprising: modifying the parameter values for storing the encoded data slices, based on a change to the DSN.

### Claim 19 (depends on 18)

The method of claim 18, wherein the change to the DSN is a change in a DSN traffic rate.

### Claim 20 (depends on 18)

The method of claim 18, wherein the change to the DSN is a change in system performance of the DSN.
