Encoded Slice Rebuilding in Dispersed Storage Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current dispersed storage networks face challenges in maintaining data integrity and availability due to storage unit failures without the need for redundant copies, and they lack efficient mechanisms for secure and long-term data storage across geographically diverse locations.

Innovation Solution

A dispersed storage network (DSN) architecture that employs error encoding using Cauchy Reed-Solomon encoding, distributing data into encoded slices stored across multiple geographically diverse storage units, with a managing unit for error correction and integrity processing to rebuild 'bad' or missing slices, ensuring data recovery and security.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is stored using traditional redundant copying methods, then data availability is improved, but storage efficiency deteriorates due to duplicate data occupying additional space

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

Solution Approach 1:

The patent segments data into multiple slices and disperses them across different storage units using information dispersal algorithms. Instead of storing complete redundant copies, the system divides data into N slices where only K slices are needed for reconstruction, achieving both space efficiency and data availability through mathematical encoding rather than simple duplication

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system changes the storage parameter from binary (original copy or duplicate copy) to continuous mathematical representations through information dispersal algorithms. Data is transformed into encoded slices with specific mathematical relationships, allowing flexible reconstruction thresholds and optimized storage utilization based on reliability requirements

Inventive Principle:
Principle #35Parameter changes

2Reliability

If data is dispersed across geographically diverse storage units, then system reliability is improved, but data retrieval complexity increases

Engineering Contradiction:
Improvesystem reliabilityVSAvoiddata retrieval complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The system implements feedback mechanisms where storage units report their status and data integrity information to coordinating entities. This enables dynamic tracking of slice locations and conditions, allowing the system to automatically select optimal storage units for retrieval operations and maintain simplified access patterns despite geographic dispersion

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent introduces intermediary components such as gateway entities and coordinating servers that manage the complexity of dispersed storage. These intermediaries handle slice reconstruction logic, coordinate between geographically distributed units, and present simplified interfaces to users, isolating retrieval complexity from end users while maintaining high reliability

Inventive Principle:
Principle #24Intermediary (Mediator)

3Reliability

If error correction encoding is applied to data, then data integrity is improved, but processing overhead increases

Engineering Contradiction:
Improvedata integrityVSAvoidprocessing overhead
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system performs error correction encoding in advance during the data ingestion phase, transforming original data into encoded slices before storage. This preliminary action ensures that data integrity protection is built-in from the start, eliminating the need for complex real-time error correction during retrieval operations and reducing processing overhead when data is accessed

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10248361B2Rebuilding slices in a dispersed storage network
Publication Date: 2019.04.02 PURE STORAGE INC
  • US10248361B2 patent drawing
  • US10248361B2 patent drawing
  • US10248361B2 patent drawing

AI summary

A method for use in a dispersed storage network operates to select a recovery of selected ones of one or more first sets of encoded data slices in response to detecting a storage error associated with the selected ones of the one or more first sets of encoded data slices; issue requests for a second decode threshold number of encoded data slices of selected ones of one or more second sets of encoded data slices corresponding to the selected ones of the one or more first sets of encoded data slices; decode the second decode threshold number of encoded data slices to produce recovered data in response to receiving the second decode threshold number of encoded data slices; encode the recovered data utilizing first IDA parameters associated with the first IDA to produce one or more rebuilt encoded data slices corresponding to the selected ones of the one or more first sets of encoded data slices; and facilitate storage of the one or more rebuilt encoded data slices.