CN101136782A - Network topology discovering method facing to data link layer - Google Patents

Abstract

The method includes steps: based on address of gateway to be discovered to obtain current active IP address corresponding to the gateway, sorting IP addresses according to sub networks; determining types of devices corresponding to IP addresses in current sub networks to find out exchangers in current sub network, grouping exchangers in current sub network according to each port of exchanger; determining root exchanger related to gateway to be discovered, and using structure of tree type graph to save relation of connection between the root exchanger and the gateway to be discovered; determining and saving topology positions of other exchangers in current sub network, and converting topology positions in tree type graph to tree structure. The technical scheme disclosed in the invention is not dependent on protocol of spanning tree. Features are: less constraint condition of initial request, quick speed, and saving space occupied.

Description

A kind of method for discovering network topology of data-oriented link layer

Technical field

The present invention relates to field of computer network administration, particularly a kind of method for discovering network topology of data-oriented link layer.

Background technology

The internet has become the important foundation facility of modern information society.Along with the continuous progress of internet technique, network behavior and architecture present quick variation, high complexity, unmanageable trend.Network size constantly enlarges, complexity continues to increase, the isomerism of network improves day by day, heterogeneous network operating system, the network communication equipment of diversification, diversified network service software and level differ very big user and potential assailant makes present network environment quite complicated.Simultaneously, the application that emerges in an endless stream also makes the user more and more higher to the requirement of network performance.Under this trend, strengthen Network Management, set up and safeguard that credible, reliable, safety, stable network environment become important unusually.Network management has become the key of the normal operation of network system.How efficiently finding the network equipment and topological structure thereof fast, set up effective network topology model, is crucial for network management.Discovering network topology mechanism can be found the equipment and the topological structure of network in the network management system, and for example all elements in the network also has the information search function simultaneously concurrently, for example collects the ID, description of the system found etc.As the basis of network management system functional development, the purpose of discovering network topology provides network operation view, is the configuration management in the network management, the important means of fault management.Discovering network topology all is very necessary to configuration management and even whole network management.In the initial period of network management, network topology and composition are just to determine when planned network, and carrying out network configuration and fault location etc. all is that the experience of manually importing and depend on administrative staff is judged.Nowadays along with rapid development of network technique, network size is increasing, and structure also becomes increasingly complex, and its function is also more and more stronger.Network management has become the key of network system operation quality.The real-time monitoring of network and control need a kind of effective instrument, are beneficial to the administrative staff structure of awareness network and the function situation of the network equipment in time, manage bookkeepings such as the obtaining of information, fault location simultaneously.Like this, discovering network topology and network topology generate as the core of configuration management and the basis of fault management, occupy an important position in the exploitation of whole network management system.Method for discovering network topology commonly used at present has: based on SNMP (SimpleNetwork Management Protocol, Simple Network Management Protocol) method for discovering network topology, based on ICMP (InternetControl Message Protocol, internet control message protocol) method for discovering network topology and based on DNS (DomainName System, domain name system), ARP (Address Resolution Protocol, address resolution protocol), RIP (RoutingInformation Protocol, RIP), the method for discovering network topology of OSPF (Open Shortest Path First, ospf) etc.The research of algorithm of carrying out Topology Discovery is a lot.But most of algorithms all are that the 3rd layer at IP network is that network layer is carried out Topology Discovery, to the second layer be below the data link layer discovering network topology research seldom.How to realize data link layer discovering network topology problem to be solved by this invention just.

Summary of the invention

In order to find the network topology structure of data link layer, the invention provides a kind of method for discovering network topology of data-oriented link layer.Described technical scheme is as follows:

A kind of method for discovering network topology of data-oriented link layer, described method comprises:

Steps A: using simple network management protocol obtains the IP address of the current active corresponding with the gateway address of waiting to find gateway from address analysis protocol table, and is classified according to subnet in described IP address;

Step B: judge the type of IP addresses in current sub networks corresponding equipment according to Simple Network Management Protocol, find out the switch in the current sub network, the switch in the current sub network is divided into groups according to each port of switch;

Step C: definite root switch that links to each other with gateway described to be found from the switch of being found out, preserve root switch and the described annexation of waiting to find gateway with the structure of tree type figure;

