CN105247823B - The method and apparatus for adjusting link overhead - Google Patents

Abstract

An embodiment of the present invention provides a kind of methods of adjustment link overhead, can avoid the generation of micro-loop phenomenon, method from including：Determine at least one pending node pair；Determine that the path cost changing value of each pending node, the path cost changing value of each pending node are the differences of the first path expense and the second path cost of each pending node；According to the path cost changing value of pending node, the link overhead of first link is adjusted at least twice, with in the first link when restoring from failure, the next-hop node of each pending node centering on the first path is set to be migrated to first path prior to the optimal path of the near first node of upper hop node, or when the first link breaks down, the upper hop node of each pending node centering on the first path is made to migrate out first path prior to the optimal path of the near first node of next-hop node.

Description

The method and apparatus for adjusting link overhead

Technical field

The present invention relates to the communications fields, and more particularly, to the method and apparatus of adjustment link overhead.

Background technology

At present it is known that a kind of technology is adopted in the network equipment of Internet protocol (IP, Internet Protocol) network It is calculated with distributed intradomain gateway agreement (Interior Gateway Protocol), that is, every network equipment is individually dispatched Router-level topology is executed, out-of-order controls each other.Therefore, when link failure or fault recovery occurs, due to each network Difference on the internal and external environment of difference and equipment operation of the equipment in hardware capabilities, leads to the startup time of router-level topology Point, operation duration calculate end time point and issue forwarding information storehouse (FIB, Fowarding Information Base) The time point of list item is inconsistent, and then leads to the appearance of micro-loop phenomenon.

Specifically, in IP network shown in Fig. 2, for example, when the link between node a and node b is extensive from failure When multiple, for example, if the hardware capabilities of node c are stronger than the hardware capabilities of node b, and the load of node c is negative less than node b It carries, then node c is completed to the calculating of routing and to issuing for fib table item prior to node b, and in turn, node c will be from node c to section From path 1, (path is followed successively by node c, node d, node e, node f, node a) by transfer sequence and switches the optimal path of point a To path 2, (path includes node c, node b, node a) successively by transfer sequence, and in other words, node c switches from link c → d To link c → b, to which node c sends the data to node b when needing to node a transmission datas.At this point, b pairs of node The calculating of routing and issuing for fib table item is not yet completed, still by path 3, (path includes successively node b by transfer sequence Node b, node c, node d, node e, node f, node a) are as from node b, to the optimal path of node a, thus, node b exists When needing to node a transmission datas, link b → c is selected, gives the data to node c.In this way, between node b and node c There is micro-loop phenomenon, that is, data repeatedly forward between node b and node c, data may be caused to transmit in an ip network Overlong time and be dropped.

Accordingly, it is desirable to provide a kind of technology, can prevent the appearance of micro-loop phenomenon.

Invention content

The present invention provides a kind of method and apparatus of adjustment link overhead, can prevent the appearance of micro-loop phenomenon.

In a first aspect, a kind of method of adjustment link overhead is provided, in the communication system including at least three nodes It executes, wherein be directly connected to by the first link between first node and second node, which, which is used for transmission, needs to send out It send to the data of the first node, this method includes：When first link breaks down or restores from failure, the network equipment At least one pending node pair is determined from least three node, wherein each pending node is to including via one Two connected pending nodes of link, the pending node can by do not include first link the second path to this One node sends message, also, the pending node can pass through the including first link when first link is normal The radial first node sends message all the way, wherein second path is from a pending node to the first node Not include first link path in total link overhead minimum path, a first path be first link just Mono- pending node of Chang Shicong is to the optimal path of the first node, also, each pending node centering is each pending Node is different with the relationship of jump up and down in first path on a second path；The network equipment determines the path of each pending node The path cost changing value of expense changing value, each pending node is first path expense and the second tunnel of each pending node The difference of diameter expense, the first path expense are total link overheads when the first link is normal on the first path, this Two path costs are total link overheads on a second path；The network equipment becomes according to the path cost of the pending node Change value adjusts the link overhead of first link at least twice, when restoring from failure, to make in first link Optimal road of the next-hop node of each pending node centering on the first path prior to the near first node of upper hop node Diameter is migrated to the first path, or when first link breaks down, to make each pending node centering on the first path Upper hop node migrate out the first path prior to the optimal path of the near first node of next-hop node.

With reference to first aspect, in the first realization method of first aspect, the network equipment is according to the pending node Path cost changing value, the link overhead of first link is adjusted at least twice, including：The network equipment is waited for from this It handles in node, determines N number of destination node, wherein the number of the destination node is less than or equal to the number of the pending node；It should The network equipment carries out n times adjustment according to the path cost changing value of the respectively destination node to the link overhead of first link.

With reference to first aspect and its above-mentioned realization method, in second of realization method of first aspect, the network equipment From the pending node, N number of destination node is determined, including：The network equipment is by the whole of the pending node, as the N A destination node.

With reference to first aspect and its above-mentioned realization method, in the third realization method of first aspect, the network equipment According to the path cost changing value of the respectively destination node, n times adjustment is carried out to the link overhead of first link, including：At this When restoring from failure, which changes the path cost of the respectively destination node in a manner of successively decreasing first link Value carries out the first sequence processing；The network equipment carries out n times adjustment to the link overhead of first link, so that ith adjusts The difference of link overhead when the link overhead of the first link afterwards and normal first link is less than the first value and is more than second value, Wherein, which is by the first sequence treated i-th of path cost changing value, which is each first object Maximum value in the path cost changing value of node, the first object node and the second destination node constitute pending node It is right, and the first object node is the upper hop node of second destination node in first path, which is By corresponding to the first sequence treated i-th of path cost changing value node or the second value be by this first Sequence treated i+1 path cost changing value.

With reference to first aspect and its above-mentioned realization method, in the 4th kind of realization method of first aspect, the network equipment According to the path cost changing value of the respectively destination node, n times adjustment is carried out to the link overhead of first link, including：At this When restoring from failure, which incrementally, changes the path cost of the respectively destination node first link Value carries out the second sequence processing；The network equipment carries out n times adjustment to the link overhead of first link, so that ith adjusts The difference of link overhead when the link overhead of the first link afterwards and normal first link is less than third value and is more than the 4th value, Wherein, which is by the second sequence treated the N-i+1 path cost changing value, and the 4th value is each third Maximum value in the path cost changing value of destination node, the third destination node and the 4th destination node constitute pending section Point pair, and the third destination node is the upper hop node of the 4th destination node, the 4th destination node in first path Be by corresponding to the second sequence treated the N-i+1 path cost changing value node or the 4th value be by Second sequence treated the N-i path cost changing value.

With reference to first aspect and its above-mentioned realization method, in the 5th kind of realization method of first aspect, the network equipment According to the path cost changing value of the respectively destination node, n times adjustment is carried out to the link overhead of first link, including：At this When first link breaks down, which incrementally, carries out the path cost changing value of the respectively destination node Third sequence is handled；The network equipment carries out n times adjustment to the link overhead of first link, so that the after ith adjustment The difference of link overhead when the link overhead of one link and normal first link is more than the 5th value and is less than the 6th value, wherein 6th value is by third sequence treated i+1 path cost changing value, and the 5th value is each 5th target section Maximum value in the path cost changing value of point, the 5th destination node and the 6th destination node constitute pending node pair, And the 5th destination node in first path be the 6th destination node upper hop node, the 6th destination node be by Node or the 5th value corresponding to third sequence treated i+1 path cost changing value are by third row Sequence treated i-th of path cost changing value.

With reference to first aspect and its above-mentioned realization method, in the 6th kind of realization method of first aspect, the network equipment According to the path cost changing value of the respectively destination node, n times adjustment is carried out to the link overhead of first link, including：At this When first link breaks down, which carries out the path cost changing value of the respectively destination node in a manner of successively decreasing 4th sequence is handled；The network equipment carries out n times adjustment to the link overhead of first link, so that the after ith adjustment The difference of link overhead when the link overhead of one link and normal first link is more than the 7th value and is less than the 8th value, wherein 8th value is by the 4th sequence treated the N-i path cost changing value, and the 7th value is each 7th target section Maximum value in the path cost changing value of point, the 7th destination node and the 8th destination node constitute pending node pair, And the 7th destination node in first path be the 8th destination node upper hop node, the 8th destination node be by Node or the 7th value corresponding to 4th sequence treated the N-i+1 path cost changing value are by the 4th Sequence treated the N-i+1 path cost changing value.

With reference to first aspect and its above-mentioned realization method, in the 7th kind of realization method of first aspect, the network equipment Carrying out adjustment at least twice to the link overhead of first link includes：The network equipment determines that each destination node calculates optimal road Diameter required processing time；The network equipment manages the time according to this, determines the time interval between this is adjusted at least twice； The network equipment adjusts the link overhead of first link according to the time interval at least twice.

With reference to first aspect and its above-mentioned realization method, in the 8th kind of realization method of first aspect, the network equipment For the second node.

Second aspect, provides a kind of device of adjustment link overhead, which includes：Pending node determination unit, For when first link breaks down or restores from failure, at least one pending section to be determined from least three nodes Point pair, wherein each pending node is to including two pending nodes being connected via a link, the pending node energy Enough the second paths by not including the first link send message to the first node of at least three node, also, this waits locating Message can be sent by the first path including first link when first link is normal to the first node by managing node, Wherein, second path is total in the not path including first link to the first node from a pending node Link overhead minimum path, a first path be when first link is normal from a pending node to this first The optimal path of node, also, each pending node of each pending node centering on a second path in first path The relationship of jump up and down it is different, it is direct by first link between the second node and the first node at least three node Connection, first link are used for transmission the data for needing to be sent to the first node；Path cost changing value determination unit, is used for Determine the path cost changing value of each pending node, the path cost changing value of each pending node is each pending node First path expense and the second path cost difference, which is when the first link is normal in first path On total link overhead, which is total link overhead on a second path；Link overhead adjustment unit, For the path cost changing value according to each pending node, the link overhead of first link is adjusted at least twice, With, when restoring from failure, make in first link next-hop node of each pending node centering on the first path prior to The optimal path of the near first node of upper hop node is migrated to the first path, or to break down in first link When, make the upper hop node of each pending node centering on the first path first node near prior to next-hop node most Shortest path migrates out the first path.

In conjunction with second aspect, in the first realization method of second aspect, the link overhead adjustment unit be additionally operable to from In the pending node, N number of destination node is determined, wherein the number of the destination node is less than or equal to the number of the pending node Mesh；For the path cost changing value according to the respectively destination node, n times adjustment is carried out to the link overhead of first link.

In conjunction with second aspect and its above-mentioned realization method, in second of realization method of second aspect, the link overhead Adjustment unit is specifically used for by the whole of the pending node, as N number of destination node.

In conjunction with second aspect and its above-mentioned realization method, in the third realization method of second aspect, the link overhead Adjustment unit is specifically used in first link when restoring from failure, and the network equipment is in a manner of successively decreasing, to the respectively mesh The path cost changing value for marking node carries out the first sequence processing；N times adjustment is carried out for the link overhead to first link, So that the difference of the link overhead when link overhead and normal first link of the first link after ith adjustment is less than the first value And it is more than second value, wherein first value is by the first sequence treated i-th of path cost changing value, this second Value is the maximum value in the path cost changing value of each first object node, the first object node and the second destination node structure At pending node pair, and the first object node is the upper hop node of second destination node in first path, this Two destination nodes are by the node or the second value corresponding to the first sequence treated i-th of path cost changing value It is by the first sequence treated i+1 path cost changing value.

In conjunction with second aspect and its above-mentioned realization method, in the 4th kind of realization method of second aspect, the link overhead Adjustment unit be specifically used in first link when restoring from failure, the network equipment incrementally, to the respectively mesh The path cost changing value for marking node carries out the second sequence processing；N times adjustment is carried out for the link overhead to first link, So that the difference of the link overhead when link overhead and normal first link of the first link after ith adjustment is less than third value And be more than the 4th value, wherein the third value be by the second sequence treated the N-i+1 path cost changing value, this 4th value is the maximum value in the path cost changing value of each third destination node, the third destination node and the 4th target section Point constitutes pending node pair, and the third destination node is the upper hop node of the 4th destination node in first path, 4th destination node be by the node corresponding to the second sequence treated the N-i+1 path cost changing value, or 4th value is by the second sequence treated the N-i path cost changing value.

In conjunction with second aspect and its above-mentioned realization method, in the 5th kind of realization method of second aspect, the link overhead Adjustment unit be specifically used for when first link breaks down, the network equipment incrementally, to the respectively destination node Path cost changing value carry out third sequence processing；N times adjustment is carried out for the link overhead to first link, so that the The difference of link overhead when the link overhead and normal first link of the first link after i adjustment is more than the 5th value and is less than 6th value, wherein the 6th value is by third sequence treated i+1 path cost changing value, and the 5th value is Maximum value in the path cost changing value of each 5th destination node, the 5th destination node are waited for the 6th destination node composition Node pair is handled, and the 5th destination node is the upper hop node of the 6th destination node, the 6th mesh in first path Mark node be by corresponding to third sequence treated i+1 path cost changing value node or the 5th value be By third sequence treated i-th of path cost changing value.

In conjunction with second aspect and its above-mentioned realization method, in the 6th kind of realization method of second aspect, the link overhead Adjustment unit is specifically used for when first link breaks down, and the network equipment is in a manner of successively decreasing, to the respectively destination node Path cost changing value carry out the 4th sequence processing；N times adjustment is carried out for the link overhead to first link, so that the The difference of link overhead when the link overhead and normal first link of the first link after i adjustment is more than the 7th value and is less than 8th value, wherein the 8th value is by the 4th sequence treated the N-i path cost changing value, and the 7th value is Maximum value in the path cost changing value of each 7th destination node, the 7th destination node are waited for the 8th destination node composition Node pair is handled, and the 7th destination node is the upper hop node of the 8th destination node, the 8th mesh in first path Mark node is by the node or the 7th value corresponding to the 4th sequence treated the N-i+1 path cost changing value It is by the 4th sequence treated the N-i+1 path cost changing value.

