CN101562577A - Router, routing next-hop-information offline computing method and device thereof - Google Patents

Router, routing next-hop-information offline computing method and device thereof Download PDF

Info

Publication number
CN101562577A
CN101562577A CNA200910146653XA CN200910146653A CN101562577A CN 101562577 A CN101562577 A CN 101562577A CN A200910146653X A CNA200910146653X A CN A200910146653XA CN 200910146653 A CN200910146653 A CN 200910146653A CN 101562577 A CN101562577 A CN 101562577A
Authority
CN
China
Prior art keywords
router
data message
state data
link state
length
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.)
Pending
Application number
CNA200910146653XA
Other languages
Chinese (zh)
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies 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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CNA200910146653XA priority Critical patent/CN101562577A/en
Publication of CN101562577A publication Critical patent/CN101562577A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The embodiment of the invention provides a router, a routing next-hop-information offline computing method and a device thereof. The routing next-hop-information offline computing method comprises the following steps: the data information about link state of a plurality of routers in a network is obtained; the type-length-value field of the data information about the link state comprises the IP addresses of the local interfaces of the routers and the IP addresses of the opposite end interface of neighboring routers connected with the local interfaces; and offline computing is conducted on the next-hop-information of the routers according to the state data information of a plurality of links. The method can obtain the IP addresses of the opposite end neighbors from an LSP when off-line, thereby being capable of competing the next-hop-address of the routers, solving the problem that the next-hop-information of the routers can not be competed when offline computing is conducted and being capable of obtaining concrete link connection information of links between two ISIS systems from the LSP simultaneously so as to bring convenience to the visual operation and maintenance of an IP.

Description

