CN103746828A - Method and device for network node management - Google Patents

Method and device for network node management Download PDF

Info

Publication number
CN103746828A
CN103746828A CN201310693907.6A CN201310693907A CN103746828A CN 103746828 A CN103746828 A CN 103746828A CN 201310693907 A CN201310693907 A CN 201310693907A CN 103746828 A CN103746828 A CN 103746828A
Authority
CN
China
Prior art keywords
node
lsa
route
associated nodes
state
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201310693907.6A
Other languages
Chinese (zh)
Other versions
CN103746828B (en
Inventor
李磊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ruijie Networks Co Ltd
Original Assignee
Fujian Star Net Communication Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Fujian Star Net Communication Co Ltd filed Critical Fujian Star Net Communication Co Ltd
Priority to CN201310693907.6A priority Critical patent/CN103746828B/en
Publication of CN103746828A publication Critical patent/CN103746828A/en
Application granted granted Critical
Publication of CN103746828B publication Critical patent/CN103746828B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a method and a device for network node management. The method comprises the following steps: when any node in a network determines that the network is in a stable state, image information containing a SPT and a routing table of the current time is locally generated at the node; a node information message sent by a node of which LSA is changed is received, and identification information and state change information, carried in the node information message, of the node of which the LSA is changed or a link of which the LSA is changed are acquired; SPTs of the image information are traversed to acquire routing information of an associated node after that the image information contains the identification information is detected; and routing of the associated node in a routing table of the image information is adjusted according to the state change information and the routing information of the associated node. By the adoption of the technical scheme of the invention, the loop problem caused by the fact that the convergence path should be recalculated for all nodes in a network after one node jitters is solved, thereby effectively improving the network performance.

Description

A kind of method of managing network node and device
Technical field
The present invention relates to communication technical field, especially a kind of method of managing network node and device.
Background technology
In communication system, in order to guarantee that each link can transmit data quickly and safely, various link-state protocols arise at the historic moment.
At present, link-state protocol comprises OSPFv2(Open Shortest Path First version2; OSPF version 2) agreement, OSPFv3(Open Shortest Path First version3; OSPF version 3) agreement, IS-IS(Intermediate system to intermediate system; Intermediate System-to-Intermediate System) agreement, wherein:
OSPFv2(is hereinafter to be referred as OSPF) agreement is IETF(The Internet Engineering Task Force; Internet Engineering task groups) of the organization development Interior Gateway Protocol based on Link State, have wide accommodation, convergence rapidly, loop free, be convenient to the features such as level network design, therefore in IPv4 network, be applied widely.
OSPFv3 agreement is version number corresponding to ospf protocol in IPv6 network, and this agreement has retained the advantage of ospf protocol, and for the feature of IPv6 network, has carried out part revision.OSPFv3 agreement is roughly consistent with the standard RFC2328 regulation of OSPF, and there are differences part before both, by RFC5340, is stipulated.
IS-IS is a kind of Interior Gateway Protocol, is one of Interior Gateway Protocol of generally adopting of telecom operators.The ISO/IEC10589:2002 institute standard that the Intermediate System to Intermediate System of standard is formulated by International Standards Organization, but the Intermediate System to Intermediate System of this standard is connectionless networks service (CLNS) design, directly be not suitable for IP network, therefore Internet Engineering task groups has been formulated the integrated Intermediate System to Intermediate System that goes for IP network.
In communication system, the network that comprises the above-mentioned agreement of multiple application and meet the following conditions: network topology is known fixed mode; Node in network is numerous; Network planning rule and symmetry.The access route of for example, consulting between the X equipment shown in Fig. 1 is generally the ECMP(Equal-Cost Multipath Routing through all Z equipment; Equal cost multipath), the planning of all IP network sections also presents certain equal difference progressive law; Network is inside and outside to be cut apart by corresponding node (being equipment), makes the inside and outside topology of network relatively independent.Below to meet above-mentioned IDC(Internet Data Center; Internet data center) network is that example is introduced, consult shown in Fig. 1, in IDC network, comprise 512 for connecting the X equipment of large-scale server, 2 for accessing the Y equipment of IDC outside, and 2 to 4 for making the Z equipment of all X and Y devices interconnect.
Due to the These characteristics of IDC network, when realizing convenient network service, brought following several technical problem: IDC nodes number is more, the shake (the LSA of this any node changes) of any node all will cause that in whole network, all nodes carry out recalculating of link topology agreement, and the rudimentary algorithm of link topology agreement is all based on enlightening Coase thorough (Dijkstra) algorithm, it is the topological evaluation work of O (n*log (n)) that the shake of each network node all can bring every equipment complexity, thereby expend system ample resources, reduced the performance of network.And, due to the restriction of link-state protocol itself, once there is the adjustment of shake or network topology structure in network, all nodes all carry out asynchronous calculating, make different nodes obtain the asynchronism(-nization) of above-mentioned shake or network topology structure adjustment information, thereby cause this difference node inconsistent for topological cognition, finally produce of short duration route loop, cause data traffic larger, make network more be difficult to the problem of convergence.Wherein, LSA(Link-State Advertisement; Link State Advertisement) be the grouping that linking status agreement is used, comprise the information about neighbor node and link cost.
For example, consult shown in Fig. 1, the link of establishing between Z1 and X1 is off-state, if Z1 is first known this link, disconnects information, first Z1 calculates converged paths, and this convergence is calculated and will first be completed, now, Z1 is sensing X2 to the converged paths result of calculation of X1, and X2 is later than Z1 and knows that this link disconnects information, when Z1 completes convergence calculating, the converged paths of X2 is calculated and may also do not completed, and now X2 is still sensing Z1 to the path of X1; The path that is Z1 sensing X1 is: Z1-X2-Z1.As can be seen here, for same signaling, will between Z1 and X2, repeat transmission, between Z1 and X2, form route loop.
In sum, the low problem of network performance that has loop problem and cause due to loop problem in communication network at present.
Summary of the invention
The embodiment of the present invention provides a kind of method and device of managing network node, in order to solve in prior art in communication network intermediate ring road problem and the low problem of network performance.
The concrete technical scheme that the embodiment of the present invention provides is as follows:
A method for managing network node, comprising:
After being stable state according to LSA LSA decision network, in this locality, generate the Mirror Info of described LSA; Wherein, described Mirror Info comprises shortest path tree SPT and routing table;
The nodal information message that the node that reception LSA changes sends, and obtain the LSA change information carrying in described nodal information message, wherein, described LSA change information comprises identification information and the state change information corresponding to this node of the node that LSA changes, or identification information and the state change information corresponding to this link of the link that changes of LSA;
When detecting, in described Mirror Info, there is the identification information of node or the identification information of link in described LSA change information, travel through described SPT, obtain the routing iinformation of the associated nodes of the link that node that described LSA changes or LSA change, and according to the routing iinformation of described associated nodes, obtain the down hop of the route of described associated nodes;
The identification information of the node changing according to described LSA and corresponding state change information and the described routing iinformation of this node, adjust the route of described associated nodes.
Optionally, for any node in described network, travel through all mid-side nodes in the preset range of described any node, and monitor the information that LSA that described any node obtains comprises; When the information that described LSA comprises in the first default duration does not correctly change, and described all periphery node states are correct and while all not changing, judge that described network is as stable state.
Further, if the information errors that described LSA comprises, or the information that described LSA comprises in the first default duration changes, or there is any periphery node state mistake, or exist any periphery node state to change, judge that described network is as labile state; Wait for after the second default duration, again travel through all mid-side nodes in the preset range of described any node, until judge that described network is as stable state.
Optionally, when the down hop number of the route of described associated nodes is at least one, if being the node that described LSA changes, described state change information changes into effective status by disarmed state, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop of the route of described associated nodes is adjusted into effective status by disarmed state, and the route of described associated nodes is adjusted into effective status by disarmed state; If the chain route disarmed state that described state change information is described LSA to change is changed into effective status, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop of the route of described associated nodes is adjusted into effective status by disarmed state, and the route of described associated nodes is adjusted into effective status by disarmed state; If being the node that described LSA changes, described state change information changes into disarmed state by effective status, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop of the route of described associated nodes is adjusted into disarmed state by effective status, and the route of described associated nodes is adjusted into disarmed state by effective status; If the chain route effective status that described state change information is described LSA to change is changed into disarmed state, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop of the route of described associated nodes is adjusted into disarmed state by effective status, and the route of described associated nodes is adjusted into disarmed state by effective status.
Optionally, when the down hop number of the route of described associated nodes is during at least two, if being the node that described LSA changes, described state change information changes into effective status by disarmed state, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop that the node changing with described LSA at least two down hops of the route of described associated nodes is associated is adjusted into effective status by disarmed state, and keeps the route of described associated nodes constant; If the chain route disarmed state that described state change information is described LSA to change is changed into effective status, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop that the link changing with described LSA in the down hop of the route of described associated nodes is associated is adjusted into effective status by disarmed state, and keeps the route of described associated nodes constant; If being the node that described LSA changes, described state change information changes into disarmed state by effective status, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop that the link changing with described LSA in the down hop of the route of described associated nodes is associated is adjusted into disarmed state by effective status, and keeps the route of described associated nodes constant; If the chain route effective status that described state change information is described LSA to change is changed into disarmed state, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop that the link changing with described LSA in the down hop of the route of described associated nodes is associated is adjusted into disarmed state by effective status, and keeps the route of described associated nodes constant.
Adopt technique scheme, when IDC network is after stable state, think that the SPT of current time is reliable state, any time afterwards, no matter how this IDC topology of networks changes, above-mentioned SPT does not all change, each node this locality in IDC network all generates Mirror Info based on this SPT, thereby make IDC network can date back at any time above-mentioned image information, the problem of having avoided the topological structure causing when shake or link occurs fault occur any node in IDC network to change.And, in said process, while there is shake or link occurs fault in any node, only upgrade the routing table in the local Mirror Info of preserving of above-mentioned IDC nodes, thereby avoided flow matches that node that above-mentioned any node or faulty link are relevant is corresponding on other routes (as default route) in routing table, and then being forwarded to unrelated equipment, the problem of the waste network bandwidth, has effectively improved network performance.
Further, when increasing new node in described network, make each node in described network again obtain the SPT after renewal according to the network after upgrading, and the LSA after upgrading; When judging that according to the LSA after described renewal network after described renewal is as stable state, each node in described network generates the Mirror Info after upgrading respectively; Wherein, the Mirror Info after described renewal comprises the routing table after SPT and the renewal after described renewal.
Adopt technique scheme, when needs carry out dilatation or knot adjustment to IDC network, only need the local Mirror Info of preserving of each node to upgrade, avoid existing ospf protocol message cannot know the information that above-mentioned network changes, thereby affected the problem of the normal operation of node.
A device for managing network node, comprising:
Generation unit, after being stable state according to LSA LSA decision network, generates the Mirror Info of described LSA in this locality; Wherein, described Mirror Info comprises shortest path tree SPT and routing table;
The first acquiring unit, the nodal information message sending for receiving node that LSA changes, and obtain the LSA change information carrying in described nodal information message, wherein, described LSA change information comprises identification information and the state change information corresponding to this node of the node that LSA changes, or identification information and the state change information corresponding to this link of the link that changes of LSA;
Second acquisition unit, for working as, detect that described Mirror Info exists the identification information of node or the identification information of link in described LSA change information, travel through described SPT, obtain the routing iinformation of the associated nodes of the link that node that described LSA changes or LSA change, and according to the routing iinformation of described associated nodes, obtain the route of described associated nodes;
Adjustment unit, for identification information and corresponding state change information and the described routing iinformation of this node of the node that changes according to described LSA, adjusts the route of described associated nodes.
Further, said apparatus also comprises identifying unit, for: for any node of described network, travel through all mid-side nodes in the preset range of described any node, and monitor the information that LSA that described any node obtains comprises; When the information that described LSA comprises in the first default duration does not correctly change, and described all periphery node states are correct and while all not changing, judge that described network is as stable state.
Optionally, described identifying unit, also for: if the information errors that described LSA comprises, or the information that described LSA comprises in the first default duration changes, or there is any periphery node state mistake, or exist any periphery node state to change, judge that described network is as labile state; Wait for after the second default duration, again travel through all mid-side nodes in the preset range of described any node, until judge that described network is as stable state.
Optionally, described adjustment unit, specifically for: when the down hop number of the route of described associated nodes is one, if being the node that described LSA changes, described state change information changes into effective status by disarmed state, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop of the route of described associated nodes is adjusted into effective status by disarmed state, and the route of described associated nodes is adjusted into effective status by disarmed state; If the chain route disarmed state that described state change information is described LSA to change is changed into effective status, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop of the route of described associated nodes is adjusted into effective status by disarmed state, and the route of described associated nodes is adjusted into effective status by disarmed state; If being the node that described LSA changes, described state change information changes into disarmed state by effective status, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop of the route of described associated nodes is adjusted into disarmed state by effective status, and the route of described associated nodes is adjusted into disarmed state by effective status; If the chain route effective status that described state change information is described LSA to change is changed into disarmed state, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop of described associated nodes route is adjusted into disarmed state by effective status, and the route of described associated nodes is adjusted into disarmed state by effective status.
Optionally, described adjustment unit, also for: when the down hop number of the route of described associated nodes is during at least two, if being the node that described LSA changes, described state change information changes into effective status by disarmed state, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop that the node changing with described LSA at least two down hops of the route of described associated nodes is associated is adjusted into effective status by disarmed state, and keeps the route of described associated nodes constant; If the chain route disarmed state that described state change information is described LSA to change is changed into effective status, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop that the link changing with described LSA in the down hop of the route of described associated nodes is associated is adjusted into effective status by disarmed state, and keeps the route of described associated nodes constant; If being the node that described LSA changes, described state change information changes into disarmed state by effective status, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop that the link changing with described LSA in the down hop of the route of described associated nodes is associated is adjusted into disarmed state by effective status, and keeps the route of described associated nodes constant; If the chain route effective status that described state change information is described LSA to change is changed into disarmed state, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop that the link changing with described LSA in the down hop of the route of described associated nodes is associated is adjusted into disarmed state by effective status, and keeps the route of described associated nodes constant.
Adopt technique scheme, when IDC network is after stable state, think that the SPT of current time is reliable state, any time afterwards, no matter how this IDC topology of networks changes, above-mentioned SPT does not all change, each node this locality in IDC network all generates Mirror Info based on this SPT, thereby make IDC network can date back at any time above-mentioned image information, the problem of having avoided the topological structure causing when shake or link occurs fault occur any node in IDC network to change.And, in said process, while there is shake or link occurs fault in any node, only upgrade the routing table in the local Mirror Info of preserving of above-mentioned IDC nodes, thereby avoided flow matches that node that above-mentioned any node or faulty link are relevant is corresponding on other routes (as default route) in routing table, and then being forwarded to unrelated equipment, the problem of the waste network bandwidth, has effectively improved network performance.
Further, said apparatus also comprises updating block, for: when described network increases new node, make each node in described network again obtain the SPT after renewal according to the network after upgrading, and the LSA after upgrading; When judging that according to the LSA after described renewal network after described renewal is as stable state, each node in described network generates the Mirror Info after upgrading respectively; Wherein, the Mirror Info after described renewal comprises the routing table after SPT and the renewal after described renewal.
Adopt technique scheme, when needs carry out dilatation or knot adjustment to IDC network, only need the local Mirror Info of preserving of each node to upgrade, avoid existing ospf protocol message cannot know the information that above-mentioned network changes, thereby affected the problem of the normal operation of node.
In the embodiment of the present invention, after any node decision network in network is stable state, at the local Mirror Info that comprises current time SPT and routing table that generates of this any node; The nodal information message that the node that reception LSA changes sends, and obtain identification information and the state change information of the node that the LSA that carries in this nodal information message changes, or identification information and the state change information of the node of the link that changes of LSA; Detect in above-mentioned image information and exist after above-mentioned identification information, the SPT of traversal above-mentioned image information obtains the routing iinformation of associated nodes; According to the routing iinformation of state change information and associated nodes, the route of associated nodes in the routing table of above-mentioned image information is adjusted.Adopt technical solution of the present invention, the LSA of any node in network based on after stable creates Mirror Info, when existing a node that shake occurs, the topological structure according to this Mirror Info, the node of the generation shake in network being affected is adjusted, avoided, at a node, all nodes in the rear network of shake occur and recalculated the loop problem that converged paths causes, thereby effectively improved network performance.
Accompanying drawing explanation
Fig. 1 is network architecture diagram in prior art;
Fig. 2 is managing network node flow chart in the embodiment of the present invention;
Fig. 3 is the mutual schematic diagram of structure in IDC network in the embodiment of the present invention;
Fig. 4 is SPT schematic diagram in the embodiment of the present invention;
Fig. 5 is the flow chart that judges network stabilization in the embodiment of the present invention;
Fig. 6 is the flow chart of adjusting routing table in the embodiment of the present invention;
Fig. 7 is each node structure schematic diagram one in concrete application scenarios lower network in the embodiment of the present invention;
Fig. 8 is managing network node detail flowchart under concrete application scenarios in the embodiment of the present invention;
Fig. 9 is each node structure schematic diagram two in concrete application scenarios lower network in the embodiment of the present invention;
Figure 10 is the apparatus structure schematic diagram of managing network node in the embodiment of the present invention.
Embodiment
In order to solve the loop problem in communication network in prior art.In the embodiment of the present invention, after any node decision network in network is stable state, at the local Mirror Info that comprises current time SPT and routing table that generates of this any node; The nodal information message that the node that reception LSA changes sends, and obtain identification information and the state change information of the node that the LSA that carries in this nodal information message changes, or identification information and the state change information of the node of the link that changes of LSA; Detect in above-mentioned image information and exist after above-mentioned identification information, the SPT of traversal above-mentioned image information obtains the routing iinformation of associated nodes; According to the routing iinformation of state change information and associated nodes, the route of associated nodes in the routing table of above-mentioned image information is adjusted.Adopt technical solution of the present invention, the LSA of any node in network based on after stable creates Mirror Info, when existing a node that shake occurs, the topological structure according to this Mirror Info, the node of the generation shake in network being affected is adjusted, avoided, at a node, all nodes in the rear network of shake occur and recalculated the loop problem that converged paths causes, thereby effectively improved network performance.
Consult and Figure 1 shows that and below in conjunction with accompanying drawing, the preferred embodiment of the present invention is elaborated network architecture diagram.
Consult shown in Fig. 2, the present invention can be applied to ospf protocol, OSPFv3 agreement, Intermediate System to Intermediate System, and the network under integrated is-is agreement, below to be applied to IDC network under ospf protocol as example, introduce in detail the process of managing network node:
Step 200: after being stable state according to LSA decision network, generate the Mirror Info of this LSA in this locality.
In the embodiment of the present invention, at any node installation network management software, by the network management software moving on this any node, manage all nodes in whole IDC network; Or any node in above-mentioned IDC network writes network management shell script, by move this network management Run Script program on above-mentioned any node, manage all nodes in whole IDC network.Wherein, above-mentioned any node is any server apparatus or any routing device in IDC network; The above-mentioned network management software or network management shell script by snmp protocol with MIB(Management Information Base; MIB) form or by TELNET agreement with CLI(Command Line Interface; Command Line Interface) form manages the ospf protocol of all nodes (routing device) in IDC network, and its concrete structure interactive graphics (IG) is consulted shown in Fig. 3.Adopt technique scheme, thereby control all nodes in whole IDC network by operational network management software or network management shell script on any node in network, effectively simplified network management flow process.
Based on said process, after any node (hereinafter referred to as node A) operational network management software or network management shell script in above-mentioned IDC network, above-mentioned node A can send and start the indication of IDC patterns to all nodes in this IDC network, make all nodes in IDC network indicate and enter IDC pattern according to this startup IDC pattern, even if IDC network is in a stable state.
Optionally, judge in IDC network, whether all nodes have all entered IDC pattern, this IDC network whether the method in stable state be: for any node in IDC network, travel through all mid-side nodes in the preset range of this any node, and monitor the information that LSA comprises; When the information that this LSA comprises in the first default duration does not correctly change, and all periphery node states are correct and while all not changing, judge that IDC network is as stable state.Wherein, the information that LSA comprises is the connected state information of each node in whole IDC network, and the state of all mid-side nodes in the preset range of the information that comprises of LSA and any node is the project of agreement regulation, can directly obtain by agreement; The information that LSA comprises is correctly neighbor node and the link that the local LSA preserving of any node in above-mentioned IDC network comprises, and the neighbor node and the link that comprise with the LSA of this neighbor node preservation match; For example, in IDC network, the local LSA that preserves of any node A comprises neighbor node B, and its link is that A points to B, and now, if the local LSA that preserves of this neighbor node B comprises neighbor node A, and its link is that B points to A, represents that the information that above-mentioned LSA comprises is correct.
Node state comprises and connects, and states such as having connected and do not connected, when judging that IDC network whether in stable state procedure, in above-mentioned several node states, has connected as correct node state; The first default duration can set in advance according to concrete application scenarios; Above-mentioned preset range is whole IDC network.
All all mid-side nodes in above-mentioned traversal IDC network in the preset range of any node can adopt the mode of recurrence traversal, first travel through the neighbor node of above-mentioned any node, the information comprising as the neighbor node state of this any node and the LSA of this any node this locality meets after above-mentioned condition, recurrence travels through this any node downwards, travel through the neighbor node of this neighbor node, and judge whether the neighbor node state of this neighbor node and the information that LSA comprises meet above-mentioned decision condition, if meet, repeat said process, carry out successively recurrence traversal downwards, until all nodes in this IDC network all travel through complete, and all meet above-mentioned decision condition, judge that whole IDC network is stable state.
Further, if the information errors that LSA comprises, or the information that this LSA comprises in the first default duration changes, or there is any periphery node state mistake, or exist any periphery node state to change, decision network is labile state; Now, can wait for after the second default duration, again adopt all mid-side nodes in the preset range of the above-mentioned any node of recursive fashion traversal, until judge that IDC network is as stable state.Wherein, the second default duration can set in advance according to concrete application scenarios, optional, is one minute, two minutes etc.
After IDC network stabilization, each node in IDC network can generate a Mirror Info according to the LSA after stable in this locality, comprise above-mentioned IDC network in SPT(Shortest Path Tree corresponding to stable state moment in this Mirror Info; Shortest path tree) and routing table.
Step 210: the nodal information message that the node that reception LSA changes sends, and obtain the LSA change information carrying in this nodal information message.
In the embodiment of the present invention, LSA change information comprises identification information and the state change information of the node that LSA changes, or identification information and the state change information of the link that changes of LSA.For example, consult shown in Fig. 1, in IDC network, have nodes X 1, if this nodes X 1 breaks down and power-off, the node that nodes X 1 changes for LSA; In IDC network, exist nodes X 1 and node Z1 to be initially connected state, if the link occurs fault between nodes X 1 and node Z1 and disconnecting, the link between nodes X 1 and node Z1 is the link that LSA changes.
When the LSA of any node in above-mentioned IDC network changes, the LSA that represents the link that the LSA of this any node itself changes or be associated with this any node changes, this any node or the node (i.e. downstream node in this any both link ends node) corresponding with this any link can be to other node sending node infomational messages in this IDC network, in this nodal information message, carry identification information and the state change information of the node that LSA changes, or the identification information of the link that LSA changes and state change information.Wherein, this state change information can be for being changed into the information of effective status by disarmed state, can also be for be changed into the information of disarmed state by effective status, the link that the node that can change for LSA in conjunction with state change information is corresponding above main body or LSA change, can draw in IDC network, state change information comprises four kinds of situations, and the node that LSA changes is changed into effective status by disarmed state, or changes into disarmed state by effective status; The chain route disarmed state that LSA changes is changed into effective status, or changes into disarmed state by effective status.
Step 220: when detecting after the identification information that has the link that node that above-mentioned LSA changes or LSA change in above-mentioned image information, the SPT that travels through this Mirror Info obtains the routing iinformation of the associated nodes of the link that node that above-mentioned LSA changes or LSA change, and according to the routing iinformation of above-mentioned associated nodes, obtain the route of associated nodes.
In the embodiment of the present invention, after other nodes when node corresponding to link that the node changing except LSA in IDC network and LSA change receive above-mentioned nodal information message, according to this nodal information message, obtain the routing iinformation of the associated nodes that link that node that LSA changes or LSA change is corresponding.
Optionally, the method that any node in above-mentioned IDC network obtains the routing iinformation of associated nodes is: travel through the SPT in the local Mirror Info of preserving of this any node, obtain each associated nodes of the link that node that LSA changes or LSA change; And the routing table of preserving according to this locality is obtained the routing iinformation of above-mentioned associated nodes.As can be seen here, in SPT, the node changing for LSA, associated nodes is the child node of node and the descendent node of child node that this LSA changes; The link changing for LSA, associated nodes is the corresponding child node of node and the descendent node of this child node of link that this LSA changes, wherein, node corresponding to link that this LSA changes is the downstream node in the both link ends node that changes of above-mentioned LSA.For example, consult shown in Fig. 4, establishing node A is any node in IDC network, if the LSA of Node B changes, in the SPT of node A, the associated nodes of the Node B that LSA changes is node C, node D, node E.For another example, consult shown in Fig. 4, establishing node A is any node in IDC network, if the LSA of the link between Node B and node C changes, in the SPT of node A, node corresponding to link that LSA changes is node C, the associated nodes of this node C is node D, node E.
Above-mentioned any node is according to the routing iinformation of above-mentioned associated nodes, obtain the down hop of the route of associated nodes, wherein, with respect to above-mentioned any node, this down hop is in the route that this any node points to the link that node that above-mentioned LSA changes or LSA change, the node IP address of the next process of this any node.For example, consult shown in Fig. 4, establishing node A is any node in IDC network, if node C is the node that LSA changes, the associated nodes of node C is node D and node E; With respect to node A, the route that node A points to node D is A-B-C-D, and A-F-C-D, and the down hop of the route of node D is the IP address (representing with b below) of Node B and the IP address (representing with f below) of node F.
Step 230: the identification information of the node changing according to above-mentioned LSA and state change information corresponding to this node, and routing iinformation, the route of this associated nodes is adjusted.
In the embodiment of the present invention, because state change information comprises four kinds of situations, the node that LSA changes is changed into effective status by disarmed state, or changes into disarmed state by effective status; The chain route disarmed state that LSA changes is changed into effective status, or changes into disarmed state by effective status.Therefore, the process of routing table corresponding to associated nodes being adjusted according to the routing iinformation of associated nodes comprises following four kinds of situations, is specially:
The first situation: change into effective status by disarmed state if above-mentioned state change information is the node that LSA changes, the routing iinformation of the associated nodes of the node changing according to above-mentioned LSA, obtain the route of this associated nodes, and the route of above-mentioned associated nodes is adjusted.
Concrete, when the down hop number of the route of this associated nodes of current time is one, the down hop of the route of this associated nodes in above-mentioned routing table is adjusted into effective status by disarmed state, and the route of this associated nodes is adjusted into effective status by disarmed state, and upgrade above-mentioned routing table.For example, consult shown in Fig. 4, establish node C and revert to kilter by malfunction, the associated nodes of node C is node D and node E; Suppose that node F and node C are for connected state not, with respect to node A herein,, the down hop of node D is the IP address (b) of Node B, now, b is adjusted into effective status by disarmed state, and the route of node D is adjusted into effective status by disarmed state, and upgrade routing table.
The down hop number of the route of this associated nodes of current time is during at least two, the down hop that the node changing with LSA at least two the; corresponding route of above-mentioned associated nodes down hops is associated is adjusted into effective status by disarmed state, upgrades above-mentioned routing table.For example, consult shown in Fig. 4, establish Node B and revert to kilter by malfunction, the associated nodes of Node B is node C, node D and node E; With respect to node A, the down hop of node D is the IP address (b) of Node B and the IP(f of node F), now, owing to there is fault recovery situation in Node B only, therefore, Node B is the node that node that above-mentioned LSA changes is associated, and only b is adjusted into effective status by disarmed state, and in the route of node D, comprises effective routing, the route that represents node A sensing node D is effective status, now, need not adjust the routing state of this node D, only upgrade routing table.
The second situation: change into disarmed state by effective status if above-mentioned state change information is the node that LSA changes, the routing iinformation of the associated nodes of the node changing according to above-mentioned LSA, obtain the route of this associated nodes, and the route of above-mentioned associated nodes is adjusted.
Concrete, when the down hop number of the route of this associated nodes of current time is one, the down hop of the route of this associated nodes is adjusted into disarmed state by effective status, and the route of associated nodes is adjusted into disarmed state by effective status, and upgrade routing table.For example, consult shown in Fig. 4, establish node C and break down, the associated nodes of node C is node D and node E; Suppose that node F and node C are for connected state not, with respect to node A herein,, the down hop of node D is the IP address (b) of Node B, now, b is adjusted into disarmed state by effective status, and the route of node D is adjusted into disarmed state by effective status, and upgrade routing table.
When the down hop number of the route of this associated nodes of current time is during at least two, the down hop that the node changing with LSA at least two down hops of the route of above-mentioned associated nodes is associated is adjusted into disarmed state by effective status.For example, consult shown in Fig. 4, establish Node B and break down, the associated nodes of Node B is node C, node D and node E; With respect to node A, the down hop of node D is the IP address (b) of Node B and the IP(f of node F), now, because Node B breaks down, therefore, only b is adjusted into disarmed state by effective status, and in the route of node D, comprise effective routing, represent that the route of node A sensing node D is effective status, now, routing state that need not knot modification D, only upgrades routing table.
The third situation: if the chain route disarmed state that above-mentioned state change information is LSA to change is changed into effective status, the routing iinformation of the associated nodes of the link changing according to this LSA, obtain the route of this associated nodes, and the route of associated nodes is adjusted.
Concrete, when the down hop number of the route of the above-mentioned associated nodes of current time is one, the down hop of the route of this associated nodes is adjusted into effective status by disarmed state.For example, consult shown in Fig. 4, the chain route malfunction of establishing between Node B and node C reverts to kilter, and the node that this faulty link is corresponding is node C, and the associated nodes of node C is node D and node E; Suppose that node F and node C are for connected state not, with respect to node A herein,, the down hop of node D is the IP address (b) of Node B, now, b is adjusted into effective status by disarmed state, and the route of node D is adjusted into effective status by disarmed state, and upgrade routing table.
When the down hop number of the route of this associated nodes of current time is during at least two, the down hop that the link changing with above-mentioned LSA at least two down hops of the route of above-mentioned associated nodes is associated is adjusted into effective status by disarmed state, and upgrades routing table.For example, consult shown in Fig. 4, the link of establishing between Node B and node C occurs to revert to kilter by malfunction, and the associated nodes of node C is node D and node E; With respect to node A, the down hop of node D is the IP address (b) of Node B and the IP(f of node F), now, owing to there is fault recovery situation in link corresponding to Node B only, therefore, only b is adjusted into effective status by disarmed state, and in the route of node D, comprise effective routing, represent that the route of node A sensing node D is effective status, now, routing state that need not knot modification D, only upgrades routing table.
The 4th kind of situation: if the chain route effective status that above-mentioned state change information is LSA to change is changed into disarmed state, the routing iinformation of the associated nodes of the link changing according to this LSA, obtain the route of this associated nodes, and the route of associated nodes is adjusted.
Concrete, when the down hop number of the route of this associated nodes of current time is one, the down hop of the route of associated nodes is adjusted into disarmed state by effective status, and the route of this associated nodes is adjusted into disarmed state by effective status, and upgrade routing table.For example, consult shown in Fig. 4, establish the link occurs fault between Node B and node C, the associated nodes of node C is node D and node E; Suppose that node F and node C are for connected state not, with respect to node A herein,, the down hop of node D is the IP address (b) of Node B, now, b is adjusted into disarmed state by effective status, and the route of node D is adjusted into disarmed state by effective status, and upgrade routing table.
The down hop number of the route of this associated nodes of current time is during at least two, the down hop that the link changing with above-mentioned LSA at least two down hops of route in above-mentioned routing table is associated is adjusted into disarmed state by effective status, and upgrades routing table.For example, consult shown in Fig. 4, establish the link occurs fault state between Node B node C, the associated nodes of node C is node D and node E; With respect to node A, the IP address (b) that the down hop of node D is Node B and the IP(f of node F), now, because Node B only exists fault, therefore, only b is adjusted into disarmed state by effective status, and upgrades routing table.
Adopt technique scheme, when IDC network is after stable state, think that the SPT of current time is reliable state, any time afterwards, no matter how this IDC topology of networks changes, above-mentioned SPT does not all change, each node this locality in IDC network all generates Mirror Info based on this SPT, thereby make IDC network can date back at any time above-mentioned image information, the problem of having avoided the topological structure causing when shake or link occurs fault occur any node in IDC network to change.And, in said process, while there is shake or link occurs fault in any node, only upgrade the routing table in the local Mirror Info of preserving of above-mentioned IDC nodes, thereby avoided flow matches that node that above-mentioned any node or faulty link are relevant is corresponding on other routes (as default route) in routing table, and then being forwarded to unrelated equipment, the problem of the waste network bandwidth, has effectively improved network performance.
Further, when increasing new node in above-mentioned IDC network, make all nodes in this IDC network again obtain the SPT after renewal according to the IDC network after upgrading, and the LSA after upgrading; When judging that according to the LSA after above-mentioned renewal IDC network after upgrading is during as stable state, according to the LSA after this renewal respectively at the local Mirror Info generating after upgrading of local each node of IDC; Wherein, the Mirror Info after this renewal comprises the routing table after SPT and the renewal after above-mentioned renewal.
Adopt technique scheme, when needs carry out dilatation or knot adjustment to IDC network, only need the local Mirror Info of preserving of each node to upgrade, avoid existing ospf protocol message cannot know the information that above-mentioned network changes, thereby affected the problem of the normal operation of node.
Based on technique scheme, below in conjunction with concrete application scenarios, describe the method for managing network node in detail.
Consult shown in Fig. 5, after each node in IDC network receives and starts the indication of IDC pattern, each node judge IDC network whether the detailed process in stable state be:
Any node in step 500:IDC network receives above-mentioned startup IDC pattern indication, and according to the indication of this startup IDC pattern, starts IDC pattern.
Step 510: the local all neighbor nodes of above-mentioned any node traversal, and monitor the information that LSA comprises.
Step 520: in the first default duration, it is pre-conditioned that this any node judges whether the state of above-mentioned LSA and above-mentioned all neighbor nodes meets simultaneously, if do not meet, execution step execution step 530; If meet, execution step 540.
In the embodiment of the present invention, above-mentioned pre-conditioned being, in the first default duration, above-mentioned LSA do not change and this LSA in the information that comprises correct, and the state of above-mentioned all neighbor nodes is not for correctly changing.
Step 530: wait for after the second default duration, return to step 510.
Step 540: judge in above-mentioned IDC network whether also have the not node of traversal, if so, perform step 550; Otherwise, judge that above-mentioned IDC network is stable state.
Step 550: above-mentioned any node continues other nodes in downward recurrence traversal IDC network, and whether all nodes that simultaneously judge recurrence traversal meet above-mentioned pre-conditionedly, if so, performs step 540; Otherwise, execution step 530.
Consult shown in Fig. 6, take the down hop number of the route of current time associated nodes as one as example, when after the node that exists LSA to change in IDC network, according to the state change information of above-mentioned node, the detailed process that routing table is adjusted is:
State change information and identification information that the node that any node reception LSA in step 600:IDC network changes sends.
Step 601: search whether there is above-mentioned identification information in the Mirror Info that above-mentioned any node is preserved in this locality, if do not exist, perform step 602; Otherwise, execution step 603.
Step 602: above-mentioned any node is not processed above-mentioned state change information.
Step 603: above-mentioned any node is according to above-mentioned state change information, when judging that IDC exists the node that LSA changes, judge that whether above-mentioned state change information is that the node that LSA changes is changed into effective status by disarmed state, if so, performs step 604; Otherwise, execution step 605.
Step 604: above-mentioned any node obtains the associated nodes of the node that above-mentioned LSA changes, and according to the routing iinformation of above-mentioned associated nodes, obtain the route of this associated nodes, and the down hop of the route of this associated nodes is adjusted into effective status by disarmed state, and the route of above-mentioned associated nodes is adjusted into effective status by disarmed state.
Step 605: above-mentioned any node obtains the associated nodes of the node that above-mentioned LSA changes, according to the routing iinformation of above-mentioned associated nodes, obtain the route of this associated nodes, and the down hop of the route of above-mentioned associated nodes is adjusted into disarmed state by effective status, and the route of above-mentioned associated nodes is adjusted into disarmed state by effective status.
Step 606: above-mentioned any node is according to above-mentioned state change information, when judging that IDC exists the link that LSA changes, judge that whether above-mentioned state change information is that the chain route disarmed state that LSA changes is changed into effective status, if so, performs step 607; Otherwise, execution step 608.
Step 607: above-mentioned any node obtains the associated nodes of the link that above-mentioned LSA changes, according to the routing iinformation of this associated nodes, obtain the route of this associated nodes, and the down hop of the route of above-mentioned associated nodes is adjusted into effective status by disarmed state, and the route of above-mentioned associated nodes is adjusted into effective status by disarmed state.
Step 608: above-mentioned any node obtains the associated nodes of the link that above-mentioned LSA changes, according to the routing iinformation of this associated nodes, obtain the route of this associated nodes, and the down hop of the route of above-mentioned associated nodes is adjusted into disarmed state by effective status, and the route of above-mentioned associated nodes is adjusted into disarmed state by effective status.
Consult shown in Fig. 7, node ToR_1 will be comprised in IDC network, Core_1, ToR_2 and Core_2, and configure basic ospf protocol on above-mentioned all nodes, after the upper operational network management software of any node (as Core_1) in this IDC network, this IDC network enters stable state, now take the link between ToR_2 and Core_2, there is fault (being the link that the link between ToR_2 and Core_2 changes as LSA), ToR_1 is example according to the process of the local routing table of preserving of above-mentioned fault adjustment, consult shown in Fig. 8, introduce in detail the process of management ID C network node:
Step 800:ToR_1 receives the nodal information message that Core_2 sends.
Consult the SPT that Figure 9 shows that ToR_1 in the embodiment of the present invention, wherein, the route that arrives ToR_2 is ECMP route.
Step 810:ToR_1 is according to the state change information carrying in above-mentioned nodal information message, and the down hop (the IP address of Core_2) of obtaining the route of the local above-mentioned ToR_2 of arrival is adjusted into disarmed state by effective status.
In the embodiment of the present invention, the route that ToR_1 points to ToR_2 is respectively ToR_1-Core_2-ToR_2 and ToR_1-Core_1-ToR_2, the IP address that down hop of the route of ToR_2 is Core_2 or the IP address of Core_1, therefore, the number of the down hop of the route of above-mentioned ToR_2 is two, the IP address that now only needs to adjust Core_2 is disarmed state, need not adjust the route of ToR_2.
Adopt technique scheme, Core_2 can not recalculate all the time and draw the route sensing ToR_1 that arrives ToR_2, thereby has guaranteed can between ToR_1 and Core_2, not form loop.Simultaneously, in said process, all calculating is only for simply searching and upgrading operation, can not move SPF calculates, in the IDC network that has great deal of nodes, if shake frequently occurs this IDC node, adopt such scheme can effectively save network equipment system resource, thereby guaranteed the operation of whole IDC network stabilization.
Based on technique scheme, consult shown in Figure 10, the present invention also provides a kind of device of managing network node, comprises generation unit 100, the first acquiring units 101, second acquisition unit 102, and adjustment unit 103, wherein:
Generation unit 100, after being stable state according to LSA LSA decision network, generates the Mirror Info of described LSA in this locality; Wherein, described Mirror Info comprises shortest path tree SPT and routing table;
The first acquiring unit 101, the nodal information message sending for receiving node that LSA changes, and obtain the LSA change information carrying in described nodal information message, wherein, described LSA change information comprises identification information and the state change information corresponding to this node of the node that LSA changes, or identification information and the state change information corresponding to this link of the link that changes of LSA;
Second acquisition unit 102, for working as, detect that described Mirror Info exists the identification information of node or the identification information of link in described LSA change information, travel through described SPT, obtain the routing iinformation of the associated nodes of the link that node that described LSA changes or LSA change, and according to the routing iinformation of described associated nodes, obtain the route of described associated nodes;
Adjustment unit 103, for identification information and corresponding state change information and the described routing iinformation of this node of the node that changes according to described LSA, adjusts the route of described associated nodes.
Further, said apparatus also comprises identifying unit 104, for: for any node of described network, travel through all mid-side nodes in the preset range of described any node, and monitor the information that LSA that described any node obtains comprises; When the information that described LSA comprises in the first default duration does not correctly change, and described all periphery node states are correct and while all not changing, judge that described network is as stable state.
Further, said apparatus also comprises updating block 105, for: when described network increases new node, make each node in described network again obtain the SPT after renewal according to the network after upgrading, and the LSA after upgrading; When judging that according to the LSA after described renewal network after described renewal is as stable state, each node in described network generates the Mirror Info after upgrading respectively; Wherein, the Mirror Info after described renewal comprises the routing table after SPT and the renewal after described renewal.
In sum, in the embodiment of the present invention, after any node in network is stable state according to LSA decision network, at the Mirror Info of the local Mirror Info that generates this LSA of this any node; Receive the nodal information message that the node that changes of LSA sends, and obtain identification information and the state change information of the node that the LSA that carries in this nodal information message changes, or identification information and the state change information of the link that changes of LSA; Detect in above-mentioned image information and exist after above-mentioned identification information, the SPT that travels through this Mirror Info obtains the routing iinformation of the associated nodes of the link that node that above-mentioned LSA changes or LSA change, and according to the routing iinformation of above-mentioned associated nodes, obtain the route of associated nodes; According to above-mentioned state change information, and the routing iinformation of associated nodes is adjusted the route of this associated nodes.Adopt technical solution of the present invention, the LSA of any node in network based on after stable creates Mirror Info, when existing a node that shake occurs, the topological structure according to this Mirror Info, the node of the generation shake in network being affected is adjusted, avoided, at a node, all nodes in the rear network of shake occur and recalculated the loop problem that converged paths causes, thereby effectively improved network performance.
Those skilled in the art should understand, embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt complete hardware implementation example, completely implement software example or the form in conjunction with the embodiment of software and hardware aspect.And the present invention can adopt the form at one or more upper computer programs of implementing of computer-usable storage medium (including but not limited to magnetic disc store, CD-ROM, optical memory etc.) that wherein include computer usable program code.
The present invention is with reference to describing according to flow chart and/or the block diagram of the method for the embodiment of the present invention, equipment (system) and computer program.Should understand can be by the flow process in each flow process in computer program instructions realization flow figure and/or block diagram and/or square frame and flow chart and/or block diagram and/or the combination of square frame.Can provide these computer program instructions to the processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device to produce a machine, the instruction that makes to carry out by the processor of computer or other programmable data processing device produces the device for realizing the function of specifying at flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frame.
These computer program instructions also can be stored in energy vectoring computer or the computer-readable memory of other programmable data processing device with ad hoc fashion work, the instruction that makes to be stored in this computer-readable memory produces the manufacture that comprises command device, and this command device is realized the function of specifying in flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device, make to carry out sequence of operations step to produce computer implemented processing on computer or other programmable devices, thereby the instruction of carrying out is provided for realizing the step of the function of specifying in flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frame on computer or other programmable devices.
Although described the preferred embodiments of the present invention, once those skilled in the art obtain the basic creative concept of cicada, can make other change and modification to these embodiment.So claims are intended to be interpreted as comprising preferred embodiment and fall into all changes and the modification of the scope of the invention.
Obviously, those skilled in the art can carry out various changes and modification and not depart from the spirit and scope of the embodiment of the present invention the embodiment of the present invention.Like this, if within these of the embodiment of the present invention are revised and modification belongs to the scope of the claims in the present invention and equivalent technologies thereof, the present invention is also intended to comprise these changes and modification interior.

Claims (12)

1. a method for managing network node, is characterized in that, comprising:
After being stable state according to LSA LSA decision network, in this locality, generate the Mirror Info of described LSA; Wherein, described Mirror Info comprises shortest path tree SPT and routing table;
The nodal information message that the node that reception LSA changes sends, and obtain the LSA change information carrying in described nodal information message, wherein, described LSA change information comprises identification information and the state change information corresponding to this node of the node that LSA changes, or identification information and the state change information corresponding to this link of the link that changes of LSA;
When detecting in described Mirror Info, there is the identification information of node or the identification information of link in described LSA change information, travel through described SPT, obtain the routing iinformation of the associated nodes of the link that node that described LSA changes or LSA change;
The identification information of the node changing according to described LSA and corresponding state change information and the described routing iinformation of this node, adjust the route of described associated nodes.
2. the method for claim 1, is characterized in that, according to LSA, judges that described network, as stable state, specifically comprises:
For any node in described network, travel through all mid-side nodes in the preset range of described any node, and monitor the information that LSA that described any node obtains comprises;
When the information that described LSA comprises in the first default duration does not correctly change, and described all periphery node states are correct and while all not changing, judge that described network is as stable state.
3. method as claimed in claim 2, it is characterized in that, if the information errors that described LSA comprises, or the information that described LSA comprises in the first default duration changes, or there is any periphery node state mistake, or exist any periphery node state to change, further comprise:
Judge that described network is as labile state;
Wait for after the second default duration, again travel through all mid-side nodes in the preset range of described any node, until judge that described network is as stable state.
4. the method as described in claim 1-3 any one, it is characterized in that, the identification information of the node changing according to described LSA and corresponding state change information and the described routing iinformation of this node, adjust the route of described associated nodes, specifically comprises:
If being the node that described LSA changes, described state change information changes into effective status by disarmed state, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop of the route of described associated nodes is adjusted into effective status by disarmed state, and the route of described associated nodes is adjusted into effective status by disarmed state;
If the chain route disarmed state that described state change information is described LSA to change is changed into effective status, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop of the route of described associated nodes is adjusted into effective status by disarmed state, and the route of described associated nodes is adjusted into effective status by disarmed state;
If being the node that described LSA changes, described state change information changes into disarmed state by effective status, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop of the route of described associated nodes is adjusted into disarmed state by effective status, and the route of described associated nodes is adjusted into disarmed state by effective status;
If the chain route effective status that described state change information is described LSA to change is changed into disarmed state, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop of the route of described associated nodes is adjusted into disarmed state by effective status, and the route of described associated nodes is adjusted into disarmed state by effective status.
5. the method as described in claim 1-3 any one, it is characterized in that, when the down hop number of the route of described associated nodes is during at least two, the identification information of the node changing according to described LSA and corresponding state change information and the described routing iinformation of this node, route to described associated nodes is adjusted, and specifically comprises:
If being the node that described LSA changes, described state change information changes into effective status by disarmed state, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop that the node changing with described LSA at least two down hops of the route of described associated nodes is associated is adjusted into effective status by disarmed state, and keeps the route of described associated nodes constant;
If the chain route disarmed state that described state change information is described LSA to change is changed into effective status, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop that the link changing with described LSA in the down hop of the route of described associated nodes is associated is adjusted into effective status by disarmed state, and keeps the route of described associated nodes constant;
If being the node that described LSA changes, described state change information changes into disarmed state by effective status, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop that the link changing with described LSA in the down hop of the route of described associated nodes is associated is adjusted into disarmed state by effective status, and keeps the route of described associated nodes constant;
If the chain route effective status that described state change information is described LSA to change is changed into disarmed state, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop that the link changing with described LSA in the down hop of the route of described associated nodes is associated is adjusted into disarmed state by effective status, and keeps the route of described associated nodes constant.
6. the method for claim 1, is characterized in that, further comprises:
When increasing new node in described network, make each node in described network again obtain the SPT after renewal according to the network after upgrading, and the LSA after upgrading;
When judging that according to the LSA after described renewal network after described renewal is as stable state, each node in described network generates the Mirror Info after upgrading respectively; Wherein, the Mirror Info after described renewal comprises the routing table after SPT and the renewal after described renewal.
7. a device for managing network node, is characterized in that, comprising:
Generation unit, after being stable state according to LSA LSA decision network, generates the Mirror Info of described LSA in this locality; Wherein, described Mirror Info comprises shortest path tree SPT and routing table;
The first acquiring unit, the nodal information message sending for receiving node that LSA changes, and obtain the LSA change information carrying in described nodal information message, wherein, described LSA change information comprises identification information and the state change information corresponding to this node of the node that LSA changes, or identification information and the state change information corresponding to this link of the link that changes of LSA;
Second acquisition unit, for working as, detect that described Mirror Info exists the identification information of node or the identification information of link in described LSA change information, travel through described SPT, obtain the routing iinformation of the associated nodes of the link that node that described LSA changes or LSA change, and according to the routing iinformation of described associated nodes, obtain the route of described associated nodes;
Adjustment unit, for identification information and corresponding state change information and the described routing iinformation of this node of the node that changes according to described LSA, adjusts the route of described associated nodes.
8. device as claimed in claim 7, is characterized in that, also comprises identifying unit, for:
For any node in described network, travel through all mid-side nodes in the preset range of described any node, and monitor the information that LSA that described any node obtains comprises; When the information that described LSA comprises in the first default duration does not correctly change, and described all periphery node states are correct and while all not changing, judge that described network is as stable state.
9. device as claimed in claim 8, is characterized in that, described identifying unit, also for:
If the information errors that described LSA comprises, or the information that described LSA comprises in the first default duration changes, or there is any periphery node state mistake, or exist any periphery node state to change, judge that described network is as labile state; Wait for after the second default duration, again travel through all mid-side nodes in the preset range of described any node, until judge that described network is as stable state.
10. the device as described in claim 7-9 any one, is characterized in that, described adjustment unit, specifically for:
When the down hop number of the route of described associated nodes is one, if being the node that described LSA changes, described state change information changes into effective status by disarmed state, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop of the route of described associated nodes is adjusted into effective status by disarmed state, and the route of described associated nodes is adjusted into effective status by disarmed state; If the chain route disarmed state that described state change information is described LSA to change is changed into effective status, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop of the route of described associated nodes is adjusted into effective status by disarmed state, and the route of described associated nodes is adjusted into effective status by disarmed state; If being the node that described LSA changes, described state change information changes into disarmed state by effective status, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop of the route of described associated nodes is adjusted into disarmed state by effective status, and the route of described associated nodes is adjusted into disarmed state by effective status; If the chain route effective status that described state change information is described LSA to change is changed into disarmed state, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop of described associated nodes route is adjusted into disarmed state by effective status, and the route of described associated nodes is adjusted into disarmed state by effective status.
11. devices as described in claim 7-9 any one, is characterized in that, described adjustment unit, specifically for:
When the down hop number of the route of described associated nodes is during at least two, if being the node that described LSA changes, described state change information changes into effective status by disarmed state, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop that the node changing with described LSA at least two down hops of the route of described associated nodes is associated is adjusted into effective status by disarmed state, and keeps the route of described associated nodes constant; If the chain route disarmed state that described state change information is described LSA to change is changed into effective status, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop that the link changing with described LSA in the down hop of the route of described associated nodes is associated is adjusted into effective status by disarmed state, and keeps the route of described associated nodes constant; If being the node that described LSA changes, described state change information changes into disarmed state by effective status, the routing iinformation of the associated nodes of the node changing according to described LSA, the down hop that the link changing with described LSA in the down hop of the route of described associated nodes is associated is adjusted into disarmed state by effective status, and keeps the route of described associated nodes constant; If the chain route effective status that described state change information is described LSA to change is changed into disarmed state, the routing iinformation of the associated nodes of the link changing according to described LSA, the down hop that the link changing with described LSA in the down hop of the route of described associated nodes is associated is adjusted into disarmed state by effective status, and keeps the route of described associated nodes constant.
12. devices as claimed in claim 7, is characterized in that, also comprise updating block, for:
When increasing new node in described network, make each node in described network again obtain the SPT after renewal according to the network after upgrading, and the LSA after upgrading; When judging that according to the LSA after described renewal network after described renewal is as stable state, each node in described network generates the Mirror Info after upgrading respectively; Wherein, the Mirror Info after described renewal comprises the routing table after SPT and the renewal after described renewal.
CN201310693907.6A 2013-12-17 2013-12-17 A kind of method and device for managing network node Active CN103746828B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310693907.6A CN103746828B (en) 2013-12-17 2013-12-17 A kind of method and device for managing network node

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310693907.6A CN103746828B (en) 2013-12-17 2013-12-17 A kind of method and device for managing network node

Publications (2)

Publication Number Publication Date
CN103746828A true CN103746828A (en) 2014-04-23
CN103746828B CN103746828B (en) 2017-06-23

Family

ID=50503819

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310693907.6A Active CN103746828B (en) 2013-12-17 2013-12-17 A kind of method and device for managing network node

Country Status (1)

Country Link
CN (1) CN103746828B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104184662A (en) * 2014-08-22 2014-12-03 深圳市中兴移动通信有限公司 Data transmitting and receiving method, communication system and terminal
CN104320346A (en) * 2014-10-31 2015-01-28 杭州华三通信技术有限公司 Status information publishing method and device
WO2016177136A1 (en) * 2015-07-31 2016-11-10 中兴通讯股份有限公司 Method and device for implementing link state advertisement processing
WO2016206371A1 (en) * 2015-06-24 2016-12-29 深圳市中兴微电子技术有限公司 Routing management method and apparatus, and storage medium
WO2021018309A1 (en) * 2019-08-01 2021-02-04 华为技术有限公司 Method, device and system for determination of message transmission path, and computer storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1585350A (en) * 2003-08-18 2005-02-23 赵季红 Network fault restoring method
WO2008005482A2 (en) * 2006-07-05 2008-01-10 Cisco Technology, Inc. A technique for efficiently determining acceptable link-based loop free alternatives in a computer network
CN101272393A (en) * 2008-05-14 2008-09-24 杭州华三通信技术有限公司 Routing computing method and network node based on link condition routing protocol
CN101599898A (en) * 2009-07-01 2009-12-09 北京邮电大学 The multilink fault environment adopts the method for the avoiding loop for routers of LFA mode down
CN102946305A (en) * 2012-10-22 2013-02-27 杭州华三通信技术有限公司 Method and equipment for synchronizing link state protocol data unit (LSP)
CN103001879A (en) * 2012-06-29 2013-03-27 杭州华三通信技术有限公司 Method and equipment for reducing of link state advertisement flooding frequency

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1585350A (en) * 2003-08-18 2005-02-23 赵季红 Network fault restoring method
WO2008005482A2 (en) * 2006-07-05 2008-01-10 Cisco Technology, Inc. A technique for efficiently determining acceptable link-based loop free alternatives in a computer network
CN101272393A (en) * 2008-05-14 2008-09-24 杭州华三通信技术有限公司 Routing computing method and network node based on link condition routing protocol
CN101599898A (en) * 2009-07-01 2009-12-09 北京邮电大学 The multilink fault environment adopts the method for the avoiding loop for routers of LFA mode down
CN103001879A (en) * 2012-06-29 2013-03-27 杭州华三通信技术有限公司 Method and equipment for reducing of link state advertisement flooding frequency
CN102946305A (en) * 2012-10-22 2013-02-27 杭州华三通信技术有限公司 Method and equipment for synchronizing link state protocol data unit (LSP)

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
于涛: "IP网络生存性技术研究", 《中国博士学位论文全文数据库 信息科技辑》 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104184662A (en) * 2014-08-22 2014-12-03 深圳市中兴移动通信有限公司 Data transmitting and receiving method, communication system and terminal
CN104184662B (en) * 2014-08-22 2016-07-27 努比亚技术有限公司 Method, communication system and the terminal that a kind of data send, receive
CN104320346A (en) * 2014-10-31 2015-01-28 杭州华三通信技术有限公司 Status information publishing method and device
CN104320346B (en) * 2014-10-31 2017-11-14 新华三技术有限公司 A kind of status information dissemination method and device
WO2016206371A1 (en) * 2015-06-24 2016-12-29 深圳市中兴微电子技术有限公司 Routing management method and apparatus, and storage medium
CN106330726A (en) * 2015-06-24 2017-01-11 深圳市中兴微电子技术有限公司 Routing management method and device
WO2016177136A1 (en) * 2015-07-31 2016-11-10 中兴通讯股份有限公司 Method and device for implementing link state advertisement processing
WO2021018309A1 (en) * 2019-08-01 2021-02-04 华为技术有限公司 Method, device and system for determination of message transmission path, and computer storage medium

Also Published As

Publication number Publication date
CN103746828B (en) 2017-06-23

Similar Documents

Publication Publication Date Title
US20150249587A1 (en) Method and apparatus for topology and path verification in networks
US9628371B2 (en) Controlling routing during scheduled node downtime
KR20150056159A (en) A method operating of a controller and a switch to resolve network error, and the controller and the switch therefor
EP1905196B1 (en) Method and apparatus for updating label-switched paths
CN101483610B (en) Route updating method for link state routing protocol
JP2005525716A (en) Topology discovery by dividing various discovery technologies
CN103746828A (en) Method and device for network node management
WO2016177049A1 (en) Method and device for achieving capacity expansion and reduction of access apparatus
CN113259162B (en) Network fault determination method and device, electronic equipment and storage medium
CN103825826A (en) Method and device for implementing dynamic routing
CN103152261A (en) Method and equipment for generating and distributing link state protocol data unit fragment messages
CN102882787B (en) Method and device for determining retransmission routes of traffic engineering tunnels
EP4072079A1 (en) Anti-fiber breakage method and device for segment routing tunnel, ingress node and storage medium
CN104937878A (en) Method to setup protocol independent multicast trees in the presence of unidirectional tunnels
CN106230717B (en) Route obtaining method and device in cluster system
CN103634218A (en) Fast routing convergence method and fast routing convergence device
CN102316029B (en) Fast rerouting method and routing equipment
JP6042838B2 (en) Management system, management server, and management method
US20160344591A1 (en) Determining Connections of Non-External Network Facing Ports
KR102187292B1 (en) Method for synchronizing topology information in SFC network, and routing network element
CN104301221A (en) Message routing method and device
EP4152701A1 (en) Routing processing method and related device
CN101616092B (en) Method and device for routing discovery
CN105812160A (en) Seamless redundant network self-adaption method and device thereof
US20200403906A1 (en) Method and apparatus for forwarding network traffic on maximally disjoint paths

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CP01 Change in the name or title of a patent holder

Address after: Cangshan District of Fuzhou City, Fujian province 350002 Jinshan Road No. 618 Garden State Industrial Park 19 floor

Patentee after: RUIJIE NETWORKS CO., LTD.

Address before: Cangshan District of Fuzhou City, Fujian province 350002 Jinshan Road No. 618 Garden State Industrial Park 19 floor

Patentee before: Fujian Xingwangruijie Network Co., Ltd.

CP01 Change in the name or title of a patent holder