CN101621402A - Method and device for processing link in network - Google Patents

Abstract

The invention discloses a method and device for processing a link in a network, belonging to the communication field. The method includes: determining blocking link information and non blocking link information in the network; determining a plurality of sub networks which are not communicated each other according to node information, the blocking link information and the non blocking link information in the network; and judging that whether the two nodes of a blocking link belongs to the same sub network, if so, the blocking link is reverted to a non blocking link. The device comprises a determining module and a judging module. In the technical scheme of the embodiment of the invention, sub networks which are not communicated in the network are determined, then further judging is carried out on the blocking link in the network according to the node information in the sub networks which are not communicated each other, and a true blocking link resulting in network division can be found according to the judging result, thus economic cost can be effectively reduced during network maintenance and optimization.

Description

The method and apparatus of link processing in the network

Technical field

The present invention relates to the communications field, the method and apparatus of link processing in particularly a kind of network.

Background technology

Based on circuit or packet-based transmission network is one of most important telecommunications basic network, it is by network node and direct interconnection network node, between network node, provide the transmission link of bandwidth to constitute, for example, wavelength division multiplexing (WavelengthDivision Multiplexing, WDM), dense wavelength division multiplexing (Dense Wavelength Division Multiplexing, DWDM) or SDH (Synchronous Digital Hierarchy) (Synchronous Digital Hierarchy, SDH) path on each layer network, link etc., its basic function is to realize that the information between the network node transmits, and this just needs to exist between the network node route (being the sequence that some conveyer chains road bandwidth constitutes) that is communicated with.

But, in the network of reality owing to transmit link active volume deficiency, interrupt losing efficacy and the network node reasons such as (all transmission links that link to each other with this node lost efficacy simultaneously) that lost efficacy, the transmission link can be lost connectedness becomes the obstruction link, for example, link capacity is 600M, and the actual needs capacity is 800M, and this moment, the capacity of this link can not satisfy actual needs, promptly became the obstruction link; If there are or occur some obstruction links in the network simultaneously, then whole network will be divided into some mutual disconnected sub-networks (in same network internal, exist between any two nodes access by, but do not exist between any two nodes that belong to heterogeneous networks access by network, can be called the soliton network again), cause belonging to and to form access between the node of different soliton networks by, and then the function that can't realization information transmits.In order to guarantee the transmitting function of network, need upgrade to blocking link (for example, the obstruction link of off-capacity being carried out dilatation) is to guarantee the connectedness of link.

In the prior art, in transmitting network operation maintenance, network evaluation and the network planning and optimization activity, all the obstruction links in the network are upgraded.But, since be not all obstruction links all be the link that causes occurring the soliton network, be some to block link be not real obstruction link, handling when blocking link like this, all obstruction links are all upgraded will increase the cost of network operation.For example; in the network optimization, adopt the method for upgrading bottleneck link capacity to make network regain connectedness through regular meeting; if block the processing mode of link in the employing prior art,, thereby increased the cost of the network optimization greatly because need all upgrade to all obstruction links.

In realizing process of the present invention, the inventor finds that there is following shortcoming at least in above-mentioned prior art:

In transmitting network operation maintenance, network evaluation and the network planning and optimization activity, all the obstruction links in the network to be upgraded, the network operation cost is big.

Summary of the invention

In order to reduce the network operation cost, the embodiment of the invention provides the method and apparatus that blocks link processing in a kind of network.

Described technical scheme is as follows:

On the one hand, the embodiment of the invention provides the method for blocking link processing in a kind of network, and described method comprises:

Determine obstruction link information and unblock link information in the network;

Determine a plurality of mutual disconnected sub-networks according to the nodal information in the described network, obstruction link information and unblock link information;

Judge whether two end nodes that block link in the described network belong to identical mutual disconnected sub-network, if be the unblock link then with described obstruction link-recovery.

On the other hand, the embodiment of the invention also provides a kind of link processing device, and described device comprises:

Determination module is used for determining the obstruction link information and the unblock link information of network, and according to the nodal information in the described network, block link information and the unblock link information is determined a plurality of mutual disconnected sub-networks;

Judge module is used for judging whether two end nodes of described network obstruction link belong to different mutual disconnected sub-networks, if then described obstruction link-recovery is the unblock link.

The beneficial effect of the technical scheme that the embodiment of the invention provides is:

The present invention is by determining mutual disconnected sub-network, whether two end nodes of judging the obstruction link that transmits network then belong to different mutual disconnected sub-networks, handle blocking link according to the result who judges, when network operation and optimization, can reduce Financial cost.

Description of drawings

Fig. 1 is the flow chart of the method for bottleneck link in the recognition network that provides of the embodiment of the invention 1;

Fig. 2 is the structural representation of the transmission network that provides of the embodiment of the invention 1;

Fig. 3 is the connective topological diagram that the network correspondence is provided among Fig. 3 of providing of the embodiment of the invention 1;

Fig. 4 be the embodiment of the invention 1 provide nodal information and link information in the connective topological diagram are carried out initialized flow chart;

Fig. 5 is the flow chart that determining of providing of the embodiment of the invention 1 comprises the mutual disconnected sub-network of a plurality of nodes;

Fig. 6 is the flow chart that determining of providing of the embodiment of the invention 1 comprises the mutual disconnected sub-network of individual node;

Fig. 7 is the structural representation of the device of bottleneck link in the recognition network that provides of the embodiment of the invention 2.