In conjunction with second aspect and its above-mentioned realization method, in the 7th kind of realization method of second aspect, the link overhead Adjustment unit is additionally operable to determine that each destination node calculates optimal path required processing time；For managing the time according to this, Determine the time interval between this is adjusted at least twice；For according to the time interval, to the link overhead of first link into Row adjusts at least twice.

In conjunction with second aspect and its above-mentioned realization method, in the 8th kind of realization method of second aspect, which is should Second node.

The method and apparatus of adjustment link overhead according to the ... of the embodiment of the present invention, pass through what is pair be directly connected to first node The link overhead of first link is repeatedly adjusted, including first link and when first link is normal as to this In each first path of the optimum link of one node, in the first link when from failure restoring, make to be likely to occur micro-loop phenomenon Pending node centering next-hop node on the first path prior to the near first node of upper hop node optimal path It migrates to first path, or when the first link breaks down, is centered in making the pending node for being likely to occur micro-loop phenomenon Upper hop node in first path migrates out first path prior to the optimal path of the near first node of next-hop node, from And it can prevent micro-loop phenomenon occur between each pending node pair.

Description of the drawings

In order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be in embodiment or description of the prior art Required attached drawing is briefly described, it should be apparent that, the accompanying drawings in the following description is only some realities of the present invention Example is applied, it for those of ordinary skill in the art, without creative efforts, can also be according to these attached drawings Obtain other attached drawings.

Fig. 1 is the schematic flow chart of the method for the adjustment link overhead of one embodiment of the invention.

Fig. 2 is the schematic of an example for the communication system that the method for the adjustment link overhead of one embodiment of the invention is applicable in Organization Chart.

Fig. 3 is made with first node in the communication system that the method for the adjustment link overhead of one embodiment of the invention is applicable in For tree root when reverse optimal path priority algorithm schematic topological diagram.

Fig. 4 is the schematic block diagram of the device of the adjustment link overhead of one embodiment of the invention.

Fig. 5 is the schematic diagram of the equipment of the adjustment link overhead of one embodiment of the invention.

Specific implementation mode

Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete Site preparation describes, it is clear that described embodiments are some of the embodiments of the present invention, instead of all the embodiments.Based on this hair Embodiment in bright, every other implementation obtained by those of ordinary skill in the art without making creative efforts Example, shall fall within the protection scope of the present invention.

Technical scheme of the present invention can be applied to various communication systems, such as：Global system for mobile communications (GSM, Global System of Mobile communication), CDMA (CDMA, Code Division Multiple Access) system, wideband code division multiple access (WCDMA, Wideband Code Division Multiple Access Wireless), General Packet Radio Service (GPRS, General Packet Radio Service), long term evolution (LTE, Long Term Evolution) etc..

Fig. 1 is the schematic flow chart of the method 100 of the adjustment link overhead of one embodiment of the invention.This method 100 exists It is executed in communication system including at least three nodes, wherein direct by the first link between first node and second node Connection, which is used for transmission the data for needing to be sent to the first node, as shown in Figure 1, this method 100 includes：

S110, when first link breaks down or restores from failure, the network equipment is from least three node Determine at least one pending node pair, wherein each pending node is to including waiting locating via two that a link is connected Node is managed, which can send message by the second path not including first link to the first node, and And the pending node can when first link is normal by the first path including first link to the first node Send message, wherein second path be from a pending node to the first node not include first link Path in total link overhead minimum path, a first path is when first link is normal from a pending section Point to the first node optimal path, also, each pending node of each pending node centering on a second path and The relationship of jump up and down in first path is different；

S120, the network equipment determine the path cost changing value of each pending node, the path of each pending node Expense changing value is the difference of the first path expense and the second path cost of each pending node, which is to work as Total link overhead when first link is normal on the first path, second path cost are total chains on a second path Road expense；

S130, the network equipment open the link of first link according to the path cost changing value of the pending node Pin is adjusted at least twice, when restoring from failure, each pending node to be made to be centered in the first via in first link Next-hop node on diameter is migrated prior to the optimal path of the near first node of upper hop node to the first path, or

When first link breaks down, to make the upper hop node of each pending node centering on the first path first The first path is migrated out in the optimal path of the near first node of next-hop node.

In the prior art, it when link failure or fault recovery occurs, disposably adjusts and issues faulty link Link overhead, each node in network recalculates optimal path based on the link overhead, since each network equipment is in hardware Difference in ability and the difference on the internal and external environment of equipment operation, cause startup time point of router-level topology, operation duration, Calculating end time point and the time point for issuing forwarding information storehouse list item are inconsistent, and then lead to the appearance of micro-loop phenomenon.

In contrast, in embodiments of the present invention, it is adjusted by multiple (at least twice) and issues the link of faulty link Expense makes to include that next-hop node on the former optimal path of the faulty link will prior to a upper node in link-recovery Optimal path switches back into former optimal path, in link failure, the upper hop node on former optimal path is made to be saved prior to next Optimal path is migrated out former optimal path by point.Thus, it is possible to avoid the appearance of micro-loop phenomenon.

Specifically, in embodiments of the present invention, this method 100 is needed in the IP network for including multiple (at least three) nodes It is executed in network, Fig. 2 shows an examples for the communication system 200 that this method 100 is applicable in.As shown in Fig. 2, the communication system 200 Include for example, 10 nodes, i.e.,：Node a, node b, node c, node d, node e, node f, node g, node h, node i, Node g.

It should be understood that the structure of communication system 200 listed above is merely illustrative, the present invention is not limited to this, Arbitrary change can be carried out to the connection relation between the number and each node of included node.

Below in order to make it easy to understand, without loss of generality, using node a as first node, being saved using node b as second Point, link b → a that the data of node a are sent to for transmission node b are illustrated as the first link.

Optionally, in embodiments of the present invention, which is the second node.

Can be second node (for example, node b), can also be specifically, the subject of implementation as this method 100 The network equipment for link overhead to be broken down or adjusted when fault recovery in the first link (for example, link b → a), also, The network equipment can be independently arranged, and can also be arranged on one or more nodes, also, in embodiments of the present invention, right In each link in system 200, the network equipment for executing this method 100 can be respectively configured, it can also be by One network equipment uniformly breaks down to each link or link overhead adjustment when fault recovery, the present invention be not special It does not limit.

Hereinafter, in order to make it easy to understand, without loss of generality, using node b as the network equipment, illustrating.

S110, node b can detect the working condition of link b → a, and break down in link b → a or from failure it is extensive When multiple, determine and need to execute this method 100, also, the detection method can be same as the prior art or similar, here, in order to It avoids repeating, the description thereof will be omitted.

As noted previously, as micro-loop phenomenon is happened between a pair of pending node, that is, two pending nodes are in link Before and after b → a breaks down, the relationship of jump up and down on selected optimal path is on the contrary, therefore, node b can be determined by chain Road b → a break down or the influence that restores from failure and need to recalculate and select each node of optimal path (pending Node).

In system 200 shown in Fig. 2, the link overhead of link b → a is 10, and the link overhead of link b → g is 10, chain The link overhead of road g → i is 10, and the link overhead of link i → j is 10, and the link overhead of link j → a is 100, link b → c Link overhead be 10, the link overhead of link c → d is 10, and the link overhead of link d → e is 10, and the link of link e → f is opened Pin is 10, and the link overhead of link f → a is 100, and the link overhead of link f → a is 10.

It should be understood that the numerical value of each link overhead listed above is merely illustrative, the present invention is not limited to this, right In the link overhead of each link, can arbitrarily change.

The path of node b to node a include：Path 1 (that is, link b → a), path 2 (including link b → g, link g → I, link i → j, link j → a), path 3 (including link b → c, link c → d, link d → e, link e → f, link f → a). Wherein, the total link expense in path 1 is the link overhead (that is, 10) of link b → a, and the total link expense in path 2 is link b → g Link overhead, the link overhead of link g → i, the link overhead of link i → j, the sum of the link overhead of link j → a (that is, 130), the total link expense in path 3 is the link of the link overhead of link b → c, the link overhead of link c → d, link d → e The sum of expense, the link overhead of link e → f, the link overhead of link f → a (that is, 140).Therefore, when link b → a is normal, The optimal path of node b to node a is path 1.When link b → a failures, the optimal path of node b to node a is path 2.

The path of node c to node a include：Path 4 (including link c → b, link b → a), path 5 (including link c → B, link b → g, link g → i, link i → j, link j → a), path 6 (including link c → d, link d → e, link e → f, Link f → a).Wherein, pass through read group total as described above, it may be determined that the total link expense in path 4 be 20, path 5 it is total Link overhead is 140, and the total link expense in path 6 is 130.Therefore, when link b → a is normal, node c is optimal to node a's Path is path 4.When link b → a failures, the optimal path of node c to node a is path 6.

The path of node d to node a include：Path 7 (including link d → c, link c → b, link b → a), (packet of path 8 Include link d → c, link c → b, link b → g, link g → i, link i → j, link j → a), path 9 (including link d → e, Link e → f, link f → a).Wherein, passing through read group total as described above, it may be determined that the total link expense in path 7 is 30, The total link expense in path 8 is 150, and the total link expense in path 9 is 120.Therefore, when link b → a is normal, node d to section The optimal path of point a is path 7.When link b → a failures, the optimal path of node d to node a is path 9.

The path of node e to node a include：Path 10 (including link e → d, link d → c, link c → b, link b → A), path 11 (including link e → d, link d → c, link c → b, link b → g, link g → i, link i → j, link j → A), path 12 (including link e → f, link f → a).Wherein, pass through read group total as described above, it may be determined that path 10 Total link expense is 40, and the total link expense in path 11 is 160, and the total link expense in path 12 is 110.Therefore, when link b → When a is normal, the optimal path of node e to node a is path 10.When link b → a failures, the optimal road of node e to node a Diameter is path 12.

The path of node f to node a include：Path 13 (including link f → e, link e → d, link d → c, link c → B, link b → a), path 14 (including link f → e, link e → d, link d → c, link c → b, link b → g, link g → i, Link i → j, link j → a), path 15 (including link f → a).Wherein, pass through read group total as described above, it may be determined that The total link expense in path 13 is 50, and the total link expense in path 14 is 170, and the total link expense in path 15 is 100.Therefore, When link b → a is normal, the optimal path of node f to node a is path 13.When link b → a failures, node f to node a Optimal path be path 15.

The path of node g to node a include：Path 16 (including link g → b, link b → a), (including the link g of path 17 → i, link i → j, link j → a), path 18 (including link g → b, link b → c, link c → d, link d → e, link e → F, link f → a).Wherein, pass through read group total as described above, it may be determined that the total link expense in path 16 is 20, path 17 Total link expense be 120, the total link expense in path 18 is 150.Therefore, when link b → a is normal, node g to node a Optimal path be path 16.When link b → a failures, the optimal path of node g to node a is path 17.

The path of node h to node a include：Path 19 (including link h → g, link g → b, link b → a), path 20 (including link h → g, link g → i, link i → j, link j → a), path 21 (including link h → g, link g → b, link b → c, link c → d, link d → e, link e → f, link f → a).Wherein, pass through read group total as described above, it may be determined that The total link expense in path 19 is 30, and the total link expense in path 20 is 130, and the total link expense in path 21 is 160.Therefore, When link b → a is normal, the optimal path of node h to node a is path 19.When link b → a failures, node h to node a Optimal path be path 20.

The path of node i to node a include：Path 22 (including link i → g, link g → b, link b → a), path 23 (including link i → j, link j → a), path 24 (including link i → g, link g → b, link b → c, link c → d, link d → e, link e → f, link f → a).Wherein, pass through read group total as described above, it may be determined that the total link expense in path 22 It is 30, the total link expense in path 23 is 110, and the total link expense in path 24 is 160.Therefore, when link b → a is normal, section The optimal path of point i to node a is path 22.When link b → a failures, the optimal path of node i to node a is path 23.

The path of node j to node a include：Path 25 (including link j → i, link i → g, link g → b, link b → A), path 26 (including link j → a), path 27 (including link j → i, link i → g, link g → b, link b → c, link c → d, link d → e, link e → f, link f → a).Wherein, pass through read group total as described above, it may be determined that path 25 Total link expense is 40, and the total link expense in path 26 is 100, and the total link expense in path 27 is 170.Therefore, when link b → When a is normal, the optimal path of node j to node a is path 25.When link b → a failures, the optimal road of node j to node a Diameter is path 26.

As described previously for above-mentioned node b, node c, node d, node e, node f, node g, node h, node i, node J, when link b → a breaks down or when fault recovery, until the optimal path of node a changes, also, in link b → a When normal, optimum link includes link b → a.Hence, it can be determined that in the system 200, node b, node c, node d, section Point e, node f, node g, node h, node i, node j are in the node that link b → a breaks down or when fault recovery is impacted (pending node).

It should be understood that since the network architecture changes with the increase and decrease of connection and node between node, by the first link shadow Loud node can also change when different framework or framework change, and therefore, pending node listed above is only For exemplary illustration, the present invention is not limited to this, can select the affected node according to the network architecture.

, can be from above-mentioned affected node after determining affected node, determination is respectively likely to occur micro-loop elder generation phenomenon Pending node pair, for example, in path 4 (first path of node c), node b is the next-hop node of node c, in path 2 In (the second path of node b), node b is the upper hop node of node c, that is, before and after link b → a failures, node b and section The relationship of jump up and down of point c changes, and micro-loop phenomenon is likely to occur between node b and node c, therefore, node b and node c Constitute a pair of pending node pair.

Similarly, node c and node b constitutes a pair of pending node pair；Node d and node c constitutes a pair of pending Node pair, node e and node d constitute a pair of pending node pair, and node f and node e constitutes a pair of pending node pair, Node b and node g constitute a pair of pending node pair, and node g and node i constitute a pair of pending node pair, node i with Node j constitutes a pair of pending node pair.

It should be noted that in embodiments of the present invention, in path 19 (first path of node h) and (the node h of path 20 The second path) in, the next-hop node of node h is node g, thus between node h and node g be not present micro-loop problem. Therefore, not using node h as pending node.

It should be understood that in embodiments of the present invention, " first path " refers to, it is normal in faulty link (for example, link b → a) When, (for example, the optimal path of node a), also, the path is with link b → a for an end node of a node to the faulty link One section as path.Therefore, for different nodes, first path is different.

