Dispersed Storage Network Data Rebalancing via Location Weights

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current dispersed storage networks face challenges in efficiently managing and accessing data across geographically distributed storage units, particularly in maintaining data integrity and availability without redundant copies, and in rebalancing storage loads to optimize performance.

Innovation Solution

A dispersed storage network architecture that employs error encoding using Cauchy Reed-Solomon encoding, decentralized agreement protocols for data distribution and retrieval, and a managing unit for coordinating storage and integrity processing, allowing for secure, fault-tolerant data storage and retrieval across multiple storage units.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If data is stored across geographically distributed storage units without redundant copies, then storage efficiency is improved, but data integrity and availability become difficult to maintain

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

Solution Approach 1:

The patent segments data into multiple data slices and disperses them across geographically distributed storage units. Error correction codes are also segmented and distributed with the data slices. This allows the system to store data efficiently without full redundant copies while maintaining data integrity through the distributed error correction capability.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent changes the parameter of data representation by applying error correction encoding transformations. Data is transformed into encoded form with embedded error correction capability, allowing the system to maintain data availability even when some storage units fail, without requiring traditional redundant copies.

Inventive Principle:
Principle #35Parameter changes

2Productivity

If storage loads are not rebalanced across distributed units, then system complexity is reduced, but performance optimization is lost

Engineering Contradiction:
Improveperformance optimizationVSAvoidsystem complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent implements a rebalancing mechanism that monitors storage loads across distributed storage units and dynamically redistributes data slices to balance the load. This feedback-based approach optimizes performance by preventing any single storage unit from becoming a bottleneck, while the automated nature of the rebalancing minimizes the operational complexity for users.

Inventive Principle:
Principle #23Feedback

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 patent applies error correction encoding in advance during the data writing phase, before data is stored in the distributed storage units. This preliminary action ensures data integrity is built into the stored data structure, eliminating the need for time-consuming error checking and correction operations during data retrieval and access, thus reducing processing overhead during critical read operations.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10254992B2Rebalancing data storage in a dispersed storage network
Publication Date: 2019.04.09 PURE STORAGE INC
  • US10254992B2 patent drawing
  • US10254992B2 patent drawing
  • US10254992B2 patent drawing

AI summary

A method for execution by a dispersed storage and task (DST) execution unit includes generating location weight data that includes a plurality of location weights assigned to a plurality of memory devices of the DST execution unit. A first one of the plurality of memory devices and a second one of the plurality of memory devices are selected for reallocation based on the location weight data. The reallocation is executed by removing a data slice from the first one of the plurality of memory devices and storing the data slice in the second one of the plurality of memory devices.