Distributed Data Backup via Segmented Peer Storage

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Current data backup solutions are not economically viable or secure for general users, as most commercial products are expensive and lack accessibility, and existing methods face risks due to hardware limitations and network data transmission vulnerabilities.

Innovation Solution

A distributed network system that establishes peer-to-peer connections between a host storage server and peer storage servers, dividing data into segments, calculating redundancy, and generating multiple copies for secure backup, recovery, and deletion through a community network system.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If commercial network storage and backup products are used, then data backup security is improved, but cost increases beyond general user affordability

Engineering Contradiction:

Improvedata backup securityVSAvoidcost

Core Design Contradiction:

ReliabilityVSEase of manufacture

Solution Approach 1:

The original data is divided into multiple data segments, which are then distributed across different peer storage servers. This segmentation allows the system to achieve secure backup through distribution rather than relying on expensive centralized commercial solutions, directly addressing the cost-security contradiction.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

Multiple peer storage servers are combined to form a distributed backup network where each server contributes storage capacity. This merging of resources creates a collectively secure backup system that is economically viable for general users, replacing the need for expensive commercial products.

Inventive Principle:

Principle #5Merging (Combining)

2Ease of manufacture

If data is backed up to a single storage location, then cost is reduced, but reliability decreases due to hardware limitations and damage risks

Engineering Contradiction:

ImprovecostVSAvoiddata recovery capability

Core Design Contradiction:

Ease of manufactureVSReliability

Solution Approach 1:

Data is segmented and distributed across multiple peer storage servers rather than stored at a single location. This segmentation maintains low costs by using existing user hardware while improving reliability through geographic and physical distribution, preventing total data loss from single-point failures.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

Multiple copies of data segments are created and stored across different peer servers. This copying strategy ensures that even if some servers fail or hardware is damaged, sufficient copies remain for data recovery, resolving the reliability issue without requiring expensive redundant systems.

Inventive Principle:

Principle #26Copying

3Reliability

If all data segments are transmitted to peer storage servers, then backup completeness is improved, but network transmission time increases

Engineering Contradiction:

Improvebackup completenessVSAvoidtransmission time

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

Data is divided into segments that can be transmitted in parallel to multiple peer servers simultaneously. This segmentation enables concurrent transmission, reducing total transmission time while ensuring complete backup across the distributed network.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The system transmits data segments to peer servers until a sufficient threshold is reached for reliable backup, rather than requiring all possible segments to be fully transmitted. This partial action approach achieves adequate backup completeness while minimizing transmission time loss.

Inventive Principle:

Principle #16Partial or excessive action

Data Source

PatentUS8275752B2Data backup method through distributed network, involves generating data segment copies to transmit to peer storage servers based on metadata with segment distribution matrix by calculating redundancy corresponding to data segments

Publication Date: 2012.09.25 IND TECH RES INST

AI summary

Distributed network-based data backup, recovery and deletion methods and a distributed network system thereof are provided. The methods include respectively establishing peer-to-peer connections between a host storage server and a plurality of peer storage servers, dividing original data into a plurality of data segments, generating a plurality of data segment copies corresponding to the data segments according to a minimum survival rate and the number of peer storage servers. The methods also include transmitting the data segment copies to the peer storage servers, wherein the number of data segment copies for each of the data segments is equal to a redundancy, and the redundancy is smaller than the number of the peer storage servers, and the data segment copies distributed to any one of the peer storage servers correspond to a portion of all the data segments. Accordingly, the methods can effectively and safely backup the original data.