Multi-Source Hybrid Overlay Network Data Recovery

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In multi-source hybrid overlay networks, when a peer disappears, the primary path is disrupted, leading to divided segments that cannot exchange data, causing challenges in real-time data recovery and maintenance of data across segments during tree reconfiguration.

Innovation Solution

A method and apparatus for recovering missing data by exchanging buffer maps between peers, selecting candidate paths to establish primary paths, and using push and pull methods to synchronize data across segments, with a cache buffer system to manage and prioritize data storage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a peer disappears from the tree topology, then the primary path is disrupted and segments are divided, but data exchange between segments becomes impossible and real-time data recovery is delayed

Engineering Contradiction:
Improvedata exchange capabilityVSAvoiddata recovery time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system performs preliminary actions by maintaining candidate paths in advance before the primary path fails. When a peer disappears and the primary path is disrupted, these pre-established candidate paths enable immediate data exchange between segments without waiting for path discovery and establishment, thus reducing data recovery time while maintaining reliability

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The candidate paths act as intermediary communication channels between segments when the primary path is disrupted. These alternative paths serve as mediators that enable data exchange between segments that would otherwise be isolated, resolving the contradiction by providing both reliability (continuous data exchange) and speed (immediate recovery)

Inventive Principle:
Principle #24Intermediary (Mediator)

2Productivity

If peers maintain data for a certain size and period in cache buffers, then storage resources are managed efficiently, but it becomes difficult to maintain all data until connection recovery

Engineering Contradiction:
Improvedata maintenance efficiencyVSAvoiddata availability
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

Peers perform preliminary data maintenance by storing data in cache buffers with defined size and period constraints before connection disruption. This preliminary action enables efficient resource management during normal operation while the candidate path mechanism ensures data can still be recovered and exchanged even when local cache constraints prevent maintaining all data, thus resolving the contradiction between productivity and reliability

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system implements feedback through buffer map exchange between peers. When segments reconnect, peers share their buffer maps to identify which data is missing, then request and transmit the specific missing data. This feedback mechanism ensures that even though peers only maintain limited data locally due to cache constraints, all necessary data can be recovered and made available again, resolving the reliability concern while maintaining productivity

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS11539789B2Method and apparatus for recovering missing data in multi-source hybrid overlay network
Publication Date: 2022.12.27 ELECTRONICS & TELECOMM RES INST
  • US11539789B2 patent drawing
  • US11539789B2 patent drawing
  • US11539789B2 patent drawing

AI summary

In a multi-source hybrid overlay network including a plurality of peers, an apparatus that recovers missing data occurring in a tree recovery process, acquires data that a peer does not have in a pull method through exchanging buffer maps with a first counterpart peer connected to a primary path recovered in the tree recovery process and at least one second counterpart peer connected to at least one candidate path, and provides data that the first counterpart peer does not have to the first counterpart peer in the push method, when a data recovery policy is a pull method, is provided.