Abstract: A method includes identifying traits associated with a number of storage units of a storage network to produce identified traits. The method further includes determining a plurality of sets of storage pool traits based on the identified traits, where a first set of storage pool traits of the plurality of sets of storage pool traits has a common trait of the identified traits. The method further includes selecting a plurality of groups of storage units from the number of storage units based on the plurality of sets of storage pool traits. The method further includes selecting a storage unit from each of the plurality of groups of storage units in accordance with a selection approach to produce a storage set of selected storage units. The method further includes utilizing the storage set of selected storage units for storing data in the storage network.

Abstract: A method for execution by a storage network starts by maintaining loading and data access rate information for a storage node and estimating a future data access rate for the storage node. The method continues by determining a probability level of potential future data loss, based on the estimated future data access rate and in response to a determination that the probability level of potential future data loss compares unfavorably to a maximum probability of data loss threshold level the method continues by facilitating migration of at least a portion of data stored on the storage node for temporary storage in another storage node of the storage network.

Abstract: A method includes identifying traits associated with a number of storage units of a storage network to produce identified traits. The method further includes determining a plurality of sets of storage pool traits based on the identified traits, where a first set of storage pool traits of the plurality of sets of storage pool traits has a common trait of the identified traits. The method further includes selecting a plurality of groups of storage units from the number of storage units based on the plurality of sets of storage pool traits. The method further includes selecting a storage unit from each of the plurality of groups of storage units in accordance with a selection approach to produce a storage set of selected storage units. The method further includes utilizing the storage set of selected storage units for storing data in the storage network.

Abstract: A method for execution by a storage network, the method begins by determining a failure rate of storage nodes of an active storage pool, establishing a number of standby storage nodes based on the determined failure rate, identifying resource identifiers for the failed storage node, selecting an available standby storage node, facilitating populating the selected available standby storage node with data slices associated with the failed storage node, utilizing the selected available standby storage node, facilitating population of a replacement storage node with the data slices from the selected available standby storage node and facilitating processing of further receive data access requests for data associated with the associated resource identifiers by utilizing the replacement storage node.

Abstract: A method for execution by a storage network, the method begins by determining a failure rate of storage nodes of an active storage pool, establishing a number of standby storage nodes based on the determined failure rate, identifying resource identifiers for the failed storage node, selecting an available standby storage node, facilitating populating the selected available standby storage node with data slices associated with the failed storage node, utilizing the selected available standby storage node, facilitating population of a replacement storage node with the data slices from the selected available standby storage node and facilitating processing of further receive data access requests for data associated with the associated resource identifiers by utilizing the replacement storage node.

Abstract: A computing device includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and processing circuitry operably coupled to the interface and to the memory. The processing circuitry is configured to execute the operational instructions to perform various operations and functions. The computing device detects a potentially unauthorized access to a storage unit (SU) of a set of storage units (SUs) that distributedly stores a set of encoded data slices (EDSs) associated with a data object. The computing device issues access information to at least some other SUs based on the potentially unauthorized access to the SU that is detected. The computing device initiates a first unauthorized abatement process for the SU and/or a second unauthorized access abatement process for a first other SU based on receipt of other access information.

Abstract: Methods and apparatus for isolating the introduction of software defects in a dispersed storage network (DSN) are disclosed. In various embodiments, a search strategy is employed whereby after identifying a test failure in a current version of the memory software code, a sequence of interim versions of the code between the current version of the memory software code and a previous successfully tested version of the code is determined. A first version of the memory software code is selected from the sequence of interim versions (e.g., from the middle of or approximately in the middle of the sequence) and tested. When testing of the first version does not result in a test failure, a second version of the memory software code is tested, the second version selected from a sub-sequence of the sequence of interim versions between the first version of the code and the current version of the code.

Abstract: A method for execution by a dispersed storage and task (DST) processing unit that includes a processor includes generating storage unit heat data based on a plurality of temperature readings received from each of a plurality of storage units, where the storage unit heat data indicates a first hot storage unit. A pair of storage units is selected from the plurality of storage units based on the storage unit heat data, where the pair of storage units includes the first hot storage unit and a second storage unit. A data swap request is generated for transmission to the pair of storage units, where the data swap request includes an instruction to transfer at least one first data slice from the first hot storage unit to the second storage unit and to transfer at least one second data slice from the second storage unit to the first hot storage unit.

Abstract: A method for execution by a storage unit of a dispersed storage network includes receiving an access request from a requestor. An access anomaly of the access request is detected, and the access request is queued for processing in response. An anomaly detection indicator is issued to a plurality of other storage units. A secondary authentication process is initiated with the requestor, and a secondary authentication response from the requestor. The access request is processed when the secondary authentication response is favorable.

Abstract: A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method begins by maintaining dispersed storage network (DSN) storage and maintenance loading information. The method continues by estimating a future data access task rate and determining a probability level of potential future data loss based on the estimated future data access task rate. The method continues, when the probability level of the potential future data loss compares unfavorably to a maximum probability of data loss threshold level, by facilitating execution of a preventative data loss mitigation process and when a current data access task rate is greater than a maximum task rate level, suspending the execution of the preventative data loss mitigation process.

