Network multi-path discovery
View Patent ↗Potential paths between a source and destination of a network are identified based on trace-route information, then filtered to eliminate paths or links that are not supported by ancillary information associated with the network so as to identify feasible/actual paths between the source and destination. The ancillary information includes, for example, routing tables and ARP tables. If a feasible path cannot be identified based on the ancillary information, supplemental information regarding nodes further along the potential path is assessed to provide a basis for inferring the nodes that may provide a feasible path. The determined feasible paths are displayed for review, and provided to serve as filters for subsequent path-analysis tools.
1. A non-transitory computer-readable medium that includes a program that, when executed by a processor, causes the processor to:
obtain trace results based on one or more trace-route operations from a source to a destination on a network, each trace result identifying one or more nodes that are situated between the source and the destination, each node being associated with a sequential hop from the source to the destination, at least two nodes being associated with a same hop,
process the trace results to identify multiple paths between the source and the destination, including determining a first path that includes a first node of the at least two nodes associated with the same hop and a second path that includes a second node of the at least two nodes associated with the same hop.
2. The medium of claim 1 , wherein the program causes the processor to identify the multiple paths by:
maintaining a set of identified paths to a given hop, each identified path having a last element associated with the given hop,
identifying each of the nodes associated with a next hop after the given hop from the trace results, and
for each identified path:
identifying each connected node of the nodes associated with the next hop that is connected to the last element of the identified path,
augmenting the identified path to include a first connected node associated with the next hop, and
for each other connected node, if any:
creating a new path that includes the identified path up to the given hop, and the other connected node.
3. The medium of claim 2 , wherein the program causes the processor to identify at least one of the connected nodes by assessing configuration information associated with the last element.
4. The medium of claim 2 , wherein the program causes the processor to identify at least one of the connected nodes by assessing configuration information associated with each node associated with the next hop.
5. The medium of claim 2 , wherein the program causes the processor to identify at least one of the connected nodes by obtaining subsequent trace results.
6. The medium of claim 5 , wherein the subsequent trace results are based on a trace operation that identifies the last element of the identified path.
7. The medium of claim 2 , wherein the program causes the processor to identify at least one of the connected nodes by assessing one or more previously determined paths in the network.
8. The medium of claim 2 , wherein, if no connected nodes are found, the program causes the processor to resolve this lack of connectivity.
9. The medium of claim 8 , wherein the program causes the processor to resolve the lack of connectivity by finding at least one element at a subsequent hop after the next hop that is connected to the last element, and inferring an identity of a node at the next hop that provides connectivity between the last element and the element at the subsequent hop.
10. The medium of claim 9 , wherein the node at the next hop is identified as a firewall.
11. The medium of claim 2 , wherein, if the next hop is a first hop from the source, each of the nodes associated with the next hop is identified as a connected node.
12. The medium of claim 1 , wherein the program causes the processor to determine the first path by a process that includes assessing configuration information associated with the first node.
13. The medium of claim 1 , wherein the program causes the processor to determine at least one of the first and second paths by a process that includes obtaining subsequent trace results.
14. The medium of claim 13 , wherein the subsequent trace results are based on a trace operation that identifies a last element of the first path immediately prior to the first node.
15. The medium of claim 1 , wherein the program causes the processor to determine at least one of the first and second paths by a process that includes assessing one or more previously determined paths in the network.
16. The medium of claim 1 , wherein the program causes the processor to determine at least one of the first and second paths by a process that includes resolving a lack of connectivity to at least one of the first and second nodes.
17. The medium of claim 16 , wherein the program causes the processor to resolve the lack of connectivity by finding at least one element at a subsequent hop after the same hop that is connected to an element prior to the at least one of the first and second nodes, and inferring an identity of the element prior to the at least one hop that provides connectivity to the at least one of the first and second nodes.
18. A method comprising:
obtaining, at a network analysis system, trace results based on one or more trace-route operations from a source to a destination on a network, each trace result identifying one or more nodes that are situated between the source and the destination, each node being associated with a sequential hop from the source to the destination, at least two nodes being associated with a same hop,
processing, by a processor of the network analysis system, the trace results to identify multiple paths between the source and the destination, including determining a first path that includes a first node of the at least two nodes associated with the same hop and a second path that includes a second node of the at least two nodes associated with the same hop, and
storing, in a memory of the network analysis system, the first and second paths for subsequent display and analysis.
19. The method of claim 18 , identifying the multiple paths includes:
maintaining a set of identified paths to a given hop, each identified path having a last element associated with the given hop,
identifying each of the nodes associated with a next hop after the given hop from the trace results, and
for each identified path:
identifying each connected node of the nodes associated with the next hop that is connected to the last element of the identified path,
augmenting the identified path to include a first connected node associated with the next hop, and
for each other connected node, if any:
creating a new path that includes the identified path up to the given hop, and the other connected node.
20. The method of claim 19 , wherein identifying at least one of the connected nodes includes assessing configuration information associated with the last element.
21. The method of claim 19 , wherein identifying at least one of the connected nodes includes assessing configuration information associated with each node associated with the next hop.
22. The method of claim 19 , wherein identifying at least one of the connected nodes includes by obtaining subsequent trace results.
23. The method of claim 22 , wherein the subsequent trace results are based on a trace operation that identifies the last element of the identified path.
24. The method of claim 19 , wherein identifying at least one of the connected nodes includes assessing one or more previously determined paths in the network.
25. The method of claim 19 , including resolving a lack of connectivity between the last element of the given hop and any of the nodes associated with the next hop.
26. The method of claim 25 , wherein resolving the lack of connectivity includes at least one element at a subsequent hop after the next hop that is connected to the last element, and inferring an identity of a node at the next hop that provides connectivity between the last element and the element at the subsequent hop.
27. The method of claim 26 , wherein the node at the next hop is identified as a firewall.
28. The method of claim 19 , wherein, if the next hop is a first hop from the source, each of the nodes associated with the next hop is identified as a connected node.
29. The method of claim 18 , wherein determining the first path includes assessing configuration information associated with the first node.
30. The method of claim 18 , wherein determining at least one of the first and second paths includes obtaining subsequent trace results.
31. The method of claim 30 , wherein the subsequent trace results are based on a trace operation that identifies a last element of the first path immediately prior to the first node.
32. The method of claim 18 , wherein determining at least one of the first and second paths includes assessing one or more previously determined paths in the network.
33. The method of claim 18 , wherein determining at least one of the first and second paths includes resolving a lack of connectivity to at least one of the first and second nodes.
34. The method of claim 33 , wherein resolving the lack of connectivity includes finding at least one element at a subsequent hop after the same hop that is connected to an element prior to the at least one of the first and second nodes, and inferring an identity of the element prior to the at least one hop that provides connectivity to the at least one of the first and second nodes.
35. A network analysis system comprisiong:
a controller that is configured to obtain trace results based on one or more trace-route operations from a source to a destination on a network, each trace result identifying one or more nodes that are situated between the source and the destination, each node being associated with a sequential hop from the source to the destination, at least two nodes being associated with a same hop,
one or more analysis tools that are configured to process the trace results to identify multiple paths between the source and the destination, including determining a first path that includes a first node of the at least two nodes associated with the same hop and a second path that includes a second node of the at least two nodes associated with the same hop, and
a memory that is configured to store the first and second paths, and
a display that is configured to illustrate the first and second paths between the source and destination.
36. The system of claim 35 , wherein at least one analysis tool is configured to:
maintain a set of identified paths to a given hop, each identified path having a last element associated with the given hop,
identify each of the nodes associated with a next hop after the given hop from the trace results, and
for each identified path:
identify each connected node of the nodes associated with the next hop that is connected to the last element of the identified path,
augment the identified path to include a first connected node associated with the next hop, and
for each other connected node, if any:
create a new path that includes the identified path up to the given hop, and the other connected node.
37. The system of claim 36 , the at least one tool is configured to identify at least one of the connected nodes by assessing configuration information associated with the last element and configuration information associated with each node associated with the next hop.
38. The system of claim 35 , wherein at least one of the analysis tools is configured to assess configuration information associated with the first node to facilitate determining the first path.
39. The system of claim 35 , wherein at least one of the analysis tools is configured to obtain subsequent trace results to facilitate determining at least one of the first and second paths.
40. The system of claim 35 , wherein at least one of the analysis tools is configured to assess one or more previously determined paths in the network to facilitate determining at least one of the first and second paths.