Network Path Discovery via Intermediate Node Filtering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for finding optimal disjoint paths in communication networks are inefficient and may not guarantee the location of diverse paths or provide path optimization, often requiring excessive message forwarding and relying on network information for logical network partitioning.
Innovation Solution
A method where intermediate nodes in the network apply specific conditions for forwarding path discovery messages, including a condition that ensures no node with a lower cost path is excluded, and use of branch information to predict and reduce unnecessary message transmission, thereby reducing traffic and ensuring optimal disjoint path discovery.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If exhaustive search or conventional path discovery methods are used to find optimal disjoint paths, then complete path exploration is achieved, but the number of messages transmitted increases excessively
Solution Approach 1:
The patent applies preliminary action by having intermediate nodes pre-calculate and store branch information (costs to reach neighboring nodes) before path discovery messages arrive. This allows nodes to make informed forwarding decisions in advance, reducing the need to forward all incoming path discovery messages while ensuring optimal disjoint paths are still found.
Solution Approach 2:
The patent implements local quality by enabling each intermediate node to independently evaluate incoming path discovery messages using locally stored branch information. Each node applies cost comparison rules locally to determine whether to forward or discard messages, eliminating the need for centralized control and reducing overall message traffic while maintaining discovery completeness.
2Manufacturing precision
If intermediate nodes forward all path discovery messages to ensure optimal disjoint paths are found, then path optimization is guaranteed, but network traffic increases
Solution Approach 1:
The patent uses feedback by having intermediate nodes compare the cost information in incoming path discovery messages against their locally stored branch information (which represents optimal costs to reach neighbors). This feedback mechanism allows nodes to intelligently discard suboptimal messages while forwarding only those that could lead to optimal disjoint paths, reducing traffic without sacrificing optimization accuracy.
Solution Approach 2:
The patent applies parameter changes by transforming the path discovery process from blind message forwarding to selective forwarding based on cost parameter comparison. Intermediate nodes use cost values (parameters) from branch information to make forwarding decisions, changing the message forwarding behavior from uniform to selective based on cost efficiency.
3Adaptability or versatility
If decentralized path discovery is used without complete network view, then network scalability is improved, but ability to find optimal disjoint paths is compromised
Solution Approach 1:
The patent resolves this contradiction by having intermediate nodes perform preliminary calculations of branch information (costs to reach all neighboring nodes) and store them locally. This preliminary action enables decentralized nodes to make optimally informed forwarding decisions without needing a complete network view, maintaining both scalability and path optimization accuracy.
Solution Approach 2:
The patent implements self-service by enabling each intermediate node to independently determine whether to forward path discovery messages using its own locally stored branch information. Nodes serve themselves by making autonomous forwarding decisions based on local cost comparisons, eliminating the need for centralized control while ensuring optimal disjoint paths are found.
Data Source
AI summary
A path discovery process is provided for discovering a lowest cost combination of a plurality of paths from the source node to the destination node via links between pairs of nodes along the paths. A path discovery messages from a source node is forwarded through the network. Prior to forwarding the path discovery message a node tests one or more conditions for disabling the forwarding. Upon receiving an instance of the path discovery message, this may include testing whether no other instance of the path discovery message has both smaller cost and a previous path that contains only nodes that occur also in the path of the received instance. Furthermore, this may include testing whether a destination of the path discovery message was also a node to which a preceding node along the path has a further link, and a cost of the path from the preceding node to the next node via said further link is not larger than the cost of the path from the preceding node to the next node. Furthermore, this may include testing whether the node has a further link to the destination node and the cost associated with the link to the next node is not less than the cost associated with the further link to the destination node.