Embodiment

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

The embodiment of the invention is by determining mutual disconnected sub-network, from the obstruction link that transmits network, find the obstruction link that causes network division according to the nodal information in the mutual disconnected sub-network of determining, in the network optimization with when safeguarding, do not need that all are blocked link and all handle, thereby reduced the cost of network operation.

Embodiment 1

In the present embodiment, according to the nodal information in the network, when blocking link information and unblock link information and determining mutual disconnected sub-network, at first generate the connective topological diagram corresponding, determine a plurality of mutual disconnected sub-networks according to nodal information in the connective topological diagram and connection link information then with network according to the nodal information in the network, obstruction link information and unblock link information.Referring to Fig. 1, the embodiment of the invention provides the method for link processing in a kind of network, specifically comprises:

201: determine obstruction link information and unblock link information in the network;

202: generate the connective topological diagram corresponding with network according to the nodal information in the network, obstruction link information and unblock link information.

Wherein, connective topological diagram is made of node, connection link and non-connection link, and the process that generates connective topological diagram according to nodal information, obstruction link information and unblock link information is specific as follows:

1) node in the connective topological diagram is the node of the network corresponding with it;

2) in connective topological diagram, two nodes only exist one to be communicated with link or a non-connection link, if have at least one unblock link between two nodes in the network, then on the connective topological diagram of correspondence, the link between these two nodes is called the connection link; If the link in the network between two nodes all is to block link, then on the connective topological diagram of correspondence, the link between these two nodes is called non-connection link;

3), then on connective topological diagram, there are not any connection link or non-connection link between these two nodes if do not have any obstruction link or unblock link between two nodes in the network yet.

Connective topological diagram can represent that wherein node listing can comprise following information by node listing and list of link:

1) attribute of unique identification node adopts " nodename " to name this attribute in the present embodiment;

2) write down the attribute of soliton network numbering under this node, adopt " soliton network number " to name this attribute in the present embodiment, in the present embodiment, for the sake of simplicity, mutual disconnected sub-network all is called the soliton network;

3) record links to each other with this node and " visit mark " attribute is all link numbers of " visit ", and this attribute is named in employing " linking number " in the present embodiment.

List of link can comprise following information:

1) attribute of unique identification link adopts this link of nodename unique identification of both link ends in the present embodiment, and promptly " link a end node title " and " link z end node title " two fields are united the attribute as the unique identification link;

2) write down the attribute whether link was examined, adopt " visit mark " to name this attribute in the present embodiment, when this link was not examined, " visit mark " attribute was " visit "; Otherwise " visit mark " attribute is " visit ".

For example, referring to Fig. 2, be a transmission network of forming by Ring#1, Ring#2, Ring#3, Ring#4 and L#1.Referring to table 1, be the link table of this network, block the situation of link as can be seen from the table in the network.

Table 1

The subnet title	Link a end node title	Link b end node title	Whether " obstruction link "
				????Ring#1	????N1	????N2	Not
????Ring#1	????N2	????N3	Not
				????Ring#1	????N3	????N4	Be
????Ring#1	????N4	????N1	Be
				????Ring#2	????N3	????N4	Not
????Ring#2	????N4	????N5	Be
				????Ring#2	????N5	????N6	Not
????Ring#2	????N6	????N3	Be
				????Ring#3	????N5	????N6	Not
????Ring#3	????N6	????N7	Be
				????Ring#3	????N7	????N8	Not
????Ring#3	????N8	????N5	Not
				????Ring#4	????N3	????N6	Be
????Ring#4	????N6	????N11	Not
				????Ring#4	????N11	????N10	Be
????Ring#4	????N10	????N3	Not
				????L#1	????N3	????N9	Be

Referring to Fig. 3, for obtain according to connective topological diagram create-rule with Fig. 3 in transmit the corresponding connective topological diagram of network, this connectedness topological diagram can adopt the data structure records of the list of link shown in node listing shown in the table 2 and the table 3:

Table 2

Nodename	The soliton network number	Linking number
			????N1	?…	????…
????N2	?…	????…
			????N3	?…	????…
????N4	?…	????…
			????N5	?…	????…
????N6	?…	????…
			????N7	?…	????…
????N8	?…	????…
			????N9	?…	????…
????N10	?…	????…
			????N11	?…	????…

Table 3

Link a end node title	Link z end node title	Whether be communicated with link	The visit mark
				????N1	????N2	Be communicated with link	????…
????N2	????N3	Be communicated with link	????…
				????N3	????N4	Be communicated with link	????…
????N4	????N1	Non-connection link	????…
				????N4	????N5	Non-connection link	????…
????N5	????N6	Be communicated with link	????…
				????N3	????N6	Non-connection link	????…
????N6	????N7	Non-connection link	????…
				????N7	????N8	Be communicated with link	????…
????N8	????N5	Be communicated with link	????…
				????N6	????N11	Be communicated with link	????…
????N11	????N10	Non-connection link	????…
				????N10	????N3	Be communicated with link	????…
????N3	????N9	Non-connection link	????…

203:, determine the nodal information in the connective topological diagram and be communicated with link information according to nodal information in the network and link information.

Referring to Fig. 4, determine that the process of nodal information and link information is specific as follows in the connective topological diagram:

2031: delete the non-connection link in the connective topological diagram, upgrade connective topological diagram;

With the non-connection link circuit deleting in the list of link of connective topological diagram, i.e. non-connection link in the delete list 3, referring to table 4, for deleting the list of link behind the non-connection link:

Table 4

Link a end node title	Link z end node title	Whether be communicated with link	The visit mark
				????N1	????N2	Be communicated with link	?????…
????N2	????N3	Be communicated with link	?????…
				????N3	????N4	Be communicated with link	?????…
????N5	????N6	Be communicated with link	?????…
				????N7	????N8	Be communicated with link	?????…
????N8	????N5	Be communicated with link	?????…
				????N6	????N11	Be communicated with link	?????…
????N10	????N3	Be communicated with link	?????…

2032: every " visit mark " attribute that is communicated with link in the connective topological diagram of initialization is " not visit " with " visit mark " attribute initialization assignment;

For example, with " visit mark " attribute initialization assignment of every link in the list of link 4 " visit ", referring to Fig. 5, be the list of link after " visit mark " attribute initialization.

Further, for convenience, also in table 5, increased " connection link name " field in the present embodiment for every link.

2033: " soliton network number " attribute and " linking number " attribute of each node in the connective topology diagram of initialization, " soliton network number " attribute of node is initialized as 0, and " linking number " attribute is initialized as the connection quantity of links that " visit mark " attribute that is connected with this node is " visit ";

The node listing of connective topological diagram is as shown in table 2, referring to table 6, for " soliton network number " attribute and " linking number " attribute being carried out the node listing after the initialization assignment.

2034: soliton web search variable is set, and the initialization assignment is 0;

For example, soliton web search variable is represented with i, initialization i=0.

Table 5

Be communicated with link name	Link a end node title	Link z end node title	Whether be communicated with link	The visit mark
					????L1	????N1	????N2	Be communicated with link	Not visit
????L2	????N2	????N3	Be communicated with link	Not visit
					????L3	????N3	????N4	Be communicated with link	Not visit
????L4	????N5	????N6	Be communicated with link	Not visit
					????L5	????N7	????N8	Be communicated with link	Not visit
????L6	????N8	????N5	Be communicated with link	Not visit
					????L7	????N6	????N11	Be communicated with link	Not visit
????L8	????N10	????N3	Be communicated with link	Not visit

Table 6

Nodename	The soliton network number	Linking number
			????N1	????0	????1
????N2	????0	????2
			????N3	????0	????3
????N4	????0	????1
			????N5	????0	????2
????N6	????0	????2
			????N7	????0	????1
????N8	????0	????2
			????N9	????0	????0
????N10	????0	????1
			????N11	????0	????1

204:, determine to comprise the soliton network of a plurality of nodes according to nodal information in the connective topological diagram after the initialization and connection link information.

Referring to Fig. 5, the detailed process of soliton network of determining to comprise a plurality of nodes is as follows:

2041: judge whether there is unchecked connection link in the connective topological diagram, if then carry out 2042; Otherwise, determine to comprise the mutual disconnected sub-network of individual node, referring to shown in Figure 6.

Because " visit mark " attribute that " linking number " attribute representation is connected with node is the connected chain way order of " not visit ", so judge and whether have unchecked connection link in the connective topological diagram, promptly judge it is whether to exist " linking number " attribute to be not equal to 0 node in the node listing 6 after the initialization, as can be seen from Table 6, except node N9, " linking number " attribute of other node all is not equal to 0, therefore, carries out 2042.

2042: soliton web search variable is added up 1;

The currency of soliton web search variable i is added 1 resulting result, and assignment is given soliton web search variable i again, and the value of i is added 1 on original basis, and promptly the value of i becomes 1 by 0.

2043: from two end nodes of unchecked connection link, choose one wantonly as present node;

In node listing 6, except that node N9, optional " linking number " attribute is not equal to 0 node as present node, for example, selects N1 as present node.

2044: with present node with node that present node directly links to each other under sub-network be designated as the current sub network network;

Upgrade " soliton network number " property value of present node N1, with the currency (i=1) of soliton web search variable i " soliton network number " property value as present node, promptly the networking of the affiliated current sub network network of present node N1 is numbered 1.

Referring to table 7, be the node listing behind " soliton network number " property value that upgrades present node N1.

Table 7

Nodename	The soliton network number	Linking number
			????N1	????1	????1
????N2	????0	????2
			????N3	????0	????3
????N4	????0	????1
			????N5	????0	????2
????N6	????0	????2
			????N7	????0	????1
????N8	????0	????2
			????N9	????0	????0
????N10	????0	????1
			????N11	????0	????1

In list of link 5, be N2 with the node that present node N1 directly links to each other, " soliton network number " property value of node N2 also is updated to the currency of soliton web search variable i, promptly node N2 also is the node in the current sub network network 1.

Referring to table 8, be the node listing behind " soliton network number " property value of new node N2 more.

Table 8

Nodename	The soliton network number	Linking number
			????N1	????1	????1
????N2	????1	????2
			????N3	????0	????3
????N4	????0	????1
			????N5	????0	????2
????N6	????0	????2
			????N7	????0	????1
????N8	????0	????2
			????N9	????0	????0
????N10	????0	????1
			????N11	????0	????1

2045: the link attribute that all that link to each other with present node in the connective topological diagram is communicated with link is updated to the inspection link, and soon " visit mark " attribute of all links that link to each other with present node in the list of link is not updated to " visit " by " visit ";

In list of link 5, be L1 with a link that links to each other as some node N1, " visit mark " attribute of L1 is updated to " visit ", referring to table 9, be the list of link behind " visit mark " attribute of renewal L1.

