# US 2017/0286222 A1 · Allocating data for storage by utilizing a location-based hierarchy in a dispersed 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/0286222 A1
- Document ID: US20170286222A1
- Status: Published application
- Kind: A1
- Application number: 15/232,147
- Filed: 2016-08-09
- Published: 2017-10-05
- Earliest claimed: 2016-03-29
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Jason K. Resch
- Web page: https://patentgrep.com/patent/US20170286222A1

## CPC

- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 3/061: {Improving I/O performance}
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- 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/0653: {Monitoring storage devices or systems}
- 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 11/1092: {Rebuilding, e.g. when physically replacing a failing disk}
- G06F 11/1662: {the resynchronized component or unit being a persistent storage device (re-synchronization of failed mirror storage G06F11/2082; rebuild or reconstruction of parity RAID storage G06F11/1008)}
- 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)}
- G06F 11/3051: {Monitoring arrangements for monitoring the configuration of the computing system or of the computing system component, e.g. monitoring the presence of processing resources, peripherals, I/O links, software programs (verification or detection of system hardware configuration G06F11/2247)}
- G06F 11/3684: {for test design, e.g. generating new test cases}
- G06F 11/3688: {for test execution, e.g. scheduling of test suites}
- G06F 11/3692: {for test results analysis}
- H03M 13/1515: {Reed-Solomon codes}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- 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 2201/805: Real-time
- G06F 2201/82: Solving problems relating to consistency
- 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}
- 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 for execution by a dispersed storage and task (DST) processing unit includes generating storage allocation data indicating a subset of a plurality of storage units based on storage location hierarchy data and an information dispersal algorithm (IDA) width. A plurality of write requests corresponding to each storage unit in the first subset are generated for transmission via a network, where each of the plurality of write requests includes one of a plurality of encoded slices of a data object.

## Claims

### Claim 1

A method for execution by a dispersed storage and task (DST) processing unit that includes a processor, the method comprises:
generating storage allocation data indicating a first subset of a plurality of storage units based on storage location hierarchy data and an information dispersal algorithm (IDA) width; and
generating a first plurality of write requests corresponding to each storage unit in the first subset for transmission via a network, wherein each of the first plurality of write requests includes one of a plurality of encoded slices of a data object.

### Claim 2 (depends on 1)

The method of claim 1, further comprising generating the storage location hierarchy data based on a decentralized agreement protocol (DAP).

### Claim 3 (depends on 1)

The method of claim 1, wherein generating the storage allocation data is further based on a desired number of data locations and a location-based width, wherein the first subset of the plurality of storage units includes a plurality of location-based subsets based on the desired number of data locations, each corresponding to a distinct one of a plurality of data locations, wherein the size of each of the plurality of location-based subsets is based on the location-based width, and wherein each of the plurality of location-based subsets includes storage units located at the corresponding distinct one of the plurality of unique data locations.

### Claim 4 (depends on 3)

The method of claim 3, further comprising calculating the location-based width by dividing the IDA width by the desired number of data locations.

### Claim 5 (depends on 3)

The method of claim 3, wherein the desired number of data locations corresponds to the size of a set of desired data locations, and wherein the set of desired data locations includes the plurality of data locations.

### Claim 6 (depends on 5)

The method of claim 5, wherein the set of desired data locations includes a plurality of data centers.

### Claim 7 (depends on 5)

The method of claim 5, further comprising selecting the set of desired data locations based on location parameter data received via the network.

### Claim 8 (depends on 7)

The method of claim 7, wherein the location parameter data includes location weight data indicating at least one location weight corresponding to at least one of: at least one region, at least one city, or at least one data center, wherein a distribution of the plurality of data locations in the set of desired data locations is based on the location weight data.

### Claim 9 (depends on 3)

The method of claim 3, wherein each of the plurality of location-based subsets corresponds to a distinct one of a plurality of regions, wherein each of the plurality of location-based subsets further includes a plurality of city-based subsets, each corresponding to a distinct one of a plurality of cities located in the distinct one of the plurality of regions, wherein each of the plurality of city-based subsets includes a plurality of center-based subsets, each corresponding to a distinct one of a plurality of data centers located in the distinct one of the plurality of cities, and wherein the location-based subsets, city-based subsets, and center-based subsets are selected based on the storage location hierarchy data.