Step D: whether also have the switch of definite topology location in the switch of judging in the current sub network to be found out with not ing, if having, execution in step E, if do not have, execution in step G;

Step e: obtain the uplink port that these determine the switch of topology location, and determine and the annexation of determining the switch of topology location according to the IP address of the Media Access Control address correspondence in the transmitting of each switch;

Step F: determined annexation is kept among the described tree type figure, returns step D;

Step G: described tree type figure is converted to tree structure.

Described data link layer is the link layer of thing Spanning-Tree Protocol work.

The step of the root switch that determining from the switch of being found out among the described step C links to each other with gateway described to be found is specially:

Search transmitting of the switch found out, the forwarding entry of transmitting by place switching domain uplink port in respectively transmitting, the corresponding switch of transmitting that described forwarding entry is minimum is defined as root switch.

The IP address according to the Media Access Control address correspondence in the transmitting of each switch in the described step e is determined to be specially with the step of the annexation of the switch of determining topology location:

According to the descending complete set S that obtains this switch that transmits of the switch of determining topology location, calculate the descending complete set S of each switch in the descending complete set of this switch then _n, deduct the descending complete set S of described each switch then with described descending complete set S _n, obtain the switch that all directly link to each other with the described switch of having determined topology location.

The beneficial effect of technical scheme provided by the invention:

Solve topological structure and the HUB between data link layer Topology Discovery, the main frame under the situation of no Spanning-Tree Protocol work or do not had the pinpointing the problems of so-called dummy devices such as switch of IP address, and technical scheme provided by the invention is not relied on fully in Spanning-Tree Protocol, the initial constraints that requires is less, speed is fast, saves space hold etc.

Description of drawings

Fig. 1 is the flow chart that the embodiment of the invention provides the method for discovering network topology of data-oriented link layer;

Fig. 2 is that the embodiment of the invention provides the principle schematic of normal root switch really;

Fig. 3 is the tree type figure logical construction schematic diagram that the embodiment of the invention provides;

Fig. 4 is the storage node composition of the tree type figure that provides of the embodiment of the invention;

Fig. 5 is the schematic diagram that the embodiment of the invention provides switch set under the normal root switch really;

Fig. 6 is the schematic diagram that the topology of the switch that provides of the embodiment of the invention generates HUB position in the tree;

Fig. 7 is the tree reflection schematic diagram after tree type figure that the embodiment of the invention provides is converted to tree structure;

Fig. 8 is the storage node composition that tree type figure shown in Figure 3 that the embodiment of the invention provides converts tree to.

Embodiment

For making the purpose, technical solutions and advantages of the present invention clearer, embodiment of the present invention is described in further detail below in conjunction with accompanying drawing.

The network data link layer comprises the main network equipment that connects main frame formation ethernet local area network, comprising: switch, hub and main frame (work station) etc.Ethernet is present most popular LAN backbone, because the transparency of network bridge protocol makes it become the most difficult one deck that obtains its network topology in the network.The embodiment of the invention provides no STP (Spanning Tree Protocol, Spanning-Tree Protocol) two etale topology discovery mechanisms under the environment, be applicable to tree type graph data structure and associative operation that the topology of double layer network under the no STP environment is described, and the method for discovering network topology of data-oriented link layer.

In order to describe the technical scheme in the embodiment of the invention better, at first introduce following relevant noun:

Switch up going port: be connected nearest port with gateway;

The switch down going port: except uplink port, the port that is connected with the cascaded switches or the main frame of subordinate;

Expend value: with the gateway connected node to the required line segment number of gateway;

Switching domain: the network that the following equipment of the data link layer that the main frame that is connected with a gateway, hub, switch etc. are formed forms;

Descending complete set: if the data link layer that is made of switch device is regarded as a tree, descending complete set is called in the set that following all switches of then a certain switch constitute;

Descending switching domain: by this network that each equipment is formed below switch;

Upstream switch: the switch that uplink port and this switch by this switch directly links to each other;

Downlink Switch: the switch that downlink port and this switch by this switch directly links to each other;

Up switching domain: the switching domain in whole switching domain except this switch and the descending switching domain of this switch;

Up complete set: the combination of switch in up switching domain;

Root switch: the switch that directly links to each other with gateway;

Gateway switching domain: the switching network of below gateway, forming by switch, main frame, hub;

