Traceroute Packet Distribution for Network Monitoring
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network monitoring techniques, such as black box and white box testing, face challenges in efficiently covering all links and routers in large computer networks while minimizing the burden on the network from sending test packets.
Innovation Solution
A computer-implemented method that receives network topology information to identify significant intermediate nodes, calculates probabilistic cover values for potential paths, and sends traceroute packets based on these values to comprehensively monitor the network with reduced packet burden.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If many test packets are sent to cover all links and routers, then network monitoring comprehensiveness is improved, but network burden increases
Solution Approach 1:
The patent segments the network monitoring task by identifying and focusing on significant intermediate nodes that appear in multiple paths. Instead of sending test packets to cover every possible link and router individually, the method divides the network into segments radiating from these significant nodes, reducing the overall number of packets needed while maintaining comprehensive coverage.
Solution Approach 2:
The patent changes the parameter of test packet distribution by using probabilistic cover values to determine how many packets to send along each path. Rather than uniform distribution, the system dynamically adjusts packet quantities based on the significance of intermediate nodes and the coverage probability required, optimizing the balance between comprehensiveness and network burden.
2Reliability
If test packets are sent between each pair of test agents, then all network paths are covered, but the number of test agents and packets becomes extremely large
Solution Approach 1:
The patent extracts and identifies significant intermediate nodes from the network topology that appear in multiple paths between test agents. By focusing monitoring efforts on these extracted key nodes rather than requiring test agents at every network boundary, the system reduces the number of test agents needed while maintaining comprehensive path coverage.
Solution Approach 2:
The significant intermediate nodes identified in the patent serve multiple functions: they act as monitoring points for multiple paths simultaneously, and their probabilistic cover values can be used to determine packet distribution for various test scenarios. This multi-functionality reduces the need for dedicated test agents at each network boundary.
3Measurement precision
If white box testing is used to compute precise test packet subsets, then router and link coverage is maximized, but the amount of network information required becomes unmanageable
Solution Approach 1:
The patent uses a simplified, approximate model of network topology information rather than complete detailed router processing information. This lighter-weight information structure provides sufficient precision for determining significant intermediate nodes and probabilistic cover values without the unmanageable data requirements of full white box testing.
Solution Approach 2:
The patent changes the parameter of information precision by transitioning from complete white box router processing information to a simplified topology model that identifies significant intermediate nodes. This parameter change maintains sufficient measurement precision for effective network monitoring while dramatically reducing the quantity of network information required.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A computer-implemented method includes receiving network topology information about a network segment between a source node and a destination node. The method also includes identifying, based on the network topology information, a significant hop in the network segment. The method additionally includes calculating a plurality of probabilistic cover values based on the significant hop. The method additionally includes causing a plurality of different sets of traceroute packets to be sent from the source node. The plurality of different sets of traceroute packets are based on the plurality of probabilistic cover values.