Dispersed Storage Partial Task Processing with Slice Reconstruction

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current distributed computing systems face challenges in ensuring data integrity and security during error encoding and decoding processes, particularly in dispersed storage networks where data is stored across multiple geographically diverse locations, and are vulnerable to data loss and unauthorized access.

Innovation Solution

The implementation of a dispersed storage network (DSN) with a managing unit, integrity processing unit, and computing devices that utilize error encoding techniques like Cauchy Reed-Solomon encoding to split data into encoded slices, which are then stored across multiple storage units, allowing for secure and fault-tolerant data storage and retrieval without the need for redundant copies.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is stored across multiple geographically diverse storage units in a dispersed storage network, then data security and fault tolerance are improved, but data integrity during encoding and decoding processes deteriorates due to network vulnerabilities and transmission errors

Engineering Contradiction:
Improvefault toleranceVSAvoiddata integrity
Core Design Contradiction:
ReliabilityVSLoss of information

Solution Approach 1:

The patent segments data into multiple data slices that are distributed across different storage units. Each slice is independently encoded and stored, allowing the system to maintain data integrity even when individual slices are corrupted or lost during transmission. The segmentation enables selective retrieval and reconstruction of data without requiring all slices to be perfectly intact.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces an intermediary encoding/decoding process that acts as a mediator between storage and retrieval operations. This intermediary layer applies error correction codes and verification mechanisms to ensure data integrity is maintained during the encoding and decoding processes, even when data passes through multiple geographically diverse storage units with potential network vulnerabilities.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If error correction schemes are implemented in dispersed storage systems, then data security is improved, but system complexity increases due to additional processing requirements

Engineering Contradiction:
Improvedata securityVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent applies error correction codes and encoding schemes in advance during the data storage process, before any potential data loss or corruption can occur. This preliminary encoding action ensures that security and integrity protections are already in place when data is distributed across storage units, reducing the need for complex real-time processing during retrieval operations.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent utilizes parameter changes in encoding schemes to balance security requirements with system complexity. By adjusting encoding parameters such as redundancy levels and error correction strength, the system can achieve adequate data security without implementing overly complex processing mechanisms that would burden the dispersed storage network.

Inventive Principle:
Principle #35Parameter changes

3Reliability

If data is encoded and split across multiple storage units, then fault tolerance is improved, but data retrieval time increases due to the need to aggregate slices from multiple locations

Engineering Contradiction:
Improvefault toleranceVSAvoiddata retrieval time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent implements partial action by retrieving only the necessary number of data slices required to reconstruct the requested information, rather than requiring all stored slices. This approach allows the system to maintain fault tolerance while reducing retrieval time by performing just enough aggregation operations to satisfy the data request without unnecessary additional network operations.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS11463420B1Storage unit partial task processing
Publication Date: 2022.10.04 PURE STORAGE INC
  • US11463420B1 patent drawing
  • US11463420B1 patent drawing
  • US11463420B1 patent drawing

AI summary

A method for execution by one or more storage units of a dispersed storage network (DSN). The method begins by receiving, at a first storage unit, a request for a partial task. The method continues by generating a slice request, to one or more additional storage units, when the first storage unit does not contain all encoded data slices required to execute the partial task. The method continues by receiving the at least one additional encoded data slice from the one or more additional storage units and performing the partial task on the first encoded data slice and the at least one additional encoded data slice to produce at least partial results.