Table 9

Be communicated with link name	Link a end node title	Link z end node title	Whether be communicated with link	The visit mark
					????L1	????N1	????N2	Be communicated with link	Visit
????L2	????N2	????N3	Be communicated with link	Not visit
					????L3	????N3	????N4	Be communicated with link	Not visit
????L4	????N5	????N6	Be communicated with link	Not visit
					????L5	????N7	????N8	Be communicated with link	Not visit
????L6	????N8	????N5	Be communicated with link	Not visit
					????L7	????N6	????N11	Be communicated with link	Not visit
????L8	????N10	????N3	Be communicated with link	Not visit

2046: upgrade the unchecked connection quantity of links that links to each other with each node in the current sub network network according to the link attribute after upgrading, promptly according to " linking number " attribute of the node in the current sub network network in " visit mark " attribute renewal node listing after upgrading in 2045;

In node listing 8, the node in the current sub network network 1 has N1 and N2; In list of link 9, not having " visit mark " property value that is connected with N1 is the link of " visit ", so " linking number " property value of N1 in the node listing 8 is updated to 0; " visit mark " attribute that is connected with N2 in the list of link 9 has 1 for the link of " visit ", i.e. L2 is so be updated to 1 with " linking number " of N2 in the node listing 8.Referring to table 10, be the node listing after upgrading.

Table 10

Nodename	The soliton network number	Linking number
			????N1	????1	????0
????N2	????1	????1
			????N3	????0	????3
????N4	????0	????1
			????N5	????0	????2
????N6	????0	????2
			????N7	????0	????1
????N8	????0	????2
			????N9	????0	????0
????N10	????0	????1
			????N11	????0	????1

2047: judge with connection link that all nodes in the current sub network network link to each other in whether have unchecked connection link, promptly judge whether have in the node of current sub network network that " " attribute is not equal to 0 node to linking number, if then carry out 2048; Otherwise, carry out 2049.

For example, in node listing 10, the node in the current sub network network 1 is N1 and N2, and " linking number " attribute of N2 is not equal to 0, therefore carries out 2048.

2048: with any node that links to each other with unchecked connection link in the current sub network network as new present node, with new present node with add the current sub network network with node that new present node directly links to each other, select in the current sub network network promptly that " " attribute is not equal to 0 node to linking number, returns 2044;

2049: the current sub network network is determined to finish, judge and whether have unchecked connection link in the connective topological diagram, promptly judge whether to exist the connection link of " visit mark " attribute for " not visit ", if, then determine that by the process of determining described current sub network network the next one comprises the sub-network of a plurality of nodes, promptly return 2042, otherwise, determine to comprise the mutual disconnected sub-network of individual node, referring to shown in Figure 6.

With the connective topological diagram among Fig. 4 is example, and the detailed process of execution 2048 is as follows:

In node listing 10, have only " linking number " attribute of node N2 to be not equal to 0 in the current sub network network 1, N2 as new present node, is returned 2044 and continues to carry out.

Because " soliton network number " attribute of present node N2 upgrades, then in list of link 9, the node that directly links to each other with present node N2 is N3, and " soliton network number " attribute of N3 is updated to the currency (i=1) of soliton web search variable, and promptly N3 also belongs to current sub network network 1.Referring to table 11, be the node listing behind " soliton network number " attribute that upgrades N3:

Table 11

Nodename	The soliton network number	Linking number
			????N1	????1	????0
????N2	????1	????1
			????N3	????1	????3
????N4	????0	????1
			????N5	????0	????2
????N6	????0	????2
			????N7	????0	????1
????N8	????0	????2
			????N9	????0	????0
????N10	????0	????1
			????N11	????0	????1

In list of link 9, the link that links to each other with present node N2 is L2, and " visit mark " attribute of L2 is updated to " visit ", referring to table 12, is the list of link after upgrading.

In node listing 11, the node in the current sub network network 1 has N1, N2 and N3; In list of link 12, not having " visit mark " attribute that is connected with node N1, N2 is the link of " visit ", so " linking number " attribute of N2 in the node listing 11 is updated to 0; " visit mark " attribute that is connected with N3 in the list of link 12 has 2 for the link of " visit ", i.e. L3 and L8 are so be updated to 2 with " linking number " attribute of N3 in the node listing 11.Referring to table 13, be the node listing after upgrading.

In node listing 13, the node in the current sub network network 1 is N1, N2 and N3, and " linking number " attribute of N3 is not equal to 0, therefore selects N3 as present node, handles by present node.

Table 12

Be communicated with link name	Link a end node title	Link z end node title	Whether be communicated with link	The visit mark
					????L1	????N1	????N2	Be communicated with link	Visit
????L2	????N2	????N3	Be communicated with link	Visit
					????L3	????N3	????N4	Be communicated with link	Not visit
????L4	????N5	????N6	Be communicated with link	Not visit
					????L5	????N7	????N8	Be communicated with link	Not visit
????L6	????N8	????N5	Be communicated with link	Not visit
					????L7	????N6	????N11	Be communicated with link	Not visit
????L8	????N10	????N3	Be communicated with link	Not visit

Table 13

Nodename	The soliton network number	Linking number
			????N1	????1	????0
????N2	????1	????0
			????N3	????1	????2
????N4	????0	????1
			????N5	????0	????2
????N6	????0	????2
			????N7	????0	????1
????N8	????0	????2
			????N9	????0	????0
????N10	????0	????1
			????N11	????0	????1

Because " soliton network number " attribute of present node N3 upgrades, then in list of link 12, with the node that present node N3 directly links to each other is N4 and N10, " soliton network number " attribute of node N4 and N10 is updated to the currency (i=1) of soliton web search variable, and promptly node N4 and N10 also belong to current sub network network 1.Referring to table 14, be the node listing behind " soliton network number " attribute of more new node N4 and N10:

Table 14

Nodename	The soliton network number	Linking number
			????N1	????1	????0
????N2	????1	????0
			????N3	????1	????2
????N4	????1	????1
			????N5	????0	????2
????N6	????0	????2
			????N7	????0	????1
????N8	????0	????2
			????N9	????0	????0
????N10	????1	????1
			????N11	????0	????1

In list of link 12, the link that links to each other with present node N3 is L3 and L8, and " visit mark " property value of L3 and L8 is updated to " visit ", referring to table 15, is the list of link after upgrading.

Table 15

Be communicated with link name	Link a end node title	Link z end node title	Whether be communicated with link	The visit mark
					????L1	????N1	????N2	Be communicated with link	Visit
????L2	????N2	????N3	Be communicated with link	Visit
					????L3	????N3	????N4	Be communicated with link	Visit
????L4	????N5	????N6	Be communicated with link	Not visit
					????L5	????N7	????N8	Be communicated with link	Not visit
????L6	????N8	????N5	Be communicated with link	Not visit
					????L7	????N6	????N11	Be communicated with link	Not visit
????L8	????N10	????N3	Be communicated with link	Visit

In node listing 14, the node in the current sub network network 1 has N1, N2, N3, N4 and N10; In list of link 12, not having " visit mark " attribute that is connected with node N1, N2, N3, N4 and N10 is the link of " visit ", so " linking number " attribute of N3, N4 and N10 in the node listing 14 is updated to 0.Referring to table 16, be the node listing after upgrading.

Table 16

Nodename	The soliton network number	Linking number
			????N1	????1	????0
????N2	????1	????0
			????N3	????1	????0
????N4	????1	????0
			????N5	????0	????2
????N6	????0	????2
			????N7	????0	????1
????N8	????0	????2
			????N9	????0	????0
????N10	????1	????0
			????N11	????0	????1

In node listing 13, the node in the current soliton network 1 is N1, N2, N3, N4 and N10, does not exist " linking number " attribute to be not equal to 0 node in these nodes, therefore carries out 2049, and promptly current soliton network 1 is determined to finish.

In list of link 15, there be the link of " visit mark " attribute for " not visit ", link L4 for example, therefore carry out 2042, upgrade the value of soliton web search variable i, the value of i is added 1, the value of i becomes 2 by 1, determine that another comprises the sub-network of a plurality of nodes, be current sub network network 2, deterministic process is identical with the process of definite current sub network network 1, repeats no more here.Node in the current sub network network 2 comprises N5, N6, N7, N8 and N11, has determined that list of link behind the current sub network network 2 and node listing are respectively shown in table 17 and table 18.

From list of link 17 as can be seen, after current sub network network 2 is determined to finish, there be not the link of " visit mark " attribute in the list of link for " not visit ", therefore, the mutual disconnected sub-network that comprises a plurality of nodes is determined to finish, determine to comprise the mutual disconnected sub-network of individual node then, referring to shown in Figure 6.

Table 17

Be communicated with link name	Link a end node title	Link z end node title	Whether be communicated with link	The visit mark
					????L1	????N1	????N2	Be communicated with link	Visit
????L2	????N2	????N3	Be communicated with link	Visit
					????L3	????N3	????N4	Be communicated with link	Visit
????L4	????N5	????N6	Be communicated with link	Visit
					????L5	????N7	????N8	Be communicated with link	Visit
????L6	????N8	????N5	Be communicated with link	Visit
					????L7	????N6	????N11	Be communicated with link	Visit
????L8	????N10	????N3	Be communicated with link	Visit

Table 18

Nodename	The soliton network number	Linking number
			????N1	????1	????0
????N2	????1	????0
			????N3	????1	????0
????N4	????1	????0
			????N5	????2	????0
????N6	????2	????0
			????N7	????2	????0
????N8	????2	????0
			????N9	????0	????0
????N10	????1	????0
			????N11	????2	????0

205: the mutual disconnected sub-network of determining to comprise individual node.

Referring to Fig. 6, the process of mutual disconnected sub-network of determining to comprise individual node is specific as follows:

2051: judge whether exist in the connective topological diagram determine under the node of sub-network, and this node be communicated with link and do not link to each other, if then carry out 2052, otherwise the mutual disconnected sub-network that comprises individual node is determined to finish;

Wherein, determine under sub-network and not be communicated with that link links to each other node be that " soliton network number " attribute all equals 0 node with " linking number " attribute in the node listing.

In node listing 18, " soliton network number " attribute of node N9 and " linking number " attribute all equal 0, therefore carry out 2052.

2052: upgrade the currency of soliton web search variable, the currency of i is added 1, promptly the value of i becomes 3 by 2;

2053: under will not determining sub-network and not be communicated with node that link links to each other as present node, sub-network under the present node is designated as current single subnet network, " soliton network number " attribute that is about to present node is updated to the currency of soliton web search variable i, returns 2051.