In carrying out the Topology Discovery process, in the downlink port forwarding information of switch switching domain, exist one to be similar to tree but a kind of data structure of figure is called tree type figure.

Referring to Fig. 1, the embodiment of the invention provides a kind of method for discovering network topology of data-oriented link layer, and concrete steps are as follows:

Step 101: input waits to find the IP address of gateway.

Step 102: use SNMP obtains current active from the ARP table IP address, and the subnet classification is pressed in these IP addresses.

Step 103: use the device type that snmp protocol is judged the IP address of current active, find out the switch in the current sub network, the switch in the current sub network is divided into groups according to each port.

According to following formula and table 1 can the specified data link layer device type:

$\mathrm{sysServices}=\underset{\mathrm{Li}}{\mathrm{\Σ}}{2}^{(\mathrm{Li}-1)}$

Table 1

Device type	The L value	The sysServices value
			Physical layer equipment	1	1
Data link layer/subnet (as: bridge)	2	2
			Network layer (as: IP gateway)	3	4 or 6
Terminal (as: IP main frame)	4	8
			Application layer (as: mail relaying)	7	72

Bridge: sysServices=2 for example.

Step 104: find out the root switch that directly links to each other with gateway in the exchange group of current sub network, and the annexation of root switch and gateway is preserved with tree type graph structure.

Earlier judge root switch from the switch of finding out, judge that root switch needs a basic premise, promptly the switch of transmitting middle correspondence in a switch ports themselves is a set, and the switch in this set is with the tree tissue.The basis that this prerequisite is set up is: the annexation in switching domain between the switch may be tree or pattern structure, but if graphic structure, then certainly exist the loop,, then must cause endless loop if exist the loop not have Spanning-Tree Protocol to eliminate redundant route again.

According to top hypothesis, can think that the switch in a certain switching domain is a tree.The judgement principle of root switch is:

In tree, parents' node switch is transmitted number necessarily greater than the transmit number of its child by the uplink port forwarding by what uplink port was transmitted.Therefore in a certain switching domain, the root switch switch that it can't be otherwise promptly passes through the minimum switch of forwarding entry that this switching domain uplink port is transmitted in switch is transmitted.Wherein, the MAC of this uplink port (Media Access Control, medium access control) address is known.As shown in Figure 2, in the switching domain under the gateway, there are any two switch S ₁And S ₂, switch S wherein ₁Be S ₂Upstream switch, S ₂Be S ₁Downlink Switch.As can be seen from Figure 2, switch S ₁Switching domain=S ₁₁+ S ₁₂+ S ₁₃S wherein ₁₃Be S ₁Up complete set, S ₁₁+ S ₁₂Be S ₁Descending complete set; Switch S ₂Switching domain=S ₂₁+ S ₂₂S wherein ₂₁Be S ₂Up complete set, S ₁₂Be S ₂Descending complete set.Can draw in view of the above:

S ₂+S ₂₁+S ₂₂＝S ₁+S ₁₁+S ₁₂+S ₁₃ (1)

Because S ₂₂And S ₁₂Only differ switch S ₂Therefore itself can think S ₂₂=S ₁₂, also can ignore switch S simultaneously ₁, S ₂

So obtain: S ₂₁=S ₁₁+ S ₁₃(2)

There are formula (1) and formula (2) to derive: S ₂₁〉=S ₁₃(3)

According to above three formula, can release switch S ₁Root switch for switching domain under this gateway.

After judging root switch, need preserve the annexation of root switch and gateway with the form of tree type figure.Tree type figure wherein is a kind of tree that both had been similar to, and but is the data structure of figure.The reason that is similar to tree is as follows:

1) then certainly exists the loop if not tree, if exist the loop not have Spanning-Tree Protocol to eliminate redundant route again then must cause the forwarding endless loop;

2) in the transmitting of the downlink port of switching domain respective switch, contain the forwarding information of its brother and ancestors' node scarcely.Because such forwarding information is necessarily transmitted by uplink port.What is more important this generate each identical node of the tree degree of depth switch transmit the information that comprises its sibling scarcely downwards, thereby have the evident characteristic of tree.

3) no matter be that real physical connection or downlink port are transmitted and all had a unique root node.

It is as follows to think that it has the reason of characteristics of figure: the downlink port of arbitrary switch must comprise the physical address of all descending switching domain switches in the switching domain.