" the second path " refers to, in faulty link (for example, link b → a) failure, a node to the faulty link One end node (for example, the optimal path of node a), since link b → a breaks down at this time, to which the path will not be with link b One section as path of → a.Therefore, for different nodes, the second path is different.

It should be noted that in embodiments of the present invention, a pending node is to two included pending nodes Between by a link be connected, also, as described above determine pending node (in other words, break down in the first link Or impacted node when fault recovery) in not include first node (here, be node a).

S120, node b can be by the nodes of above-mentioned pending node centering, and as pending node, also, node b can With the switching threshold (path cost changing value) of the above-mentioned pending node of determination, it refers to that triggering path switches to be somebody's turn to do " switching threshold " Critical value, that is, when the link overhead of link b → a is more than the switching threshold, impacted node will not select to include link b The path of → a is impacted when the link overhead of link b → a is less than the switching threshold as the optimal path to node a Node can select include link b → a path as the optimal path to node a.

It in embodiments of the present invention, can will be on the optimal path in the first link failure of a pending node Total link overhead (the second path cost) and total link overhead (first via on the optimal path when the first link is normal Diameter expense) difference, the switching threshold as the pending node.Following table 1 shows each pending node in system 200 (node b, node c, node d, node e, node f, node g, node i, node j) switching threshold.

Table 1

In S130, node b can be with it is described above that switching threshold corresponding to each pending node determined, to chain The link overhead of road b → a carries out repeatedly adjustment (at least twice), so that every time after adjustment, for the upper hop on same path Node and next-hop node will not simultaneously switch over optimal path.

In embodiments of the present invention, when link b → a restores from failure (that is, situation 1) and link b → a occur It is different to the adjustment mode of the link overhead of link b → a when failure (that is, situation 2), in the following, respectively to both the above in the case of Adjustment action and method illustrate.

Situation 1

