Slice Migration in Dispersed Storage Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current distributed storage systems face challenges in maintaining data integrity and security, particularly in scenarios where multiple storage unit failures occur, as they often require redundant copies and are vulnerable to unauthorized access.

Innovation Solution

A dispersed storage network (DSN) utilizing a managing unit, integrity processing unit, and computing devices with a dispersed storage client module, which employs error encoding techniques like Cauchy Reed-Solomon encoding to distribute data across multiple storage units, ensuring data recovery and security through slice naming and verification processes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is stored using traditional distributed storage systems with redundant copies, then data availability is improved, but security against unauthorized access deteriorates and vulnerability to attacks increases

Engineering Contradiction:
Improvedata availabilityVSAvoidunauthorized access vulnerability
Core Design Contradiction:
ReliabilityVSObject-affected harmful factors

Solution Approach 1:

The patent segments data into multiple encoded slices distributed across different storage units. Each slice is encrypted and requires a threshold number of slices to reconstruct the original data. This segmentation approach maintains data availability while enhancing security, as unauthorized access to individual slices does not compromise the entire dataset.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent employs error encoding techniques that transform data into multiple parameter representations (encoded slices). By changing the parameter space in which data is stored, the system achieves both redundancy for availability and cryptographic security against unauthorized access, as the encoded form does not reveal meaningful information without proper decoding.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If multiple redundant copies of data are maintained, then data recovery from failures is improved, but storage space efficiency deteriorates

Engineering Contradiction:
Improvedata recovery capabilityVSAvoidstorage space consumption
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent uses error encoding to create multiple copies of encoded data slices rather than direct redundant copies of the original data. This allows the system to achieve data recovery capability with more efficient storage utilization, as the encoded slices are mathematical transformations that occupy less space than full redundant copies while maintaining the ability to reconstruct original data.

Inventive Principle:
Principle #26Copying

Solution Approach 2:

By transforming data into encoded parameter representations distributed across storage units, the patent achieves efficient storage utilization. The encoded form allows for compact representation while maintaining full data recovery capability through mathematical reconstruction algorithms.

Inventive Principle:
Principle #35Parameter changes

3Object-affected harmful factors

If data is encrypted and segmented into multiple slices, then security against unauthorized access is improved, but complexity of data reconstruction deteriorates

Engineering Contradiction:
Improveunauthorized access resistanceVSAvoiddata reconstruction complexity
Core Design Contradiction:
Object-affected harmful factorsVSDevice complexity

Solution Approach 1:

The patent incorporates verification mechanisms that provide feedback during the data reconstruction process. The system verifies that the threshold number of slices are present and valid before attempting reconstruction, and uses checksums or authentication tags to ensure data integrity. This feedback approach simplifies the overall complexity by providing clear validation points rather than requiring complex error detection throughout the entire reconstruction process.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The encoded slices contain embedded metadata and verification information that enable self-verification during reconstruction. The system automatically identifies which slices are needed, validates their authenticity, and performs reconstruction without requiring complex external coordination, thereby reducing operational complexity.

Inventive Principle:
Principle #25Self-service

4Manufacturing precision

If slice verification and integrity checking are performed, then data integrity is improved, but processing time deteriorates

Engineering Contradiction:
Improvedata integrityVSAvoidverification processing time
Core Design Contradiction:
Manufacturing precisionVSLoss of time

Solution Approach 1:

The patent performs integrity verification in advance by embedding authentication tags and checksums in the encoded slices during the encoding phase. This preliminary action allows for rapid verification during data access, as the pre-computed verification data can be quickly checked without requiring time-consuming computations during the actual data retrieval or reconstruction process.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10402393B2Slice migration in a dispersed storage network
Publication Date: 2019.09.03 PURE STORAGE INC
  • US10402393B2 patent drawing
  • US10402393B2 patent drawing
  • US10402393B2 patent drawing

AI summary

A method for use by a source storage unit of a dispersed storage network includes identifying a slice name corresponding to a slice to migrate from a source storage unit to a destination storage unit; sending the slice to migrate to the destination storage unit; generating a slice verification request and sending the slice verification request to the destination storage unit; receiving an integrity value from the destination storage unit; and determining when the integrity value compares favorably to the slice verification request. When the source storage unit determines that the integrity value compares favorably to the slice verification request, a slice name assignment associated with the slice name is updated and the slice is deleted from the source storage unit.