Therefore, this data structure is the figure with characteristics of tree, and this data structure logical schematic as shown in Figure 3.Abstract data type about tree type graph structure is defined as follows:

Tree type figure (Treelike Graph TG) is a finite aggregate that comprises n node, in any non-NULL tree:

1) there is and only has a specific node that is called root (Root);

2) as n〉during l, all the other nodes can be divided into the individual mutually disjoint finite aggregate T of m (m〉0) ₁, T ₂... T _m, wherein each set itself meets this definition again, and be called root subtree type figure (Sub Treelike Graph., STG):

3) any one node all has the information of pointing to its descendants.This point is different with common tree.

Abstract data type ADT Treelike-Graph{

Data object D:D is the set with data element of identical characteristics, is called vertex set.

Data relationship R:

If D is an empty set, then be called empty tree type figure;

If D only contains a data element, then R is an empty set, otherwise R={H}, H is following binary crelation:

1) have unique data element root that is called root in D, it is concerning under the H not have the forerunner;

2) if D-{root} ≠ Φ then exists one of D-{root} to divide D ₁, D ₂..., D _m(m〉0), to any j ≠ k (1≤j, k≤m), Dj ∩ DK=Φ is arranged, and to i arbitrarily (1≤i≤m), unique data element xi ∈ Di that exists has＜root Xi〉∈ H;

3) corresponding to the division of D-{root}, H-{＜root, x ₁...,＜root, X _mUnique division H arranged ₁, H ₂..., H _m(m〉0), to any j ≠ k (1≤j, k≤m), H is arranged _i∩ H _k=Φ, and to i arbitrarily (1≤i≤m), H _iBe D _iOn binary crelation, (D _i, { H _i) be a tree type figure who meets this definition, be called the subtree of root root.

4) ${\∀}_v\∈D,$ The descendants of v gathers W, ${\∀}_w\∈W,$ Then certainly exist and concern VR={＜v, w〉v ∈ D, w ∈ W and P (v, w), wherein,＜v, w〉arc of expression from V to W, predicate P (v w) has defined arc＜v, w〉meaning or information }.

Tree type figure need preserve in the mode that system can realize, Fig. 4 is the storage node composition of Fig. 3.

Step 105: whether judge in the exchange group of current sub network the uncertain switch in location,, then carry out 108 if do not have; If have, then execution in step 106.

Step 106: obtain the uplink port of the uncertain switch in position, and judge the annexation of the switch of determining with the position according to the IP address of the MAC Address correspondence in the transmitting of each switch.

Wherein, the principle of obtaining the uncertain switch in position is: in the gateway switching domain, and the i.e. Downlink Switch set of this switch of the difference of the descending complete set sum of all switches in the descending complete set of any one switch and the descending complete set of this switch.If the well-known root switch then can be tried to achieve the descending complete set of this switching domain by transmitting of root switch, and then try to achieve the descending complete set of all switches in the descending complete set of this switch, therefore can obtain the Downlink Switch of root switch.As shown in Figure 5: switch S ₁Descending complete set be S ₁₁, switch S ₁Downlink Switch set be { S ₂, S ₃, S ₄.Switch S ₂Descending complete set be S ₂₁, S ₃Descending complete set be S ₃₁, S ₄Descending complete set be S ₄₁... S _nDescending complete set be S _N1Switch S as can be seen ₁Descending complete set S ₁₁=S ₂+ S ₃+ S ₄+ ... + S _n+ S ₂₁+ S ₃₁+ S ₄₁+ ... + S _N1Therefore, the Downlink Switch S set of switch S1 ₂+ S ₃+ S ₄+ ... + S _n=S ₁₁-{ S ₂₁+ S ₃₁+ S ₄₁+ ... + S _N1.

The principle of obtaining the uplink port of the uncertain switch in position is: destination address was the uplink port that the pairing port of gateway is this switch during the link layer switch of no Spanning-Tree Protocol work was transmitted, and all the other interfaces of this switch are downlink port.

Obtain and transmit then, obtain by address designator according to snmp protocol.

In embodiments of the present invention, if have HUB (hub) in the network or do not have the switch of IP address, then judge its annexation:, then on these switches, certainly exist a HUB equipment if can determine that some switches are in switch-layer topology and generate the same level of tree and have identical upstream switch interface according to following standard.As shown in Figure 6, Fig. 6 determines that the topology of Fig. 5 switch generates the schematic diagram of HUB position in the tree, and can know switch S ₁The forwarding port of Downlink Switch.S as can be seen therefrom ₂With S ₃Be linked into upstream switch by HUB, then must have identical forwarding port on their capable switches thereon.

Step 107: the structure with tree type figure is preserved determined annexation, returns step 105.

Step 108: the tree type figure of the topological connection relation correspondence of above-mentioned all movable switches is converted to tree structure.

Convert this data structure of tree type figure to common tree structure, promptly finished the discovery of data link layer network topology under the no Spanning-Tree Protocol working condition.As shown in Figure 7, the tree type figure that Fig. 7 provides for Fig. 3 is converted to the tree reflection schematic diagram behind the tree structure, and its corresponding storage node composition is referring to Fig. 8, and concrete transfer algorithm is as follows:

Tree type figure is to conversion (the TG ， ﹠amp of tree; T)

The formation of definition node;

Initialize queue;

The formation of definition return results;

This formation of initialization;

The pointer of node is pointed in definition;

Point to first node;

Point to the next son node;

When (node is not empty)

Insert new node;

Move behind the node;

}

Return node formation=node formation;

The definition arc;

Descendants ID;

When (arc is not empty)

Deletion queue heads (﹠amp; TreeQueue ， ﹠amp; TGArc);

Move behind the node;

Point to node;

(if a certain node descendants territory of a certain node descendants territory=TreeResultQueue among the TGArc) {

Delete this node from the return results formation;

This node among the TGArc is joined TreeResultQueue;

}

}

The return results formation;

}。