Abstract: A method begins by receiving a storage request to store one or more portions of a data object and determining whether the one or more portions are stored within a dispersed storage network memory. When stored, the method continues by determining a retrieval demand for a portion of the one or more portions. When below a first threshold, the method continues by indicating that an existing copy of the one or more portions will be used for retrieval requests for the one or more portions. When above the first threshold, the method continues by copying the existing copy to create a first one or more portion copies and indicating the one or more portions will be used for retrieval requests from a first group of user computing devices and indicating the first one or more portion copies will be used for retrieval requests from a second group.

Abstract: A method for execution by a dispersed storage network (DSN), the method begins by determining a failure rate of storage units of an active storage unit pool, establishing a number of standby storage units based on the determined failure rate, identifying an associated DSN address range of the failed storage unit, selecting an available standby storage unit, facilitating populating the selected available standby storage unit with data slices associated with the failed storage unit, utilizing the selected available standby storage unit, facilitating population of a replacement storage unit with the data slices from the selected available standby storage unit and facilitating processing of further receive data access requests for data associated with the associated DSN address range by utilizing the replacement storage unit.

Abstract: Methods and apparatus for isolating the introduction of software defects in a dispersed storage network (DSN) are disclosed. In various embodiments, a search strategy is employed whereby after identifying a test failure in a current version of the memory software code, a sequence of interim versions of the code between the current version of the memory software code and a previous successfully tested version of the code is determined. A first version of the memory software code is selected from the sequence of interim versions (e.g., from the middle of or approximately in the middle of the sequence) and tested. When testing of the first version does not result in a test failure, a second version of the memory software code is tested, the second version selected from a sub-sequence of the sequence of interim versions between the first version of the code and the current version of the code.

Abstract: A method for execution by a dispersed storage and task (DST) processing unit that includes a processor includes generating storage unit heat data based on a plurality of temperature readings received from each of a plurality of storage units, where the storage unit heat data indicates a first hot storage unit. A pair of storage units is selected from the plurality of storage units based on the storage unit heat data, where the pair of storage units includes the first hot storage unit and a second storage unit. A data swap request is generated for transmission to the pair of storage units, where the data swap request includes an instruction to transfer at least one first data slice from the first hot storage unit to the second storage unit and to transfer at least one second data slice from the second storage unit to the first hot storage unit.

Abstract: A dispersed storage network facilitates isolating the introduction of software defects in dispersed storage units. A search strategy is employed whereby after identifying a test failure in a current version of the memory software code, a code version since a previous successfully tested version is identified. An interim version that represents the point at which approximately one half the changes were introduced is then tested. When there is a test failure, the next interim version selected for testing represents the point at which approximately one half the changes were introduced between the first interim version tested and the current version. If no failure, a next interim version is tested that represents the point at which approximately one half the changes were introduced between the previous successfully tested version and the first interim version tested.

Abstract: A method for execution by a dispersed storage and task (DST) processing unit that includes a processor includes generating storage unit heat data based on a plurality of temperature readings received from each of a plurality of storage units, where the storage unit heat data indicates a first hot storage unit. A pair of storage units is selected from the plurality of storage units based on the storage unit heat data, where the pair of storage units includes the first hot storage unit and a second storage unit. A data swap request is generated for transmission to the pair of storage units, where the data swap request includes an instruction to transfer at least one first data slice from the first hot storage unit to the second storage unit and to transfer at least one second data slice from the second storage unit to the first hot storage unit.

Abstract: A method begins by receiving a storage request to store one or more portions of a data object and determining whether the one or more portions are stored within a dispersed storage network memory. When stored, the method continues by determining a retrieval demand for a portion of the one or more portions. When below a first threshold, the method continues by indicating that an existing copy of the one or more portions will be used for retrieval requests for the one or more portions. When above the first threshold, the method continues by copying the existing copy to create a first one or more portion copies and indicating the one or more portions will be used for retrieval requests from a first group of user computing devices and indicating the first one or more portion copies will be used for retrieval requests from a second group.

Abstract: A method begins by receiving a storage request to store one or more portions of a data object. The method continues by determining whether the one or more portions are stored within a dispersed storage network memory. When stored, the method continues by determining a retrieval demand for each portion. When the retrieval demand for a first portion is below a first threshold, the method continues by indicating that an existing copy of the first portion will be used for retrieval requests of the first portion. When the retrieval demand is above the first threshold, the method continues by copying the existing copy to create a first portion copy and indicating that the existing copy will be used for retrieval requests from a first group of user computing devices and indicating that the first portion copy will be used for retrieval requests from a second group of user computing devices.

Abstract: A computing device includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and processing circuitry operably coupled to the interface and to the memory. The processing circuitry is configured to execute the operational instructions to perform various operations and functions. The computing device detects a potentially unauthorized access to a storage unit (SU) of a set of storage units (SUs) that distributedly stores a set of encoded data slices (EDSs) associated with a data object. The computing device issues access information to at least some other SUs based on the potentially unauthorized access to the SU that is detected. The computing device initiates a first unauthorized abatement process for the SU and/or a second unauthorized access abatement process for a first other SU based on receipt of other access information.

Abstract: A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method begins by maintaining dispersed storage network (DSN) storage and maintenance loading information. The method continues by estimating a future data access task rate and determining a probability level of potential future data loss based on the estimated future data access task rate. The method continues, when the probability level of the potential future data loss compares unfavorably to a maximum probability of data loss threshold level, by facilitating execution of a preventative data loss mitigation process and when a current data access task rate is greater than a maximum task rate level, suspending the execution of the preventative data loss mitigation process.