CN104283789B - Route convergent method and system - Google Patents
Route convergent method and system Download PDFInfo
- Publication number
- CN104283789B CN104283789B CN201410483947.2A CN201410483947A CN104283789B CN 104283789 B CN104283789 B CN 104283789B CN 201410483947 A CN201410483947 A CN 201410483947A CN 104283789 B CN104283789 B CN 104283789B
- Authority
- CN
- China
- Prior art keywords
- network
- node
- network node
- webserver
- link
- 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.)
- Active
Links
Abstract
The invention discloses a kind of route convergent method and system, described method comprises: the webserver gathers the network topological information of map network; Based on the shortest path that the path that described network topological information accessed path jumping figure is minimum is between each source node and each destination node, the link information of each network node of map network, shortest path between each source node and each destination node is converted to complete trails routing table, and send to each network node of described map network, carry out routing convergence to make each network node by inquiry complete trails routing table.Implement method and system of the present invention, need to make network node without the need to calculating path during routing convergence, carry out centralized path planning based on complete trails routing table, network convergence speed and network operation efficiency can be promoted, strengthening network-based control ability, is convenient to the network architecture and carries out extending transversely.
Description
Technical field
The present invention relates to communication technical field, particularly relate to a kind of route convergent method and system.
Background technology
At IDC (InternetDataCenter, Internet data center) dispose OSPF (OpenShortestPathFirst, ospf), generally for Fast Convergent, the all-network node deployment in IDC is at same region (non-backbone area).Directly interconnected by Web broadcast link between network node, shaken hands by hello packet and become ospf neighbor.In order to prevent the loss of ospf protocol calculated performance, ospf network type is set to P2P (PeertoPeer, P2P computing) pattern, to forbid the DR election of OSPF on broadcasting link.In territory, each link cost is identical value 10.
OSPF adopts the distributed route computing mode based on Link State.Link information and the ospf neighbor information of running the network node oneself of ospf protocol are broadcasted in territory.After receiving broadcasting packet, network node, to calculate from initiating SPF (shortest-path first algorithm) as root node, calculates the shortest path that self arrives other network nodes.
But above-mentioned route computing method, when router-level topology, can calculate more long path, and in the data in heart network, this long path is the Invalid path being greater than double bounce, can reduce the convergence efficiency of data center.As shown in Figure 1, Internet data center can comprise network node 1011 to the network node 101a of one-level, network node 1021 to the network node 102b of secondary, and network node 1031 to the network node 103c of three grades, a, b, c are positive integer.Network node 1011 to the network node 301a of one-level is connected with network node 1021 to the network node 102b of secondary respectively, and network node 1021 to the network node 102b of secondary is connected with network node 1031 to the network node 303c of three grades respectively.All-network node is all in non-backbone area 10.When the link failure of network node 103c to network node 102b, network node 102b, with from carrying out SPF calculating as root node, can calculate the Invalid path being similar to " network node 102b-network node 1032-network node 1021-network node 103c ".
Summary of the invention
Based on this, be necessary, for above-mentioned router-level topology, the problem of more Invalid path can be calculated, a kind of route convergent method and system are provided.
A kind of route convergent method, comprises the following steps:
The webserver gathers the network topological information of map network;
The webserver searches based on described network topological information the first network node that source node down hop can reach, wherein, respectively with any two network nodes of described map network for source node and destination node;
If do not comprise destination node in the first network node found, then the webserver chooses based on described network topological information the second network node that down hop can reach described destination node from described first network node;
It is shortest path between described source node and described destination node to the link of each second network node and each second network node to the link of described destination node that the webserver chooses described source node;
The link information of each network node of the corresponding described map network of the webserver stores the shortest path between each source node and each destination node, generate complete trails routing table, and send to each network node of described map network, carry out routing convergence to make each network node by the described complete trails routing table of inquiry.
A kind of routing convergence system, comprise the webserver, the described webserver comprises:
Acquisition module, for gathering the network topological information of map network;
First node searches module, for searching the first network node that source node down hop can reach based on described network topological information, wherein, respectively with any two network nodes of described map network for source node and destination node;
Section Point searches module, during for not comprising destination node in the first network node found, chooses based on described network topological information the second network node that down hop can reach described destination node from described first network node;
Module is chosen in path, is shortest path between described source node and described destination node for choosing described source node to the link of each second network node and each second network node to the link of described destination node;
Complete trails routing table generation module, link information for each network node of the described map network of correspondence stores the shortest path between each source node and each destination node, generate complete trails routing table, and send to each network node of described map network, carry out routing convergence to make each network node by the described complete trails routing table of inquiry.
Above-mentioned route convergent method and system, the webserver searches based on described network topological information the first network node that source node down hop can reach, when not comprising destination node in the first network node found, from described first network node, the second network node that down hop can reach described destination node is chosen based on described network topological information, obtain the shortest path between described source node and described destination node, and then generate the complete trails routing table of the shortest path between any two network nodes comprising map network and send to network node, when making to need convergence, network node is without the need to calculating path, network convergence speed can be promoted, being convenient to the network architecture carries out extending transversely, it is few that acquisition shortest path takies resource, calculate simple and direct, network equipment maintenance difficulty can be reduced, centralized path planning is carried out based on complete trails routing table, network operation efficiency can be promoted, strengthening network-based control ability.
A kind of route convergent method, comprises the following steps:
The webserver gathers the network topological information of map network;
The webserver searches based on described network topological information the first network node that source node down hop can reach, wherein, respectively with any two network nodes of described map network for source node and destination node;
If do not comprise destination node in the first network node found, then the webserver chooses based on described network topological information the second network node that down hop can reach described destination node from described first network node;
It is shortest path between described source node and described destination node to the link of each second network node and each second network node to the link of described destination node that the webserver chooses described source node;
The link information of each network node of the corresponding described map network of the webserver stores the shortest path between each source node and each destination node, generates complete trails routing table, and sends to each network node of described map network;
Each network node receives and stores described complete trails routing table;
When each network node receives the network failure information of described map network, each network node, by the faulty link corresponding to network failure information described in described complete trails routing table lookup, carries out routing convergence.
A kind of routing convergence system, comprise the webserver and network node, the described webserver comprises:
Acquisition module, for gathering the network topological information of map network;
First node searches module, for searching the first network node that source node down hop can reach based on described network topological information, wherein, respectively with any two network nodes of described map network for source node and destination node;
Section Point searches module, during for not comprising destination node in the first network node found, chooses based on described network topological information the second network node that down hop can reach described destination node from described first network node;
Module is chosen in path, is shortest path between described source node and described destination node for choosing described source node to the link of each second network node and each second network node to the link of described destination node;
Complete trails routing table generation module, the link information for each network node of the described map network of correspondence stores the shortest path between each source node and each destination node, generates complete trails routing table, and sends to each network node of described map network;
Described network node comprises:
Memory module, for receiving and storing described complete trails routing table;
Convergence module, for when receiving the network failure information of described map network, by the faulty link corresponding to network failure information described in described complete trails routing table lookup, carries out routing convergence.
Above-mentioned route convergent method and system, the webserver searches based on described network topological information the first network node that source node down hop can reach, when not comprising destination node in the first network node found, from described first network node, the second network node that down hop can reach described destination node is chosen based on described network topological information, obtain the shortest path between described source node and described destination node, and then generate the complete trails routing table of the shortest path between any two network nodes comprising map network and send to network node, make network node without the need to calculating path, when receiving the network failure information of described map network, by the faulty link corresponding to network failure information described in described complete trails routing table lookup, carry out routing convergence, network convergence speed can be promoted, being convenient to the network architecture carries out extending transversely, it is few that acquisition shortest path takies resource, calculate simple and direct, network equipment maintenance difficulty can be reduced, centralized path planning is carried out based on complete trails routing table, network operation efficiency can be promoted, strengthening network-based control ability.
Accompanying drawing explanation
Fig. 1 is the structural representation of the implementation environment of existing SPF algorithm;
Fig. 2 is the structural representation of an implementation environment of the embodiment of the present invention;
Fig. 3 is the schematic flow sheet of route convergent method first execution mode of the present invention;
Fig. 4 is the schematic flow sheet of route convergent method second execution mode of the present invention;
Fig. 5 is the structural representation of routing convergence system first execution mode of the present invention;
Fig. 6 is the schematic flow sheet of route convergent method of the present invention 3rd execution mode;
Fig. 7 is the structural representation of routing convergence system the 3rd execution mode of the present invention.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
Unless context separately has the description of specific distinct, the element in the present invention and assembly, the form that quantity both can be single exists, and form that also can be multiple exists, and the present invention does not limit this.Although the step in the present invention arranges with label, and be not used in and limit the precedence of step, the order of step or the execution of certain step need based on other steps unless expressly stated, otherwise the relative rank of step is adjustable.Be appreciated that term "and/or" used herein relates to and contains the one or more any and all possible combination in the Listed Items be associated.
Refer to Fig. 2, Fig. 2 is the structural representation of an implementation environment of the route convergent method of the embodiment of the present invention.
Implementation environment shown in Fig. 2 is for realizing the route convergent method described in any embodiment of the present invention or execution mode, and comprise the webserver 2000 and network node 3000, the webserver 2000 is connected by wireless or cable network with network node 3000.
Wherein, network node 3000 is preferably and has absolute address and the equipment having the map network that transmits or receive data function and be connected, and can comprise personal computer, work station, server, switch, router or other network equipments.Each network node is connected by communication line, forms certain geometrical relationship, namely forms the topological structure of map network.
The webserver 2000 preferably can be the controller of map network, can comprise at least one in the terminal equipments such as desktop computer, notebook, personal digital assistant, smart phone, panel computer.
Described map network can be two-stage or three-level network structure, is preferably the network of Internet data center.
The number of the webserver 2000 and network node 3000 all can be two or more.According to the amount of calculation of the number of network node in map network 2000 and shortest path, the number of the webserver 2000 can be determined.
In one embodiment, the webserver 2000 can comprise the webserver 2010, the webserver 2020 to webserver 20d0, and d is more than or equal to the positive integer of 2.
Network node 3000 can comprise network node 3011 to the network node 301a of one-level, network node 3021 to the network node 302b of secondary, and network node 3031 to the network node 303c of three grades, a, b, c are positive integer.Network node 3011 to the network node 301a of one-level is connected with network node 3021 to the network node 302b of secondary respectively, and network node 3021 to the network node 302b of secondary is connected with network node 3031 to the network node 303c of three grades respectively.
When realizing route convergent method, the webserver 2000 can gather the network topological information of map network; The first network node that source node down hop can reach is searched based on described network topological information; If do not comprise destination node in the first network node found, then from described first network node, choose based on described network topological information the second network node that down hop can reach described destination node; Choosing described source node is shortest path between described source node and described destination node to the link of each second network node and each second network node to the link of described destination node.Further, the link information of each network node 3000 of described map network is also may correspond to when realizing route convergent method, shortest path between each source node and each destination node is converted to complete trails routing table, and send to each network node 3000 of described map network, carry out routing convergence to make each network node by the described complete trails routing table of inquiry.
Preferably, source node is any one in each network node of described map network, and destination node is other network nodes in each network node of described map network except source node.
Further, the webserver 2000 collection network node 3000, link and network node 3000 annexations, and safeguard the state of these information.
Each network node 3000 can receive described complete trails routing table, and in the network node of network link failure or the network node of one-level, the network node 3021 of secondary or three grades during any one node failure, according to corresponding failure information inquiry, complete trails routing table carries out routing convergence.
Refer to Fig. 3, Fig. 3 is the schematic flow sheet of route convergent method first execution mode of the present invention.
The described route convergent method of present embodiment preferably can perform in network server end, can comprise the following steps:
Step S501, the webserver gathers the network topological information of map network.
Step S502, the webserver searches based on described network topological information the first network node that source node down hop can reach, wherein, respectively with any two network nodes of described map network for source node and destination node.
Step S503, if do not comprise destination node in the first network node found, then the webserver chooses based on described network topological information the second network node that down hop can reach described destination node from described first network node.
Step S504, it is shortest path between described source node and described destination node to the link of each second network node and each second network node to the link of described destination node that the webserver chooses described source node.
Step S505, the link information of each network node of the corresponding described map network of the webserver stores the shortest path between each source node and each destination node, generate complete trails routing table, and send to each network node of described map network, carry out routing convergence to make each network node by the described complete trails routing table of inquiry.
Route convergent method described in present embodiment, the webserver searches based on described network topological information the first network node that source node down hop can reach, when not comprising destination node in the first network node found, from described first network node, the second network node that down hop can reach described destination node is chosen based on described network topological information, obtain the shortest path between described source node and described destination node, and then generate the complete trails routing table of the shortest path between any two network nodes comprising map network and send to network node, make network node without the need to calculating path, network convergence speed can be promoted, being convenient to the network architecture carries out extending transversely, it is few that acquisition shortest path takies resource, calculate simple and direct, network equipment maintenance difficulty can be reduced, centralized path planning is carried out based on complete trails routing table, network operation efficiency can be promoted, strengthening network-based control ability.
Wherein, for step S501, the webserver can be any one in the webserver 2010 shown in Fig. 2, the webserver 2020 to webserver 20d0.Described map network is preferably the network of Internet data center, can be secondary or three-level network framework, and the jumping figure of any two internodal shortest paths mostly is double bounce most.
Preferably, described network topological information comprises the annexation between each network node.Also can comprise node identification and the link identification of each network node.
In one embodiment, the step of the network topological information of described webserver collection map network comprises the following steps:
The neighbor information that each network node that the webserver receives described corresponding network is obtained by network layer protocol.
The webserver is according to the neighbor information received, and the annexation between each network node obtaining described map network, generates described network topological information.
Preferably, each network node can be expanded by network enabled layer protocol (LLDP agreement), and carry the information such as port IP address by LLDP agreement, LLDP is sent to the webserver when receiving this information.
In other embodiments, also can in (the network node additions and deletions of the described map network of configuration, and/or, network link additions and deletions, and/or network configuration changes) time, the network topological information after configuration is stored into the webserver or corresponding network equipment, when needing to gather, the webserver self is transferred or from corresponding network device request.
For step S502, preferably, respectively with each network node in described map network for source node, obtain the first network node of corresponding each network node.Preferably by described network topological information, using described source node as path starting point, searching the network node direct-connected with source node is described first network node.
In one embodiment, after the webserver searches the step of the first network node that source node down hop can reach based on described network topological information, further comprising the steps of:
If the first network node found comprises described destination node, then the webserver chooses described source node to the link of described destination node is shortest path between described source node and described destination node.
For step S503, node for the purpose of other network nodes any respectively in described map network except described source node, obtains first network node, the second network node of each source node corresponding and destination node.
Preferably, can described first network node be path starting point, searching the first network node direct-connected with destination node be described second network node.
In one embodiment, the webserver is chosen based on described network topological information the step that down hop can reach the second network node of described destination node and is comprised the following steps from described first network node:
The network node that each first network node down hop can reach is searched based on described network topological information.
Judge whether the network node found comprises described destination node.
If so, from the described network node found, then choose the network node that down hop can reach described destination node is described second network node.
In other embodiments, if destination node and source node are the network node of same stages, that can search that each first network node down hop can reach based on described network topological information is in the network node of same one-level with described destination node, and then judge whether the network node found comprises described destination node, if so, from the described network node found, then choose the network node that down hop can reach described destination node is described second network node.
In another embodiment, after judging whether the network node found comprises the step of described destination node, further comprising the steps of:
If described in do not comprise described destination node in the network node that finds, then the network node found described in record is the second alternate node, continues to search based on described network topological information the network node that each second alternate node down hop can reach.
Judge whether the network node found comprises described destination node.
If so, from each second alternate node, the 3rd network node that down hop can reach described destination node is then chosen.
Choosing described destination node is shortest path between described source node and described destination node to the link of each 3rd network node, each 3rd network node to the link of each first network node and each first network node to the link of described source node.
Present embodiment is applicable to the network that network configuration is four level frameworks.
For the network that network configuration is Pyatyi and above framework, operating procedure can be analogized by aforesaid operations.
For step S504, preferably, the jumping figure of described shortest path mostly is double bounce most.
In one embodiment: as shown in Figure 2, described source node can be network node 303c to described map network, and described destination node can be network node 301a.The operation of the shortest path that above-described route convergent method obtains between network node 303c and network node 301a comprises the following steps:
Gather the network topological information of described map network.
Jumping network node 3021 to the network node 302b that can reach based on described network topological information Network Search node 303c mono-is first network node.
Do not comprise destination node in described first network node, searching based on described network topological information network node 3021 to the network node 302b that down hop in first network node can reach described destination node is second network node.
By the link of network node 3030c to network node 3021, network node 3021 is to the link of network node 301a, and network node 3030c is to the link of network node 302b, network node 302b to the link of network node 301a, respectively as the shortest path between network node 303c and network node 301a.
Present embodiment, the shortest path between acquisition network node 303c that can be rapid and simple and network node 301a.
Wherein, can respectively with network node 3021 to network node 302b for path starting point, network node 3031 to network node 303c, network node 302b that Network Search node 3021 to network node 302b down hop can reach, network node 3021, network node 3011 to network node 301a, then by traversal, select network node 301a, the first network node that down hop can reach network node 301a can be found.
Preferably shortest path is respectively network node 303c → network node 3021 → network node 301a, to network node 303c → network node 302b → network node 301a.
In other embodiments, can other nodes be source node and destination node in described map network, as: source node and destination node can be the network node of adjacent level shown in Fig. 2, and source node and destination node also can be the network node of same one-level.
For step S505, preferably, the link of each network node of described map network can be pre-stored in the described webserver.Described link information can comprise the IP address of the IP address of each network node, adjacent link, adjacent node.
Preferably, described complete trails routing table can be sent to the subnetwork node of described map network by the webserver, and then described in these network nodes, complete trails routing table is sent to remaining network node.
Preferably, can in (the network node additions and deletions of the described map network of configuration, and/or, network link additions and deletions, and/or network configuration changes) time, each network node finds neighbor information by network layer protocol, if the IP address of local port IP address and adjacent port and adjacent link, and be sent to the webserver.
Further, described link information can be as shown in table 1, wherein, the network node that B1, B2 identify the network node of the one-level of described map network respectively, C1, C2 identify the secondary of described map network respectively, T1, T2, T3, T4 identify the network node of three grades of described map network respectively, the network node of the direct-connected secondary of network node difference of one-level, the network node of direct-connected three grades of the network node difference of secondary:
Table 1:
| Link | IP address | IP address |
| B1-C1 | 1.1.1.2/30 | 1.1.1.1/30 |
| B1-C2 | …… | …… |
| B2-C1 | …… | …… |
| B2-C2 | …… | …… |
| C1-T1 | 1.1.1.10/30 | 1.1.1.11/30 |
| C1-T2 | …… | …… |
| C1-T3 | …… | …… |
| C1-T4 | …… | …… |
| …… | …… | …… |
In one embodiment, store the shortest path between each source node and each destination node at the link information of each network node of the corresponding described map network of the webserver, after generating the step of complete trails routing table, further comprising the steps of:
The network failure information that the network node that the webserver receives described map network sends.
The webserver is by each network node transmission to described map network of the network failure information of reception.
This enforcement, the webserver can link information between real-time collecting, the network topological information of monitoring and the described map network of maintenance and each network node.
Preferably, described network failure information comprises the information corresponding with the node failure of network node and/or network link failure.
In another embodiment, described link information can be as shown in table 1, when being respectively described destination node and described source node with two heterogeneous networks nodes any in B1, B2, C1, C2, T1, T2, T3, T4, by step S501 to S505, corresponding link information shown in table 1, shortest path between each destination node and each source node and the destination address gathered in advance, mask, outgoing interface, can obtain complete trails routing table as shown in table 2:
Table 2:
| Destination address | Mask | Outgoing interface | Down hop | Link 1 | Link 2 |
| 174.15.24.24 | 24 | GE1/0/1 | 1.1.1.11 | T1-C1 | C1-B1 |
| 174.15.24.24 | 24 | GE1/0/2 | …… | T1-C2 | C2-B1 |
| …… | …… | …… | …… | …… |
The complete trails routing table of the present embodiment comprises network node-to-network node routing information.
Wherein, the corresponding T1 of destination address 174.15.24.24, mask 24 and outgoing interface GE1/0/1 is node for the purpose of source node, B1, shortest path is T1 → C1 → B1.The corresponding T1 of destination address 174.15.24.24, mask 24 and outgoing interface GE1/0/2 is node for the purpose of source node, B1, shortest path is T1 → C2 → B2.
Preferably, the IP address of each network node is on the network node configurable.
In other embodiments, also can to the link information that described complete trails routing table is out of shape or described in additions and deletions, complete trails routing table comprises.
Refer to Fig. 4, Fig. 4 is the schematic flow sheet of route convergent method second execution mode of the present invention.
The described route convergent method of present embodiment is with the difference of the first execution mode: the link information of each network node of the corresponding described map network of the webserver stores the shortest path between each source node and each destination node, and the step generating complete trails routing table comprises the following steps:
Step S601, the webserver receives the routing iinformation of the external network that each network node sends.
Step S602, the webserver extracts destination address, mask, outgoing interface and next hop address from described routing iinformation.
Step S603, each source node destination address, mask, outgoing interface and next hop address that to the link of each second network node and each second network node to the link of described destination node, correspondence is extracted store by the webserver, generate described complete trails routing table.
Present embodiment, receives the routing information acquisition destination address of the external network that each network node sends, mask, outgoing interface and next hop address, generates described complete trails routing table.
Preferably, described external network is the network carrying out with described map network communicating, and described routing iinformation comprises the traditional routing information such as direct-connected route, static routing, OSPF, BGP.
In one embodiment, the step that each source node and the link information of each destination node and the shortest path between each source node and each destination node are converted to complete trails routing table comprises the following steps by the webserver:
From the routing iinformation of described external network, obtain the priority of each source node to the link of each second network node, and each second network node is to the priority of the link of described destination node.
Corresponding for the priority of acquisition each link is stored in described complete trails routing table.
Present embodiment, is increased to link priority in described complete trails routing table, is convenient to choose more excellent shortest path, can improve routing convergence efficiency further.
Refer to Fig. 5, Fig. 5 is the structural representation of routing convergence system first execution mode of the present invention.
The described routing convergence system of present embodiment can comprise the webserver, the described webserver can comprise acquisition module 210, first node searches module 220, Section Point searches module 230, module 240 is chosen in path and complete trails routing table generation module 250, wherein:
Acquisition module 210, for gathering the network topological information of map network.
First node searches module 220, for searching the first network node that source node down hop can reach based on described network topological information, wherein, respectively with any two network nodes of described map network for source node and destination node.
Section Point searches module 230, during for not comprising destination node in the first network node found, chooses based on described network topological information the second network node that down hop can reach described destination node from described first network node.
Module 240 is chosen in path, is shortest path between described source node and described destination node for choosing described source node to the link of each second network node and each second network node to the link of described destination node.
Complete trails routing table generation module 250, link information for each network node of the described map network of correspondence stores the shortest path between each source node and each destination node, generate complete trails routing table, and send to each network node of described map network, carry out routing convergence to make each network node by the described complete trails routing table of inquiry.
Routing convergence system described in present embodiment, the webserver searches based on described network topological information the first network node that source node down hop can reach, when not comprising destination node in the first network node found, from described first network node, the second network node that down hop can reach described destination node is chosen based on described network topological information, obtain the shortest path between described source node and described destination node, and then generate the complete trails routing table of the shortest path between any two network nodes comprising map network and send to network node, make network node without the need to calculating path, network convergence speed can be promoted, being convenient to the network architecture carries out extending transversely, it is few that acquisition shortest path takies resource, calculate simple and direct, network equipment maintenance difficulty can be reduced, centralized path planning is carried out based on complete trails routing table, network operation efficiency can be promoted, strengthening network-based control ability.
Wherein, for acquisition module 210, the webserver can be any one in the webserver 2010 shown in Fig. 2, the webserver 2020 to webserver 20d0.Described map network is preferably the network of Internet data center, can be secondary or three-level network framework, and the jumping figure of any two internodal shortest paths mostly is double bounce most.
Preferably, described network topological information comprises the annexation between each network node.Also can comprise node identification and the link identification of each network node.
In one embodiment, the neighbor information that each network node that acquisition module 210 also can be used for receiving described corresponding network is obtained by network layer protocol.According to the neighbor information received, the annexation between each network node obtaining described map network, generates described network topological information.
Preferably, each network node can be expanded by network enabled layer protocol (LLDP agreement), and carry the information such as port IP address by LLDP agreement, LLDP is sent to the webserver when receiving this information.
In other embodiments, also can in (the network node additions and deletions of the described map network of configuration, and/or, network link additions and deletions, and/or network configuration changes) time, the network topological information after configuration is stored into the webserver or corresponding network equipment, when needing to gather, the webserver self is transferred or from corresponding network device request.
Module 220 is searched for first node, respectively with each network node in described map network for source node, obtain the first network node of corresponding each network node.Preferably by described network topological information, using described source node as path starting point, searching the network node direct-connected with source node is described first network node.
Module 230 is searched for Section Point, node for the purpose of other network nodes any respectively in described map network except described source node, obtain first network node, the second network node of each source node corresponding and destination node.
Preferably, can described first network node be path starting point, searching the first network node direct-connected with destination node be described second network node.
In one embodiment, Section Point is searched module 230 and be can be used for:
The network node that each first network node down hop can reach is searched based on described network topological information.
Judge whether the network node found comprises described destination node.
If so, from the described network node found, then choose the network node that down hop can reach described destination node is described second network node.
In other embodiments, if destination node and source node are the network node of same stages, that can search that each first network node down hop can reach based on described network topological information is in the network node of same one-level with described destination node, and then judge whether the network node found comprises described destination node, if so, from the described network node found, then choose the network node that down hop can reach described destination node is described second network node.
Choose module 240 for path, preferably, the jumping figure of described shortest path mostly is double bounce most.
In one embodiment: as shown in Figure 2, described source node can be network node 303c to described map network, and described destination node can be network node 301a.The operation of the shortest path that above-described routing convergence system obtains between network node 303c and network node 301a comprises:
Gather the network topological information of described map network.
Jumping network node 3021 to the network node 302b that can reach based on described network topological information Network Search node 303c mono-is first network node.
Do not comprise destination node in described first network node, searching based on described network topological information network node 3021 to the network node 302b that down hop in first network node can reach described destination node is second network node.
By the link of network node 3030c to network node 3021, network node 3021 is to the link of network node 301a, and network node 3030c is to the link of network node 302b, network node 302b to the link of network node 301a, respectively as the shortest path between network node 303c and network node 301a.
Present embodiment, the shortest path between acquisition network node 303c that can be rapid and simple and network node 301a.
Wherein, can respectively with network node 3021 to network node 302b for path starting point, network node 3031 to network node 303c, network node 302b that Network Search node 3021 to network node 302b down hop can reach, network node 3021, network node 3011 to network node 301a, then by traversal, select network node 301a, the first network node that down hop can reach network node 301a can be found.
Preferably shortest path is respectively network node 303c → network node 3021 → network node 301a, to network node 303c → network node 302b → network node 301a.
In other embodiments, can other nodes be source node and destination node in described map network, as: source node and destination node can be the network node of adjacent level shown in Fig. 2, and source node and destination node also can be the network node of same one-level.
In another embodiment, path is chosen module 240 and is also used in the first network node found when comprising described destination node, and choosing described source node to the link of described destination node is shortest path between described source node and described destination node.
For complete trails routing table generation module 250, described link information can comprise the IP address of the IP address of each network node, adjacent link, adjacent node.
Preferably, can in (the network node additions and deletions of the described map network of configuration, and/or, network link additions and deletions, and/or network configuration changes) time, each network node finds neighbor information by network layer protocol, if the IP address of local port IP address and adjacent port and adjacent link, and be sent to the webserver.
Further, described link information can be as shown in table 1, wherein, the network node that B1, B2 identify the network node of the one-level of described map network respectively, C1, C2 identify the secondary of described map network respectively, T1, T2, T3, T4 identify the network node of three grades of described map network respectively, the network node of the direct-connected secondary of network node difference of one-level, the network node of direct-connected three grades of the network node difference of secondary:
In one embodiment, the webserver 2000 also can comprise failed transmission module, the network failure information that the network node for receiving described map network sends.By each network node transmission to described map network of the network failure information of reception.
This enforcement, the webserver can link information between real-time collecting, the network topological information of monitoring and the described map network of maintenance and each network node.
In other embodiments, also by the usual other technologies means of those skilled in the art by described network failure information transmission each network node to described map network.
In another embodiment, described link information can be as shown in table 1, when being respectively described destination node and described source node with two heterogeneous networks nodes any in B1, B2, C1, C2, T1, T2, T3, T4, by step S501 to S505, corresponding link information shown in table 1, shortest path between each destination node and each source node and the destination address gathered in advance, mask, outgoing interface, can obtain complete trails routing table as shown in table 2:
The complete trails routing table of the present embodiment comprises network node-to-network node routing information.
Wherein, the corresponding T1 of destination address 174.15.24.24, mask 24 and outgoing interface GE1/0/1 is node for the purpose of source node, B1, shortest path is T1 → C1 → B1.The corresponding T1 of destination address 174.15.24.24, mask 24 and outgoing interface GE1/0/2 is node for the purpose of source node, B1, shortest path is T1 → C2 → B2.
Preferably, the IP address of each network node is on the network node configurable.
In other embodiments, also can to the link information that described complete trails routing table is out of shape or described in additions and deletions, complete trails routing table comprises.
The following stated is routing convergence system second execution mode of the present invention.
The described routing convergence system of present embodiment and the difference of the first execution mode are: complete trails routing table generation module 250 also can be used for:
Receive the routing iinformation of the external network that each network node sends.
Destination address, mask, outgoing interface and next hop address is extracted from described routing iinformation.
Each source node correspondence is extracted to the link of each second network node and each second network node to the link of described destination node destination address, mask, outgoing interface and next hop address are stored, generates described complete trails routing table.
Present embodiment, receives the routing information acquisition destination address of the external network that each network node sends, mask, outgoing interface and next hop address, generates described complete trails routing table.
Preferably, described external network is the network carrying out with described map network communicating, and described routing iinformation comprises the traditional routing information such as direct-connected route, static routing, OSPF, BGP.
In one embodiment, complete trails routing table generation module 250 also can be further used for:
From the routing iinformation of described external network, obtain the priority of each source node to the link of each second network node, and each second network node is to the priority of the link of described destination node.
Corresponding for the priority of acquisition each link is stored in described complete trails routing table.
Present embodiment, is increased to link priority in described complete trails routing table, is convenient to choose more excellent shortest path, can improve routing convergence efficiency further.
Refer to Fig. 6, Fig. 6 is the schematic flow sheet of route convergent method of the present invention 3rd execution mode.
The described route convergent method of present embodiment preferably can be performed by the webserver and network node alternately, can comprise the following steps:
Step S801, the webserver gathers the network topological information of map network.
Step S802, the webserver searches based on described network topological information the first network node that source node down hop can reach, wherein, respectively with any two network nodes of described map network for source node and destination node.
Step S803, if do not comprise destination node in the first network node found, then the webserver chooses based on described network topological information the second network node that down hop can reach described destination node from described first network node.
Step S804, it is shortest path between described source node and described destination node to the link of each second network node and each second network node to the link of described destination node that the webserver chooses described source node.
Step S805, the link information of each network node of the corresponding described map network of the webserver stores the shortest path between each source node and each destination node, generates complete trails routing table, and sends to each network node of described map network.
Step S806, each network node receives and stores described complete trails routing table.
Step S807, when each network node receives the network failure information of described map network, each network node, by the faulty link corresponding to network failure information described in described complete trails routing table lookup, carries out routing convergence.
Route convergent method described in present embodiment, the webserver searches based on described network topological information the first network node that source node down hop can reach, when not comprising destination node in the first network node found, from described first network node, the second network node that down hop can reach described destination node is chosen based on described network topological information, obtain the shortest path between described source node and described destination node, and then generate the complete trails routing table of the shortest path between any two network nodes comprising map network and send to network node, make network node without the need to calculating path, when receiving the network failure information of described map network, by the faulty link corresponding to described complete trails routing table lookup network failure information, carry out routing convergence, network convergence speed can be promoted, being convenient to the network architecture carries out extending transversely, it is few that acquisition shortest path takies resource, calculate simple and direct, network equipment maintenance difficulty can be reduced, centralized path planning is carried out based on complete trails routing table, network operation efficiency can be promoted, strengthening network-based control ability.
Step S801 to step S805 is consistent to step S505 with the step S501 of above-described route convergent method.
For step S806, each network node support is based on the described complete trails routing table of shortest path.Routing iinformation corresponding for described complete trails routing table can be converted to traditional routing by each network node, is injected into OSPF route or BGP route.
For step S807, described network failure information can comprise network node failure information and/or the link failure information of described map network.Faulty link corresponding to described network failure information is preferably the link or the network node-to-network node link identical with faulty link that comprise failing network-node.
Preferably, inquire about the faulty link of corresponding described fault message in described complete trails routing table, get rid of the faulty link inquired, make routing decision according to described complete trails routing table and carry out routing convergence.
Preferably, network node, after the network node failure information receiving the described map network that the webserver sends and/or link failure information, is inquired about described complete trails routing table and is carried out routing convergence.
In one embodiment, described complete trails routing table is as shown in table 2, C1-B1 link failure, according to C1-B1 link failure by question blank 2, known destination address is 174.15.24.24/24, and outgoing interface is GE1/0/1 route break, chooses T1-C2, the shortest path of the destination address 174.15.24.24/24 that C2-B1 is, makes routing decision and carries out routing convergence.
In another embodiment, when arbitrary network node network layer protocol of described map network obtains adjacent network node fault and/or link failure, the corresponding network failure information of described arbitrary network node sends to the webserver.The each network node of described network failure information to described map network sends by the webserver.
In other embodiments, when arbitrary network node network layer protocol of described map network obtains adjacent network node fault and/or link failure, the usual other technologies means of those skilled in the art can also be passed through to the corresponding network failure information of each network node transmissions.
Refer to Fig. 7, Fig. 7 is the structural representation of routing convergence system the 3rd execution mode of the present invention.
The described routing convergence system of present embodiment preferably can comprise the webserver and network node, the described webserver can comprise acquisition module 310, first node searches module 320, Section Point searches module 330, module 340 is chosen in path and complete trails routing table production module 350, described network node can comprise memory module 360 and convergence module 370, wherein:
Acquisition module 310, for gathering the network topological information of map network.
First node searches module 320, for searching the first network node that source node down hop can reach based on described network topological information, wherein, respectively with any two network nodes of described map network for source node and destination node.
Section Point searches module 330, during for not comprising destination node in the first network node found, chooses based on described network topological information the second network node that down hop can reach described destination node from described first network node.
Module 340 is chosen in path, is shortest path between described source node and described destination node for choosing described source node to the link of each second network node and each second network node to the link of described destination node.
Complete trails routing table generation module 350, the link information for each network node of the described map network of correspondence stores the shortest path between each source node and each destination node, generates complete trails routing table, and sends to each network node of described map network.
Memory module 360, for receiving and storing described complete trails routing table.
Convergence module 370, for when receiving the network failure information of described map network, by the faulty link corresponding to network failure information described in described complete trails routing table lookup, carries out routing convergence.
Routing convergence system described in present embodiment, the webserver searches based on described network topological information the first network node that source node down hop can reach, when not comprising destination node in the first network node found, from described first network node, the second network node that down hop can reach described destination node is chosen based on described network topological information, obtain the shortest path between described source node and described destination node, and then generate the complete trails routing table of the shortest path between any two network nodes comprising map network and send to network node, make network node without the need to calculating path, when receiving the network failure information of described map network, by the faulty link corresponding to described complete trails routing table lookup network failure information, carry out routing convergence, network convergence speed can be promoted, being convenient to the network architecture carries out extending transversely, it is few that acquisition shortest path takies resource, calculate simple and direct, network equipment maintenance difficulty can be reduced, centralized path planning is carried out based on complete trails routing table, network operation efficiency can be promoted, strengthening network-based control ability.
Acquisition module 310 to complete trails routing table generation module 350 is consistent with above-described acquisition module 210 to complete trails routing table generation module 250.
For memory module 360, each network node support is based on the described complete trails routing table of shortest path.
For convergence module 370, after the network node failure information receiving the described map network that the webserver sends and/or link failure information, inquire about described complete trails routing table and carry out routing convergence.
In one embodiment, described complete trails routing table is as shown in table 2, C1-B1 link failure, convergence module 370 can be used for according to C1-B1 link failure by question blank 2, known destination address is 174.15.24.24/24, and outgoing interface is GE1/0/1 route break, chooses T1-C2, the shortest path of the destination address 174.15.24.24/24 that C2-B1 is, makes routing decision and carries out routing convergence.
In another embodiment, when arbitrary network node network layer protocol of described map network obtains adjacent network node fault and/or link failure, the corresponding network node failure information of described arbitrary network node and/or link failure information send to the webserver.The each network node of corresponding network failure information to described map network sends by the webserver.
In other embodiments, when arbitrary network node network layer protocol of described map network obtains adjacent network node fault and/or link failure, the usual other technologies means of those skilled in the art can also be passed through to the corresponding network link failure information of each network node transmissions.
The above embodiment only have expressed several execution mode of the present invention, and it describes comparatively concrete and detailed, but therefore can not be interpreted as the restriction to the scope of the claims of the present invention.It should be pointed out that for the person of ordinary skill of the art, without departing from the inventive concept of the premise, can also make some distortion and improvement, these all belong to protection scope of the present invention.Therefore, the protection range of patent of the present invention should be as the criterion with claims.
Claims (15)
1. a route convergent method, is characterized in that, comprises the following steps:
The webserver gathers the network topological information of map network;
The webserver searches based on described network topological information the first network node that source node down hop can reach, wherein, respectively with any two network nodes of described map network for source node and destination node;
If do not comprise destination node in the first network node found, then the webserver chooses based on described network topological information the second network node that down hop can reach described destination node from described first network node;
It is shortest path between described source node and described destination node to the link of the second network node respectively chosen and the second network node respectively chosen to the link of described destination node that the webserver chooses described source node;
The link information of each network node of the corresponding described map network of the webserver stores the shortest path between each source node and each destination node, generate complete trails routing table, and send to each network node of described map network, carry out routing convergence to make each network node by the described complete trails routing table of inquiry.
2. route convergent method according to claim 1, is characterized in that, the step that the described webserver gathers the network topological information of map network comprises the following steps:
The neighbor information that each network node that the webserver receives described corresponding network is obtained by network layer protocol;
The webserver is according to the neighbor information received, and the annexation between each network node obtaining described map network, generates described network topological information.
3. route convergent method according to claim 1, is characterized in that, after the webserver searches the step of the first network node that source node down hop can reach based on described network topological information, further comprising the steps of:
If the first network node found comprises described destination node, then the webserver chooses described source node to the link of described destination node is shortest path between described source node and described destination node.
4. route convergent method according to claim 1, is characterized in that, the webserver is chosen based on described network topological information the step that down hop can reach the second network node of described destination node and comprised the following steps from described first network node:
The network node that each first network node down hop can reach is searched based on described network topological information;
Judge whether the network node found comprises described destination node;
If so, from the described network node found, then choose the network node that down hop can reach described destination node is described second network node.
5. route convergent method according to claim 4, is characterized in that, after judging whether the network node found comprises the step of described destination node, further comprising the steps of:
If described in do not comprise described destination node in the network node that finds, then the network node found described in record is the second alternate node, continues to search based on described network topological information the network node that each second alternate node down hop can reach;
Judge whether the network node found comprises described destination node;
If so, from each second alternate node, the 3rd network node that down hop can reach described destination node is then chosen;
Choosing described destination node is shortest path between described source node and described destination node to the link of each 3rd network node, each 3rd network node to the link of each first network node and each first network node to the link of described source node.
6. route convergent method according to claim 1, it is characterized in that, the shortest path between each source node and each destination node is stored at the link information of each network node of the corresponding described map network of the webserver, after generating the step of complete trails routing table, further comprising the steps of:
The network failure information that the network node that the webserver receives described map network sends;
The webserver is by each network node transmission to described map network of the network failure information of reception.
7. route convergent method as claimed in any of claims 1 to 6, it is characterized in that, the link information of each network node of the corresponding described map network of the webserver stores the shortest path between each source node and each destination node, and the step generating complete trails routing table comprises the following steps:
The webserver receives the routing iinformation of the external network that each network node sends;
The webserver extracts destination address, mask, outgoing interface and next hop address from described routing iinformation;
Each source node destination address, mask, outgoing interface and next hop address that to the link of each second network node and each second network node to the link of described destination node, correspondence is extracted store by the webserver, generate described complete trails routing table.
8. route convergent method according to claim 7, it is characterized in that, the step that each source node and the link information of each destination node and the shortest path between each source node and each destination node are converted to complete trails routing table comprises the following steps by the webserver:
The webserver obtains the priority of each source node to the link of each second network node from the routing iinformation of described external network, and each second network node is to the priority of the link of described destination node;
Corresponding for the priority of acquisition each link is stored in described complete trails routing table by the webserver.
9. a routing convergence system, is characterized in that, comprises the webserver, and the described webserver comprises:
Acquisition module, for gathering the network topological information of map network;
First node searches module, for searching the first network node that source node down hop can reach based on described network topological information, wherein, respectively with any two network nodes of described map network for source node and destination node;
Section Point searches module, during for not comprising destination node in the first network node found, chooses based on described network topological information the second network node that down hop can reach described destination node from described first network node;
Module is chosen in path, is shortest path between described source node and described destination node for choosing described source node to the link of each second network node and each second network node to the link of described destination node;
Complete trails routing table generation module, link information for each network node of the described map network of correspondence stores the shortest path between each source node and each destination node, generate complete trails routing table, and send to each network node of described map network, carry out routing convergence to make each network node by the described complete trails routing table of inquiry.
10. routing convergence system according to claim 9, is characterized in that, the described webserver also comprises failed transmission module, the network failure information that the network node for receiving described map network sends; By each network node transmission to described map network of the network failure information of reception.
11. routing convergence systems according to claim 9 or 10, is characterized in that, described complete trails routing table generation module also for:
Receive the routing iinformation of the external network that each network node sends;
Destination address, mask, outgoing interface and next hop address is extracted from described routing iinformation;
Each source node correspondence is extracted to the link of each second network node and each second network node to the link of described destination node destination address, mask, outgoing interface and next hop address are stored, generates described complete trails routing table.
12. routing convergence systems according to claim 11, is characterized in that, described complete trails routing table generation module further also for:
From the routing iinformation of described external network, obtain the priority of each source node to the link of each second network node, and each second network node is to the priority of the link of described destination node;
Corresponding for the priority of acquisition each link is stored in described complete trails routing table.
13. 1 kinds of route convergent methods, is characterized in that, comprise the following steps:
The webserver gathers the network topological information of map network;
The webserver searches based on described network topological information the first network node that source node down hop can reach, wherein, respectively with any two network nodes of described map network for source node and destination node;
If do not comprise destination node in the first network node found, then the webserver chooses based on described network topological information the second network node that down hop can reach described destination node from described first network node;
It is shortest path between described source node and described destination node to the link of each second network node and each second network node to the link of described destination node that the webserver chooses described source node;
The link information of each network node of the corresponding described map network of the webserver stores the shortest path between each source node and each destination node, generates complete trails routing table, and sends to each network node of described map network;
Each network node receives and stores described complete trails routing table;
When each network node receives the network failure information of described map network, each network node, by the faulty link corresponding to network failure information described in described complete trails routing table lookup, carries out routing convergence.
14. route convergent methods according to claim 13, is characterized in that:
When arbitrary network node of described map network is when obtaining adjacent network node fault and/or link failure, the corresponding network failure information of described arbitrary network node sends to the webserver;
The each network node of described network failure information to described map network sends by the webserver.
15. 1 kinds of routing convergence systems, is characterized in that, comprise the webserver and network node, and the described webserver comprises:
Acquisition module, for gathering the network topological information of map network;
First node searches module, for searching the first network node that source node down hop can reach based on described network topological information, wherein, respectively with any two network nodes of described map network for source node and destination node;
Section Point searches module, during for not comprising destination node in the first network node found, chooses based on described network topological information the second network node that down hop can reach described destination node from described first network node;
Module is chosen in path, is shortest path between described source node and described destination node for choosing described source node to the link of each second network node and each second network node to the link of described destination node;
Complete trails routing table generation module, the link information for each network node of the described map network of correspondence stores the shortest path between each source node and each destination node, generates complete trails routing table, and sends to each network node of described map network;
Described network node comprises:
Memory module, for receiving and storing described complete trails routing table;
Convergence module, for when receiving the network failure information of described map network, by the faulty link corresponding to network failure information described in described complete trails routing table lookup, carries out routing convergence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410483947.2A CN104283789B (en) | 2014-09-19 | 2014-09-19 | Route convergent method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410483947.2A CN104283789B (en) | 2014-09-19 | 2014-09-19 | Route convergent method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104283789A CN104283789A (en) | 2015-01-14 |
| CN104283789B true CN104283789B (en) | 2016-04-13 |
Family
ID=52258286
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410483947.2A Active CN104283789B (en) | 2014-09-19 | 2014-09-19 | Route convergent method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104283789B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106161237B (en) * | 2015-04-17 | 2020-08-18 | 富士通株式会社 | Centralized routing method, device and system |
| CN104967563B (en) * | 2015-07-24 | 2017-10-20 | 北京智芯微电子科技有限公司 | A kind of proactive by method and device |
| CN105933252A (en) * | 2016-04-01 | 2016-09-07 | 浪潮电子信息产业股份有限公司 | Switch communication method and system and switch |
| CN107306224B (en) * | 2016-04-19 | 2020-08-14 | 华为技术有限公司 | Routing path updating method, network management device and routing equipment |
| CN106100961A (en) * | 2016-07-21 | 2016-11-09 | 广州高能计算机科技有限公司 | A kind of Direct Connect Architecture computing cluster system based on infinite bandwidth and construction method |
| CN108270677A (en) * | 2016-12-30 | 2018-07-10 | 中国移动通信集团浙江有限公司 | A kind of fast route convergence method and device |
| CN108574594B (en) | 2017-03-14 | 2020-04-03 | 华为技术有限公司 | Method and system for transmitting network service |
| CN108111423B (en) * | 2017-12-28 | 2020-11-17 | 迈普通信技术股份有限公司 | Traffic transmission management method and device and network shunting equipment |
| CN109088765B (en) * | 2018-08-15 | 2021-10-29 | 无锡江南计算技术研究所 | Interconnection network routing fault diagnosis method and device |
| CN111385194B (en) * | 2018-12-29 | 2021-02-26 | 华为技术有限公司 | Method for converging network path and related equipment |
| CN112333098B (en) * | 2020-10-29 | 2022-11-25 | 杭州迪普科技股份有限公司 | Message forwarding method and device between service board cards |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101521895A (en) * | 2009-04-03 | 2009-09-02 | 南京邮电大学 | Forwarding method used for constructing multi-hop routing in wireless self-organizing network |
| CN101667972A (en) * | 2009-10-19 | 2010-03-10 | 国网信息通信有限公司 | Power communication network service routing method and device |
| CN102780607A (en) * | 2012-04-19 | 2012-11-14 | 中兴通讯股份有限公司 | Method and device for dynamically configuring Ethernet service channel |
| CN103001875A (en) * | 2013-01-07 | 2013-03-27 | 山东量子科学技术研究院有限公司 | Quantum cryptography network dynamic routing method |
-
2014
- 2014-09-19 CN CN201410483947.2A patent/CN104283789B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101521895A (en) * | 2009-04-03 | 2009-09-02 | 南京邮电大学 | Forwarding method used for constructing multi-hop routing in wireless self-organizing network |
| CN101667972A (en) * | 2009-10-19 | 2010-03-10 | 国网信息通信有限公司 | Power communication network service routing method and device |
| CN102780607A (en) * | 2012-04-19 | 2012-11-14 | 中兴通讯股份有限公司 | Method and device for dynamically configuring Ethernet service channel |
| CN103001875A (en) * | 2013-01-07 | 2013-03-27 | 山东量子科学技术研究院有限公司 | Quantum cryptography network dynamic routing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104283789A (en) | 2015-01-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104283789B (en) | Route convergent method and system | |
| CN101455030B (en) | Dynamic shared risk node group (srng) membership discovery | |
| EP3244574B1 (en) | Alternate down paths for directed acyclic graph (dag) routing | |
| CN103281247B (en) | The general method for routing of a kind of data center network and system | |
| CN102368727B (en) | Crossed IP network TRILL network communication method, system thereof and devices | |
| CN106131919B (en) | A kind of synchronous method of non-stop layer self-organized network topology | |
| CN106375231A (en) | Flow switching method, device and system | |
| CN101834794B (en) | Method and device for forwarding message through backbone network | |
| CN105591937B (en) | A kind of acquisition method and equipment of network topological information | |
| CN102377680B (en) | Route convergence method and device | |
| CN104518967A (en) | Routing method, equipment and system | |
| US10320653B2 (en) | Route topology discovery in data networks | |
| CN102158407A (en) | Address resolution protocol (ARP) table entry configuration method and device | |
| CN101355486A (en) | Method, equipment and system for switching route | |
| WO2017084448A1 (en) | Network system and network operating method | |
| CN103023773A (en) | Method, device and system for forwarding message in multi-topology network | |
| CN102946349A (en) | OSPF (open shortest path first) protocol-based Ethernet E-Line service link discovery method and device | |
| CN101977156A (en) | Method, device and routing equipment for learning maximum transmission unit | |
| CN103023775A (en) | Router in OSPF (open shortest path first) network and processing method thereof | |
| CN105282041A (en) | Method and device of flooding on the basis of ISIS (intermediate system to intermediate system) | |
| CN103220217B (en) | A kind of route generating method and equipment | |
| CN104937878A (en) | Method to setup protocol independent multicast trees in the presence of unidirectional tunnels | |
| US8750166B2 (en) | Route topology discovery in data networks | |
| CN105591806B (en) | A kind of link switch-over method and device | |
| CN103200108B (en) | A kind of prime number route network generation method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |