Network Path Control Apparatus for Failure-Induced Load Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In network systems with dynamic path control, the load on path calculation increases when multiple failures occur in a short period, affecting network stability, especially as the number of nodes increases, due to the need for extensive information exchange and recalculation across all nodes.
Innovation Solution
A path control apparatus and method that detects status changes and compares pre-failure and post-failure shortest path trees to determine which nodes require path updates, reducing unnecessary path calculations by notifying only affected nodes, thereby minimizing network load.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all nodes perform path recalculation when a failure occurs, then path accuracy is maintained, but network load increases significantly
Solution Approach 1:
The patent applies local quality by making different nodes perform different actions based on their relationship to the failure. Nodes that are affected by the failure (those whose shortest path trees change) perform path recalculation, while nodes that are not affected do not recalculate. This selective approach maintains path accuracy where needed while reducing unnecessary calculations elsewhere in the network.
Solution Approach 2:
The patent segments the network into affected and unaffected portions by comparing shortest path trees before and after failure. By identifying which specific nodes have their shortest path trees modified by the failure, the system divides the recalculation task into only those necessary segments, rather than requiring all nodes to recalculate uniformly.
2Reliability
If tree information is exchanged among all nodes to identify affected nodes, then path update accuracy improves, but information exchange load increases
Solution Approach 1:
The patent extracts only the necessary information for determining affected nodes - specifically, the shortest path trees before and after failure at the detecting node. Instead of exchanging comprehensive tree information from all nodes, the system extracts and communicates only the minimal required data to identify which nodes need path updates, significantly reducing information exchange volume.
Solution Approach 2:
The detecting node performs self-service by autonomously comparing its own shortest path trees before and after the failure to identify affected nodes. This eliminates the need for other nodes to exchange their tree information, as the detecting node independently determines which nodes require path updates based on its own calculations.
3Quantity of substance
If self-calculating method is used without exchanging tree information, then information exchange load decreases, but calculation load at each node increases
Solution Approach 1:
The patent introduces an intermediary approach where the detecting node acts as a coordinator. It performs the comparison calculation locally and then communicates the results to other nodes. This distributes the calculation burden - the detecting node does the comparison work, while other nodes simply receive and act on the results, avoiding both full information exchange and excessive calculation at every node.
Data Source
AI summary
A path control apparatus of the present invention includes: a status change detecting unit that detects a status change of a network; a path calculating unit that decides a path in accordance with the status of the network; and a calculation execution node deciding unit that compares a shortest path tree, which is established before occurrence of a change in the status of the network calculated by the path calculating unit, with a shortest path tree, which is established after the occurrence of the change in the status of the network calculated by the path calculating unit, and creates information required for determining whether a node apparatus in the network needs a path update, when the change occurs in the status of the network.