By the technical scheme that the embodiment of the invention adopted, emphasis has solved topological structure and the HUB between data link layer Topology Discovery, the main frame under the situation of no Spanning-Tree Protocol work or has not had the pinpointing the problems of so-called dummy devices such as switch of IP address.That this method is not relied on fully is less in Spanning-Tree Protocol, the initial constraints that requires, algorithm time and space-efficient, has filled up the blank in this field.

The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (4)

1. the method for discovering network topology of a data-oriented link layer is characterized in that, described method comprises:

Steps A: using simple network management protocol, the IP address that from address analysis protocol table, obtains the current active corresponding with the gateway address of waiting to find gateway, and described IP address classified according to subnet;

Step B: judge the type of IP addresses in current sub networks corresponding equipment according to Simple Network Management Protocol, find out the switch in the current sub network, the switch in the current sub network is divided into groups according to each port of switch;

Step C: definite root switch that links to each other with gateway described to be found from the switch of being found out, preserve root switch and the described annexation of waiting to find gateway with the structure of tree type figure;

Step D: whether also have the switch of definite topology location in the switch of judging in the current sub network to be found out with not ing, if having, execution in step E, if do not have, execution in step G:

Step e: obtain the uplink port that these determine the switch of topology location, and determine and the annexation of determining the switch of topology location according to the IP address of the Media Access Control address correspondence in the transmitting of each switch;

Step F: determined annexation is kept among the described tree type figure, returns step D;

Step G: described tree type figure is converted to tree structure.

2. the method for discovering network topology of data-oriented link layer as claimed in claim 1 is characterized in that, described data link layer is the link layer of no Spanning-Tree Protocol work.

3. the method for discovering network topology of data-oriented link layer as claimed in claim 1 is characterized in that, the step of the root switch that determining from the switch of being found out among the described step C links to each other with gateway described to be found is specially:

Search transmitting of the switch found out, the forwarding entry of transmitting by place switching domain uplink port in respectively transmitting, the corresponding switch of transmitting that described forwarding entry is minimum is defined as root switch.

4. the method for discovering network topology of data-oriented link layer as claimed in claim 1, it is characterized in that the IP address according to the Media Access Control address correspondence in the transmitting of each switch in the described step e is determined to be specially with the step of the annexation of the switch of determining topology location:

According to the descending complete set S that obtains this switch that transmits of the switch of determining topology location, calculate the descending complete set S of each switch in the descending complete set of this switch then _n, deduct the descending complete set S of described each switch then with described descending complete set S _n, obtain the switch that all directly link to each other with the described switch of having determined topology location.

Images