When link b → a restores from failure, node b can be by the link overhead of link b → a from preset peak 10) (for example, 16777215) successive adjustment to normal value (is here,.

Optionally, in embodiments of the present invention, the network equipment is right according to the path cost changing value of the pending node The link overhead of first link is adjusted at least twice, including：

The network equipment determines N number of destination node from the pending node；

The network equipment carries out the link overhead of first link according to the path cost changing value of the respectively destination node N times adjust.

In embodiments of the present invention, the number of adjustment according to the number of above-mentioned pending node, can be determined (with target section The number N of point is identical).

Optionally, which determines at least one destination node from the pending node, including：

The network equipment is by the whole of the pending node, as N number of destination node.

Specifically, in embodiments of the present invention, the number of adjustment can be made identical as the number of pending node.It is being In system 200, the number of pending node is 8, therefore, can be carried out for example, 8 adjustment.

For example, optionally, the network equipment is according to the path cost changing value of the respectively destination node, to first link Link overhead carries out n times adjustment, including：

In first link when restoring from failure, the network equipment is in a manner of successively decreasing, to the respectively destination node Path cost changing value carries out the first sequence processing；

The network equipment carries out n times adjustment to the link overhead of first link, so that the first link after ith adjustment Link overhead and the difference of link overhead when normal first link be less than or equal to the first value and be more than second value, wherein should First value is by the first sequence treated i-th of path cost changing value, which is by first sequence I+1 path cost changing value after reason.

Also, optionally, which determines at least one destination node from the pending node, including：

The network equipment determines N number of destination node from the pending node, and the path cost of N number of destination node becomes Change value is different each other.

Specifically, in the above-described embodiments, the switching threshold of each pending node is different, but it is not excluded for each pending The switching threshold of node has repetition to happen, and when the switching threshold of each pending node has repetition, can only retain one The pending node that switching threshold repeats for the switching threshold repeated, can only retain one in other words.

Node b can be ranked up each switching threshold of destination node, that is, can obtain as follows by the sequence successively decreased It puts in order：

120 (switching thresholds of node b), 110 (switching thresholds of node c), 100 (the switching thresholds of node g and node h Value), 90 (switching thresholds of node d), 80 (switching thresholds of node i), 70 (switching thresholds of node e), 60 (node j's cuts Change threshold value), 50 (switching thresholds of node f).

Thereafter, node b can (number be cut with what is do not repeated mutually in table 1 to the link overhead of link b → a progress 8 times The quantity for changing threshold value is identical) adjustment.

The link overhead for the link b → a for adjusting and issuing for the first time can be less than 130 (120+10) and to be more than 120 Any number of (110+10), for example, 125 (115+10), after first time adjusts, only node b can near node a optimal road Diameter switches to path 2 (including link b → a), since the link overhead of link b → a after first time adjusts changes (115) greatly In the switching threshold of node c and node g, therefore, node c will not the optimal path of near node a switch to path 6, also, save Point g will not the optimal path of near node a switch to path 17, thus, it is possible to avoid the hardware capabilities because of node g or node c And processing environment leads to that micro-loop phenomenon occurs between node c and node b or between node g and node b better than node b.

The link overhead for the link b → a for adjusting and issuing for the second time can be less than 120 (110+10) and to be more than 110 Any number of (100+10), for example, 115 (105+10), after second adjusts, node c can near node a optimal path Path 6 (including link b → a) is switched to, since the link overhead variation (105) of link b → a after second adjusts is more than The switching threshold of node d, therefore, node d will not the optimal path of near node a switch to path 9, thus, it is possible to avoid because The hardware capabilities and processing environment of node d lead to that micro-loop phenomenon occurs between node d and node c better than node c.Also, by Path 2 is switched in the optimal path in first time adjustment posterior nodal point b near node a, therefore between node b and node c not Micro-loop phenomenon can occur.

The link overhead for link b → a that third time is adjusted and issued can be less than 110 (100+10) and to be more than 100 (90 + 10) any number, for example, 105 (95+10), after third time adjusts, node g can the optimal path of near node a switch To path 17 (including link b → a), since the link overhead variation (95) of link b → a after third time adjusts is more than node The switching threshold of i, therefore, node i will not the optimal path of near node a switch to path 23, thus, it is possible to avoid because of node The hardware capabilities and processing environment of i lead to that micro-loop phenomenon occurs between node i and node g better than node g.Also, due to The optimal path of adjustment posterior nodal point b near node a switches to path 2 for the first time, therefore will not be sent out between node b and node g Raw micro-loop phenomenon.

It should be noted that in embodiments of the present invention, the switching threshold of the switching threshold and node g of node h is 100, therefore, node h and node g to the optimum link of node a simultaneously to switching over.But due to the switching threshold of node h It is identical as the switching threshold of node g, it indicates in path 19 and path 20, node h is the upper hop node of node g, so Micro-loop problem is not present between node h and node g.

The link overhead of the 4th link b → a for adjusting and issuing can be less than 100 (90+10) and to be more than 90 (80+ 10) any number, for example, 95 (85+10), after the 4th adjustment, node d can the optimal path of near node a switch to Path 9 (including link b → a), since the link overhead variation (85) of link b → a after the 4th adjustment is more than node e's Switching threshold, therefore, node e will not the optimal path of near node a switch to path 12, thus, it is possible to avoid because node e's Hardware capabilities and processing environment lead to that micro-loop phenomenon occurs between node e and node d better than node d.Also, due to second The optimal path of secondary adjustment posterior nodal point c near node a switches to path 6, therefore will not occur between node c and node d micro- Ring phenomenon.

The link overhead of the 5th link b → a for adjusting and issuing can be less than 90 (80+10) and to be more than 80 (70+ 10) any number, for example, 85 (75+10), after the 5th adjustment, node i can the optimal path of near node a switch to Path 23 (including link b → a), since the link overhead variation (75) of link b → a after the 5th adjustment is more than node j Switching threshold, therefore, node j will not the optimal path of near node a switch to path 26, thus, it is possible to avoid because of node j Hardware capabilities and processing environment cause better than node i between node j and node i occur micro-loop phenomenon.Also, due to The optimal path of adjustment posterior nodal point g near node a switches to path 17 three times, therefore will not occur between node g and node i Micro-loop phenomenon.

The link overhead of the 6th link b → a for adjusting and issuing can be less than 80 (70+10) and to be more than 70 (60+ 10) any number, for example, 75 (65+10), after the 6th adjustment, node e can the optimal path of near node a switch to Path 12 (including link b → a), since the link overhead variation (65) of link b → a after the 6th adjustment is more than node f Switching threshold, therefore, node f will not the optimal path of near node a switch to path 15, thus, it is possible to avoid because of node f Hardware capabilities and processing environment cause better than node e between node f and node e occur micro-loop phenomenon.Also, due to The optimal path of four adjustment posterior nodal point d near node a switches to path 9, therefore will not occur between node d and node e Micro-loop phenomenon.

The link overhead of the 7th link b → a for adjusting and issuing can be less than 70 (60+10) and to be more than 60 (50+ 10) any number, for example, 65 (55+10), after the 7th adjustment, node j can the optimal path of near node a switch to Path 26 (including link b → a), the optimal path due to adjusting posterior nodal point i near node a at the 5th time switch to path 23, therefore micro-loop phenomenon will not occur between node i and node j.

The link overhead of the 8th link b → a for adjusting and issuing can be any number less than 60 (50+10), example Such as, 55 (45+10), after the 8th adjustment, node f can the optimal path of near node a switch to (including the link b of path 15 → a), the optimal path due to adjusting posterior nodal point e near node a at the 6th time switches to path 12, node e and node Micro-loop phenomenon will not occur between f.

For another example optionally, the network equipment is according to the path cost changing value of the respectively destination node, to first link Link overhead carry out n times adjustment, including：

In first link when restoring from failure, the network equipment incrementally, to the respectively destination node Path cost changing value carries out the second sequence processing；

The network equipment carries out n times adjustment to the link overhead of first link, so that the first link after ith adjustment Link overhead and the difference of link overhead when normal first link be less than third value and be more than the 4th value, wherein the third Value is by the second sequence treated the N-i+1 path cost changing value, and the 4th value is by second sequence The N-i path cost changing value after reason.

Also, optionally, which determines at least one destination node from the pending node, including：

The network equipment determines N number of destination node from the pending node, and the path cost of N number of destination node becomes Change value is different each other.

Specifically, in the above-described embodiments, the switching threshold of each pending node is different, but it is not excluded for each pending The switching threshold of node has repetition to happen, and when the switching threshold of each pending node has repetition, can only retain one The pending node that switching threshold repeats for the switching threshold repeated, can only retain one in other words.

Node b can be ranked up each switching threshold of destination node, that is, can obtain as follows by incremental sequence It puts in order：

50 (switching thresholds of node f), 60 (switching thresholds of node j), 70 (switching thresholds of node e), 80 (node is Switching threshold), 90 (switching thresholds of node d), 100 (switching thresholds of node g and node h), 110 (the switching thresholds of node c Value), 120 (switching thresholds of node b).

Thereafter, node b can (number be cut with what is do not repeated mutually in table 1 to the link overhead of link b → a progress 8 times The quantity for changing threshold value is identical) adjustment.

The link overhead for the link b → a for adjusting and issuing for the first time can be less than 130 (120+10) and to be more than 120 Any number of (110+10), for example, 125 (115+10), after first time adjusts, only node b can near node a optimal road Diameter switches to path 2 (including link b → a), since the link overhead of link b → a after first time adjusts changes (115) greatly In the switching threshold of node c and node g, therefore, node c will not the optimal path of near node a switch to path 6, also, save Point g will not the optimal path of near node a switch to path 17, thus, it is possible to avoid the hardware capabilities because of node g or node c And processing environment leads to that micro-loop phenomenon occurs between node c and node b or between node g and node b better than node b.

The link overhead for the link b → a for adjusting and issuing for the second time can be less than 120 (110+10) and to be more than 110 Any number of (100+10), for example, 115 (105+10), after second adjusts, node c can near node a optimal path Path 6 (including link b → a) is switched to, since the link overhead variation (105) of link b → a after second adjusts is more than The switching threshold of node d, therefore, node d will not the optimal path of near node a switch to path 9, thus, it is possible to avoid because The hardware capabilities and processing environment of node d lead to that micro-loop phenomenon occurs between node d and node c better than node c.Also, by Path 2 is switched in the optimal path in first time adjustment posterior nodal point b near node a, therefore between node b and node c not Micro-loop phenomenon can occur.

The link overhead for link b → a that third time is adjusted and issued can be less than 110 (100+10) and to be more than 100 (90 + 10) any number, for example, 105 (95+10), after third time adjusts, node g can the optimal path of near node a switch To path 17 (including link b → a), since the link overhead variation (95) of link b → a after third time adjusts is more than node The switching threshold of i, therefore, node i will not the optimal path of near node a switch to path 23, thus, it is possible to avoid because of node The hardware capabilities and processing environment of i lead to that micro-loop phenomenon occurs between node i and node g better than node g.Also, due to The optimal path of adjustment posterior nodal point b near node a switches to path 2 for the first time, therefore will not be sent out between node b and node g Raw micro-loop phenomenon.

It should be noted that in embodiments of the present invention, the switching threshold of the switching threshold and node g of node h is 100, therefore, node h and node g to the optimum link of node a simultaneously to switching over.But due to the switching threshold of node h It is identical as the switching threshold of node g, it indicates in path 19 and path 20, node h is the upper hop node of node g, so Micro-loop problem is not present between node h and node g.

The link overhead of the 4th link b → a for adjusting and issuing can be less than 100 (90+10) and to be more than 90 (80+ 10) any number, for example, 95 (85+10), after the 4th adjustment, node d can the optimal path of near node a switch to Path 9 (including link b → a), since the link overhead variation (85) of link b → a after the 4th adjustment is more than node e's Switching threshold, therefore, node e will not the optimal path of near node a switch to path 12, thus, it is possible to avoid because node e's Hardware capabilities and processing environment lead to that micro-loop phenomenon occurs between node e and node d better than node d.Also, due to second The optimal path of secondary adjustment posterior nodal point c near node a switches to path 6, therefore will not occur between node c and node d micro- Ring phenomenon.

The link overhead of the 5th link b → a for adjusting and issuing can be less than 90 (80+10) and to be more than 80 (70+ 10) any number, for example, 85 (75+10), after the 5th adjustment, node i can the optimal path of near node a switch to Path 23 (including link b → a), since the link overhead variation (75) of link b → a after the 5th adjustment is more than node j Switching threshold, therefore, node j will not the optimal path of near node a switch to path 26, thus, it is possible to avoid because of node j Hardware capabilities and processing environment cause better than node i between node j and node i occur micro-loop phenomenon.Also, due to The optimal path of adjustment posterior nodal point g near node a switches to path 17 three times, therefore will not occur between node g and node i Micro-loop phenomenon.

The link overhead of the 6th link b → a for adjusting and issuing can be less than 80 (70+10) and to be more than 70 (60+ 10) any number, for example, 75 (65+10), after the 6th adjustment, node e can the optimal path of near node a switch to Path 12 (including link b → a), since the link overhead variation (65) of link b → a after the 6th adjustment is more than node f Switching threshold, therefore, node f will not the optimal path of near node a switch to path 15, thus, it is possible to avoid because of node f Hardware capabilities and processing environment cause better than node e between node f and node e occur micro-loop phenomenon.Also, due to The optimal path of four adjustment posterior nodal point d near node a switches to path 9, therefore will not occur between node d and node e Micro-loop phenomenon.

The link overhead of the 7th link b → a for adjusting and issuing can be less than 70 (60+10) and to be more than 60 (50+ 10) any number, for example, 65 (55+10), after the 7th adjustment, node j can the optimal path of near node a switch to Path 26 (including link b → a), the optimal path due to adjusting posterior nodal point i near node a at the 5th time switch to path 23, therefore micro-loop phenomenon will not occur between node i and node j.

The link overhead of the 8th link b → a for adjusting and issuing can be any number less than 60 (50+10), example Such as, 55 (45+10), after the 8th adjustment, node f can the optimal path of near node a switch to (including the link b of path 15 → a), the optimal path due to adjusting posterior nodal point e near node a at the 6th time switches to path 12, node e and node Micro-loop phenomenon will not occur between f.

More than, the embodiment that adjustment number is determined according to pending node is listed, but the present invention is not limited to this, For example, when link b → a restores from failure, two or more pending node can be made by once adjusting Optimal path is switched to first path by the next-hop node on the first path of centering prior to upper hop node.As realization Method can carry out following act.

That is, optionally, the network equipment is according to the path cost changing value of the pending node, to the chain of first link Road expense is adjusted at least twice, including：

The network equipment determines the adjustment model of each pending node according to the path cost changing value of each pending node It encloses, wherein the adjusting range of a pending node is the path cost changing value less than or equal to the pending node, and is more than Equal to the path cost changing value of the reference mode of the pending node, the reference mode of a pending node is that this is pending The maximum node of path cost changing value in upper hop node of the node in each first path；

The network equipment carries out at least two according to the adjusting range of the pending node to the link overhead of first link Secondary adjustment.

Specifically, in the communication system that the method that Fig. 3 is the adjustment link overhead of one embodiment of the invention is applicable in The schematic topological diagram of reverse optimal path priority algorithm when first node is as tree root..It should be noted that in Fig. 3 The switching threshold of pending node corresponding to Digital ID.It is each due to being necessary to ensure that when link b → a restores from failure The next-hop node (hop count away from node a is smaller) of pending node centering prior to upper hop node (hop count away from node a compared with Optimal path is switched over greatly), also, since the first path of each node includes link b → a, in other words, each first via Diameter is using node b as the last one transit node, it is desirable, therefore, to assure that the pending node of the hop count minimum away from node a (that is, node b) is initially completed switching.

In embodiments of the present invention, it is possible, firstly, in the case of for the first link failure, reverse shortest path first is used (RSPF, Reverse Shortest Path FIRST) algorithm calculates each pending node to the road of root node (first node) Diameter cost values D (i, max).Under normal circumstances for link, using RSPF algorithms, each pending node is calculated to root node cost Value D (i, min).

Thereafter, the maximum link expense that the first link adjusted is needed for the anti-micro-loop switching of each pending node is calculated It is worth Δ cost (i, max)：

Δ cost (i, max)=D (i, max)-D (i, min).

The anti-micro-loop switching for calculating each pending node needs the smallest link overhead value Δ cost of the first link adjusted (i, min)：

Δ cost (i, min)=MAX { Δ cost (j, max) }, wherein node j is node i in the first link normal condition Under child (in other words, node j is the upper hop node of node i on the first path).

To need the cost values range (that is, adjusting range) of the first link adjusted for the anti-micro-loop switching of node i Be ＜ Δs cost (i, min)+K, Δ cost (i, max)+K ＞, wherein K it is cost values when the first link is normal.

Thereafter, it can be adjusted according to the adjusting range of each node, for example, in system 200, the adjustment model of node g It encloses for [80,100], the adjusting range of node c is [90,110], also, node g constitutes the switching of the node of pending node pair Threshold value not between node c and the switching threshold of node d (that is, the switching threshold of node b be 120 be more than 110, the switching of node i 90) threshold value is less than for 80, then when adjusting link overhead so that node c switches over optimal path, node g can be simultaneously Switching.

As shown in figure 3, since there may be differences for remaining each node to the path of node b, for example, node c, node d, section Point e, node f needs are switched successively by the ascending sequence of the hop count away from node a, also, node g, node i, node j are also needed To switch successively by the ascending sequence of the hop count away from node a.Therefore, the section for being located on above-mentioned two paths Point, it is understood that there may be the case where by an expense adjustment while switching to optimal path.

As described above, in system 200, the switching threshold (that is, 100) of node g, fall into a pair of pending node to (that is, Between node c and the switching threshold of node d) (that is, [90,110]), also, node g constitutes cutting for the node of pending node pair Changing threshold value, (that is, the switching threshold of node b is more than 110 for 120, node i is cut not between node c and the switching threshold of node d It changes threshold value for 80 to be less than 90), then when adjusting link overhead so that node c switches over optimal path, node g can be same When switch.

Similarly, node i can switch optimal path simultaneously with node d, and node j and node e can switch optimal road simultaneously Diameter.

That is, node g, node i and node j can be deleted as non-targeted node from pending node.

Without loss of generality, following methods may be used and determine non-targeted node from pending node.

1. initializing three lists：Chained list (TentList) is handled, candidate chained list (CandList) exports chained list (OutPutList)。

2. link failure, which changes nearest node, (be node b) to be here, to first have to do anti-micro-loop switching, remembers that the node is self。

3. node self is pushed into TentList.

4. from TentList obtain a node x, wherein node x be adjusting range in TentList lower limiting value (or Person says, the link overhead changing value of upper hop node on the first path) maximum node.If TentList is sky, calculate Method terminates.

5. node x is pushed into OutPutList.

6. (being here, that node c and node g) is added by the child nodes y that the there may be micro-loop of node x switches CandList。

7. a maximum switching threshold cost 1 in the switching threshold of all nodes in determination CandList, with The switching threshold cost 2 of TentList interior joints z, if 2 ＞ cost 1 of cost, node z is deleted from TentList.

8. if node z is deleted from TentList, the there may be micro-loop switchings of node z (are waited for node z compositions Handle node to) child nodes w CandList is added.

9. repeat 7~8, until complete the switching threshold of all nodes in TentList and the comparison of cost 1 and It deletes.

10. all nodes in CandList are moved on in TentList, it is sky to make CandList.

11. redirecting execution 4.

It is thus possible to determine that each node in OutPutList is destination node.

Here, in system 200, each node in the OutPutList determined through the above method is node b, node c, saves Point d, node e, node f.

Thereafter, the switching threshold of each node in OutPutList can be ranked up (increasing or decreasing), and according to For each switching threshold into the adjustment and publication of the link overhead of line link b → a, which can be with above-mentioned according to pending section The process of switching threshold into adjustment and the publication of the link overhead of line link b → a of point is similar, here, in order to avoid repeating, saves Slightly its explanation.

In addition, in the switching threshold according to each node in OutPutList, into the tune of the link overhead of line link b → a When whole and publication, following method of adjustment can also be used：

That is, optionally, the network equipment is according to the path cost changing value of the respectively destination node, to the chain of first link Road expense carries out n times adjustment, including：

In first link when restoring from failure, the network equipment is in a manner of successively decreasing, to the respectively destination node Path cost changing value carries out the first sequence processing；

The network equipment carries out n times adjustment to the link overhead of first link, so that the first link after ith adjustment Link overhead and the difference of link overhead when normal first link be less than the first value and be more than second value, wherein this first Value be by the first sequence treated i-th of path cost changing value,

The second value is the maximum value in the path cost changing value of each first object node, the first object node with Second destination node constitutes pending node pair, and the first object node is the upper of second destination node in first path One hop node, second destination node are by the section corresponding to the first sequence treated i-th of path cost changing value Point.

Specifically, being ranked up (here, with by sequence of successively decreasing in the switching threshold to each node in OutPutList For arrangement) after, T adjustment can be carried out, T is the quantity for the node that OutPutList includes, as described above, in system In 200, T 5.

That is, the link overhead for the link b → a for adjusting and issuing for the first time can be less than 130 (120+10) and to be more than 120 Any number of (110+10), for example, 121 (111+10), after first time adjusts, only node b can near node a optimal road Diameter switches to path 2 (including link b → a), since the link overhead of link b → a after first time adjusts changes (111) greatly In the switching threshold of node c and node g, therefore, node c will not the optimal path of near node a switch to path 6, also, save Point g will not the optimal path of near node a switch to path 17, thus, it is possible to avoid the hardware capabilities because of node g or node c And processing environment leads to that micro-loop phenomenon occurs between node c and node b or between node g and node b better than node b.

The link overhead for the link b → a for adjusting and issuing for the second time can be less than 120 (110+10) and to be more than 100 (90 + 10) any number, for example, 101 (91+10), after second adjusts, node c can the optimal path of near node a switch To path 6 (including link b → a), also, node g can near node a optimal path switch to path 17 (including link b → a).Since the link overhead variation (91) of link b → a after second adjusts is more than the switching threshold of node d, section Point d will not the optimal path of near node a switch to path 9, thus, it is possible to avoid the hardware capabilities and processing ring because of node d Border leads to that micro-loop phenomenon occurs between node d and node c better than node c.Also, due to having adjusted posterior nodal point b in first time The optimal path of near node a switches to path 2, therefore micro-loop phenomenon will not occur between node b and node c.Also, due to The link overhead variation (91) of link b → a after second adjusts is more than the switching threshold of node i, and therefore, node i will not The optimal path of near node a switches to path 23, thus, it is possible to which hardware capabilities and processing environment because of node i is avoided to be better than Node g and cause between node i and node g occur micro-loop phenomenon.Also, due to adjusting posterior nodal point b near sections in first time The optimal path of point a switches to path 2, therefore micro-loop phenomenon will not occur between node b and node g.

It should be noted that as shown in figure 3, in system 200, only there are one child nodes by node c, but the present invention is not It is defined in this, in the case that node c has multiple child nodes, the link overhead of adjusted link b → a can be made to be more than Maximum value in the path cost changing value of each child nodes of node c.

It should be noted that in embodiments of the present invention, the switching threshold of the switching threshold and node g of node h is 100, therefore, node h and node g to the optimum link of node a simultaneously to switching over.But due to the switching threshold of node h It is identical as the switching threshold of node g, it indicates in path 19 and path 20, node h is the upper hop node of node g, so Micro-loop problem is not present between node h and node g.

The link overhead for link b → a that third time is adjusted and issued can be less than 100 (90+10) and to be more than 80 (70+ 10) any number, for example, 81 (71+10), after third time adjusts, node d can the optimal path of near node a switch to Path 9 (including link b → a), since the link overhead variation (71) of link b → a after third time adjusts is more than node e's Switching threshold, therefore, node e will not the optimal path of near node a switch to path 12, thus, it is possible to avoid because node e's Hardware capabilities and processing environment lead to that micro-loop phenomenon occurs between node e and node d better than node d.Also, due to second The optimal path of secondary adjustment posterior nodal point c near node a switches to path 6, therefore will not occur between node c and node d micro- Ring phenomenon.Also, after third time adjusts, node i can near node a optimal path switch to path 23 (including link b → A), since the link overhead variation (71) of link b → a after third time adjusts is more than the switching threshold of node j, section Point j will not the optimal path of near node a switch to path 26, thus, it is possible to avoid the hardware capabilities and processing ring because of node j Border leads to that micro-loop phenomenon occurs between node j and node i better than node i.Also, due to having adjusted posterior nodal point g at second The optimal path of near node a switches to path 17, therefore micro-loop phenomenon will not occur between node g and node i.

It should be noted that as shown in figure 3, in system 200, only there are one child nodes by node d, but the present invention is not It is defined in this, in the case that node d has multiple child nodes, the link overhead of adjusted link b → a can be made to be more than Maximum value in the path cost changing value of each child nodes of node d.

The link overhead of the 4th link b → a for adjusting and issuing can be less than 80 (70+10) and to be more than 60 (50+ 10) any number, for example, 61 (51+10), after the 4th adjustment, node e can the optimal path of near node a switch to Path 12 (including link b → a), since the link overhead variation (61) of link b → a after the 4th adjustment is more than node f Switching threshold, therefore, node f will not the optimal path of near node a switch to path 15, thus, it is possible to avoid because of node f Hardware capabilities and processing environment cause better than node e between node f and node e occur micro-loop phenomenon.Also, due to The optimal path of adjustment posterior nodal point d near node a switches to path 9 three times, therefore will not occur between node d and node e Micro-loop phenomenon.Also, after the 4th adjustment, node j can the optimal path of near node a switch to (including the link b of path 26 → a), due to switching to path 23, node i and node in the optimal path of third time adjustment posterior nodal point i near node a Micro-loop phenomenon will not occur between j.

It should be noted that as shown in figure 3, in system 200, only there are one child nodes by node e, but the present invention is not It is defined in this, in the case that node e has multiple child nodes, the link overhead of adjusted link b → a can be made to be more than Maximum value in the path cost changing value of each child nodes of node e.

The link overhead of the 5th link b → a for adjusting and issuing can be any number less than 60 (50+10), example Such as, 55 (45+10), after the 5th adjustment, node f can the optimal path of near node a switch to (including the link b of path 15 → a), the optimal path due to adjusting posterior nodal point e near node a at the 4th time switches to path 12, node e and node Micro-loop phenomenon will not occur between f.

Similarly, descending order can be pressed to the switching threshold of each node in OutPutList, and be adjusted, it should Process is similar to the above process, and here, in order to avoid repeating, the description thereof will be omitted.

That is, optionally, the network equipment is according to the path cost changing value of the respectively destination node, to the chain of first link Road expense carries out n times adjustment, including：

In first link when restoring from failure, the network equipment incrementally, to the respectively destination node Path cost changing value carries out the second sequence processing；

The network equipment carries out n times adjustment to the link overhead of first link, so that the first link after ith adjustment Link overhead and the difference of link overhead when normal first link be less than third value and be more than the 4th value, wherein the third Value be by the second sequence treated the N-i+1 path cost changing value,

4th value is the maximum value in the path cost changing value of each third destination node, the third destination node with 4th destination node constitutes pending node pair, and the third destination node is the upper of the 4th destination node in first path One hop node, the 4th destination node are by corresponding to the second sequence treated the N-i+1 path cost changing value Node.

The method of adjustment link overhead according to the ... of the embodiment of the present invention, by further deleting pending node Processing, can reduce number of processes, improve the efficiency of adjustment, to improve the practicability of adjustment.

Situation 2

When link b → a breaks down, node b can be by the link overhead of link b → a from normal value (being here, 10) Successive adjustment is to preset peak (for example, 16777215).

Optionally, in embodiments of the present invention, the network equipment is right according to the path cost changing value of the pending node The link overhead of first link is adjusted at least twice, including：

The network equipment determines N number of destination node from the pending node；

The network equipment carries out the link overhead of first link according to the path cost changing value of the respectively destination node N times adjust.

In embodiments of the present invention, the number of adjustment according to the number of above-mentioned pending node, can be determined (with target section The number N of point is identical).

Optionally, which determines at least one destination node from the pending node, including：

The network equipment is by the whole of the pending node, as N number of destination node.

Specifically, in embodiments of the present invention, the number of adjustment can be made identical as the number of pending node.It is being In system 200, the number of pending node is 8, therefore, can be carried out for example, 8 adjustment.

For example, optionally, the network equipment is according to the path cost changing value of the respectively destination node, to first link Link overhead carries out n times adjustment, including：

When first link breaks down, which opens the path of the respectively destination node in a manner of successively decreasing It sells changing value and carries out the 4th sequence processing；

The network equipment carries out n times adjustment to the link overhead of first link, so that the first link after ith adjustment Link overhead and the difference of link overhead when normal first link be more than the 7th value and be less than the 8th value, wherein the 7th Value is by the 4th sequence treated the N-i+1 path cost changing value, and the 8th value is by the 4th sequence The N-i path cost changing value after reason.

Also, optionally, which determines at least one destination node from the pending node, including：

The network equipment determines N number of destination node from the pending node, and the path cost of N number of destination node becomes Change value is different each other.

Specifically, in the above-described embodiments, the switching threshold of each pending node is different, but it is not excluded for each pending The switching threshold of node has repetition to happen, and when the switching threshold of each pending node has repetition, can only retain one The pending node that switching threshold repeats for the switching threshold repeated, can only retain one in other words.

Node b can be ranked up each switching threshold of destination node, that is, can obtain as follows by the sequence successively decreased It puts in order：

120 (switching thresholds of node b), 110 (switching thresholds of node c), 100 (the switching thresholds of node g and node h Value), 90 (switching thresholds of node d), 80 (switching thresholds of node i), 70 (switching thresholds of node e), 60 (node j's cuts Change threshold value), 50 (switching thresholds of node f).

Thereafter, node b can (number be cut with what is do not repeated mutually in table 1 to the link overhead of link b → a progress 8 times The quantity for changing threshold value is identical) adjustment.

The link overhead for the link b → a for adjusting and issuing for the first time can be less than 70 (60+10) and to be more than 60 (50+ 10) any number, for example, 65 (55+10), after first time adjusts, only node f can the optimal path of near node a switch To path 13 (not including link b → a), since the link overhead variation (55) of link b → a after first time adjusts is less than section The switching threshold of point e, therefore, node e will not the optimal path of near node a switch to path 10, thus, it is possible to avoid because of section The hardware capabilities and processing environment of point e lead to that micro-loop phenomenon occurs between node e and node f better than node f.

The link overhead for the link b → a for adjusting and issuing for the second time can be less than 80 (70+10) and to be more than 70 (60+ 10) any number, for example, 75 (65+10), after second adjusts, node j can the optimal path of near node a switch to Path 25 (not including link b → a), since the link overhead variation (65) of link b → a after second adjusts is less than node The switching threshold of i, therefore, node i will not the optimal path of near node a switch to path 110, thus, it is possible to avoid because of section The hardware capabilities and processing environment of point i lead to that micro-loop phenomenon occurs between node i and node j better than node j.

The link overhead for link b → a that third time is adjusted and issued can be less than 90 (80+10) and to be more than 80 (70+ 10) any number, for example, 85 (75+10), after third time adjusts, node e can the optimal path of near node a switch to Path 10 (not including link b → a), since the link overhead variation (75) of link b → a after third time adjusts is less than node The switching threshold of d, therefore, node d will not the optimal path of near node a switch to path 7, thus, it is possible to avoid because of node d Hardware capabilities and processing environment cause better than node e between node d and node e occur micro-loop phenomenon.Also, due to The optimal path of primary adjustment posterior nodal point f near node a switches to path 13, therefore will not occur between node e and node f Micro-loop phenomenon.

The link overhead of the 4th link b → a for adjusting and issuing can be less than 100 (90+10) and to be more than 90 (80+ 10) any number, for example, 95 (85+10), after the 4th adjustment, node i can the optimal path of near node a switch to Path 22 (not including link b → a), since the link overhead variation (85) of link b → a after the 4th adjustment is less than node The switching threshold of g, therefore, node g will not the optimal path of near node a switch to path 16, thus, it is possible to avoid because of node The hardware capabilities and processing environment of g lead to that micro-loop phenomenon occurs between node g and node i better than node i.Also, due to The optimal path of second adjustment posterior nodal point j near node a switches to path 25, therefore will not be sent out between node i and node j Raw micro-loop phenomenon.

The link overhead of the 5th link b → a for adjusting and issuing can be less than 110 (100+10) and to be more than 100 (90 + 10) any number, for example, 105 (95+10), after the 5th adjustment, node d can the optimal path of near node a switch To path 7 (not including link b → a), since the link overhead variation (95) of link b → a after the 5th adjustment is less than section The switching threshold of point c, therefore, node c will not the optimal path of near node a switch to path 4, thus, it is possible to avoid because of section The hardware capabilities and processing environment of point c lead to that micro-loop phenomenon occurs between node c and node d better than node d.Also, due to Path 10 is switched in the optimal path of third time adjustment posterior nodal point e near node a, therefore will not between node d and node e Micro-loop phenomenon occurs.

The link overhead of the 6th link b → a for adjusting and issuing can be less than 120 (110+10) and to be more than 110 Any number of (100+10), for example, 115 (105+10), after the 6th adjustment, node g can near node a optimal path Path 16 (not including link b → a) is switched to, since the link overhead of link b → a after the 6th adjustment changes (105) Less than the switching threshold of node b, therefore, node b will not the optimal path of near node a switch to path 1, thus, it is possible to keep away Exempt from because the hardware capabilities of node b and processing environment are better than node g to lead to that micro-loop phenomenon occurs between node b and node g.And And since the optimal path for adjusting posterior nodal point i near node a at the 4th time switches to path 22, node g and node i Between micro-loop phenomenon will not occur.

It should be noted that in embodiments of the present invention, the switching threshold of the switching threshold and node g of node h is 100, therefore, node h and node g to the optimum link of node a simultaneously to switching over.But due to the switching threshold of node h It is identical as the switching threshold of node g, it indicates in path 19 and path 20, node h is the upper hop node of node g, so Micro-loop problem is not present between node h and node g.

The link overhead of the 7th link b → a for adjusting and issuing can be less than 130 (120+10) and to be more than 120 Any number of (110+10), for example, 125 (115+10), after the 7th adjustment, node c can near node a optimal path Path 4 (not including link b → a) is switched to, since the link overhead variation (115) of link b → a after the 7th adjustment is small In the switching threshold of node b, therefore, node b will not the optimal path of near node a switch to path 1, thus, it is possible to avoid Because the hardware capabilities of node b and processing environment are better than node c lead to that micro-loop phenomenon occurs between node b and node c.Also, Optimal path due to adjusting posterior nodal point d near node a at the 5th time switches to path 7, between node c and node d Micro-loop phenomenon will not occur.

The link overhead of the 8th link b → a for adjusting and issuing can be any number more than 130 (120+10), For example, 130 (125+10), after the 8th adjustment, node b can the optimal path of near node a switch to path 1 and (do not include Link b → a), the optimal path due to adjusting posterior nodal point g near node a at the 6th time switch to path 16, node b Micro-loop phenomenon will not occur between node g.Also, due to the optimal path for adjusting posterior nodal point c near node a at the 7th time Path 4 is switched to, therefore micro-loop phenomenon will not occur between node b and node c.

For another example optionally, the network equipment is according to the path cost changing value of the respectively destination node, to first link Link overhead carry out n times adjustment, including：

When first link breaks down, which incrementally, opens the path of the respectively destination node It sells changing value and carries out third sequence processing；

The network equipment carries out n times adjustment to the link overhead of first link, so that the first link after ith adjustment Link overhead and the difference of link overhead when normal first link be more than the 5th value and be less than the 6th value, wherein the 5th Value is by third sequence treated i-th of path cost changing value, and the 6th value is after third sequence processing I+1 path cost changing value.

Also, optionally, which determines at least one destination node from the pending node, including：

The network equipment determines N number of destination node from the pending node, and the path cost of N number of destination node becomes Change value is different each other.

Specifically, in the above-described embodiments, the switching threshold of each pending node is different, but it is not excluded for each pending The switching threshold of node has repetition to happen, and when the switching threshold of each pending node has repetition, can only retain one The pending node that switching threshold repeats for the switching threshold repeated, can only retain one in other words.

Node b can be ranked up each switching threshold of destination node, that is, can obtain as follows by incremental sequence It puts in order：

50 (switching thresholds of node f), 60 (switching thresholds of node j), 70 (switching thresholds of node e), 80 (node is Switching threshold), 90 (switching thresholds of node d), 100 (switching thresholds of node g and node h), 110 (the switching thresholds of node c Value), 120 (switching thresholds of node b).

Thereafter, node b can (number be cut with what is do not repeated mutually in table 1 to the link overhead of link b → a progress 8 times The quantity for changing threshold value is identical) adjustment.

The link overhead for the link b → a for adjusting and issuing for the first time can be less than 70 (60+10) and to be more than 60 (50+ 10) any number, for example, 65 (55+10), after first time adjusts, only node f can the optimal path of near node a switch To path 13 (not including link b → a), since the link overhead variation (55) of link b → a after first time adjusts is less than section The switching threshold of point e, therefore, node e will not the optimal path of near node a switch to path 10, thus, it is possible to avoid because of section The hardware capabilities and processing environment of point e lead to that micro-loop phenomenon occurs between node e and node f better than node f.

The link overhead for the link b → a for adjusting and issuing for the second time can be less than 80 (70+10) and to be more than 70 (60+ 10) any number, for example, 75 (65+10), after second adjusts, node j can the optimal path of near node a switch to Path 25 (not including link b → a), since the link overhead variation (65) of link b → a after second adjusts is less than node The switching threshold of i, therefore, node i will not the optimal path of near node a switch to path 110, thus, it is possible to avoid because of section The hardware capabilities and processing environment of point i lead to that micro-loop phenomenon occurs between node i and node j better than node j.

The link overhead for link b → a that third time is adjusted and issued can be less than 90 (80+10) and to be more than 80 (70+ 10) any number, for example, 85 (75+10), after third time adjusts, node e can the optimal path of near node a switch to Path 10 (not including link b → a), since the link overhead variation (75) of link b → a after third time adjusts is less than node The switching threshold of d, therefore, node d will not the optimal path of near node a switch to path 7, thus, it is possible to avoid because of node d Hardware capabilities and processing environment cause better than node e between node d and node e occur micro-loop phenomenon.Also, due to The optimal path of primary adjustment posterior nodal point f near node a switches to path 13, therefore will not occur between node e and node f Micro-loop phenomenon.

The link overhead of the 4th link b → a for adjusting and issuing can be less than 100 (90+10) and to be more than 90 (80+ 10) any number, for example, 95 (85+10), after the 4th adjustment, node i can the optimal path of near node a switch to Path 22 (not including link b → a), since the link overhead variation (85) of link b → a after the 4th adjustment is less than node The switching threshold of g, therefore, node g will not the optimal path of near node a switch to path 16, thus, it is possible to avoid because of node The hardware capabilities and processing environment of g lead to that micro-loop phenomenon occurs between node g and node i better than node i.Also, due to The optimal path of second adjustment posterior nodal point j near node a switches to path 25, therefore will not be sent out between node i and node j Raw micro-loop phenomenon.

The link overhead of the 5th link b → a for adjusting and issuing can be less than 110 (100+10) and to be more than 100 (90 + 10) any number, for example, 105 (95+10), after the 5th adjustment, node d can the optimal path of near node a switch To path 7 (not including link b → a), since the link overhead variation (95) of link b → a after the 5th adjustment is less than section The switching threshold of point c, therefore, node c will not the optimal path of near node a switch to path 4, thus, it is possible to avoid because of section The hardware capabilities and processing environment of point c lead to that micro-loop phenomenon occurs between node c and node d better than node d.Also, due to Path 10 is switched in the optimal path of third time adjustment posterior nodal point e near node a, therefore will not between node d and node e Micro-loop phenomenon occurs.

The link overhead of the 6th link b → a for adjusting and issuing can be less than 120 (110+10) and to be more than 110 Any number of (100+10), for example, 115 (105+10), after the 6th adjustment, node g can near node a optimal path Path 16 (not including link b → a) is switched to, since the link overhead of link b → a after the 6th adjustment changes (105) Less than the switching threshold of node b, therefore, node b will not the optimal path of near node a switch to path 1, thus, it is possible to keep away Exempt from because the hardware capabilities of node b and processing environment are better than node g to lead to that micro-loop phenomenon occurs between node b and node g.And And since the optimal path for adjusting posterior nodal point i near node a at the 4th time switches to path 22, node g and node i Between micro-loop phenomenon will not occur.

It should be noted that in embodiments of the present invention, the switching threshold of the switching threshold and node g of node h is 100, therefore, node h and node g to the optimum link of node a simultaneously to switching over.But due to the switching threshold of node h It is identical as the switching threshold of node g, it indicates in path 19 and path 20, node h is the upper hop node of node g, so Micro-loop problem is not present between node h and node g.

The link overhead of the 7th link b → a for adjusting and issuing can be less than 130 (120+10) and to be more than 120 Any number of (110+10), for example, 125 (115+10), after the 7th adjustment, node c can near node a optimal path Path 4 (not including link b → a) is switched to, since the link overhead variation (115) of link b → a after the 7th adjustment is small In the switching threshold of node b, therefore, node b will not the optimal path of near node a switch to path 1, thus, it is possible to avoid Because the hardware capabilities of node b and processing environment are better than node c lead to that micro-loop phenomenon occurs between node b and node c.Also, Optimal path due to adjusting posterior nodal point d near node a at the 5th time switches to path 7, between node c and node d Micro-loop phenomenon will not occur.

The link overhead of the 8th link b → a for adjusting and issuing can be any number more than 130 (120+10), For example, 130 (125+10), after the 8th adjustment, node b can the optimal path of near node a switch to path 1 and (do not include Link b → a), the optimal path due to adjusting posterior nodal point g near node a at the 6th time switch to path 16, node b Micro-loop phenomenon will not occur between node g.Also, due to the optimal path for adjusting posterior nodal point c near node a at the 7th time Path 4 is switched to, therefore micro-loop phenomenon will not occur between node b and node c.

More than, the embodiment that adjustment number is determined according to pending node is listed, but the present invention is not limited to this, For example, when during link b → a breaks down, two or more pending node pair can be made by once adjusting In upper hop node on the first path optimal path is migrated out into first path prior to next-hop node.As realization side Method can carry out following act.

That is, optionally, the network equipment is according to the path cost changing value of the pending node, to the chain of first link Road expense is adjusted at least twice, including：

The network equipment determines the adjustment model of each pending node according to the path cost changing value of each pending node It encloses, wherein the adjusting range of a pending node is the path cost changing value less than or equal to the pending node, and is more than Equal to the path cost changing value of the reference mode of the pending node, the reference mode of a pending node is that this is pending The maximum node of path cost changing value in upper hop node of the node in each first path；

The network equipment carries out at least two according to the adjusting range of the pending node to the link overhead of first link Secondary adjustment.

Specifically, in the communication system that the method that Fig. 3 is the adjustment link overhead of one embodiment of the invention is applicable in The schematic topological diagram of reverse optimal path priority algorithm when first node is as tree root..It should be noted that in Fig. 3 The switching threshold of pending node corresponding to Digital ID.It is each due to being necessary to ensure that when link b → a restores from failure The next-hop node (hop count away from node a is smaller) of pending node centering prior to upper hop node (hop count away from node a compared with Optimal path is switched over greatly), also, since the first path of each node includes link b → a, in other words, each first via Diameter is using node b as the last one transit node, it is desirable, therefore, to assure that the pending node of the hop count minimum away from node a (that is, node b) is initially completed switching.

In embodiments of the present invention, it is possible, firstly, in the case of for the first link failure, reverse shortest path first is used (RSPF, Reverse Shortest Path FIRST) algorithm calculates each pending node to the road of root node (first node) Diameter cost values D (i, max).Under normal circumstances for link, using RSPF algorithms, each pending node is calculated to root node cost Value D (i, min).

Thereafter, the maximum link expense that the first link adjusted is needed for the anti-micro-loop switching of each pending node is calculated It is worth Δ cost (i, max)：

Δ cost (i, max)=D (i, max)-D (i, min).

The anti-micro-loop switching for calculating each pending node needs the smallest link overhead value Δ cost of the first link adjusted (i, min)：

Δ cost (i, min)=MAX { Δ cost (j, max) }, wherein node j is node i in the first link normal condition Under child (in other words, node j is the upper hop node of node i on the first path).

To need the cost values range (that is, adjusting range) of the first link adjusted for the anti-micro-loop switching of node i Be ＜ Δs cost (i, min)+K, Δ cost (i, max)+K ＞, wherein K it is cost values when the first link is normal.

Thereafter, it can be adjusted according to the adjusting range of each node, for example, in system 200, the adjustment model of node g It encloses for [80,100], the adjusting range of node c is [90,110], also, node g constitutes the switching of the node of pending node pair Threshold value not between node c and the switching threshold of node d (that is, the switching threshold of node b be 120 be more than 110, the switching of node i 90) threshold value is less than for 80, then when adjusting link overhead so that node c switches over optimal path, node g can be simultaneously Switching.

As shown in figure 3, since there may be differences for remaining each node to the path of node b, for example, node c, node d, section Point e, node f needs are switched successively by the ascending sequence of the hop count away from node a, also, node g, node i, node j are also needed To switch successively by the ascending sequence of the hop count away from node a.Therefore, the section for being located on above-mentioned two paths Point, it is understood that there may be the case where by an expense adjustment while switching to optimal path.

As described above, in system 200, the switching threshold (that is, 100) of node g, fall into a pair of pending node to (that is, Between node c and the switching threshold of node d) (that is, [90,110]), also, node g constitutes cutting for the node of pending node pair Changing threshold value, (that is, the switching threshold of node b is more than 110 for 120, node i is cut not between node c and the switching threshold of node d It changes threshold value for 80 to be less than 90), then when adjusting link overhead so that node c switches over optimal path, node g can be same When switch.

Similarly, node i can switch optimal path simultaneously with node d, and node j and node e can switch optimal road simultaneously Diameter.

That is, node g, node i and node j can be deleted as non-targeted node from pending node.

Without loss of generality, following methods may be used and determine non-targeted node from pending node.

1. initializing three lists：Chained list (TentList) is handled, candidate chained list (CandList) exports chained list (OutPutList)。

2. link failure, which changes nearest node, (be node b) to be here, to first have to do anti-micro-loop switching, remembers that the node is self。

3. node self is pushed into TentList.

4. from TentList obtain a node x, wherein node x be the lower limiting value of adjusting range in TentList most Big node.If TentList is sky, algorithm terminates.

5. node x is pushed into OutPutList.

6. (being here, that node c and node g) is added by the child nodes y that the there may be micro-loop of node x switches CandList。

7. a maximum switching threshold cost 1 in the switching threshold of all nodes in determination CandList, with The switching threshold cost 2 of TentList interior joints z, if 2 ＞ cost 1 of cost, node z is deleted from TentList.

8. if node z is deleted from TentList, the there may be micro-loop switchings of node z (are waited for node z compositions Handle node to) child nodes w CandList is added.

9. repeat 7~8, until complete the switching threshold of all nodes in TentList and the comparison of cost 1 and It deletes.

10. all nodes in CandList are moved on in TentList, it is sky to make CandList.

11. redirecting execution 4.

It is thus possible to determine that each node in OutPutList is destination node.

Here, in system 200, each node in the OutPutList determined through the above method is node b, node c, saves Point d, node e, node f.

Thereafter, the switching threshold of each node in OutPutList can be ranked up (increasing or decreasing), and according to For each switching threshold into the adjustment and publication of the link overhead of line link b → a, which can be with above-mentioned according to pending section The process of switching threshold into adjustment and the publication of the link overhead of line link b → a of point is similar, here, in order to avoid repeating, saves Slightly its explanation.

In addition, in the switching threshold according to each node in OutPutList, into the tune of the link overhead of line link b → a When whole and publication, following method of adjustment can also be used：

That is, optionally, the network equipment is according to the path cost changing value of the respectively destination node, to the chain of first link Road expense carries out n times adjustment, including：

When first link breaks down, which incrementally, opens the path of the respectively destination node It sells changing value and carries out third sequence processing；

The network equipment carries out n times adjustment to the link overhead of first link, so that the first link after ith adjustment Link overhead and the difference of link overhead when normal first link be more than the 5th value and be less than the 6th value, wherein the 6th Value be by third sequence treated i+1 path cost changing value,

5th value is the maximum value in the path cost changing value of each 5th destination node, the 5th destination node with 6th destination node constitutes pending node pair, and the 5th destination node is the upper of the 6th destination node in first path One hop node, the 6th destination node are by corresponding to third sequence treated i+1 path cost changing value Node.

Specifically, being ranked up (here, to press incremental order in the switching threshold to each node in OutPutList For arrangement) after, T adjustment can be carried out, T is the quantity for the node that OutPutList includes, as described above, in system In 200, T 5.

That is, the link overhead for the link b → a for adjusting and issuing for the first time can be less than 80 (70+10) and to be more than 60 (50 + 10) any number, for example, 61 (51+10), after first time adjusts, node f can the optimal path of near node a switch to Path 13 (not including link b → a), since the link overhead variation (51) of link b → a after first time adjusts is less than node The switching threshold of e, therefore, node e will not the optimal path of near node a switch to path 10, thus, it is possible to avoid because of node The hardware capabilities and processing environment of e lead to that micro-loop phenomenon occurs between node e and node f better than node f.

It should be noted that as shown in figure 3, in system 200, only there are one child nodes by node e, but the present invention is not It is defined in this, in the case that node e has multiple child nodes, the link overhead of adjusted link b → a can be made to be more than Maximum value in the path cost changing value of each child nodes of node e.

The link overhead for the link b → a for adjusting and issuing for the second time can be less than 100 (90+10) and to be more than 80 (70+ 10) any number, for example, 81 (71+10), after second adjusts, node e can the optimal path of near node a switch to Path 10 (not including link b → a), since the link overhead variation (71) of link b → a after second adjusts is less than node The switching threshold of d, therefore, node d will not the optimal path of near node a switch to path 7, thus, it is possible to avoid because of node d Hardware capabilities and processing environment cause better than node e between node d and node e occur micro-loop phenomenon.Also, due to The optimal path of primary adjustment posterior nodal point f near node a switches to path 13, therefore will not occur between node e and node f Micro-loop phenomenon.Also, after second adjusts, node j can the optimal path of near node a switch to path 25 (including chain Road b → a), since the link overhead variation (71) of link b → a after second adjusts is less than the switching threshold of node i, because This, node i will not the optimal path of near node a switch to path 110, thus, it is possible to avoid because node i hardware capabilities and Processing environment leads to that micro-loop phenomenon occurs between node i and node j better than node j.

It should be noted that as shown in figure 3, in system 200, only there are one child nodes by node d, but the present invention is not It is defined in this, in the case that node d has multiple child nodes, the link overhead of adjusted link b → a can be made to be more than Maximum value in the path cost changing value of each child nodes of node d.

The link overhead for link b → a that third time is adjusted and issued can be less than 120 (110+10) and to be more than 100 (90 + 10) any number, for example, 101 (91+10), after third time adjusts, node d can the optimal path of near node a switch To path 7 (not including link b → a), since the link overhead variation (91) of link b → a after third time adjusts is less than section The switching threshold of point c, therefore, node c will not the optimal path of near node a switch to path 4, thus, it is possible to avoid because of section The hardware capabilities and processing environment of point c lead to that micro-loop phenomenon occurs between node c and node d better than node d.Also, due to Path 10 is switched in the optimal path of second adjustment posterior nodal point e near node a, therefore will not between node d and node e Micro-loop phenomenon occurs.Also, after second adjusts, node i can the optimal path of near node a switch to path 22 and (do not wrap Link b → a) is included, since the link overhead variation (91) of link b → a after second adjusts is less than switching threshold of node g Value, therefore, node g will not the optimal path of near node a switch to path 16, thus, it is possible to avoid the hardware energy because of node g Power and processing environment lead to that micro-loop phenomenon occurs between node g and node i better than node i.Also, due to being adjusted at second The optimal path of posterior nodal point j near node a switches to path 25, therefore it is existing that micro-loop will not occur between node i and node j As.

It should be noted that as shown in figure 3, in system 200, only there are one child nodes by node c, but the present invention is not It is defined in this, in the case that node c has multiple child nodes, the link overhead of adjusted link b → a can be made to be more than Maximum value in the path cost changing value of each child nodes of node c.

The link overhead of the 4th link b → a for adjusting and issuing can be less than 130 (120+10) and to be more than 120 Any number of (110+10), for example, 121 (111+10), after the 4th adjustment, node c can near node a optimal path Path 4 (not including link b → a) is switched to, since the link overhead variation (115) of link b → a after the 4th adjustment is small In the switching threshold of node b, therefore, node b will not the optimal path of near node a switch to path 1, thus, it is possible to avoid Because the hardware capabilities of node b and processing environment are better than node c lead to that micro-loop phenomenon occurs between node b and node c.Also, Due to switching to path 7 in the optimal path of third time adjustment posterior nodal point d near node a, between node c and node d Micro-loop phenomenon will not occur.Also, after the 4th adjustment, node g can the optimal path of near node a switch to path 16 (not including link b → a), due to link overhead variation (105) the cutting less than node b of link b → a after the 4th adjustment Change threshold value, therefore, node b will not the optimal path of near node a switch to path 1, thus, it is possible to avoid hard because of node b Part ability and processing environment lead to that micro-loop phenomenon occurs between node b and node g better than node g.Also, due in third time The optimal path of adjustment posterior nodal point i near node a switches to path 22, therefore micro-loop will not occur between node g and node i Phenomenon.

It should be noted that in embodiments of the present invention, the switching threshold of the switching threshold and node g of node h is 100, therefore, node h and node g to the optimum link of node a simultaneously to switching over.But due to the switching threshold of node h It is identical as the switching threshold of node g, it indicates in path 19 and path 20, node h is the upper hop node of node g, so Micro-loop problem is not present between node h and node g.

It should be noted that as shown in figure 3, in system 200, due to node c be node b child nodes (node c and The maximum node of path cost changing value in node g), therefore the path cost for making this link overhead adjusted be more than node c Changing value.

The link overhead of the 5th link b → a for adjusting and issuing can be any number more than 130 (120+10), For example, 130 (125+10), after the 8th adjustment, node b can the optimal path of near node a switch to path 1 and (do not include Link b → a), the optimal path due to adjusting posterior nodal point g near node a at the 4th time switch to path 16, node b Micro-loop phenomenon will not occur between node g.Also, due to the optimal path for adjusting posterior nodal point c near node a at the 4th time Path 4 is switched to, therefore micro-loop phenomenon will not occur between node b and node c.

Similarly, descending order can be pressed to the switching threshold of each node in OutPutList, and be adjusted, it should Process is similar to the above process, and here, in order to avoid repeating, the description thereof will be omitted.

That is, optionally, the network equipment is according to the path cost changing value of the respectively destination node, to the chain of first link Road expense carries out n times adjustment, including：

When first link breaks down, which opens the path of the respectively destination node in a manner of successively decreasing It sells changing value and carries out the 4th sequence processing；

The network equipment carries out n times adjustment to the link overhead of first link, so that the first link after ith adjustment Link overhead and the difference of link overhead when normal first link be more than the 7th value and be less than the 8th value, wherein the 8th Value be by the 4th sequence treated the N-i path cost changing value,

7th value is the maximum value in the path cost changing value of each 7th destination node, the 7th destination node with 8th destination node constitutes pending node pair, and the 7th destination node is the upper of the 8th destination node in first path One hop node, the 8th destination node are by corresponding to the 4th sequence treated the N-i+1 path cost changing value Node.

The method of adjustment link overhead according to the ... of the embodiment of the present invention, by further deleting pending node Processing, can reduce number of processes, improve the efficiency of adjustment, to improve the practicability of adjustment.

Optionally, which, which to the link overhead of first link adjust at least twice, includes：

The network equipment determines that each destination node calculates optimal path required processing time；

The network equipment manages the time according to this, determines the time interval between this is adjusted at least twice；

The network equipment adjusts the link overhead of first link according to the time interval at least twice.

Specifically, in embodiments of the present invention, can also determine in this adjustment can complete optimal path gravity treatment The required re-computation processing time of node, for example, can (for example, from supplier) obtain the hardware information of each node, from And computing capability estimation is carried out according to the hardware information, so that it is determined that the re-computation processing time, determines and adjusts and send out next time The time of cloth is adjusted next time so that after the node that can complete optimal path gravity treatment in this adjustment completes gravity treatment And publication.

The method of adjustment link overhead according to the ... of the embodiment of the present invention, further can reliably avoid the hair of micro-loop phenomenon It is raw.

The method of adjustment link overhead according to the ... of the embodiment of the present invention, passes through pair first chain being directly connected to first node The link overhead on road is repeatedly adjusted, and is used as to the first node including first link and when first link is normal Optimum link each first path in, in the first link when restoring from failure, make to be likely to occur micro-loop phenomenon and wait locating The next-hop node of reason node centering on the first path prior to the optimal path of the near first node of upper hop node migrate to First path, or when the first link breaks down, the first via is centered in making the pending node for being likely to occur micro-loop phenomenon Upper hop node on diameter migrates out first path prior to the optimal path of the near first node of next-hop node, thus, it is possible to Prevent micro-loop phenomenon occur between each pending node pair.

More than, in conjunction with the method that adjustment link overhead according to the ... of the embodiment of the present invention is described in detail in Fig. 1 to Fig. 3, in the following, The device of adjustment link overhead according to the ... of the embodiment of the present invention is described in detail in conjunction with Fig. 4.

Fig. 4 shows the schematic block diagram of the device 300 of adjustment link overhead according to the ... of the embodiment of the present invention.Such as Fig. 4 institutes Show, which includes：

Pending node determination unit 310, for when first link breaks down or restores from failure, from least At least one pending node pair is determined in three nodes, wherein each pending node is to including being connected via a link Two pending nodes, which can be by including the second path of the first link at least three node First node send message, also, the pending node can be when first link be normal by including first link First path to the first node send message, wherein second path be from a pending node to this first The path of total link overhead minimum in the not path including first link of node, a first path is in first chain From a pending node to the optimal path of the first node when road is normal, also, each pending node centering respectively waits for It is different with the relationship of jump up and down in first path on a second path to handle node, second node at least three node with It is directly connected to by first link between the first node, which, which is used for transmission, needs to be sent to the first node Data；

Path cost changing value determination unit 320, the path cost changing value for determining each pending node, this is respectively waited for The path cost changing value of processing node is the difference of the first path expense and the second path cost of each pending node, this One path cost is total link overhead when the first link is normal on the first path, which is second Total link overhead on path；

Link overhead adjustment unit 330, for the path cost changing value according to each pending node, to first link Link overhead adjusted at least twice, when restoring from failure, to make each pending node centering in first link Next-hop node on the first path is migrated prior to the optimal path of the near first node of upper hop node to the first via Diameter, or

When first link breaks down, make the upper hop node of each pending node centering on the first path prior to The optimal path of the near first node of next-hop node migrates out the first path.

Optionally, which is additionally operable to from the pending node, determines N number of destination node, In, the number of the destination node is less than or equal to the number of the pending node；

For the path cost changing value according to the respectively destination node, n times tune is carried out to the link overhead of first link It is whole.

Optionally, which is specifically used for by the whole of the pending node, as N number of mesh Mark node.

Optionally, which is specifically used in first link when restoring from failure, the net Network equipment carries out the first sequence processing in a manner of successively decreasing, to the path cost changing value of the respectively destination node；

N times adjustment is carried out for the link overhead to first link, so that the link of the first link after ith adjustment The difference of link overhead when expense and normal first link be less than the first value and be more than second value, wherein first value be through Cross the first sequence treated i-th of path cost changing value, which is by first sequence treated i+1 A path cost changing value.

Optionally, which is specifically used in first link when restoring from failure, the net Network equipment incrementally, to the path cost changing value of the respectively destination node carries out the second sequence processing；

N times adjustment is carried out for the link overhead to first link, so that the link of the first link after ith adjustment The difference of link overhead when expense and normal first link be less than third value and be more than the 4th value, wherein the third value be through Cross the second sequence treated the N-i+1 path cost changing value, the 4th value is second to sort that treated by this The N-i path cost changing value.

Optionally, which is specifically used for when first link breaks down, the network equipment Incrementally, third sequence processing is carried out to the path cost changing value of the respectively destination node；

N times adjustment is carried out for the link overhead to first link, so that the link of the first link after ith adjustment The difference of link overhead when expense and normal first link be more than the 5th value and be less than the 6th value, wherein the 6th value be through Cross third sequence treated i+1 path cost changing value, the 5th value is to sort that treated i-th by the third A path cost changing value.

Optionally, which is specifically used for when first link breaks down, the network equipment In a manner of successively decreasing, the 4th sequence processing is carried out to the path cost changing value of the respectively destination node；

N times adjustment is carried out for the link overhead to first link, so that the link of the first link after ith adjustment The difference of link overhead when expense and normal first link be more than the 7th value and be less than the 8th value, wherein the 8th value be through Cross the 4th sequence treated the N-i path cost changing value, the 7th value is to sort that treated the by the 4th N-i+1 path cost changing value.

Optionally, which is additionally operable to determine that each destination node calculating optimal path is required Processing time；

For managing the time according to this, the time interval between this is adjusted at least twice is determined；

For according to the time interval, being adjusted at least twice to the link overhead of first link.

Optionally, which is the second node.

Optionally, which is specifically used for the path cost changing value according to each pending node, Determine the adjusting range of each pending node, wherein the adjusting range of a pending node is less than or equal to the pending section The path cost changing value of point, and the path cost changing value of the reference mode more than or equal to the pending node, one is waited locating The reference mode of reason node is that path cost changing value is maximum in upper hop node of the pending node in each first path Node；

For the adjusting range according to the pending node, the link overhead of first link is adjusted at least twice It is whole.

The device 300 of adjustment link overhead according to the ... of the embodiment of the present invention can correspond in the method for the embodiment of the present invention The network equipment (for example, second node), also, each unit, that is, module in the device 300 and other above-mentioned operation and/or functions Respectively in order to realize the corresponding flow of the method 100 in Fig. 1, for sake of simplicity, details are not described herein.

The device of adjustment link overhead according to the ... of the embodiment of the present invention, passes through pair first chain being directly connected to first node The link overhead on road is repeatedly adjusted, and is used as to the first node including first link and when first link is normal Optimum link each first path in, in the first link when restoring from failure, make to be likely to occur micro-loop phenomenon and wait locating The next-hop node of reason node centering on the first path prior to the optimal path of the near first node of upper hop node migrate to First path, or when the first link breaks down, the first via is centered in making the pending node for being likely to occur micro-loop phenomenon Upper hop node on diameter migrates out first path prior to the optimal path of the near first node of next-hop node, thus, it is possible to Prevent micro-loop phenomenon occur between each pending node pair.

More than, in conjunction with the method that adjustment link overhead according to the ... of the embodiment of the present invention is described in detail in Fig. 1 to Fig. 3, in the following, The equipment that adjustment link overhead according to the ... of the embodiment of the present invention is described in detail in conjunction with Fig. 5.

Fig. 5 shows the schematic block diagram of the equipment 400 of adjustment link overhead according to the ... of the embodiment of the present invention.Such as Fig. 5 institutes Show, which includes：

Bus 410；

The processor 420 being connected with the bus；

The memory 430 being connected with the bus；

Wherein, which calls the program stored in the memory 430 by the bus 410, should for working as When first link breaks down or restores from failure, network equipment determination from least three node is at least one pending Node pair, wherein each pending node is to including two pending nodes being connected via a link, the pending node It can be by not including that the second path of first link sends message to the first node, also, the pending node can Message is sent to the first node by the first path including first link when first link is normal, wherein one Second path is opened from pending node link total in the not path including first link to the first node Sell minimum path, a first path be when first link is normal from a pending node to the first node most Shortest path, also, each pending node of each pending node centering on a second path with the jump up and down in first path Relationship is different；

The path cost changing value of path cost changing value for determining each pending node, each pending node is The difference of the first path expense and the second path cost of each pending node, the first path expense are when the first link is normal When total link overhead on the first path, which is total link overhead on a second path；

For the path cost changing value according to each pending node, at least two are carried out to the link overhead of first link Secondary adjustment, when restoring from failure, to make the next-hop of each pending node centering on the first path in first link Node is migrated prior to the optimal path of the near first node of upper hop node to the first path, or

When first link breaks down, make the upper hop node of each pending node centering on the first path prior to The optimal path of the near first node of next-hop node migrates out the first path.

Optionally, which is additionally operable to from the pending node, determines N number of destination node, wherein the target The number of node is less than or equal to the number of the pending node；

For the path cost changing value according to the respectively destination node, n times tune is carried out to the link overhead of first link It is whole.

Optionally, which is specifically used for by the whole of the pending node, as N number of destination node.

Optionally, which is specifically used in first link when restoring from failure, and the network equipment is to pass The mode subtracted carries out the first sequence processing to the path cost changing value of the respectively destination node；

N times adjustment is carried out for the link overhead to first link, so that the link of the first link after ith adjustment The difference of link overhead when expense and normal first link be less than the first value and be more than second value, wherein first value be through Cross the first sequence treated i-th of path cost changing value, which is by first sequence treated i+1 A path cost changing value.

Optionally, which is specifically used in first link when restoring from failure, and the network equipment is to pass The mode of increasing carries out the second sequence processing to the path cost changing value of the respectively destination node；

N times adjustment is carried out for the link overhead to first link, so that the link of the first link after ith adjustment The difference of link overhead when expense and normal first link be less than third value and be more than the 4th value, wherein the third value be through Cross the second sequence treated the N-i+1 path cost changing value, the 4th value is second to sort that treated by this The N-i path cost changing value.

Optionally, which is specifically used for when first link breaks down, and the network equipment is with incremental side Formula carries out third sequence processing to the path cost changing value of the respectively destination node；

N times adjustment is carried out for the link overhead to first link, so that the link of the first link after ith adjustment The difference of link overhead when expense and normal first link be more than the 5th value and be less than the 6th value, wherein the 6th value be through Cross third sequence treated i+1 path cost changing value, the 5th value is to sort that treated i-th by the third A path cost changing value.

Optionally, which is specifically used for when first link breaks down, side of the network equipment to successively decrease Formula carries out the 4th sequence processing to the path cost changing value of the respectively destination node；

N times adjustment is carried out for the link overhead to first link, so that the link of the first link after ith adjustment The difference of link overhead when expense and normal first link be more than the 7th value and be less than the 8th value, wherein the 8th value be through Cross the 4th sequence treated the N-i path cost changing value, the 7th value is to sort that treated the by the 4th N-i+1 path cost changing value.

Optionally, which is additionally operable to determine that each destination node calculates optimal path required processing time；

For managing the time according to this, the time interval between this is adjusted at least twice is determined；

For according to the time interval, being adjusted at least twice to the link overhead of first link.

Optionally, which is the second node.

Optionally, which is specifically used for the path cost changing value according to each pending node, and determination respectively waits locating Manage the adjusting range of node, wherein the adjusting range of a pending node is the path less than or equal to the pending node Expense changing value, and the path cost changing value of the reference mode more than or equal to the pending node, a pending node Reference mode be the maximum section of path cost changing value in upper hop node of the pending node in each first path Point；

For the adjusting range according to the pending node, the link overhead of first link is carried out at least twice Adjustment.

The equipment 400 of adjustment link overhead according to the ... of the embodiment of the present invention can correspond in the method for the embodiment of the present invention The network equipment (for example, second node), also, each unit, that is, module in the equipment 400 and other above-mentioned operation and/or functions Respectively in order to realize the corresponding flow of the method 100 in Fig. 1, for sake of simplicity, details are not described herein.

It should be understood that in embodiments of the present invention, which can be central processing unit (Central Processing Unit, referred to as " CPU "), which can also be other general processors, digital signal processor (DSP), application-specific integrated circuit (ASIC), ready-made programmable gate array (FPGA) or other programmable logic device, discrete gate Or transistor logic, discrete hardware components etc..General processor can be that microprocessor or the processor can also It is any conventional processor etc..

The memory 430 may include read-only memory and random access memory, and to processor 610 provide instruction and Data.The a part of of memory 430 can also include nonvolatile RAM.For example, memory 430 can also be deposited Store up the information of device type.

The bus 410 can also include power bus, controlling bus and status signal bus in addition in addition to including data/address bus Deng.But for the sake of clear explanation, various buses are all designated as bus system 410 in figure.

During realization, each step of the above method can pass through the integrated logic circuit of the hardware in processor 410 Or the instruction of software form is completed.The step of method in conjunction with disclosed in the embodiment of the present invention, can be embodied directly at hardware Reason device executes completion, or in processor hardware and software module combine and execute completion.Software module can be located at random Memory, flash memory, read-only memory, the abilities such as programmable read only memory or electrically erasable programmable memory, register In the storage medium of domain maturation.The storage medium is located at memory 430, and processor 420 reads the information in memory 430, knot Close the step of its hardware completes the above method.To avoid repeating, it is not detailed herein.

The equipment of adjustment link overhead according to the ... of the embodiment of the present invention, passes through pair first chain being directly connected to first node The link overhead on road is repeatedly adjusted, and is used as to the first node including first link and when first link is normal Optimum link each first path in, in the first link when restoring from failure, make to be likely to occur micro-loop phenomenon and wait locating The next-hop node of reason node centering on the first path prior to the optimal path of the near first node of upper hop node migrate to First path, or when the first link breaks down, the first via is centered in making the pending node for being likely to occur micro-loop phenomenon Upper hop node on diameter migrates out first path prior to the optimal path of the near first node of next-hop node, thus, it is possible to Prevent micro-loop phenomenon occur between each pending node pair.

It should be understood that the terms "and/or", only a kind of incidence relation of description affiliated partner, expression can deposit In three kinds of relationships, for example, A and/or B, can indicate：Individualism A exists simultaneously A and B, these three situations of individualism B. In addition, character "/" herein, it is a kind of relationship of "or" to typically represent forward-backward correlation object.

It should be understood that in various embodiments of the present invention, size of the sequence numbers of the above procedures is not meant to execute suitable The execution sequence of the priority of sequence, each process should be determined by its function and internal logic, the implementation without coping with the embodiment of the present invention Process constitutes any restriction.

Those of ordinary skill in the art may realize that lists described in conjunction with the examples disclosed in the embodiments of the present disclosure Member and algorithm steps can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions are actually It is implemented in hardware or software, depends on the specific application and design constraint of technical solution.Professional technician Each specific application can be used different methods to achieve the described function, but this realization is it is not considered that exceed The scope of the present invention.

It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description, The specific work process of device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.

In several embodiments provided herein, it should be understood that disclosed systems, devices and methods, it can be with It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit It divides, only a kind of division of logic function, formula that in actual implementation, there may be another division manner, such as multiple units or component It can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown or The mutual coupling, direct-coupling or communication connection discussed can be the indirect coupling by some interfaces, device or unit It closes or communicates to connect, can be electrical, machinery or other forms.

The unit illustrated as separating component may or may not be physically separated, aobvious as unit The component shown may or may not be physical unit, you can be located at a place, or may be distributed over multiple In network element.Some or all of unit therein can be selected according to the actual needs to realize the mesh of this embodiment scheme 's.

In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, it can also It is that each unit physically exists alone, it can also be during two or more units be integrated in one unit.

It, can be with if the function is realized in the form of SFU software functional unit and when sold or used as an independent product It is stored in a computer read/write memory medium.Based on this understanding, technical scheme of the present invention is substantially in other words The part of the part that contributes to existing technology or the technical solution can be expressed in the form of software products, the meter Calculation machine software product is stored in a storage medium, including some instructions are used so that a computer equipment (can be People's computer, server or network equipment etc.) it performs all or part of the steps of the method described in the various embodiments of the present invention. And storage medium above-mentioned includes：USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), arbitrary access are deposited The various media that can store program code such as reservoir (RAM, Random Access Memory), magnetic disc or CD.

The above description is merely a specific embodiment, but scope of protection of the present invention is not limited thereto, any Those familiar with the art in the technical scope disclosed by the present invention, can easily think of the change or the replacement, and should all contain Lid is within protection scope of the present invention.Therefore, protection scope of the present invention should be based on the protection scope of the described claims.

Claims (20)

1. a kind of method of adjustment link overhead, which is characterized in that it is executed in the communication system including at least three nodes, In, it is directly connected to by the first link between first node and second node, first link is used for transmission needs and is sent to The data of the first node, the method includes：

When first link breaks down or restores from failure, the network equipment from least three node determine to A few pending node pair, wherein each pending node to including two pending nodes being connected via a link, The pending node can send message by the second path not including first link to the first node, and And the pending node can when first link is normal by the first path including first link to described First node sends message, wherein second path is not include to the first node from a pending node The path of total link overhead minimum in the path of first link, a first path are when first link is normal From a pending node to the optimal path of the first node, also, each pending section of each pending node centering Point is different with the relationship of jump up and down in first path on a second path；

The network equipment determines that the path cost changing value of each pending node, the path cost of each pending node become Change value is the difference of the first path expense and the second path cost of each pending node, and the first path expense is when first Total link overhead when link is normal on the first path, second path cost are total links on a second path Expense；

The network equipment according to the path cost changing value of the pending node, to the link overhead of first link into Row adjusts at least twice, when restoring from failure, each pending node to be made to be centered in first path in first link On the optimal path of the next-hop node first node near prior to upper hop node migrate to the first path, or

With when first link breaks down, make the upper hop node of each pending node centering on the first path prior to The optimal path of the near first node of next-hop node migrates out the first path.

2. according to the method described in claim 1, it is characterized in that, the network equipment is according to the path of the pending node Expense changing value adjusts the link overhead of first link at least twice, including：

The network equipment determines the adjusting range of each pending node according to the path cost changing value of each pending node, Wherein, the adjusting range of a pending node is the path cost changing value less than or equal to the pending node, and is more than Equal to the path cost changing value of the reference mode of the pending node, the reference mode of a pending node is described waits for Handle the maximum node of path cost changing value in upper hop node of the node in each first path；

The network equipment carries out at least the link overhead of first link according to the adjusting range of the pending node It adjusts twice.

3. according to the method described in claim 1, it is characterized in that, the network equipment is according to the path of the pending node Expense changing value adjusts the link overhead of first link at least twice, including：

The network equipment determines N number of destination node from the pending node, wherein the number of the destination node is small In the number equal to the pending node；

The network equipment according to the path cost changing value of each destination node, to the link overhead of first link into Row n times adjust.

4. according to the method described in claim 3, it is characterized in that, the network equipment determines N from the pending node A destination node, including：

The network equipment is by the whole of the pending node, as N number of destination node.

5. method according to claim 3 or 4, which is characterized in that the network equipment is according to each destination node Path cost changing value carries out n times adjustment to the link overhead of first link, including：

In first link when restoring from failure, the network equipment is in a manner of successively decreasing, to each destination node Path cost changing value carry out the first sequence processing；

The network equipment carries out n times adjustment to the link overhead of first link, so that the first link after ith adjustment Link overhead and the difference of link overhead when normal first link be less than the first value and be more than second value, wherein it is described First value is by the first sequence treated i-th of path cost changing value, and the second value is by described first Sequence treated i+1 path cost changing value.

6. method according to claim 3 or 4, which is characterized in that the network equipment is according to each destination node Path cost changing value carries out n times adjustment to the link overhead of first link, including：

In first link when restoring from failure, the network equipment incrementally, to each destination node Path cost changing value carry out the second sequence processing；

The network equipment carries out n times adjustment to the link overhead of first link, so that the first link after ith adjustment Link overhead and the difference of link overhead when normal first link be less than third value and be more than the 4th value, wherein it is described Third value is by the second sequence treated the N-i+1 path cost changing value, and the 4th value is by described Second sequence treated the N-i path cost changing value.

7. method according to claim 3 or 4, which is characterized in that the network equipment is according to each destination node Path cost changing value carries out n times adjustment to the link overhead of first link, including：

When first link breaks down, the network equipment incrementally, to the path of each destination node Expense changing value carries out third sequence processing；

The network equipment carries out n times adjustment to the link overhead of first link, so that the first link after ith adjustment Link overhead and the difference of link overhead when normal first link be more than the 5th value and be less than the 6th value, wherein it is described 6th value is by third sequence treated i+1 path cost changing value, and the 5th value is by described the Three sequence treated i-th of path cost changing value.

8. method according to claim 3 or 4, which is characterized in that the network equipment is according to each destination node Path cost changing value carries out n times adjustment to the link overhead of first link, including：

When first link breaks down, the network equipment is in a manner of successively decreasing, to the path of each destination node Expense changing value carries out the 4th sequence processing；

The network equipment carries out n times adjustment to the link overhead of first link, so that the first link after ith adjustment Link overhead and the difference of link overhead when normal first link be more than the 7th value and be less than the 8th value, wherein it is described 8th value is by the 4th sequence treated the N-i path cost changing value, and the 7th value is by described the Four sequence treated the N-i+1 path cost changing value.

9. method according to claim 1 to 4, which is characterized in that the network equipment is to first chain The link overhead on road carries out adjustment at least twice：

The network equipment determines that each destination node calculates optimal path required processing time；

The network equipment determines the time interval between the adjustment at least twice according to the processing time；

The network equipment adjusts the link overhead of first link according to the time interval at least twice.

10. method according to claim 1 to 4, which is characterized in that the network equipment is second section Point.

11. a kind of device of adjustment link overhead, which is characterized in that described device is configured at the communication for including at least three nodes In system, wherein be directly connected to by the first link between first node and second node, first link, which is used for transmission, to be needed The data of the first node are sent to, described device includes：

Pending node determination unit, for when first link breaks down or restores from failure, from least three At least one pending node pair is determined in node, wherein each pending node is to including two to be connected via a link A pending node, the pending node can be by not including the second path of the first link at least three node First node send message, also, the pending node can be when first link be normal by including described the The first path of one link sends message to the first node, wherein second path is existed from a pending node To the path of total link overhead minimum in the not path including first link of the first node, a first path It is also, each to wait locating from a pending node to the optimal path of the first node when first link is normal Each pending node for managing node centering is different with the relationship of jump up and down in first path on a second path, and described at least three It is directly connected to by first link between second node and the first node in node, first link is for passing The defeated data for needing to be sent to the first node；

Path cost changing value determination unit, the path cost changing value for determining each pending node are described each pending The path cost changing value of node is the difference of the first path expense and the second path cost of each pending node, described first Path cost is total link overhead when the first link is normal on the first path, and second path cost is second Total link overhead on path；

Link overhead adjustment unit, for the path cost changing value according to each pending node, to the chain of first link Road expense is adjusted at least twice, when restoring from failure, each pending node to be made to be centered in first link The optimal path of the next-hop node first node near prior to upper hop node in first path is migrated to described first Path, or

With when first link breaks down, make the upper hop node of each pending node centering on the first path prior to The optimal path of the near first node of next-hop node migrates out the first path.

12. according to the devices described in claim 11, which is characterized in that the link overhead adjustment unit is specifically used for according to each The path cost changing value of pending node determines the adjusting range of each pending node, wherein the tune of a pending node The whole path cost changing value for being ranging from less than or equal to the pending node, and more than or equal to the reference of the pending node The path cost changing value of node, the reference mode of a pending node are the pending nodes in each first path The maximum node of path cost changing value in upper hop node；

For the adjusting range according to the pending node, the link overhead of first link is adjusted at least twice It is whole.

13. according to the devices described in claim 11, which is characterized in that the link overhead adjustment unit is additionally operable to wait for from described It handles in node, determines N number of destination node, wherein the number of the destination node is less than or equal to the number of the pending node Mesh；

For the path cost changing value according to each destination node, n times tune is carried out to the link overhead of first link It is whole.

14. device according to claim 13, which is characterized in that the link overhead adjustment unit is specifically used for will be described The whole of pending node, as N number of destination node.

15. the device according to claim 13 or 14, which is characterized in that the link overhead adjustment unit is specifically used for First link from failure when restoring, in a manner of successively decreasing, to the path cost changing value of each destination node into The first sequence of row is handled；

N times adjustment is carried out for the link overhead to first link, so that the link of the first link after ith adjustment is opened The difference of link overhead of the pin with first link when normal is less than the first value and more than second value, wherein first value is By the first sequence treated i-th of path cost changing value, the second value is handled by first sequence I+1 path cost changing value afterwards.

16. the device according to claim 13 or 14, which is characterized in that the link overhead adjustment unit is specifically used for First link from failure when restoring, incrementally, to the path cost changing value of each destination node into The second sequence of row is handled；

N times adjustment is carried out for the link overhead to first link, so that the link of the first link after ith adjustment is opened The difference of link overhead of the pin with first link when normal is less than third value and more than the 4th value, wherein the third value is By the second sequence treated the N-i+1 path cost changing value, the 4th value is by second sequence Treated the N-i path cost changing value.

17. the device according to claim 13 or 14, which is characterized in that the link overhead adjustment unit is specifically used for When first link breaks down, incrementally, third is carried out to the path cost changing value of each destination node Sequence is handled；

N times adjustment is carried out for the link overhead to first link, so that the link of the first link after ith adjustment is opened The difference of link overhead of the pin with first link when normal is more than the 5th value and less than the 6th value, wherein the 6th value is By third sequence treated i+1 path cost changing value, the 5th value is by the third sequence I-th of path cost changing value after reason.

18. the device according to claim 13 or 14, which is characterized in that the link overhead adjustment unit is specifically used for When first link breaks down, in a manner of successively decreasing, the 4th is carried out to the path cost changing value of each destination node Sequence is handled；

N times adjustment is carried out for the link overhead to first link, so that the link of the first link after ith adjustment is opened The difference of link overhead of the pin with first link when normal is more than the 7th value and less than the 8th value, wherein the 8th value is By the 4th sequence treated the N-i path cost changing value, the 7th value is by the 4th sequence The N-i+1 path cost changing value after reason.

19. the device according to any one of claim 11 to 14, which is characterized in that the link overhead adjustment unit is also For determining that each destination node calculates optimal path required processing time；

For according to the processing time, determining the time interval between the adjustment at least twice；

For according to the time interval, being adjusted at least twice to the link overhead of first link.

20. the device according to any one of claim 11 to 14, which is characterized in that described device is second section Point.