As present node, 3 of promptly current single subnet networks comprise node N9 with node N9." soliton network number " attribute of N9 is updated to 3,, is the node listing behind " soliton network number " attribute of new node N9 more referring to table 19.

Table 19

Nodename	The soliton network number	Linking number
			????N1	????1	????0
????N2	????1	????0
			????N3	????1	????0
????N4	????1	????0
			????N5	????2	????0
????N6	????2	????0
			????N7	????2	????0
????N8	????2	????0
			????N9	????3	????0
????N10	????1	????0
			????N11	????2	????0

So far, the subnet Lu Douyi in node listing 19 under each node determines that 205 are finished.

For example network, have 3 sub-networks in the content display network of node listing, number 1,2 and 3 respectively, wherein sub-network 1 comprises node N1, N2, N3, N4 and N10, sub-network 2 comprises node N5, N6, N7, N8 and N11, and sub-network 3 comprises node N9.

206: after having determined mutual disconnected sub-network, judge whether two end nodes that block link in the network belong to different mutual disconnected sub-networks, if then carry out 207; Otherwise, carry out 208.

Further, in the present embodiment, will cause network to produce the obstruction link of cutting apart, form some mutual disconnected sub-networks and be called bottleneck link.

To have determined that comprising the node listing that obtains after the mutual disconnected sub-network of individual node is foundation, block link to every in the network, whether two end nodes of judging this obstruction link belong to identical mutual disconnected sub-network, judge promptly whether " soliton network number " attribute under the both link ends node is identical, if then this obstruction link is non-bottleneck link; Otherwise this obstruction link is a bottleneck link.

In network shown in Figure 2,, from node listing 19, can find every " soliton network number " attribute that blocks the both link ends node, referring to table 20, for discerning the result of bottleneck link in this network for the obstruction link in the link table 1.

Table 20

The subnet title	Link a end node title	Link z end node title	The soliton network number of a end node	The soliton network number of z end node	Bottleneck link whether
						??Ring#1	????N3	????N4	????1	????1	Not
??Ring#1	????N4	????N1	????1	????1	Not
						??Ring#2	????N4	????N5	????1	????2	Be
??Ring#2	????N6	????N3	????2	????1	Be
						??Ring#3	????N6	????N7	????2	????2	Not
??Ring#4	????N3	????N6	????1	????2	Be
						??Ring#4	????N11	????N10	????2	????1	Be
??L#1	????N3	????N9	????1	????3	Be

207: the obstruction link is a bottleneck link, and will block link-recovery is the unblock link, promptly when network operation and optimization, need handle this link, for example, this link is upgraded expansion capacity etc.

208: blocking link is non-bottleneck link, when network operation and optimization, does not need this link is handled

Present embodiment is to determine to comprise the mutual disconnected sub-network of a plurality of nodes earlier, the mutual disconnected sub-network of determining to comprise individual node again is that example describes, further, also can determine to comprise the mutual disconnected sub-network of individual node earlier, determine to comprise the mutual disconnected sub-network of a plurality of nodes again, promptly 204 and 205 order can be exchanged.

In the present embodiment, by the nodal information in the network, block link information and unblock link information and generate connective topological diagram, and then according to the nodal information in the connective topological diagram be communicated with link information and determine the soliton network, intuitive and convenient, further, can also not generate connective topological diagram, directly determine the soliton network according to nodal information in the network and unblock link information, wherein, also can adopt the mode in 203 that node in the network and unblock link are carried out initialization, determine the process of soliton network and 204 to 206 similar, repeat no more herein.

In addition, block the link identification condition by changing, the method for bottleneck link can also solve multiple application problem in the recognition network that present embodiment provides:

When whether the assessment network link capacity can produce network division, can define " the link capacity utilization rate surpasses certain value " as blocking the link identification condition.For example, can define " the link capacity utilization rate surpasses 80% " as blocking the link identification condition, then all link capacity utilization rates surpass 80% link and all can be identified as the obstruction link in the network, use the method for present embodiment and can block network bottleneck link when which accurately identifying in the link being " the link capacity utilization rate surpasses 80% " at these;

When the assessment network node lost efficacy to the influencing of network topology, can define " link that links to each other with specified node " conduct " obstruction link identification condition ".For example, node A is the failure node of appointment, and then all links that link to each other with node A all can be identified as the obstruction link, and which the method that using present embodiment provides can accurately identify in these " obstruction links " be the bottleneck link of node A when losing efficacy.

Further, communication network in other technical field, when the bottleneck link set in bottleneck link set to be identified or bottleneck link and the present embodiment or bottleneck link are similar, also can use the method for bottleneck link in the recognition network that present embodiment provides and discern bottleneck link.

Present embodiment is by determining mutual disconnected sub-network, according to identifying bottleneck link in the obstruction link of the nodal information in the mutual disconnected sub-network from network, avoided when network operation and optimization, all being blocked links in the prior art and all handled, effectively reduced the Financial cost of network operation maintenance, network evaluation and planning and optimization.

Embodiment 2

Referring to Fig. 7, the embodiment of the invention provides a kind of link processing device, and this device comprises:

Determination module is used for determining the obstruction link information and the unblock link information of network, and according to the nodal information in the network, block link information and the unblock link information is determined a plurality of mutual disconnected sub-networks;

Judge module is used for judging whether two end nodes of network obstruction link belong to identical mutual disconnected sub-network, if then blocking link-recovery is the unblock link.

Further, above-mentioned determination module can specifically comprise:

The link information determining unit is used for determining the obstruction link information and the unblock link information of network;

Generation unit is used for generating connective topological diagram according to obstruction link information and unblock link information that the nodal information and the link information determining unit of network are determined;

The multinode determining unit is used for nodal information and connection link information according to the connective topological diagram of generation unit generation, determines to comprise the mutual disconnected sub-network of a plurality of nodes;

The single node determining unit is used for determining to comprise the mutual disconnected sub-network of individual node after the multinode determining unit has determined to comprise the soliton network of a plurality of nodes.

Above-mentioned determination module can also specifically comprise:

The link information determining unit is used for determining the obstruction link information and the unblock link information of network;

Generation unit is used for generating connective topological diagram according to obstruction link information and unblock link information that the nodal information and the link information determining unit of network are determined;

The single node determining unit is used for nodal information and connection link information according to the connective topological diagram of generation unit generation, determines to comprise the mutual disconnected sub-network of individual node;

The multinode determining unit is used for determining to comprise the mutual disconnected sub-network of a plurality of nodes in determined to comprise the soliton network of individual node in the single node determining unit after.

Above-mentioned multinode determining unit can specifically comprise:

First judgment sub-unit is used for judging whether the connective topological diagram that generation unit generates exists unchecked connection link;

Choose subelement, be used for when first judgment sub-unit is judged connective topological diagram and had unchecked connection link, from two end nodes of unchecked connection link optional one as present node;

Current network is determined subelement, be used for choose present node that subelement chooses with node that present node directly links to each other under the soliton network be defined as the current sub network network;

First upgrades subelement, be used for and be updated to the inspection link with all link attributes that are communicated with links of choosing that present node that subelement chooses links to each other, and upgrade the unchecked connection quantity of links that links to each other with each node in the current soliton network according to the link attribute after upgrading;

Second judgment sub-unit is used for after the renewal subelement upgrades unchecked connection quantity of links, judges whether the link that links to each other with each node in the current soliton network is checked;

New node adds subelement, be used for judging when having unchecked connection link in the connection link that links to each other with each node of current sub network network when second judgment sub-unit, with any node that links to each other with unchecked connection link in the current sub network network as new present node, with new present node with add the current sub network network with node that new present node directly links to each other;

Second upgrades subelement, be used for when new node add subelement will new present node with node adding current sub network network that new present node directly links to each other after, renewal link attribute and unchecked connection quantity of links;

Determine to finish subelement, be used for when the connection link that links to each other with each node of current sub network network all during inspected, the current sub network network is determined to finish.

Above-mentioned single node determining unit can specifically comprise:

Judgment sub-unit be used for judging whether connective topological diagram exists the node of not determining affiliated sub-network, and there is not the connection link that links to each other with this node in this node;

Determine subelement, be used for when judgment sub-unit is judged connective topological diagram and had above-mentioned node, with above-mentioned node as present node, sub-network under the present node is designated as current single subnet network, the node that in connective topological diagram, does not have sub-network under determining, and under state node and do not have the connection link that links to each other with node;

Determine to finish subelement, be used for when judgment sub-unit is judged connective topological diagram and do not had node, the mutual disconnected sub-network that comprises individual node is determined to finish.

Processing between the said apparatus module, implementation and the inventive method embodiment 1 can repeat no more referring to the description of method embodiment 1 based on same design herein.

Present embodiment is after determination module is determined mutual disconnected sub-network in the network, whether two end nodes of the obstruction link in the judge module network belong to mutual disconnected sub-network, can find out the bottleneck link that causes network division according to judged result, thereby when network operation and optimization, can reduce Financial cost effectively.

The embodiment of the invention can realize that correspondingly software can store in the storage medium that can read by software, for example, and in the hard disk of computer, floppy disk or the CD.

Below only be specific embodiments of the invention, or not all within principle of the present invention in order to restriction the present invention, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (11)

1. the method for link processing in the network is characterized in that described method comprises:

Determine obstruction link information and unblock link information in the network;

Determine a plurality of mutual disconnected sub-networks according to the nodal information in the described network, obstruction link information and unblock link information;

Judge whether two end nodes that block link in the described network belong to different mutual disconnected sub-networks, if be the unblock link then with described obstruction link-recovery.

2. the method for link processing is characterized in that in the network according to claim 1, described according to the nodal information in the described network, block link information and the unblock link information is determined a plurality of mutual disconnected sub-networks, specifically comprise:

Generate connective topological diagram according to the nodal information in the network, obstruction link information and unblock link information;

According to nodal information in the described connective topological diagram and connection link information, at first determine to comprise the mutual disconnected sub-network of a plurality of nodes, determine to comprise the mutual disconnected sub-network of individual node then.

3. the method for link processing is characterized in that in the network according to claim 1, described according to the nodal information in the described network, block link information and the unblock link information is determined a plurality of mutual disconnected sub-networks, specifically comprise:

Generate connective topological diagram according to the nodal information in the network, obstruction link information and unblock link information;

According to nodal information in the described connective topological diagram and connection link information, at first determine to comprise the mutual disconnected sub-network of individual node, and then determine to comprise the mutual disconnected sub-network of a plurality of nodes.

4. according to the method for link processing in claim 2 or the 3 described networks, it is characterized in that the described mutual disconnected sub-network of determining to comprise a plurality of nodes specifically comprises:

Judge and whether have unchecked connection link in the described connective topological diagram, if, then from two end nodes of described unchecked connection link optional one as present node, with described present node with node that described present node directly links to each other under sub-network be defined as the current sub network network;

The link attribute that all that will link to each other with described present node are communicated with link is updated to the inspection link, and the link attribute according to after upgrading upgrades the unchecked connection quantity of links that links to each other with each node in the described current soliton network;

Whether there is unchecked connection link in judgement and the connection link that each node in the described current sub network network links to each other, if, then with any node that links to each other with unchecked connection link in the described current sub network network as new present node, with described new present node with add described current sub network network with node that described new present node directly links to each other, upgrade to be communicated with link attribute and unchecked connection quantity of links, up to the connection link that links to each other with each node in described current sub network network inspected all; Otherwise described current sub network network is determined to finish.

5. according to the method for link processing in claim 2 or the 3 described networks, it is characterized in that the described soliton network of determining to comprise individual node specifically comprises:

Judge whether there is the node of not determining affiliated sub-network in the described connective topological diagram, and described node does not link to each other with the connection link;

If, then with described node as present node, the sub-network under the described present node is defined as current single subnet network, in described connective topological diagram, do not have the node of sub-network under determining, and described node be communicated with link and do not link to each other;

The node that in described connective topological diagram, does not have sub-network under determining, and described node is when being communicated with link and not linking to each other, and the mutual disconnected sub-network that then comprises individual node is determined to finish.

6. the method for link processing is characterized in that in the network according to claim 1, and described method also comprises:

When two end nodes of determining in the described network to block link belong to identical mutual disconnected sub-network, keep the blocked state of described obstruction link constant.

7. a link processing device is characterized in that, described device comprises:

Determination module is used for determining the obstruction link information and the unblock link information of network, and according to the nodal information in the described network, block link information and the unblock link information is determined a plurality of mutual disconnected sub-networks;

Judge module is used for judging whether two end nodes of described network obstruction link belong to different mutual disconnected sub-networks, if then described obstruction link-recovery is the unblock link.

8. link processing device according to claim 7 is characterized in that, described determination module specifically comprises:

The link information determining unit is used for determining the obstruction link information and the unblock link information of network;

Generation unit is used for generating connective topological diagram according to obstruction link information and unblock link information that the nodal information and the described link information determining unit of described network are determined;

The multinode determining unit is used for nodal information and connection link information according to the connective topological diagram of described generation unit generation, determines to comprise the mutual disconnected sub-network of a plurality of nodes;

The single node determining unit is used for determining to comprise the mutual disconnected sub-network of individual node after described multinode determining unit has determined to comprise the mutual disconnected sub-network of a plurality of nodes.

9. link processing device according to claim 7 is characterized in that, described determination module specifically comprises:

The link information determining unit is used for determining the obstruction link information and the unblock link information of network;

Generation unit is used for generating connective topological diagram according to obstruction link information and unblock link information that the nodal information and the described link information determining unit of described network are determined;

The single node determining unit is used for nodal information and connection link information according to the connective topological diagram of described generation unit generation, determines to comprise the mutual disconnected sub-network of individual node;

The multinode determining unit is used for determining to comprise the mutual disconnected sub-network of a plurality of nodes after having determined to comprise the soliton network of individual node in described single node determining unit.

10. according to Claim 8 or 9 described link processing device, it is characterized in that described multinode determining unit specifically comprises:

First judgment sub-unit is used for judging whether the connective topological diagram that described generation unit generates exists unchecked connection link;

Choose subelement, be used for when described first judgment sub-unit is judged described connective topological diagram and had unchecked connection link, from two end nodes of described unchecked connection link optional one as present node;

Current network is determined subelement, be used for described choose present node that subelement chooses with node that described present node directly links to each other under sub-network be defined as the current sub network network;

First upgrades subelement, be used for and be updated to the inspection link with the link attribute that described all that choose that present node that subelement chooses links to each other are communicated with links, and upgrade the unchecked connection quantity of links that links to each other with each node in the described current soliton network according to the link attribute after upgrading;

Second judgment sub-unit is used for after described renewal subelement upgrades described unchecked connection quantity of links, judges whether the link that links to each other with each node in the described current soliton network is not checked;

New node adds subelement, be used for judging when having unchecked connection link in the connection link that links to each other with described each node of current sub network network when described second judgment sub-unit, with any node that links to each other with unchecked connection link in the described current sub network network as new present node, with described new present node with add described current sub network network with node that described new present node directly links to each other;

Second upgrades subelement, be used for when described new node add subelement with described new present node with after node that described new present node directly links to each other adds described current sub network network, renewal link attribute and unchecked connection quantity of links;

Determine to finish subelement, be used for when the connection link that links to each other with described each node of current sub network network all during inspected, described current sub network network is determined to finish.

11. according to Claim 8 or 9 described link processing device, it is characterized in that described single node determining unit specifically comprises:

Judgment sub-unit, be used for judging described connective topological diagram whether exist determine under the node of sub-network, and described node is not deposited and is communicated with link and links to each other;

Determine subelement, be used for when described judgment sub-unit is judged described connective topological diagram and had described node, with described node as present node, sub-network under the described present node is designated as current single subnet network, the node that in described connective topological diagram, does not have sub-network under determining, and under state node be communicated with link and do not link to each other;

Determine to finish subelement, be used for when described judgment sub-unit is judged described connective topological diagram and do not had described node, the mutual disconnected sub-network that comprises individual node is determined to finish.

Images