Router, route next jump hop-information offline computing and device
Technical field
The present invention relates to network communications technology field, particularly router, route next jump hop-information offline computing and device.
Background technology
At present, ISIS (Intermediate System to Intermediate System, intermediate system to intermediate syst) needs to support the calculated off-line route.DT (Dumb Terminal, the dumb terminal) is a network management device that is independent of outside the network topology, during calculated off-line, DT collects (the Link State Packets of the LSP based on ISIS of all-router in the network, the Link State data message) to constitute LSDB (LinkState Database, LSD), and this LSDB being stored in this locality, is that root node calculates route with each ISIS system respectively then.Article one, complete routing iinformation comprises prefix, subnet mask, next hop address, outgoing interface.At last, DT is the route of calculating, and directly imports in the network in the corresponding ISIS system, is used to instruct local IP message forwarding.
When non-calculated off-line, each ISIS system can go out to put in order the topology information of net and the routing iinformation of each router issue according to the LSDB information calculations of whole net.In the prior art, LSP comprises LSP heading and TLV (Type Length Value, type-length-value) field.Fig. 1 is the data structure schematic diagram of the LSP heading of prior art.As shown in Figure 1, the LSP heading comes LSP of unique identification by LSP ID (Link StatePackets Identifier, Link State data message identifier).LSP ID comprises Sys ID (System Identifier, system identifier), PSN ID (Pseudonode Identifier, dummy node identifier) and LSP Num (LSP Number, LSP numbering).In the TLV of LSP field, type is 2 NBR (Neighbors, form the neighbours of syntople) the TLV field description Sys ID (the System Identifier of adjacent neighbors router, system identifier) and Cost (link overhead value), but do not describe neighbours' IP address information, can't calculate the next hop information of route according to the content of its LSP.When non-calculated off-line, next hop information is that the neighbor information (neighbours' IP address informations) by this locality obtains.
And when calculated off-line, DT can only collect the LSDB information of whole net, do not collect the local neighbor information of each ISIS system, therefore can only calculate the topology information of whole net and the routing iinformation of each router issue, but can't calculate the next hop information of route according to LSDB information.
The IP visualized O﹠M is defined as: the running status of the control plane of IP network and datum plane is presented as much as possible, particularly present in patterned mode, standby maintenance personnel control network and orientation problem.The key-course surface information comprises: agreement neighbor information, routing iinformation, LDP LSP, TE LSP information.Data plane information comprises: IP forward-path Congestion Level SPCC, MPLS transmit Congestion Level SPCC on certain link.
At present in the IP visualized O﹠M, because the TLV of the NBR among the ISIS LSP has only described between two ISIS systems link is arranged, but the concrete link information between two ISIS systems can't be described, webmastering software can only describe according to the TLV of NBR and have link between the ISIS system, by which bar link links between the ISIS system but can not describe particularly.
Below describe the situation of prior art for example in detail: see also Fig. 2, Fig. 2 is the data structure diagram of No. 2 TLV of prior art.As shown in Figure 2, the Cost-Style of No. 2 TLV of prior art (link overhead type) is Narrow (arrowband) pattern, and these No. 2 TLV comprise TLV head and plurality of sub TLV.The TLV head represents that with Virtual Flag the virtual flag of Virtual Flag is a boolean logic values, and its length is 1 byte, if it equals 1, this represents that this link is real layer 2 path, to repair an area dividing.(layer 1 intermediate system will be always reported this field from 0 to all neighbours).
Each sub-TLV among aforementioned a plurality of sub-TLV includes: Default Metric (default metric), Delay Metric (delay metric), Expense Metric (cost metric), Error Metric (error metrics) and Neighbor ID (neighbor-id).
Default Metric (default metric) is a default value that is used for linking to the neighbours of tabulation, and its length is 1 byte.The 8th of this field is reserved, the 7th (being labeled as I/E) expression metric type of this field, and will comprise value " 0 ", to represent an inner tolerance.
Delay Metric (delay metric) is a length of delay that is used for being linked to the neighbours of tabulation, and its length is 1 byte.If this intermediate system is not supported this value, it will be provided with " S " position is 1 (the 8th of this field is marked as S), is not supported to represent this tolerance.The 7th (being labeled as I/E) expression metric type of this field, and will comprise value " 0 ", to represent an inner tolerance.
Expense Metric (cost metric) is an overhead value that is used for linking to the neighbours of tabulation, and its length is 1 byte.This intermediate system is not supported this value in this way, and it will be provided with " S " position is 1, is not supported to represent this tolerance.The 7th (being labeled as I/E) expression metric type of this field, and will comprise value " 0 ", to represent an inner tolerance.
Error Metric (error metrics) is an error amount that links to the neighbours in the tabulation, and its length is 1 byte.If this intermediate system is not supported this value, it will be provided with " S " position is 1, is not supported to represent this tolerance.The 7th (being labeled as I/E) expression metric type of this field, and will comprise value " 0 ", to represent an inner tolerance.
Neighbor ID (neighbor-id) is used for neighbours of unique identification intermediate system, the system identifier (system ID) that first ID identifier length field is neighbours, and last field is 0.For the dummy node neighbours, first ID identifier length field is layer 2 local area network (LAN) DIS (DesignatedIntermediate System, designated intermediate system) system identifier, and last field is a non-zero values by 2 layers of local area network (LAN) designated intermediate system definition.Neighbor?ID=Sys?ID+PSNID+LSP?Num。Wherein, LSP Num length is 1 byte, and the length of each sub-TLV is that the length of NeighborID adds 5 bytes.
The inventor finds in realizing process of the present invention, prior art has the following disadvantages: that the Cost-Style of prior art uses when being the Narrow pattern is No. 2 TLV, the Neighbor ID of this TLV and Default Metric have described the Sys ID and the link Cost value of adjacent neighbors router respectively, but, this TLV does not describe the field of the IP address information of neighbor router, the IP address information to end interface of neighbor router is not promptly described, therefore during calculated off-line, TLV calculated off-line outlet that can't be by prior art by next hop information, concrete link link information between the router also can't be described, therefore when the visual operation maintenance of IP, can't obtain the concrete link annexation between the ISIS system.
Summary of the invention
The embodiment of the invention provides a kind of Link State data message dissemination method, router and route next jump hop-information offline computing and device of router.The router of the embodiment of the invention a kind ofly carries local interface IP address and to the Link State data message of end interface IP address by generating, and sends it to neighboring router or whole net; The new Link State data message that the calculated off-line device of the route next jump information of the embodiment of the invention sends by the router that obtains the embodiment of the invention and reality are to the calculated off-line of route next hop information.
On the one hand, the embodiment of the invention provides a kind of Link State data message dissemination method of router, described method comprises: generate the Link State data message of router, the type-length-value field of described Link State data message comprises the IP address of local interface of described router and the IP address to end interface that connects the neighbor router of described local interface; Send described Link State data message.
On the other hand, the embodiment of the invention provides a kind of router, described router comprises: Link State data message generation unit, be used to generate the Link State data message of described router, the type-length-value field of described Link State data message comprises the IP address of local interface of described router and the IP address to end interface that connects the neighbor router of described local interface; Link State data message transmitting element is used to send described Link State data message.
Also on the one hand, the embodiment of the invention provides a kind of route next jump hop-information offline computing, described method comprises: obtain the Link State data message of router in the network, the type-length-value field of described Link State data message comprises the IP address of local interface of described router and the IP address to end interface that connects the neighbor router of described local interface; According to described Link State data message, the next hop information of the described router of calculated off-line.
Again on the one hand, the embodiment of the invention provides a kind of calculated off-line device of route next jump information, described device comprises: Link State data message acquiring unit, be used for obtaining the Link State data message of network router, the type-length-value field of described Link State data message comprises the IP address of local interface of described router and the IP address to end interface that connects the neighbor router of described local interface; The next hop information computing unit is used for according to described Link State data message, the next hop information of the described router of calculated off-line.
Another aspect, the embodiment of the invention provide a kind of network management device, and described network management device comprises the calculated off-line device of a kind of route next jump information of the embodiment of the invention.
The useful technique effect of the embodiment of the invention is: since the router of the embodiment of the invention to the type-length-value field configuration of its Link State data message the local interface IP address of this router and neighbor router to end interface IP address, and this information sent to neighboring router or whole net, so the calculated off-line device of the route next jump information of the embodiment of the invention can obtain the Link State data message that a plurality of routers send in the whole net by monitoring, thereby can calculated off-line go out to put in order the route next jump information of each router in the net, when having solved calculated off-line, can't calculate the problem of route next jump information, especially in the IP visualized O﹠M, according to the aforementioned calculation result, can know the concrete link annexation of learning particularly based between a plurality of routers of intermediate system to intermediate syst, give visual providing convenience property of operation maintenance and the intuitive of IP.
Description of drawings
Fig. 1 is the data structure schematic diagram of the LSP heading of prior art;
Fig. 2 is the data structure schematic diagram of No. 2 TLV of prior art;
Fig. 3 is the flow chart of Link State data message dissemination method of the router of the embodiment of the invention;
Fig. 4 is the functional block diagram of a kind of router of the embodiment of the invention;
Fig. 5 is the flow chart of a kind of route next jump hop-information offline computing of the embodiment of the invention;
Fig. 6 is the functional block diagram of calculated off-line device of a kind of route next jump information of the embodiment of the invention;
Fig. 7 is the data structure schematic diagram of the TLV of the embodiment of the invention;
Fig. 8 is the schematic diagram of next jumping routing iinformation of calculated off-line of the embodiment of the invention 2;
Fig. 9 is the effect schematic diagram of the IP visualized O﹠M of prior art;
Figure 10 is the effect schematic diagram of the IP visualized O﹠M of the embodiment of the invention.
Embodiment
For above-mentioned feature and advantage of the present invention can be become apparent, a plurality of embodiment cited below particularly, and conjunction with figs. is described in detail below.
Embodiment 1:
The embodiment of the invention provides a kind of dissemination method of Link State data message of router, by this dissemination method, can issue the novel Link State data message of this router to adjacent or all-router.
See also Fig. 3, Fig. 3 is the flow chart of Link State data message dissemination method of the router of the embodiment of the invention.As shown in Figure 3, this dissemination method comprises the steps:
Step S301, generate the Link State data message of router, the type-length-value field of described Link State data message comprises the IP address of local interface of described router and the IP address to end interface that connects the neighbor router of described local interface;
Alternatively, the type-length-value field of described Link State data message also comprise described router neighbor router sign and arrive the link overhead value of described neighbor router;
Alternatively, the type-length-value field of described Link State data message comprises a plurality of subtype-length-value field, each subtype-length-value field comprise the IP address of the local interface of described router, the neighbor router that is connected with described local interface to the sign of the neighbor router of the IP address of end interface, described router and described router link overhead value to neighbor router;
Step S302, the described Link State data message of transmission.
Alternatively, step S302 can be for sending described Link State data message to neighboring router, or send described Link State data message with broadcast mode.
The beneficial effect of the embodiment of the invention 1 is: comprise the local interface IP address of router and the IP address to end interface of the neighbor router that is connected with this local interface in the type-length value field of the Link State data message that dissemination method generated of the Link State data message of the router of the embodiment of the invention 1, so when calculated off-line, help that dumb terminal or other network management device obtain this novel link-state information and the next hop address that calculates each router, also help simultaneously the concrete link annexation between dumb terminal or each router of Network Management Equipment detail knowledge, this just provides convenience for the visual operation maintenance of IP network.
Embodiment 2:
The embodiment of the invention provides a kind of router, and this router can generate a kind of data message that carries the detailed link annexation that can describe this router and neighbor router, and this data message is sent to neighbor router or whole net.
See also Fig. 4, Fig. 4 is the functional block diagram of a kind of router of the embodiment of the invention.As shown in Figure 4, the router four 00 of the embodiment of the invention 1 is a kind of router based on intermediate system to intermediate syst, and it comprises:
Link State data message generation unit 401, be used to generate the Link State data message LSP of described router, its type-length-value TLV field comprise the local interface IP address of described router and described router neighbor router to end interface IP address;
Alternatively, the type-length-value TLV field of described Link State data message LSP can also comprise the neighbor router sign Neighbor ID of described router and arrive the link overhead value Cost of described neighbor router from described router;
Alternatively, the type-length-value TLV field of described Link State data message LSP can also comprise a plurality of subtype-length-value (Sub-TLV) field, wherein each subtype-length-value (Sub-TLV) field comprise the local interface IP address of described router, the neighbor router that is connected with described local interface the neighbor router sign to end interface IP address, described router, arrive the link overhead value of described neighbor router;
Link State data message transmitting element 402 is used to send described Link State data message LSP.Alternatively, Link State data message transmitting element 402 can send described Link State data message LSP to neighboring router, or sends described Link State data message LSP with broadcast mode.
Fig. 7 is the data structure schematic diagram of TLV field of the LSP of the embodiment of the invention.As shown in Figure 7, the TLV of the embodiment of the invention is used to represent router (hereinafter to be referred as the ISIS router) based on the ISIS agreement and the concrete link link information between its neighbor router.In the present embodiment, the Cost-Style of this TLV (expense type) is Narrow (arrowband).This TLV comprises a plurality of sub-TLV, and wherein each sub-TLV includes: IPv4interface address (local interface IP address), be used to represent the IPv4 address of the local interface that links to each other with neighbours, and its length is 4 bytes; IPv4neighbor address (neighbours IP address), the IPv4 address to end interface of the neighbor router that expression is connected with local interface, its length is 4 bytes; Default Metric (default metric) is used to represent the link overhead value Cost from current I SIS router to neighbours ISIS router, and its length is 1 byte; Neighbor ID (neighbor router sign), be used for a neighbours ISIS of unique identification router, the value of Neighbor ID equals the system identifier Sys ID+ dummy node identifier PSN ID of neighbours ISIS router, the length of Neighbor ID is the length sum of Sys ID and PSN ID, the length of Sys ID is a variable value, and the length of PSN ID is generally 1 byte, and the length of Sys ID is 6 bytes in the present embodiment, and the length of PSN ID is 1 byte.As shown in Figure 7, the length of each sub-TLV is ID length+10 bytes, and wherein ID refers to the system identifier Sys ID of neighbours ISIS router, and in the present embodiment, this TLV field length is 255 bytes, therefore, can hold a plurality of sub-TLV.
The router of the embodiment of the invention 1 can generate a kind of can describe in detail ISIS router and neighbours ISIS router the novel LSP of concrete link annexation, thereby, also provide information support more easily for concrete topological state or the visual maintaining network of describing network for the next hop information of calculated off-line ISIS router provides possibility.
Embodiment 3:
The embodiment of the invention 3 provides a kind of offline computing method of next hop information of ISIS route.By the method for the embodiment of the invention 3, dumb terminal or Network Management Equipment can calculated off-line go out the next hop address of each ISIS router of ISIS system, thereby can implement visual operation maintenance to IP network, for the maintenance of IP network is provided convenience.
See also Fig. 5, Fig. 5 is the flow chart of offline computing method of a kind of next hop information of the embodiment of the invention 3.As shown in Figure 5, the method for the embodiment of the invention 3 comprises the steps:
Step S501, obtain the Link State data message of router in the network, the type-length-value field of described Link State data message comprises the IP address of local interface of described router and the IP address to end interface that connects the neighbor router of described local interface;
Alternatively, the type-length-value field of described Link State data message can also comprise that the neighbor router of described router identifies and arrive from described router the link overhead value of neighbor router;
Alternatively, the type-length-value field of described Link State data message comprises a plurality of subtype-length-value field, and wherein each subtype-length-value field comprises the neighbor-id to end interface IP address, described router of the neighbor router of the local interface IP address of described router, described router, the described router link overhead value to neighbor router;
Step S502, according to described Link State data message, the next hop information of the described router of calculated off-line;
Alternatively, can utilize SPF (Shortest Path First, SPF) algorithm computation to go out the SPF tree by the NBR TLV information among the LSP, and then the next hop information of each router in can the calculated off-line network.The SPF algorithm is well known to those skilled in the art, do not give unnecessary details at this, this mainly illustrate the method for the embodiment of the invention be how to obtain calculated off-line next jump route necessary next jump out interface message.
See also Fig. 8, Fig. 8 is the schematic diagram of next jumping routing iinformation of calculated off-line of the embodiment of the invention 2.When need be, can adopt the non-offline computing method of prior art and the offline computing method of the embodiment of the invention from the schematic diagram of the angle calculation SPF of router-A tree.What pay particular attention to is that the non-offline computing method of prior art can't adapt to the demand of calculated off-line.
As shown in Figure 8, because router B and C are the neighbours of router-A, and router D, E, F or G are not the neighbours of A.Non-neighbours' next hop information is inherited neighbours' next hop information, and promptly non-one jumps the router that can arrive need inherit a next hop information of jumping the router that can reach.So router D and E inherit the next hop information of router B; Router F and G inherit the next hop information of router C.Above-mentioned next hop information comprises outgoing interface and next-hop address information.
During non-calculated off-line, the outgoing interface information the next hop information from router-A to router B is to obtain from the interface that router-A and router B set up neighbours, and for example router-A and router B set up neighborhood by E0, and then outgoing interface is exactly E0.The next-hop address information of router-A in the next hop information of router B, be exactly the interface IP address 1.1.1.0/24 that router B and router-A are set up neighbours, router-A is the IP address that obtains the interface of router B by the hello packet of router B, and be kept in the neighbor information, from the IP address that the neighbor information of router B comprises, obtain next-hop address information when calculating next hop address.
And during calculated off-line, outgoing interface information the next hop information from router-A to router B, the IPv4interface address (the IPv4 address of the local interface that links to each other with neighbours) that can be comprised from the TLV field of the LSP of the embodiment of the invention 2 obtains, issue calculated off-line when transmitting, on router-A, need to find concrete interface as outgoing interface by the IP address.The next-hop address information of router-A in the next hop information of router B, the IPv4neighbor address (neighbours are to the IPv4 address of end interface) that is comprised in the TLV field of the LSP by the embodiment of the invention 2 obtains.
The useful technique effect of the embodiment of the invention 3 is: when the offline computing method of the embodiment of the invention 3 has solved present ISIS calculated off-line, can't calculate the problem of the next hop information of route.Use this method, can from the LSP that the ISIS router sends, obtain the concrete link linking relationship between this router and its neighbor router, it for example is which incoming interface that is connected to neighbor router from which outgoing interface of this router, also can obtain simultaneously the concrete next hop information of the neighbor router of this router, thereby the off-line route that can realize whole net is calculated, these just for the IP visualized O﹠M provide may with facility.
Embodiment 4:
The embodiment of the invention 4 provides a kind of next hop information calculation element of ISIS route.
See also Fig. 6, Fig. 6 is the functional block diagram of calculated off-line device of a kind of route next jump information of the embodiment of the invention.As shown in Figure 6, this device comprises:
Link State data message acquiring unit 601, be used for obtaining the Link State data message of network router, the type-length-value field of described Link State data message comprises the IP address of local interface of described router and the IP address to end interface that connects the neighbor router of described local interface;
Alternatively, the type-length-value field of described Link State data message can also comprise that the neighbor router of described router identifies and arrive from described router the link overhead value of neighbor router;
Alternatively, the type-length-value field of described Link State data message comprises a plurality of subtype-length-value field, each subtype-length-value field comprise the IP address of the local interface of described router, the neighbor router that is connected with described local interface to the neighbor router sign of the IP address of end interface, described router and described router link overhead value to neighbor router;
Next hop information computing unit 602 is used for according to described Link State data message, the next hop information of the described router of calculated off-line.
The beneficial technical effects of the embodiment of the invention 4 is: at present during the ISIS calculated off-line, can't calculate route next jump information, use the device of the embodiment of the invention 4, can from LSP, obtain opposite end neighbours' next hop information, thereby calculate the next hop address of route, when having solved calculated off-line, can't calculate the problem of route next jump information.
In the IP visualized O﹠M, concrete link information between two ISIS systems can not be described out.Use the device of the embodiment of the invention 4, can from LSP, acquire the specifying information of link, specifically link, strengthened maintainability by any bar link to describe out between two ISIS.
Embodiment 5:
The embodiment of the invention 2 provides a kind of IP network management equipment, this network equipment is independent of outside the network topology, and the novel Link State data message that the router of all present embodiments sends in the monitoring ISIS system, be collected in local the preservation then, to calculate the routing iinformation of entire I SIS system when the off-line.
Please consult Fig. 6 once more, the Network Management Equipment of the embodiment of the invention 5 comprises the calculated off-line device of a kind of route next jump information of the embodiment of the invention 4.Described device describes in detail in embodiment 4, does not therefore give unnecessary details at this.
In order to further specify the remarkable result of the embodiment of the invention, please in conjunction with consulting Fig. 9 and Figure 10.Fig. 9 is the effect schematic diagram of the IP visualized O﹠M of prior art; Figure 10 is the effect schematic diagram of the IP visualized O﹠M of the embodiment of the invention.As shown in Figure 9, in the IP of prior art visualized O﹠M, administrative staff can only see between 4 routers link, but can not be clear and definite know links to each other by which bar link.
Figure 10 is consulted in contrast, the design sketch that has shown the IP visualized O﹠M that generates behind the novel TLV that comprises among the novel Link State data message LSP of a kind of IP network management equipment of the embodiment of the invention according to each router transmission that listens among Figure 10, Figure 10 has shown concrete link situation between 4 routes very intuitively, is providing convenience property of IP visualized O﹠M and intuitive.
The useful technique effect of the embodiment of the invention 5 is: the LSP to the IP address of end interface that comprises local interface IP address and neighbor router of the ISIS router of the Network Management Equipment of the embodiment of the invention 5 by obtaining the embodiment of the invention 2, thereby can be when off-line, calculate the next hop address of each ISIS router of ISIS system, like this, in the process of the visual operation maintenance of IP network, can describe concrete link annexation between any two ISIS routers in detail according to the entrained information of the TLV of the novel LSP that Network Management Equipment obtained, for the visualized O﹠M of IP provides convenient and intuitive means.
Though the present invention discloses as above with preferred embodiment; right its is not in order to limit the present invention; those skilled in the art of the present invention; without departing from the spirit and scope of the present invention; when can doing a little change and retouching, so protection scope of the present invention attached claims scope before looking defines and is as the criterion.

Claims (15)

1, a kind of Link State data message dissemination method of router is characterized in that described method comprises:
Generate the Link State data message of router, the type-length-value field of described Link State data message comprises the IP address of local interface of described router and the IP address to end interface that connects the neighbor router of described local interface;
Send described Link State data message.
2, method according to claim 1 is characterized in that, sends described Link State data message and comprises:
Send described Link State data message to neighboring router, or send described Link State data message with broadcast mode.
3, method according to claim 1 is characterized in that:
The type-length-value field of described Link State data message also comprise described router neighbor router sign and arrive the link overhead value of described neighbor router.
4, method according to claim 1 is characterized in that:
The type-length-value field of described Link State data message comprises a plurality of subtype-length-value field, each subtype-length-value field comprise the IP address of the local interface of described router, the neighbor router that is connected with described local interface to the sign of the neighbor router of the IP address of end interface, described router and described router link overhead value to neighbor router.
5, a kind of router is characterized in that, described router comprises:
Link State data message generation unit, be used to generate the Link State data message of described router, the type-length-value field of described Link State data message comprises the IP address of local interface of described router and the IP address to end interface that connects the neighbor router of described local interface;
Link State data message transmitting element is used to send described Link State data message.
6, router according to claim 5 is characterized in that:
Described Link State data message transmitting element is used for sending described Link State data message to neighboring router, or is used for sending described Link State data message with broadcast mode.
7, router according to claim 5 is characterized in that:
The type-length-value field of described Link State data message also comprise described router neighbor router sign and arrive the link overhead value of described neighbor router.
8, router according to claim 5 is characterized in that:
The type-length-value field of described Link State data message comprises a plurality of subtype-length-value field, each subtype-length-value field comprise the IP address of the local interface of described router, the neighbor router that is connected with described local interface to the sign of the neighbor router of the IP address of end interface, described router and described router link overhead value to neighbor router.
9, a kind of route next jump hop-information offline computing is characterized in that, described method comprises:
Obtain the Link State data message of router in the network, the type-length-value field of described Link State data message comprises the IP address of local interface of described router and the IP address to end interface that connects the neighbor router of described local interface;
According to described Link State data message, the next hop information of the described router of calculated off-line.
10, offline computing method according to claim 9 is characterized in that:
The type-length-value field of described Link State data message also comprise described router neighbor router sign and arrive the link overhead value of described neighbor router.
11, offline computing method according to claim 9 is characterized in that:
The type-length-value field of described Link State data message comprises a plurality of subtype-length-value field, wherein each subtype-length-value field comprise the IP address of the local interface of described router, the neighbor router that is connected with described local interface to the sign of the neighbor router of the IP address of end interface, described router and the link overhead value that arrives described neighbor router.
12, a kind of calculated off-line device of route next jump information is characterized in that, described device comprises:
Link State data message acquiring unit, be used for obtaining the Link State data message of network router, the type-length-value field of described Link State data message comprises the IP address of local interface of described router and the IP address to end interface that connects the neighbor router of described local interface;
The next hop information computing unit is used for according to described Link State data message, the next hop information of the described router of calculated off-line.
13, device according to claim 12 is characterized in that:
The type-length-value field of described Link State data message also comprise described router neighbor router sign and arrive the link overhead value of described neighbor router.
14, device according to claim 12 is characterized in that:
The type-length-value field of described Link State data message comprises a plurality of subtype-length-value field, wherein each subtype-length-value field comprise the IP address of the local interface of described router, the neighbor router that is connected with described local interface to the sign of the neighbor router of the IP address of end interface, described router and the link overhead value that arrives described neighbor router.
15, a kind of network management device is characterized in that:
Described network management device comprises the calculated off-line device of any described route next jump information of claim among the claim 12-14.
CNA200910146653XA 2009-06-09 2009-06-09 Router, routing next-hop-information offline computing method and device thereof Pending CN101562577A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNA200910146653XA CN101562577A (en) 2009-06-09 2009-06-09 Router, routing next-hop-information offline computing method and device thereof

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNA200910146653XA CN101562577A (en) 2009-06-09 2009-06-09 Router, routing next-hop-information offline computing method and device thereof

Publications (1)

Publication Number Publication Date
CN101562577A true CN101562577A (en) 2009-10-21

Family

ID=41221203

Family Applications (1)

Application Number Title Priority Date Filing Date
CNA200910146653XA Pending CN101562577A (en) 2009-06-09 2009-06-09 Router, routing next-hop-information offline computing method and device thereof

Country Status (1)

Country Link
CN (1) CN101562577A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103220221B (en) * 2012-01-20 2017-04-12 华为技术有限公司 Method and device capable of noticing link information

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103220221B (en) * 2012-01-20 2017-04-12 华为技术有限公司 Method and device capable of noticing link information

Similar Documents

Publication Publication Date Title
CN101960785B (en) Implementation of VPN over a link state protocol controlled Ethernet network
EP2904747B1 (en) Mpls segment-routing
EP2761827B1 (en) Incremental deployment of mrt based ipfrr
EP2911348B1 (en) Control device discovery in networks having separate control and forwarding devices
EP1986370B1 (en) Control system, data message transmission method and network device in the ethernet
CN105939260B (en) Overload function in overlay network
CN105594167B (en) Method, controller, forwarding device and the network system to E-Packet
CN101606341B (en) Technique for efficiently routing ip traffic on CE-CE paths across a provider network
CN101133408B (en) Computation of a shortest inter-domain te-lsp across a set of autonomous systems
CN101401083B (en) Technique for preventing routing loops by disseminating BGP attribute information in an ospf-configured network
CN101485160B (en) A technique for efficiently determining acceptable link-based loop free alternatives in a computer network
CN103841022B (en) For setting up the method and device in tunnel
CN109257278A (en) Segment routing label switched path for the router that non-Segment routing enables
US20140286195A1 (en) Service Instance Applied to MPLS Network
US9270426B1 (en) Constrained maximally redundant trees for point-to-multipoint LSPs
EP3920476A1 (en) Fault protection method, node, and storage medium
CN104396197A (en) Selecting between equal cost shortest paths in a 802.1aq network using split tiebreakers
WO2009092246A1 (en) Path selection method and network system, path computation element
CN101243654A (en) Method and apparatus for enabling routing of label switched data packets
JP2010517350A (en) Method for calculating spanning tree based on link state advertisement (LSA), bridge and computer network
CN104038419B (en) For the method that transmission data is grouped in the data network being made of multiple network nodes
CN102959909A (en) Method and apparatus for generating distribution trees, and routing bridge
CN101562577A (en) Router, routing next-hop-information offline computing method and device thereof
TWI556599B (en) Network controlling method and network controller
CN112702253A (en) MPLS tunnel creating method, system and storage medium based on network link quality

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C12 Rejection of a patent application after its publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20091021