### Claim 10 (depends on 9)

The method of claim 9, wherein the number of location-based subsets is based on region-based width corresponding to a desired number of regions, wherein the number of city-based subsets in each of the plurality of location-based subsets is based on a city-based width corresponding to a desired number of cities in each region, wherein the number of center-based subsets in each of the plurality of city-based subsets each of the center-based subsets is based on a center-based width corresponding to a desired number of data centers in each city, and wherein the size of each of the plurality of center-based subsets is based on a storage-unit based width corresponding to a desired number of storage units in each data center.

### Claim 11 (depends on 10)

The method of claim 10, wherein at least one of: the desired number of regions, the desired number of cities in each region, the desired number of data centers in each city, or the desired number of storage units in each data center is calculated based on a decentralized agreement protocol (DAP).

### Claim 12 (depends on 10)

The method of claim 10, further comprising receiving width parameter data via the network that indicates at least one of: the desired number of regions, the desired number of cities in each region, the desired number of data centers in each city, or the desired number of storage units in each data center.

### Claim 13 (depends on 10)

The method of claim 10, wherein the product of the desired number of regions, the desired number of cities in each region, the desired number of data centers in each city, and the desired number of storage units in each data center is greater than or equal to the IDA width.

### Claim 14 (depends on 1)

The method of claim 1, further comprising:
generating reassignment data in response to a change in the storage location hierarchy data, wherein the reassignment data indicating a mapping of the plurality of encoded slices to a new subset of a second plurality of storage units based on the change in the storage location hierarchy data; and
generating a second plurality of write requests corresponding to each storage unit in the new subset for transmission via the network, wherein each of the second plurality of write requests includes one of the plurality of encoded slices of a data object based on the reassignment data.

### Claim 15

A processing system of a dispersed storage and task (DST) processing unit comprises:
at least one processor;
a memory that stores operational instructions, that when executed by the at least one processor cause the processing system to:
generate storage allocation data indicating a first subset of a plurality of storage units based on storage location hierarchy data and an information dispersal algorithm (IDA) width; and
generate a first plurality of write requests corresponding to each storage unit in the first subset for transmission via a network, wherein each of the first plurality of write requests includes one of a plurality of encoded slices of a data object.

### Claim 16 (depends on 15)

The processing system of claim 15, wherein the operational instructions, when executed by the at least one processor, further cause the processing system to generate the storage location hierarchy data based on a decentralized agreement protocol (DAP).

### Claim 17 (depends on 15)

The processing system of claim 15, wherein generating the storage allocation data is further based on a desired number of data locations and a location-based width, wherein the first subset of the plurality of storage units includes a plurality of location-based subsets based on the desired number of data locations, each corresponding to a distinct one of a plurality of data locations, wherein the size of each of the plurality of location-based subsets is based on the location-based width, and wherein each of the plurality of location-based subsets includes storage units located at the corresponding distinct one of the plurality of unique data locations.

### Claim 18 (depends on 17)

The processing system of claim 17, wherein the operational instructions, when executed by the at least one processor, further cause the processing system to calculate the location-based width by dividing the IDA width by the desired number of data locations.

### Claim 19 (depends on 17)

The processing system of claim 17, wherein each of the plurality of location-based subsets corresponds to a distinct one of a plurality of regions, wherein each of the plurality of location-based subsets further includes a plurality of city-based subsets, each corresponding to a distinct one of a plurality of cities located in the distinct one of the plurality of regions, wherein each of the plurality of city-based subsets includes a plurality of center-based subsets, each corresponding to a distinct one of a plurality of data centers located in the distinct one of the plurality of cities, and wherein the location-based subsets, city-based subsets, and center-based subsets are selected based on the storage location hierarchy data.

### Claim 20

A non-transitory computer readable storage medium comprises:
at least one memory section that stores operational instructions that, when executed by a processing system of a dispersed storage network (DSN) that includes a processor and a memory, causes the processing system to:
generate storage allocation data indicating a first subset of a plurality of storage units based on storage location hierarchy data and an information dispersal algorithm (IDA) width; and
generate a first plurality of write requests corresponding to each storage unit in the first subset for transmission via a network, wherein each of the first plurality of write requests includes one of a plurality of encoded slices of a data object.
