P2P Network Recovery via Broadcast Routing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Peer-to-peer networks face challenges in recovering from failed links between nodes, as existing protocols like TCP/IP and UDP do not guarantee message delivery or ordered delivery, and lack mechanisms for direct message response, making it difficult to maintain network connectivity and data transmission efficiency.

Innovation Solution

A system and method are introduced where nodes in a peer-to-peer network broadcast recovery requests to establish alternative routes, allowing each node to store and forward route information, enabling location-independent message delivery and recovery from link failures by utilizing a topology and routing layer that creates virtual communication channels and manages tree-based data structures for message routing.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If nodes use existing protocols like TCP/IP or UDP for communication, then network communication can be established, but message delivery reliability and ordered delivery are not guaranteed

Engineering Contradiction:
Improvemessage delivery reliabilityVSAvoidprotocol complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent introduces a topology and routing layer as an intermediary between the application layer and the transport layer. This layer maintains routing tables and manages virtual channels, acting as a mediator that ensures reliable message delivery without requiring complex modifications to existing TCP/IP or UDP protocols. The routing layer tracks node locations and dynamically routes messages through alternative paths when link failures occur.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Productivity

If nodes maintain direct connections in a peer-to-peer network, then communication efficiency is improved, but network connectivity is vulnerable to link failures

Engineering Contradiction:
Improvecommunication efficiencyVSAvoidnetwork connectivity
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent implements dynamic routing where the network topology and communication paths are not fixed but can change in response to link failures. When a direct link fails, the topology and routing layer dynamically computes alternative paths through intermediate nodes. This dynamic adaptation maintains network connectivity while preserving communication efficiency, as messages are routed through the most available paths without requiring complete network reconfiguration.

Inventive Principle:
Principle #15Dynamics

3Reliability

If nodes broadcast recovery requests to recover from link failures, then network recovery capability is improved, but network traffic overhead increases

Engineering Contradiction:
Improvenetwork recovery capabilityVSAvoidnetwork traffic overhead
Core Design Contradiction:
ReliabilityVSLoss of energy

Solution Approach 1:

The patent maintains routing tables and topology information in advance, so when a link failure occurs, nodes can quickly determine alternative paths without extensive broadcasting. The topology and routing layer pre-computes and stores routing information, enabling rapid recovery by simply switching to pre-identified alternative paths. This preliminary preparation significantly reduces the need for extensive recovery broadcasting, thereby lowering network traffic overhead while maintaining strong recovery capability.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS8275864B1Peer-to-peer network with recovery capability
Publication Date: 2012.09.25 ARCTERA US LLC
  • US8275864B1 patent drawing
  • US8275864B1 patent drawing
  • US8275864B1 patent drawing

AI summary

A first node in the network may broadcast a recovery request via one or more links to one or more other nodes. The recovery request may specify a first address, where the first address is associated with one or more nodes in the network. Nodes may receive and forward the recovery request until every node with which the first address is associated receives the recovery request and returns a recovery response. The recovery responses may be used to create route information for routing a message to each node with which the first address is associated.