Determination of network topology using flow-based traffic information
First Claim
1. A method for determination of a network topology from a set of traffic records, the method comprising:
- generating, by a computer processor, a list of device sets for a destination from the set of traffic records, each device set comprising at least one network device;
removing any duplicate device sets from the list of device sets;
creating a tree for the destination using the list of device sets, wherein creating a tree comprises;
introducing a root node into the tree;
sorting the list of device sets for the destination by length;
removing the shortest device set from the list;
introducing a new node representing the shortest device set into the tree;
determining whether a node in the tree represents a maximum length subset of the shortest device set, and in the event that a node is determined, connecting the new node to the determined node, or else connecting the new node to the root node;
setting the identifier of the introduced node to a list of members of the shortest device set that are not represented in the determined node, or, in the event that the new node is connected to the root node, to a list of members of the shortest device set; and
repeating the removing the shortest device set, introducing, determining, and setting for the next shortest device set in the list, until there are no more device sets remaining for the destination.
2 Assignments
0 Petitions
Accused Products
Abstract
A method for determination of a network topology includes generating a list of device sets for a destination; removing any duplicate device sets from the list; creating a tree for the destination by introducing a root node into the tree; sorting the list of device sets for the destination by length; removing the shortest device set from the list; introducing a new node representing the shortest device set into the tree; determining whether a node in the tree represents a maximum length subset of the shortest device set, and in the event that a node is determined, connecting the new node to the determined node, or else connecting the new node to the root node; setting the identifier of the introduced node to a list of members of the shortest device set that are not included in the maximum length subset of the determined node.
119 Citations
20 Claims
-
1. A method for determination of a network topology from a set of traffic records, the method comprising:
-
generating, by a computer processor, a list of device sets for a destination from the set of traffic records, each device set comprising at least one network device; removing any duplicate device sets from the list of device sets; creating a tree for the destination using the list of device sets, wherein creating a tree comprises; introducing a root node into the tree; sorting the list of device sets for the destination by length; removing the shortest device set from the list; introducing a new node representing the shortest device set into the tree;
determining whether a node in the tree represents a maximum length subset of the shortest device set, and in the event that a node is determined, connecting the new node to the determined node, or else connecting the new node to the root node;setting the identifier of the introduced node to a list of members of the shortest device set that are not represented in the determined node, or, in the event that the new node is connected to the root node, to a list of members of the shortest device set; and repeating the removing the shortest device set, introducing, determining, and setting for the next shortest device set in the list, until there are no more device sets remaining for the destination. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer program product comprising a non-transitory computer readable storage medium containing computer code that, when executed by a computer, implements a method for determination of a network topology, wherein the method comprises:
-
generating a list of device sets for a destination from the set of traffic records, each device set comprising at least one network device; removing any duplicate device sets from the list of device sets; creating a tree for the destination using the list of device sets, wherein creating a tree comprises; introducing a root node into the tree; sorting the list of device sets for the destination by length; removing the shortest device set from the list; introducing a new node representing the shortest device set into the tree; determining whether a node in the tree represents a maximum length subset of the shortest path, and in the event that a node is determined, connecting the new node to the determined node, or else connecting the new node to the root node; setting the identifier of the introduced node to a list of members of the shortest device set that are not represented in the determined node, or, in the event that the new node is connected to the root node, to a list of members of the shortest device set; and repeating the removing the shortest device set, introducing, determining, and setting for the next shortest device set in the list, until there are no more device sets remaining for the destination. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A network comprising:
-
means for generating a list of device sets for a destination from a set of traffic records, each device set comprising at least one network device; means for removing any duplicate device sets from the list of device sets; means for creating a tree for the destination using the list of device sets, wherein creating a tree comprises; means for introducing a root node into the tree; means for sorting the list of device sets for the destination by length; means for removing the shortest device set from the list; means for introducing a new node representing the shortest device set into the tree; means for determining whether a node in the tree represents a maximum length subset of the shortest path, and in the event that a node is determined, connecting the new node to the determined node, or else connecting the new node to the root node; means for setting the identifier of the introduced node to a list of members of the shortest device set that are not represented in the determined node, or, in the event that the new node is connected to the root node, to a list of members of the shortest device set; and means for repeating the removing the shortest device set, introducing, determining, and setting for the next shortest device set in the list, until there are no more device sets remaining for the destination. - View Dependent Claims (18, 19, 20)
-
Specification