Encoded Slice Mapping for Fault-Tolerant DSN Object Retrieval

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current dispersed storage networks face challenges in efficiently storing and retrieving large amounts of data across geographically diverse locations while ensuring data integrity and security, particularly in the presence of failures and network complexities.

Innovation Solution

A distributed computing system that employs dispersed error encoding and decoding techniques to segment and distribute data across multiple storage units, allowing for reliable and secure storage and retrieval of data, even in the presence of failures, through a network of geographically dispersed storage and task processing units.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is segmented and distributed across multiple geographically dispersed storage units, then data security and fault tolerance are improved, but system complexity and retrieval overhead increase

Engineering Contradiction:
Improvefault toleranceVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments data into multiple data objects and distributes them across geographically dispersed storage units. Each storage unit stores a portion of the encoded data, which improves fault tolerance as failures at individual locations do not compromise the entire dataset. The segmentation principle is fundamental to achieving both reliability and manageable complexity in the distributed storage system.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces an intermediary encoding mechanism that processes data before distribution. The error correction code acts as an intermediary layer that enables reliable reconstruction of original data from distributed segments, even when some storage units fail. This intermediary encoding reduces the complexity of managing distributed data by providing a systematic approach to data recovery.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If data is encoded with error correction codes, then data integrity is improved, but processing time and computational resources increase

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

Solution Approach 1:

The patent applies error correction encoding in advance before data is distributed to storage units. This preliminary encoding action ensures that data integrity is protected from the outset, and the computational overhead is performed during the initial storage phase rather than during every retrieval operation. The encoded data can then be directly stored and retrieved without repeated processing.

Inventive Principle:
Principle #10Preliminary action

3Adaptability or versatility

If multiple storage units are used across geographically diverse locations, then data security and availability are improved, but network complexity and communication overhead increase

Engineering Contradiction:
Improvedata availabilityVSAvoidnetwork complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent creates a universal distributed storage architecture where storage units at different geographic locations perform the same basic functions of storing and returning data objects. This multi-functionality approach simplifies network complexity by standardizing operations across diverse locations, allowing the same protocols and procedures to be applied universally regardless of geographic distribution.

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

Data Source

PatentUS10853172B1Concatenating data objects for storage in a vast data storage network
Publication Date: 2020.12.01 PURE STORAGE INC
  • US10853172B1 patent drawing
  • US10853172B1 patent drawing
  • US10853172B1 patent drawing

AI summary

A method includes identifying an independent data object of a plurality of independent data objects for retrieval from dispersed storage network (DSN) memory. The method further includes determining a mapping of the plurality of independent data objects into a data matrix, wherein the mapping is in accordance with the dispersed storage error encoding function. The method further includes identifying, based on the mapping, an encoded data slice of the set of encoded data slices corresponding to the independent data object. The method further includes sending a retrieval request to a storage unit of the DSN memory regarding the encoded data slice. When the encoded data slice is received, the method further includes decoding the encoding data slice in accordance with the dispersed storage error encoding function and the mapping to reproduce the independent data object.