Dynamic Dispersal Parameter Adjustment in Dispersed Storage Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Dispersed storage networks face challenges in managing write conflicts and ensuring data integrity across geographically distributed storage units, particularly in maintaining data availability and security without redundant copies.

Innovation Solution

The implementation of a dispersed storage network with a managing unit, integrity processing unit, and computing devices that utilize error encoding and decoding techniques like Cauchy Reed-Solomon encoding to distribute data into encoded slices, ensuring data integrity and availability through dynamic adjustment of dispersal parameters based on storage conditions.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If data is stored in a dispersed storage network without redundant copies, then storage efficiency and security are improved, but data availability and integrity are worsened

Engineering Contradiction:
Improvestorage efficiencyVSAvoiddata availability
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

The patent divides data into multiple encoded slices using error correction codes (such as Reed-Solomon or Cauchy Reed-Solomon). Each slice is independently stored in different storage units, allowing the system to maintain data availability even when some storage units fail. This segmentation enables efficient storage while ensuring reliability through distributed redundancy.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent dynamically adjusts dispersal parameters (such as the number of slices, slice size, and error correction levels) based on storage conditions and availability. This allows the system to optimize the balance between storage efficiency and data availability by adapting to changing network conditions and storage unit statuses.

Inventive Principle:
Principle #35Parameter changes

2Adaptability or versatility

If dynamic adjustment of dispersal parameters is implemented, then adaptability to storage conditions is improved, but system complexity is worsened

Engineering Contradiction:
Improveadaptability to storage conditionsVSAvoidsystem complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent incorporates feedback mechanisms where the system continuously monitors storage conditions, availability, and performance metrics. Based on this feedback, the system automatically adjusts dispersal parameters to optimize data distribution. This feedback loop enables adaptability while managing complexity through automated decision-making.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent implements dynamic parameter adjustment where dispersal parameters are not fixed but can change based on real-time storage conditions. The system can dynamically re-distribute data slices, adjust error correction levels, and modify storage strategies to adapt to changing availability and performance characteristics of storage units.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS10057351B2Modifying information dispersal algorithm configurations in a dispersed storage network
Publication Date: 2018.08.21 PURE STORAGE INC
  • US10057351B2 patent drawing
  • US10057351B2 patent drawing
  • US10057351B2 patent drawing

AI summary

A method for execution by a dispersed storage (DS) client module includes receiving a write request for a first data object. A set of storage units associated with the first data object are identified, and an availability level is determined. The DS client module determines to modify dispersal parameters associated with the set based on the availability level, and modified dispersal parameters are determined based on current dispersal parameters and the availability level. Encoded slices are generated by performing an encoding function on the first data object using the modified dispersal parameters, and the slices are sent to the storage units. A second data object stored in the identified set of storage units is recovered by utilizing the current dispersal parameters. Encoded slices are generated by performing an encoding function on the second data object using the modified dispersal parameters, and the slices are sent to the storage units.