Dispersed Storage Network Rebuilding Strategy

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current dispersed storage networks face challenges in efficiently rebuilding lost or corrupted data across geographically distributed storage units without redundant copies, leading to potential data loss and system inefficiencies.

Innovation Solution

The implementation of a dispersed storage network with a managing unit and integrity processing unit that employs error encoding techniques like Cauchy Reed-Solomon encoding, allowing data to be split into encoded slices stored across multiple sites, enabling data reconstruction from a subset of available slices without the need for redundant copies.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is stored using traditional redundant copying methods, then data availability is improved, but storage cost and system complexity increase

Engineering Contradiction:
Improvedata availabilityVSAvoidstorage capacity
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent segments data into multiple encoded slices using Cauchy Reed-Solomon encoding, distributing them across different storage units. This allows reconstruction of original data from any sufficient subset of slices, eliminating the need for complete redundant copies while maintaining data availability.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transforms data from its original form into encoded form through mathematical encoding functions. This parameter transformation enables the same amount of data to be stored more efficiently by creating inter-dependent slices that collectively represent the original data without requiring exact duplicates.

Inventive Principle:
Principle #35Parameter changes

2Ease of repair

If complete copies of data are maintained across all storage units, then data recovery is simplified, but rebuilding efficiency deteriorates when data loss occurs

Engineering Contradiction:
Improvedata recovery simplicityVSAvoidrebuilding efficiency
Core Design Contradiction:
Ease of repairVSProductivity

Solution Approach 1:

The patent performs preliminary encoding of data into multiple slices before storage, establishing the mathematical relationships between slices in advance. This preliminary action enables efficient rebuilding operations later, as the encoding structure allows any sufficient subset of slices to reconstruct the original data without requiring complex coordination between all storage units.

Inventive Principle:
Principle #10Preliminary action

3Quantity of substance

If data is encoded and distributed across multiple storage units, then storage efficiency is improved, but the complexity of data management increases

Engineering Contradiction:
Improvestorage efficiencyVSAvoiddata management complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent creates a universal encoding framework using Cauchy Reed-Solomon codes that can handle various data types and storage configurations. The same encoding mechanism works regardless of the number of storage units or the specific data being stored, simplifying management by providing a consistent approach rather than requiring different mechanisms for different scenarios.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS10558527B2Rebuilding strategy in memory managed multi-site duplication
Publication Date: 2020.02.11 PURE STORAGE INC
  • US10558527B2 patent drawing
  • US10558527B2 patent drawing
  • US10558527B2 patent drawing

AI summary

A method includes identifying encoded data slices in need of rebuilding, where the encoded data slices are of plurality of copies of a set of encoded data slices stored in a plurality of sets of storage units of a plurality of dispersed storage network (DSN) memories. The method further includes determining a rebuilding strategy for the encoded data slices in need of rebuilding based on at least one of an urgency rebuild factor and a rebuild complexity factor. For a first encoded data slice of the encoded data slices in need of rebuilding, the method includes implementing a rebuild of the first encoded data slice in accordance with the rebuilding strategy to produce a rebuilt first encoded data slice, and sending the rebuilt first encoded data slice to a first storage unit of one of the plurality of sets of storage units.