Multicast IP Addressing for Distributed Storage Replication

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data storage systems face inefficiencies in servicing all types of data access requests and status checks, often resulting in prohibitive response times due to inadequate communication between devices.

Innovation Solution

A dispersed storage network (DSN) utilizing error-encoded data and separate provisioned memories within computing devices, where fast memory is used for slice names and slower memory for encoded data slices, enabling rapid data retrieval and error correction without loss of data, even with storage unit failures.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of time

If traditional data storage systems are used, then data can be stored, but response time for data access requests and status checks is prohibitive

Engineering Contradiction:
Improveresponse timeVSAvoiddata access efficiency
Core Design Contradiction:
Loss of timeVSReliability

Solution Approach 1:

The patent segments data into encoded data slices distributed across multiple storage units. Each storage unit stores only a portion of the encoded data, allowing parallel access and reducing the time required to service data access requests. The segmentation enables the system to retrieve data from multiple locations simultaneously rather than sequentially from a single storage location.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements preliminary action by maintaining slice status information in fast memory before actual data retrieval is needed. The system proactively tracks the location and status of encoded data slices across storage units, enabling rapid determination of data availability and reducing access time when retrieval is requested.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If data is distributed across multiple storage units, then data availability is improved, but communication overhead between devices increases

Engineering Contradiction:
Improvedata availabilityVSAvoidcommunication overhead
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent introduces an intermediary mechanism in the form of slice status information that mediates communication between storage units and accessing devices. Instead of direct complex communication between all devices, the status information acts as an intermediary layer that provides quick lookup and coordination, reducing communication overhead while maintaining distributed data availability.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent replaces mechanical communication protocols with an information-based system. Rather than relying on complex device-to-device communication protocols, the system uses stored slice status information to determine data location and availability, substituting physical communication mechanisms with informational lookup mechanisms that reduce overhead.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

3Speed

If fast memory is used for all data storage, then data access speed is improved, but storage capacity is insufficient and cost increases

Engineering Contradiction:
Improvedata access speedVSAvoidstorage capacity
Core Design Contradiction:
SpeedVSQuantity of substance

Solution Approach 1:

The patent applies local quality by using fast memory selectively for slice status information rather than for all data storage. The fast memory locally stores critical metadata about data location and status, while slower, higher-capacity storage units hold the actual encoded data slices. This differentiated approach provides fast access to control information without the prohibitive cost of using fast memory for entire data sets.

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The patent implements a nested structure where slice status information is stored in fast memory, which contains references to encoded data slices stored in slower memory or storage units. This nested arrangement allows the system to maintain fast access to critical status information while nesting the bulk data storage in higher-capacity, lower-speed media.

Inventive Principle:
Principle #7Nested doll (Nesting)

Data Source

PatentUS20240419545A1Using Multicast IP Addresses in a Distributed Storage Network
Publication Date: 2024.12.19 PURE STORAGE INC
  • US20240419545A1 patent drawing
  • US20240419545A1 patent drawing
  • US20240419545A1 patent drawing

AI summary

A method for execution in a storage network begins with a storage network entity receiving a write request for a data object, where the data object is dispersed error encoded in accordance with dispersed error encoding parameters to produce a plurality of sets of encoded data slices. The method continues with the storage network entity determining whether to store a plurality of copies of the data object; and in response to a decision to store a plurality of copies of the data object, determining a plurality of vaults for storage of the data object. The method then continues by identifying a multicast IP address associated with the plurality vaults for storage of the plurality of copies. The method then continues by generating a multicast IP message to a plurality of storage units associated with each vault of the plurality of vaults, where the storage units of the plurality of storage units are configured to determine a multicast IP address from the multicast IP message. Finally, the method continues by facilitating storage of the plurality of copies of the data object in the plurality of vaults.