Network Failure Localization via Sub-path Probability Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network failure localization methods are inefficient and burdensome, particularly in large networks, as they require testing each node to identify failures, which is time-consuming and impractical.
Innovation Solution
A method that systematically localizes network failures by enumerating paths and sub-paths between a source node and a destination node, generating data packets to traverse these paths, and calculating probabilities of successful packet transmission to identify failing nodes based on conditional probabilities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional node-by-node testing methods are used to identify network failures, then failure identification can be achieved, but the process becomes time-consuming and burdensome
Solution Approach 1:
The patent segments the network path into multiple sub-paths, each ending at a different intermediary node. By sending probe packets along these segmented sub-paths and analyzing which segments fail, the system identifies the specific failing node without testing every node individually. This segmentation approach maintains precise failure identification while dramatically reducing the number of tests required.
2Measurement precision
If comprehensive node testing is performed to ensure accurate failure localization, then measurement precision improves, but device complexity and operational burden increase
Solution Approach 1:
The patent creates a universal probing mechanism that can test multiple nodes and paths simultaneously using a single probe packet design. The probe packet structure is universal across all sub-paths, and the probability-based analysis method works uniformly regardless of network size or topology. This multi-functionality allows accurate failure localization without requiring complex, customized testing procedures for different network configurations.
3Productivity
If probability-based analysis across multiple sub-paths is used, then failure localization efficiency improves, but the computational complexity of calculating conditional probabilities increases
Solution Approach 1:
The system uses feedback from probe packet responses to iteratively refine failure probability estimates. By analyzing which probe packets succeed and which fail along different sub-paths, the system calculates conditional probabilities that feed back into identifying the most likely failing node. This feedback mechanism achieves efficient failure localization with manageable computational complexity, as it only requires processing results from a limited number of probe packets rather than exhaustive analysis.
Data Source
AI summary
A method, implemented at a computer system in a network, for localizing network failure in the network includes enumerating at least one path between the computer system and a path destination node in the network through one or more intermediary nodes. The method further includes enumerating a plurality of sub-paths between the computer system and the path destination node. Each sub-path has either the path destination node, or one or more intermediary nodes of the corresponding path as a corresponding sub-path destination node. For each of the plurality of sub-paths, determining a probability that a data packet can successfully traverse the round trip of the corresponding sub-path and identifying a node in the network where network failure have occurred.