LINK INFERENCE IN LARGE NETWORKS BASED ON INCOMPLETE DATA

摘要

discovery of network topology based on incomplete switch forwarding tables AFT, layer 2 information. To reduce complexity of topology computation according to the known Lowenkamp algorithm, the set of nodes is first divided into partitions, according to the known simply connected nodes algoritm, the partitions are discovered according to the Lowenkamp, and after the partial partition discovery is done, the discovered network topologies are merged.