P2P Routing Table Update via LDN Failure Notification

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current Peer-to-Peer (P2P) network systems face inefficiencies in route discovery and maintenance due to network churn, where the failure of nodes leads to recursive searches and prolonged crawl times, especially when multiple key routing nodes fail, resulting in O(N) time complexity for route searching.

Innovation Solution

The method involves determining the range of nodes affected by a failed node's routing table based on distance and sending failure information to Long Distance Neighbors (LDNs), who update the routing tables, thereby reducing the need for recursive searches and improving network stability and efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If K sequential nodes ping each other to maintain connections, then node connectivity is maintained, but route search efficiency deteriorates to O(N) when multiple key routing nodes fail

Engineering Contradiction:
Improvenode connectivityVSAvoidroute search efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent applies preliminary action by proactively notifying Long Distance Neighbors (LDNs) of node failures before they are discovered through recursive searching. When a node fails, its neighboring nodes detect the failure and immediately notify LDNs within a calculated impact range, allowing these nodes to pre-update their routing tables. This prevents the need for O(N) recursive searches when route requests are made, as the routing information is already updated in advance.

Inventive Principle:
Principle #10Preliminary action

2Measurement precision

If failure information is broadcast to all nodes, then route update accuracy improves, but network overhead increases

Engineering Contradiction:
Improveroute update accuracyVSAvoidnetwork overhead
Core Design Contradiction:
Measurement precisionVSQuantity of substance

Solution Approach 1:

The patent applies local quality by notifying only those nodes that are actually affected by the failure. Instead of broadcasting to all nodes, the system calculates an impact range based on the distance between the failed node and LDNs in the node ID space. Only nodes within this impact range receive failure notifications and update their routing tables. This localized approach ensures route update accuracy for affected nodes while minimizing unnecessary network overhead by excluding nodes outside the impact range.

Inventive Principle:
Principle #3Local quality

3Stability of the object's composition

If recursive search is used to find substitute nodes, then route continuity is maintained, but search time increases to O(N)

Engineering Contradiction:
Improveroute continuityVSAvoidsearch time
Core Design Contradiction:
Stability of the object's compositionVSLoss of time

Solution Approach 1:

The patent eliminates recursive searching by applying preliminary action - routing table updates are performed in advance when failures occur. LDNs receive failure notifications and update their routing tables proactively, storing the substitute node information before any route request is made. This ensures route continuity is maintained while reducing search time from O(N) to O(1), as the routing information is already prepared and stored.

Inventive Principle:
Principle #10Preliminary action

4Reliability

If proactive ping is performed between neighboring nodes, then node failure detection improves, but maintenance overhead increases

Engineering Contradiction:
Improvenode failure detectionVSAvoidmaintenance overhead
Core Design Contradiction:
ReliabilityVSUse of energy by stationary object

Solution Approach 1:

The patent extracts and amplifies the failure detection capability from local neighboring nodes to remote LDNs. Instead of requiring all nodes to perform proactive pinging, the system allows neighboring nodes to detect failures and then extracts this detection information to be propagated to LDNs through targeted notifications. This reduces maintenance overhead by eliminating the need for LDNs to perform continuous pinging, while maintaining reliable failure detection through the notification mechanism.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS8248919B2Method, device and system for updating routes after node fails in P2P network
Publication Date: 2012.08.21 HUAWEI TECH CO LTD
  • US8248919B2 patent drawing
  • US8248919B2 patent drawing
  • US8248919B2 patent drawing

AI summary

A method for updating routing table information after a node fails in a P2P network is disclosed herein. The method includes: the range of the nodes whose route is directed to the failed node is determined according to the distance between the failed node and the neighboring node of the failed node; the failure information of the failed node is sent to the LDN of the failed node within the node range; and the LDN updates the routing table according to the failure information. A network device and a P2P communication network are also disclosed herein. The embodiments of the present invention enhance the capability of the whole P2P network in perceiving node churn and improve the route search efficiency and system stability of the whole P2P network.