Distributed Storage Data Recovery via Neighboring Peer Nodes

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Distributed storage systems face challenges with low data transfer bandwidths and high access latencies, particularly in handling large volumes of data, which complicates traditional evaluation metrics like cost, persistence, bandwidth, and latency due to the remarkable growth of communications and networking.

Innovation Solution

A method and system for data recovery from an unavailable peer node in a network, where fragments of a data object are distributively stored across neighboring peer nodes, allowing for efficient recovery through intelligent management and duplication patterns, reducing network traffic and processing overhead.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is distributively stored across multiple peer nodes, then data availability and reliability are improved, but network bandwidth consumption and access latency increase

Engineering Contradiction:
Improvedata availabilityVSAvoidnetwork bandwidth consumption
Core Design Contradiction:
ReliabilityVSLoss of energy

Solution Approach 1:

The data object is divided into multiple fragments and distributed across different peer nodes in the network. Each peer node stores a portion of the data, which enables data availability improvement while the system manages network bandwidth through intelligent retrieval strategies that minimize redundant data transfer during recovery operations.

Inventive Principle:
Principle #1Segmentation

2Reliability

If data fragments are stored across multiple peer nodes, then system reliability is improved, but access latency increases

Engineering Contradiction:
Improvesystem reliabilityVSAvoidaccess latency
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system pre-establishes knowledge about fragment locations and peer node capabilities before data recovery is needed. When a peer node becomes unavailable, the system can quickly identify and retrieve fragments from alternative sources without extensive search delays, thus reducing access latency while maintaining high system reliability.

Inventive Principle:
Principle #10Preliminary action

3Device complexity

If traditional storage metrics are used for evaluation, then simplicity is maintained, but adaptability to modern networking conditions deteriorates

Engineering Contradiction:
Improveevaluation simplicityVSAvoidadaptability to networking growth
Core Design Contradiction:
Device complexityVSAdaptability or versatility

Solution Approach 1:

The system extends traditional storage evaluation metrics by incorporating new parameters that reflect modern networking conditions, such as peer node availability, network bandwidth variability, and access latency patterns. This allows the system to adapt to remarkable growth in communications and networking while building upon established storage evaluation frameworks.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS10154086B1Distributed consumer cloud storage system
Publication Date: 2018.12.11 EMC IP HLDG CO LLC
  • US10154086B1 patent drawing
  • US10154086B1 patent drawing
  • US10154086B1 patent drawing

AI summary

Example embodiments of the present invention relate to a method, a system, and a computer program product for data recovery from an unavailable peer node of a plurality of peer nodes in a network detected as unavailable. The method includes recovering from neighboring peer nodes of the plurality of peer nodes in the network neighboring the unavailable peer node a fragment of a data object distributively stored to the unavailable peer node.