Network topology mapper
First Claim
1. A method for discovering the topology of a network data link subnet comprising:
- (a) forming a list of switches that comprise the network;
(b) determining a MAC address cache for each one of the switches;
(c) forming from the MAC address caches a list of insiders for every pair of switches;
(d) determining whether the insider for each pair of switches is a graph edge;
(e) determining adjacent ones of the graph edges; and
(f) forming a symmetric adjacency matrix from the graph edges to represent the topology of the network.
3 Assignments
0 Petitions
Accused Products
Abstract
A method enables the topology of an acyclic fully propagated network to be discovered. A list of switches that comprise the network is formed and the MAC address cache for each one of the switches is determined. For each pair of switches, from the MAC address caches the remaining switches that see the pair of switches are located. For each pair of switches the remaining switches are determined that see one of the pair of switches on a first port and the second one of the pair of switches on a second port. A list of insiders is formed for every pair of switches. It is determined whether the insider for each pair of switches is a graph edge and adjacent ones of the graph edges are determined. A symmetric adjacency matrix is formed from the graph edges to represent the topology of the data link network.
10 Citations
9 Claims
-
1. A method for discovering the topology of a network data link subnet comprising:
-
(a) forming a list of switches that comprise the network;
(b) determining a MAC address cache for each one of the switches;
(c) forming from the MAC address caches a list of insiders for every pair of switches;
(d) determining whether the insider for each pair of switches is a graph edge;
(e) determining adjacent ones of the graph edges; and
(f) forming a symmetric adjacency matrix from the graph edges to represent the topology of the network. - View Dependent Claims (2, 3, 4)
-
-
5. A method for propagating MAC tables in switches of an acyclical interconnected network comprising:
-
(a) recovering at least one edge in the interconnected network directly or indirectly connecting first and second switches on first and second ports, respectively;
(b) determining from a MAC cache in the first switch of the edge first vertices seen from the first switch from ports other than the first port;
(c) determining from a MAC cache in the second switch of the edge second vertices seen from the second switch from ports other than the second port;
(d) propagating the first vertices to the MAC cache of the second switch and the second vertices to the MAC cache of the first port;
(e) repeating steps (a) through (d) for all other edges recovered from the interconnected network;
(f) repeating steps (a) through (e) until the MAC tables in the switches are fully propagated. - View Dependent Claims (6, 7, 8, 9)
-
Specification