WO2015154420A1 - 基于isis的路由计算方法及装置 - Google Patents

基于isis的路由计算方法及装置 Download PDF

Info

Publication number
WO2015154420A1
WO2015154420A1 PCT/CN2014/089074 CN2014089074W WO2015154420A1 WO 2015154420 A1 WO2015154420 A1 WO 2015154420A1 CN 2014089074 W CN2014089074 W CN 2014089074W WO 2015154420 A1 WO2015154420 A1 WO 2015154420A1
Authority
WO
WIPO (PCT)
Prior art keywords
neighbor
tlv
interface
sub
route calculation
Prior art date
Application number
PCT/CN2014/089074
Other languages
English (en)
French (fr)
Inventor
吴强
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to EP14888855.5A priority Critical patent/EP3166264A4/en
Priority to US15/323,088 priority patent/US20170195214A1/en
Publication of WO2015154420A1 publication Critical patent/WO2015154420A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/42—Centralised routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/023—Delayed use of routing table updates
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/03—Topology update or discovery by updating link state protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/26—Route discovery packet
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/741—Routing in networks with a plurality of addressing schemes, e.g. with both IPv4 and IPv6
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/32—Flooding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
    • H04L63/1441—Countermeasures against malicious traffic
    • H04L63/1458—Denial of Service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
    • H04L63/1441—Countermeasures against malicious traffic
    • H04L63/1466—Active attacks involving interception, injection, modification, spoofing of data unit addresses, e.g. hijacking, packet injection or TCP sequence number attacks

Definitions

  • the present invention relates to the field of communications, and in particular to a method and apparatus for calculating a route based on an intermediate system to an intermediate system (ISIS).
  • ISIS intermediate system
  • ISIS Intermediate System to Intermediate System Routing Protocol
  • IGP Interior Gateway Protocol
  • the IS on each network needs to bear the functions of flooding, synchronizing, saving, and routing calculation of LSP. It consumes a lot of computing resources and occupies network bandwidth. It also has network attacks such as LSP flooding LSP interception and modification, and performs abnormal route calculations to make the network trap or send traffic to a hacker-specific destination.
  • the embodiment of the invention provides an ISIS-based route calculation method and device, so as to solve at least the problem that the route calculation method of ISIS in the related art occupies more computing resources and is vulnerable to attack.
  • an ISIS-based route calculation method including: a route calculation unit acquires a link state protocol data packet LSP message from each intermediate system IS of the network; The LSP message calculates a routing table of each IS, and sends the routing table to each IS.
  • the LSP message includes: the next hop information required by the neighbor in each neighbor entry ITEM of the neighbor TLV 22 of the IS.
  • the route calculation unit obtains the LSP message from each IS of the network, and the route calculation unit obtains the LSP message from each of the ISs, where the LSP message includes each of the neighbor TLVs 22 of the IS.
  • the IPv4 interface address sub-TLV includes a local IPv4 interface address set to be data forwarding on the interface where the neighbor is located.
  • the local interface information sub-TLV includes the sub-TLV type, the length, and the interface number of the interface where the neighbor is located.
  • the LSP message further includes an IPv4 neighbor address sub-TLV of the point-to-point neighbor.
  • the neighbor IPv4 neighbor address sub-TLV includes an IPv4 interface address of a neighbor set to data forwarding on the interface where the neighbor is located.
  • an ISIS-based routing computing device which is located in a route calculation unit, and includes: an obtaining module, configured to acquire a link state protocol data packet LSP report from each intermediate system IS of the network. And a calculation module, configured to calculate a routing table of each IS according to the LSP message, and send the routing table to each IS.
  • the LSP message includes: next hop information required by the neighbor included in each neighbor entry ITEM in the neighbor TLV 22 of the IS.
  • the obtaining module is further configured to: obtain an LSP message from each of the ISs, where the LSP message includes an IPv4 interface address sub-TLV and a local of the neighbor in each neighbor entry of the neighbor TLV 22 of the IS.
  • An interface information sub-TLV where the local interface information sub-TLV is set to describe outbound interface information in the next hop information of the neighbor; the IPv4 interface address sub-TLV is set to describe the next hop information that reaches the neighbor Gateway information.
  • the LSP message further includes an IPv4 neighbor address sub-TLV of the point-to-point neighbor.
  • the route calculation unit is located on a part of all ISs in the IS; or the route calculation unit is located in a preset route calculation device.
  • the route calculation unit obtains an LSP message from each IS of the network; the route calculation unit calculates a routing table of each IS according to the LSP message, and sends the routing table to the routing table.
  • the method of the IS solves the problem that the route calculation method of the ISIS in the related art occupies more computing resources and is vulnerable to attacks, and reduces the computing resources occupied by the route calculation method of the ISIS, and does not need to be in each IS. Flooding, synchronizing, and saving other IS LSPs reduces the chances of attacking ISIS and improves system stability and reliability.
  • FIG. 1 is a flowchart of an ISIS-based route calculation method according to an embodiment of the present invention
  • FIG. 2 is a structural block diagram of an ISIS-based routing computing device according to an embodiment of the present invention.
  • FIG. 3 is a schematic diagram of a route calculation unit located on an IS according to Embodiment 1 of the present invention.
  • FIG. 4 is a schematic diagram of a route calculation unit located on a dedicated computer according to Embodiment 1 of the present invention.
  • FIG. 5 is a schematic diagram of a broadcast link LSP generation situation according to Embodiment 1 of the present invention.
  • FIG. 6 is a schematic diagram of a situation of point-to-point link LSP generation according to Embodiment 1 of the present invention.
  • FIG. 1 is a flowchart of an ISIS-based route calculation method according to an embodiment of the present invention. As shown in FIG. 1, the method includes the following steps. step:
  • Step S102 The route calculation unit acquires an LSP message from each intermediate system (IS) of the network.
  • Step S104 The route calculation unit calculates a routing table of each IS according to the LSP message, and sends the routing table to each IS.
  • a route calculation unit is newly added in the network, and the routing table originally calculated in each intermediate system (IS) is unified into the route calculation unit for calculation, that is, the route calculation unit
  • Each IS in the network obtains an LSP packet, and then calculates a routing table for each IS according to the LSP, and distributes it to each IS, thereby freeing resources for routing calculation work in the IS, and routing calculation is performed by routing.
  • the calculation unit is unified and solves the problem that the route calculation method of the ISIS in the related art occupies a large number of computational resources and is vulnerable to attack, and reduces the computational resources occupied by the route calculation method of the ISIS, and does not need to torrent between the ISs. Pan, synchronization, and storage of other IS LSPs reduce the chances of attacking ISIS and improve system stability and reliability.
  • each IS calculates the routing table of the IS by itself, it can easily know the next hop information required to reach its neighbor, and when using the route calculation unit to calculate the routing table of each IS, it can The IS acquires the next hop information.
  • the next hop information required by the neighbors is included in the neighboring item (item).
  • the LSP packet may include the IPv4 interface address sub-TLV of the neighbor in each neighbor entry of the neighbor TLV 22 of the IS in the LSP packet. And a local interface information sub-TLV, wherein the local interface information sub-TLV is set to describe outbound interface information in the next hop information that arrives at the neighbor; the IPv4 interface address sub-TLV Set to describe gateway information in the next hop information arriving at the neighbor.
  • the IPv4 interface address sub-TLV includes the local IPv4 interface address set to data forwarding on the interface where the neighbor is located, and deletes the restriction that the sub-TLV is limited to the TE used in the protocol.
  • the local interface information sub-TLV is a sub-TLV type added in this embodiment, including the interface number of the interface where the neighbor is located, and the sub-TLV type and length.
  • the sub-TLV type of the local interface information sub-TLV may be 19.
  • the LSP message further includes an IPv4 neighbor address sub-TLV of the point-to-point neighbor.
  • the IPv4 neighbor address sub-TLV includes the IPv4 interface address of the neighbor that is set to be forwarded by the data on the interface where the neighbor is located, and deletes the restriction that the sub-TLV is limited to the TE.
  • an ISIS-based routing computing device is also provided in the embodiment, which is located in the routing computing unit, and is configured to implement the foregoing embodiments and preferred embodiments, and has not been described again.
  • the term "module” may implement a combination of software and/or hardware of a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 2 is a structural block diagram of an ISIS-based routing computing device according to an embodiment of the present invention. As shown in FIG. 2, the device includes an obtaining module 22 and a computing module 24. The following describes each module in detail:
  • the obtaining module 22 is configured to obtain an LSP message from each intermediate system (IS) of the network; the calculating module 24 is connected to the obtaining module 22, and is configured to calculate a routing table of each IS according to the LSP message, and The routing table is sent to each of the ISs.
  • IS intermediate system
  • the LSP message includes: next hop information required by the neighbor included in each neighbor entry ITEM in the neighbor TLV 22 of the IS.
  • the obtaining module 22 may be configured to obtain an LSP message from each of the ISs, where the LSP message includes an IPv4 interface address sub-TLV of the neighbor in each neighbor entry of the neighbor TLV 22 of the IS. a local interface information sub-TLV, where the local interface information sub-TLV is set to describe outbound interface information in the next hop information of the neighbor; the IPv4 interface address sub-TLV is set to describe next hop information to the neighbor Gateway information in .
  • the LSP message further includes an IPv4 neighbor address sub-TLV of the point-to-point neighbor.
  • the route calculation unit may be located on a part of the IS in the IS. Alternatively, the route calculation unit may be located in a preset route calculation device. For example, one or more dedicated computers may be set as the route calculation unit.
  • the ISIS protocol in the following preferred embodiment supports a method and system for distributed route calculation, wherein the distributed route calculation is performed by the route calculation unit separately, and the route calculation unit can be on its own device, on other devices on the network, or on a dedicated route calculation.
  • the route calculation unit obtains link state protocol packet (LSP) database information from an intermediate system (IS) on the network, and provides ISIS topology calculation and route calculation for the IS.
  • LSP link state protocol packet
  • IS intermediate system
  • the IS on the network is no longer required to flood and synchronize LSPs.
  • the LSPs of other ISs are no longer saved and processed. To perform topology calculation and route calculation, you only need to obtain your own routing table from the route calculation unit to forward the data packet.
  • IS does not need to synchronize the LSP database, which greatly relieves the network burden caused by database synchronization and reduces the occupation of user bandwidth.
  • IS does not need to synchronize the LSP database, and does not need to save and process other ISs.
  • the LSP does not need to perform topology calculation and partial route calculation, which greatly releases the IS workload and resources.
  • the IS only focuses on packet forwarding, which greatly improves the forwarding performance of the IS.
  • the LSP data packet does not need to be used. Perform database synchronization on the network to block network security risks such as interception and modification of LSP packets.
  • the system in the following preferred embodiment includes: an original IS, a route calculation unit.
  • the original IS does not perform flooding and synchronization of the LSPs.
  • the LSPs generated by the LSPs are not sent to the route calculation unit.
  • the LSPs of other ISs are not saved and processed.
  • the route calculation unit is a device that performs routing calculations, and can be located on an IS or on a dedicated routing computer.
  • the route calculation unit obtains the link state protocol data packet (LSP) database information from the IS on the network, and provides the ISIS protocol topology calculation and route calculation for each IS, and then sends the routing table to the corresponding IS.
  • LSP link state protocol data packet
  • the neighbor TLV22 neighbor information description format (RFC5305); introduce the sub-TLV of the two neighbor TLV22 in RFC5305: IPv4 interface address sub-TLV and IPv4 neighbor address sub-TLV. Eliminate the limitation that it is only set to the TE function, and can also be used in the route calculation; a new sub-TLV of the neighbor TLV22, the interface information sub-TLV, of type 19 is proposed.
  • the format is as described herein.
  • the IS fills in the neighbor description information of the neighbor TLV 22 and its sub-TLV according to the description herein. Fill in the newly proposed interface information sub-TLV.
  • the routing calculation unit performs the topology calculation and the partial routing calculation in the manner described in the present invention.
  • the next hop information is obtained from the sub-TLV of the neighbor description information of the neighbor TLV 22: the next hop is obtained from the interface information sub-TLV.
  • the interface obtains the gateway information of the next hop from the IPv4 interface address sub-TLV or the IPv4 neighbor address sub-TLV.
  • the network device running Intermediate System to Intermediate System (ISIS) routing protocol and the network device independently performing routing calculation in the following preferred embodiments support distributed routing calculation for ISIS protocol, applicable to various ISIS supporting devices and provide for ISIS
  • the device for routing calculations may include, for example, a router, a switch, a computer host, and the like.
  • the preferred embodiment can implement a distributed routing calculation method and system independent of the ISIS route calculation function, and a route calculation unit (device) exclusively performs a route calculation function for each IS.
  • the IS on the network fills in the neighbor information according to the neighbor filling method of the TLV 22 in the LSP in the embodiment of the present invention.
  • Sub-TLVs of two TLVs 22 in RFC5305 are introduced: IPv4 interface address sub-TLV and IPv4 neighbor address sub-TLV.
  • the new interface information sub-TLV, of type 19 sends the generated LSP to the route calculation unit.
  • the route calculation unit receives all the LSPs sent by the IS, and performs route calculation for each IS: topology calculation and partial route calculation (PRC).
  • the SPF algorithm is still executed in the topology calculation.
  • the next hop information is obtained from the sub-TLV of the TLV22, and the next hop information of the local IS to other ISs is calculated.
  • the part of the route calculation is performed by copying the next hop information of the other IS to the next hop information of the IP reachability information carried by the IS, and completing the route calculation.
  • the corresponding routing table of each IS is sent to the IS, and the IS can use this routing table to forward the data packet.
  • Reduce network load This method does not need to perform flood synchronization of LSPs on the network, which reduces network load.
  • IS does not need to perform flooding and synchronization of LSPs. It does not need to process and save LSPs of other ISs. It does not need to perform route calculation, which greatly releases IS workload and resources.
  • IS does not need to perform flooding and synchronization of LSPs, does not need to perform route calculation, and focuses on forwarding of data packets, which greatly improves the data forwarding performance of routers (switches).
  • LSPs do not need to be flooded and synchronized on the network, eliminating network attacks such as LSP interception and modification.
  • the route calculation unit is a device that performs routing calculations. Its location can be located on the IS and can be located on a dedicated routing computer. After the LSP is sent, the LSP is generated. Then, the LSP is generated and sent to the independent computing unit. Then, the route calculation unit saves the LSPs of all ISs on the network, and the route calculation unit performs route calculation according to the LSPs, and sends the route calculation result to the router, and the router can forward the data packet according to the route information.
  • the system operation mode describes in detail how the route calculation unit is located on the IS and on a dedicated routing computer.
  • the method and system for distributed routing calculation described herein are not limited to this scenario setting, and the core is that the route calculation is separated from the IS and completed by the route calculation unit.
  • FIG. 3 is a schematic diagram of a route calculation unit located on an IS according to the first embodiment of the present invention.
  • the route calculation unit is located on an IS.
  • the route calculation unit On the network consisting of router A and router B, the route calculation unit is located on router A, that is, router A bears the route calculation unit.
  • Router A After generating an LSP, Router A sends all the LSPs generated by itself to the route calculation unit on its own device.
  • Router B also sends its own generated LSP to the route calculation unit of Router A through a special channel. Then, the route calculation unit located on Router A performs route calculation for each IS according to the LSPs generated by all IS router A and router B on the network.
  • the routing result table corresponding to the IS is sent to the IS: the routing table calculated for Router A is sent to router A; the routing table calculated for Router B is sent to router B. Finally, both router A and router B have their own corresponding routing table, which forwards the data packets according to the routing table.
  • FIG. 4 is a schematic diagram of a route calculation unit located on a dedicated computer according to the first embodiment of the present invention.
  • the route calculation unit is located on a dedicated computer, and is routed on a network composed of router A and router B.
  • the computing unit is located on a computer with a dedicated routing calculation.
  • Router A After Router A generates an LSP, it sends all the LSPs generated by itself to the route calculation unit located on the computer through a special channel or other means.
  • Router B also sends its own generated LSP to the route calculation unit located on the computer through a special channel or other means.
  • the route calculation unit located on the dedicated host performs route calculation for each IS according to the LSPs generated by all IS router A and router B on the network.
  • the routing result table corresponding to the IS is sent to the IS: the routing table calculated for Router A is sent to router A; the routing table calculated for Router B is sent to router B. Finally, both router A and router B have their own corresponding routing table, which forwards the data packets according to the routing table.
  • the route calculation unit performs route calculation based on the LSPs obtained from ISs on all networks, and performs topology calculation and partial route calculation (Partial Route Calculation, referred to as PRC).
  • the topology calculation and partial route calculation (PRC) are still performed according to the original method.
  • the topology calculation first uses the SPF algorithm to calculate the next hop information from the local IS to each IS.
  • the next hop information mainly includes the outbound interface information of the next hop.
  • the gateway information of the next hop; part of the route calculation constitutes its own next hop information according to the next hop information of the IS copy that the IS prefix belongs to.
  • each IS itself performs topology calculation and partial route calculation (PRC) to calculate the routing table that it needs.
  • PRC partial route calculation
  • the topology calculation is performed according to the neighbor TLV in the LSP.
  • the calculation of the next hop information in the topology calculation is obtained from the corresponding neighbors on the interface initiated by each IS.
  • the route calculation unit described in the preferred embodiment performs route calculation not in the present IS. Therefore, the next hop information required by the neighbor can be carried in the LSP, so that the route calculation unit can perform the calculation of the next hop.
  • Protocol extension
  • RFC 5305 describes that one neighbor information format in the neighbor TLV 22 of the original LSP includes: 7 bytes of system Id and pseudo node number, and 3 bytes of metric information, 1 Byte sub-TLV length, sub-TLV from 0 to 244 bytes.
  • the neighbor information can contain two important sub-TLVs. For details, see RFC5305: IPv4 Address Sub-TLV and IPv4 Neighbor Address Sub-TLV. However, it is only used in the TE function and will not be used in route calculation.
  • Table 1 Neighbor information format in neighbor TLV 22 according to Embodiment 1 of the present invention
  • the neighbor TLV information remains in the original format (as shown in Table 1): 7 bytes of system Id and pseudo node number, 3 bytes of metric information, 1 byte of sub-TLV length, which can carry 0 behind. To a sub-TLV of 244 bytes;
  • Table 2 is a format of a local interface information sub-TLV according to the first embodiment of the present invention.
  • the format is as follows: the sub-TLV type is 19, and includes one byte. IS interface number. Set to get the outbound interface information in the next hop information.
  • the interface information sub-TLV fills in the interface number of the interface where the neighbor is located.
  • Table 2 Local interface information sub-TLV format according to Embodiment 1 of the present invention
  • Sub-TLV type (1 byte) 19 Length (1 byte) Interface number: (1 byte)
  • FIG. 5 is a schematic diagram of a broadcast link LSP generation according to the first embodiment of the present invention.
  • the interface number of interface 1 is 1 and the interface of the interface Ipv4 is 1.1.1.1/24.
  • the interface with the interface number 1 on Router B and the interface Ipv4 address 1.1.1.2/24 establishes the neighbor of the broadcast network.
  • the system-id of router A is 1111.1111.1111
  • the system-id of router B is 2222-222222.2222.
  • interface 1 of router A is the DIS of the election of the broadcast network, then a pseudo node router A.1 is created.
  • the LSP is generated as follows:
  • One of the LSPs generated by router A is 1111.1111.1111.01 (router A.01), and the metric defaults to 10.
  • the neighbor carries two sub-TLVs: one is the IPv4 interface address sub-TLV, and the local Ipv4 interface address is 1.1.1.1.
  • One is the interface information sub-TLV, and the filling interface number is 1.
  • One of the LSPs generated by router B is 1111.1111.1111.01 (router A.01), and the metric defaults to 10.
  • the neighbor carries two sub-TLVs: one is the IPv4 interface address sub-TLV, and the local Ipv4 interface address is 1.1.1.2.
  • One is the interface information sub-TLV, and the filling interface number is 1.
  • the LSP generated by the router A.1 is the same as the existing protocol. There are two neighbors: one is 1111.1111.1111.00 (router A.00), the metric is 0, and the other is 2222.2222.2222.00 (router B. 00), metric is 0.
  • the route calculation unit After receiving the LSP generated by router A, router B, and router A.01, the route calculation unit performs route calculation for router A and router B: topology calculation and partial route calculation.
  • the route calculation unit performs route calculation for the router A.
  • the SPF algorithm is used to perform topology calculation.
  • the next hop information of the router B is the outbound interface 1 of the router A, the next hop gateway is 1.1.1.2, and the next hop interface is from the interface.
  • the neighbor is obtained from the interface sub-TLV of router A.01.
  • the gateway of the next hop is obtained from the LSP of router B, and the address of the local Ipv4 interface of the router A.01 is 1.1.1.2.
  • the IP reachability information on the router B is copied to the next hop information of the router B, and constitutes the next hop information of the IP reachability information, and the route calculation ends.
  • the route calculation unit sends the route information of router A to router A, and router A uses its routing table for route forwarding.
  • the route calculation unit performs route calculation for the router B.
  • the SPF algorithm is used to perform topology calculation.
  • the next hop information arriving at the router A is the outbound interface 1 of the router B, and the next hop gateway is 1.1.1.1.
  • the interface is obtained from the LSP of the router B, and the neighbor is the interface information sub-TLV of the router A.01.
  • the gateway of the next hop is obtained from the LSP of the router A, and the address of the local Ipv4 interface of the router A.01 is 1.1.1.1. .
  • the IP reachability information on the router A is copied to the next hop information of the router A, and constitutes the next hop information of the IP reachability information, and the route calculation ends.
  • the route calculation unit sends the route information of router B to router B, and router B uses its routing table for route forwarding.
  • FIG. 6 is a schematic diagram of a point-to-point link LSP generation according to Embodiment 1 of the present invention.
  • an interface numbered 1 on Router A and an address of 1.1.1.1/24 on an interface Ipv4.
  • the neighbor of the broadcast network is established on the interface numbered 1 on Router B and the interface Ipv4 is 1.1.1.2/24.
  • the system-id of router A is 1111.1111.1111
  • the system-id of router B is 2222222222222.
  • the neighbor carries three sub-TLVs: one is the IPv4 interface address sub-TLV, and the local Ipv4 is connected.
  • the port address is 1.1.1.1; the other is the IPv4 neighbor address sub-TLV, the local Ipv4 interface address is 1.1.1.2, and the last one is the interface information sub-TLV, and the interface number is 1.
  • One of the LSPs generated by router B is 1111.1111.1111.01 (router A.01), and the metric defaults to 10.
  • the neighbor carries three sub-TLVs: one is the IPv4 interface address sub-TLV, and the local Ipv4 interface address is 1.1.1.1. The other is the IPv4 neighbor address sub-TLV. The local Ipv4 interface address is 1.1.1.2. The last one is the interface information sub-TLV, and the interface number is 1.
  • the route calculation unit After receiving the LSP generated by router A and router B, the route calculation unit performs route calculation for router A and router B: topology calculation and partial route calculation.
  • the route calculation unit performs route calculation for the router A: firstly, the SPF algorithm is used for topology calculation, and finally, the next hop information arriving at the router B is the outbound interface 1 of the router A, and the next hop gateway is 1.1.1.2: the next hop out interface is In the LSP of router A, the neighbor is obtained from the interface sub-TLV of router B.00; the gateway of the next hop is obtained from the LSP of router B, and the address of the local Ipv4 interface of the router A.00 is 1.1.1.2, but Before obtaining the IP address of the gateway Ipv4, you must confirm that the local Ipv4 interface address of the router B.00 in the LSP of the router A is 1.1.1.1, and the neighbor Ipv4 interface of the router A.00 in the LSP of the router B.
  • the address is 1.1.1.1, and the two Ipv4 addresses are equal. In fact, it is confirmed that the two point-to-point neighbor description information is on the same point-to-point link. Then, the IP reachability information on the router B is copied to the next hop information of the router B, and constitutes the next hop information of the IP reachability information, and the route calculation ends. Finally, the route calculation unit sends the route information of router A to router A, and router A uses its routing table for route forwarding.
  • the route calculation unit performs route calculation for the router B.
  • the SPF algorithm is used to perform topology calculation.
  • the next hop information arriving at the router A is the outbound interface 1 of the router B, and the next hop gateway is 1.1.1.1: the next hop out interface is In the LSP of router B, the neighbor is the interface sub-TLV of router A.00 and obtains 1; the gateway of the next hop is obtained from the LSP of router A, and the address of the local Ipv4 interface whose router is router B.00 is 1.1.1.1.
  • the route calculation unit sends the route information of router B to router B, and router B uses its routing table for route forwarding.
  • a software is provided that is configured to perform the technical solutions described in the above embodiments and preferred embodiments.
  • a storage medium in which the above software is stored, including but not limited to an optical disk, a floppy disk, a hard disk, an erasable memory, and the like.
  • modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.
  • an ISIS-based route calculation method and apparatus provided by the embodiments of the present invention have the following beneficial effects: the problem that the route calculation method of the ISIS occupies more computing resources and is vulnerable to attack is solved in the related art. Reduces the computing resources occupied by the route calculation method of the ISIS. It does not need to flood, synchronize, and save other IS LSPs between the ISs. This reduces the chances of attacking ISIS and improves system stability and reliability. effect.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

一种基于ISIS的路由计算方法及装置，其中，该方法包括：路由计算单元从网络的每个IS获取LSP报文（S102）；路由计算单元根据上述LSP报文计算上述每个IS的路由表，并将上述路由表发送给上述每个IS（S104）。解决了相关技术中ISIS的路由计算方式占用计算资源较多且易被攻击的问题，降低了ISIS的路由计算方式占用的计算资源，并且由于不需要在各个IS之间互相洪泛、同步、保存其他IS的LSP，减少了能够对ISIS进行攻击的机会，提升了系统稳定性及可靠性。

Description

基于ISIS的路由计算方法及装置 技术领域
本发明涉及通信领域，具体而言，涉及一种基于中间系统到中间系统协议(Intermediate system to Intermediate system，简称为ISIS)的路由计算方法及装置。
背景技术
中间系统到中间系统路由协议(ISIS)是一种动态的、基于链路状态的内部网关协议(Interior Gateway Protocols，简称为IGP)。ISIS协议通过hello报文交互协商建立邻居后，每一个中间系统(Intermediate system，简称为IS)都产生链路状态协议数据包(Link State Protocol Data Unit，简称为LSP)描述本中间系统(IS)的链路状态信息，并发送到网络中，并且也会存储网络拓扑上所有中间系统(IS)设备发送过来的LSP，形成链路状态数据库(Link State DataBase，简称为LSDB)。ISIS就是使用链路状态数据库(LSDB)通过最短路径优先算法(Shortest Path First，简称为SPF)计算出到达目的地址的最佳路由。
这样，每一个网络上的IS都需要承担LSP的洪泛、同步、保存，路由计算这些功能。耗费了大量的计算资源，占用了网络带宽，而且还存在LSP洪泛的LSP截获、修改等网络攻击，进行异常的路由计算，使网络陷于瘫痪或将流量发送到黑客特定的目的地。
针对相关技术中ISIS的路由计算方式占用计算资源较多且易被攻击的问题，目前尚未提出有效的解决方案。
发明内容
本发明实施例提供了一种基于ISIS的路由计算方法及装置，以至少解决相关技术中ISIS的路由计算方式占用计算资源较多且易被攻击的问题。
根据本发明的一个实施例，提供了一种基于ISIS的路由计算方法，包括：路由计算单元从网络的每个中间系统IS获取链路状态协议数据包LSP报文；所述路由计算单元根据所述LSP报文计算所述每个IS的路由表，并将所述路由表发送给所述每个IS。
所述LSP报文包括：所述IS的邻居TLV22的每个邻居条目ITEM中包含该邻居所需要的下一跳信息。
路由计算单元从网络的每个IS获取LSP报文包括：所述路由计算单元从所述每个IS中获取LSP报文，其中，所述LSP报文中包含所述IS的邻居TLV22的每个邻居条目中该邻居的IPv4接口地址子TLV和本地接口信息子TLV，所述本地接口信息子TLV设置为描述到达所述邻居的下一跳信息中的出接口信息；所述IPv4接口地址子TLV设置为描述到达所述邻居的下一跳信息中的网关信息。
所述IPv4接口地址子TLV包括该邻居所在接口上设置为数据转发的本地IPv4接口地址。
所述本地接口信息子TLV包括子TLV类型、长度以及邻居所在接口的接口编号。
在所述邻居条目为点对点邻居的情况下，所述LSP报文中还包含所述点对点邻居的IPv4邻居地址子TLV。
所述邻居IPv4邻居地址子TLV包括该邻居所在接口上设置为数据转发的邻居的IPv4接口地址。
根据本发明的另一实施例，提供了一种基于ISIS的路由计算装置，位于路由计算单元中，包括：获取模块，设置为从网络的每个中间系统IS获取链路状态协议数据包LSP报文；计算模块，设置为根据所述LSP报文计算所述每个IS的路由表，并将所述路由表发送给所述每个IS。
所述LSP报文包括：所述IS的邻居TLV22中每个邻居条目ITEM中包含的该邻居所需要的下一跳信息。
所述获取模块还设置为从所述每个IS中获取LSP报文，其中，所述LSP报文中包含所述IS的邻居TLV22的每个邻居条目中该邻居的IPv4接口地址子TLV和本地接口信息子TLV，所述本地接口信息子TLV设置为描述到达所述邻居的下一跳信息中的出接口信息；所述IPv4接口地址子TLV设置为描述到达所述邻居的下一跳信息中的网关信息。
在所述邻居条目为点对点邻居的情况下，所述LSP报文中还包含所述点对点邻居的IPv4邻居地址子TLV。
所述路由计算单元位于全部IS中的部分IS上；或者，所述路由计算单元位于预设的路由计算设备中。
通过本发明实施例，采用路由计算单元从网络的每个IS获取LSP报文；所述路由计算单元根据所述LSP报文计算所述每个IS的路由表，并将所述路由表发送给所述每个IS的方式，解决了相关技术中ISIS的路由计算方式占用计算资源较多且易被攻击的问题，降低了ISIS的路由计算方式占用的计算资源，并且由于不需要在各个IS之间互相洪泛、同步、保存其他IS的LSP，减少了能够对ISIS进行攻击的机会，提升了系统稳定性及可靠性。
附图说明
此处所说明的附图用来提供对本发明的进一步理解，构成本申请的一部分，本发明的示意性实施例及其说明设置为解释本发明，并不构成对本发明的不当限定。在附图中：
图1是根据本发明实施例的一种基于ISIS的路由计算方法的流程图；
图2是根据本发明实施例的一种基于ISIS的路由计算装置的结构框图；
图3是根据本发明实施例一的路由计算单元位于一个IS上的示意图；
图4是根据本发明实施例一的路由计算单元位于专用计算机上的示意图；
图5是根据本发明实施例一的广播链路LSP生成情况的示意图；
图6是根据本发明实施例一的点对点链路LSP生成情况的示意图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本发明。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。
根据本发明的一实施例，提供了一种基于ISIS的路由计算方法，图1是根据本发明实施例的一种基于ISIS的路由计算方法的流程图，如图1所述，该方法包括以下步骤：
步骤S102，路由计算单元从网络的每个中间系统(IS)获取LSP报文；
步骤S104，所述路由计算单元根据所述LSP报文计算所述每个IS的路由表，并将所述路由表发送给所述每个IS。
本实施例通过上述步骤，在网络中新增了路由计算单元，并将原来在每个中间系统(IS)中各自计算的路由表统一到所述路由计算单元中进行计算，即路由计算单元从网络中的每个IS中获取LSP报文，然后根据该LSP计算每个IS的路由表，并分发给每个IS，从而将IS中进行路由计算工作的资源解放了出来，而路由计算由路由计算单元统一计算，解决了相关技术中ISIS的路由计算方式占用计算资源较多且易被攻击的问题，降低了ISIS的路由计算方式占用的计算资源，并且由于不需要在各个IS之间互相洪泛、同步、保存其他IS的LSP，减少了能够对ISIS进行攻击的机会，提升了系统稳定性及可靠性。
在相关技术中由于是每个IS自行计算本IS的路由表，因此其可以方便得知到达其邻居所需要的下一跳信息，而使用路由计算单元计算各个IS的路由表时，可以从各个IS获取所述下一跳信息。本实施例中在各个IS发给路由计算单元的所述LSP报文中携带的邻居TLV22每个邻居条目(item)中包含了所述邻居所需要的下一跳信息。
在所述LSP报文中携带所述邻居所需要的下一跳信息的方式，可以在LSP报文中包含所述IS的邻居TLV22的每个邻居条目中该邻居的IPv4接口地址子TLV(Type，Length，Value，简称为TLV)和本地接口信息子TLV，其中，所述本地接口信息子TLV设置为描述到达所述邻居的下一跳信息中的出接口信息；所述IPv4接口地址子TLV设置为描述到达所述邻居的下一跳信息中的网关信息。
所述IPv4接口地址子TLV包括邻居所在接口上设置为数据转发的本地IPv4接口地址，并删除了协议中该子TLV仅限于TE中使用的限制。
所述本地接口信息子TLV是本实施例中新增的子TLV类型，包括邻居所在接口的接口编号，还包括子TLV类型、长度。在本实施例中，所述本地接口信息子TLV的子TLV类型可以为19。
在所述邻居条目为点对点邻居的情况下，所述LSP报文中还包含所述点对点邻居的IPv4邻居地址子TLV。
所述IPv4邻居地址子TLV包括邻居所在接口上设置为数据转发的邻居的IPv4接口地址，并删除了协议中该子TLV仅限于TE中使用的限制。
对应于上述方法，在本实施例中还提供了一种基于ISIS的路由计算装置，位于路由计算单元中，该装置设置为实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图2是根据本发明实施例的一种基于ISIS的路由计算装置的结构框图，如图2所示，该装置包括获取模块22和计算模块24，下面对各个模块进行详细说明：
获取模块22，设置为从网络的每个中间系统(IS)获取LSP报文；计算模块24，与获取模块22相连，设置为根据所述LSP报文计算所述每个IS的路由表，并将所述路由表发送给所述每个IS。
所述LSP报文包括：所述IS的邻居TLV22中每个邻居条目ITEM中包含的该邻居所需要的下一跳信息。
所述获取模块22可以设置为从所述每个IS中获取LSP报文，其中，所述LSP报文中包含所述IS的邻居TLV22的每个邻居条目中该邻居的IPv4接口地址子TLV和本地接口信息子TLV，所述本地接口信息子TLV设置为描述到达所述邻居的下一跳信息中的出接口信息；所述IPv4接口地址子TLV设置为描述到达所述邻居的下一跳信息中的网关信息。
在所述邻居条目为点对点邻居的情况下，所述LSP报文中还包含所述点对点邻居的IPv4邻居地址子TLV。
所述路由计算单元可以位于全部IS中的部分IS上；或者，所述路由计算单元也可以位于预设的路由计算设备中，例如可以设置一台或多台专用计算机作为路由计算单元。
下面结合优选实施例进行说明，以下优选实施例结合了上述实施例及其优选实施方式。
以下优选实施例中的ISIS协议支持分布式路由计算的方法和系统，其中，分布式路由计算由路由计算单元单独完成，路由计算单元可以处于自身设备上、网络上其他设备上、或专用路由计算的计算机上。路由计算单元从网络上的中间系统(IS)得到链路状态协议数据包(LSP)数据库信息，为IS提供ISIS协议的拓扑计算和路由计算。网络上的IS不再需要进行LSP的洪泛和同步，不再保存和处理其他IS的LSP，不再 进行拓扑计算和路由计算，只需要从路由计算单元获取自己的路由表进行数据包的转发。通过这种方式，IS不需要进行LSP数据库的同步，极大释放了数据库同步带来的网络负担，减少了对用户带宽的占用；IS不需要进行LSP数据库的同步，不需要保存和处理其他IS的LSP，也不需要进行拓扑计算以及部分路由计算，极大释放了IS工作负担和资源；IS只专注于数据包的转发，极大提高IS的转发性能；同时，LSP的数据报文不需要在网络上进行数据库同步，屏蔽了LSP报文截获、修改等网络安全隐患。
以下优选实施例中的系统包括：原有的IS，路由计算单元。
原有的IS不再进行LSP的洪泛和同步，不再执行路由计算，将自己生成的LSP发送至路由计算单元，自己不再保存和处理其他IS的LSP。
路由计算单元是一个专门进行路由计算的设备，可以位于一个IS上，或位于一个专用的路由计算机上等。路由计算单元从网络上的IS得到链路状态协议数据包(LSP)数据库信息，为每一个IS提供ISIS协议的拓扑计算和路由计算后，将路由表发送给对应IS。
保持现有协议在宽度量下，邻居TLV22的邻居信息描述格式(RFC5305)；引入RFC5305中的两个邻居TLV22的子TLV：IPv4接口地址子TLV和IPv4邻居地址子TLV。消除其只设置为TE功能的限制，在路由计算中也可以使用；提出一种新的邻居TLV22的子TLV，接口信息子TLV，类型为19。格式如本文描述。
IS按照本文描述填写邻居TLV22的邻居描述信息及其子TLV。填写新提出的接口信息子TLV。
路由计算单元按照本文描述的方式执行拓扑计算和部分路由计算；在拓扑计算中，从邻居TLV22的邻居描述信息的子TLV中，得到下一跳信息：从接口信息子TLV获取下一跳的出接口，从IPv4接口地址子TLV或IPv4邻居地址子TLV获取下一跳的网关信息。
以下优选实施例中的运行中间系统到中间系统(ISIS)路由协议的网络设备和独立进行路由计算的网络设备，对ISIS协议支持分布式路由计算，适用于各种支持ISIS的设备和为ISIS提供路由计算的设备，例如可以包括路由器、交换机、计算机主机等。
该优选实施例可以将ISIS路由计算功能独立出来的分布式路由计算方法和系统，由一个路由计算单元(设备)专门为每一个IS承担路由计算功能。
网络上的IS按照本发明实施例中的LSP中TLV22的邻居填写方法填写邻居信息。引入RFC5305中的两个TLV22的子TLV：IPv4接口地址子TLV和IPv4邻居地址子TLV。并且，本发明实施例中新的接口信息子TLV，类型为19，将生成的LSP发送至路由计算单元。
路由计算单元收到所有的IS发送过来的LSP，为每一个IS执行路由计算：拓扑计算和部分路由计算(PRC)。拓扑计算中仍然执行SPF算法，下一跳信息从TLV22的子TLV中获取，计算出本IS到达其他IS的下一跳信息。然后，进行部分路由计算，就是将到达其他IS的下一跳信息拷贝至其携带的IP可达性信息的下一跳信息中，完成路由计算。最后，将每一个IS的对应的路由表发送至这个IS，那么这个IS就可以使用此路由表进行数据包的转发。
本优选实施例中ISIS协议支持分布式路由计算的方法具有如下优势：
(1)减小网络负载：本方法不需要在网络上进行LSP的洪泛同步，减小了网络负载。
(2)释放IS工作负担和资源：IS不需要进行LSP的洪泛和同步，不需要处理和保存其他IS的LSP，不需要进行路由计算，极大释放了IS工作负担和资源。
(3)提高IS转发性能：IS不需要进行LSP的洪泛和同步，不需要进行路由计算，专注于数据包的转发，极大提高路由器(交换机)的数据转发性能。
(4)符合网络安全：LSP不需要在网络上进行洪泛和同步，消除了LSP截获、修改等手段的网络攻击。
下面结合具体实施方式对本优选实施例进行进一步说明。
实施例一
路由计算单元是一个专门进行路由计算的设备，其位置可以位于IS上，可以位于一个专用的路由计算机上。当IS链路状态发送变化后，会产生LSP报文，那么就将自己产生的LSP报文发送给独立计算单元。那么，路由计算单元保存了网络上所有IS的LSP，路由计算单元依据这些LSP，进行路由计算，将路由计算结果发送给路由器，路由器就可以根据这些路由信息进行数据包的转发。
系统运行方式包括以下两种：
系统运行方式详细描述了路由计算单元位于IS上，和位于一个专用的路由计算机上两种情景下的运行方式。当然，本文描述的分布式路由计算的方法和系统不限于此场景设置，其核心是路由计算从IS中分离出来，由路由计算单元完成。
1、路由计算单元位于IS上的运行方式：
图3是根据本发明实施例一的路由计算单元位于一个IS上的示意图，如图3所示，路由计算单元位于一个IS上。在路由器(router)A和router B组成的网络上，路由计算单元位于router A上，即router A承担路由计算单元。Router A生成了LSP后，会将自己生成的所有的LSP发送至位于自己设备上的路由计算单元。Router B也会通过特殊通道，洪泛或其他方式将自己产生的LSP发送至Router A的路由计算单元。那么，位于router A上的路由计算单元就会依据网络上所有IS router A和router B产生的LSP为每一个IS进行路由计算。然后，将对应IS的计算结果路由表发送至此IS：为Router A计算的路由表发送至router A；为Router B计算的路由表发送至router B。最终，router A和router B都有了自己对应的路由表，依据路由表进行数据包的转发。
2、路由计算单元位于专用计算机上的运行方式
图4是根据本发明实施例一的路由计算单元位于专用计算机上的示意图，如图4所示，路由计算单元位于一个专用计算机上的运行方式，在router A和router B组成的网络上，路由计算单元位于一个专用路由计算的计算机上。Router A生成了LSP后，会将自己生成的所有的LSP通过特殊通道，或其他方式发送至位于计算机上的路由计算单元。Router B也会通过特殊通道，或其他方式将自己产生的LSP发送至位于计算机上的路由计算单元。那么，位于专用主机上的路由计算单元就会依据网络上所有IS router A和router B产生的LSP为每一个IS进行路由计算。然后，将对应IS的计算结果路由表发送至此IS：为Router A计算的路由表发送至router A；为Router B计算的路由表发送至router B。最终，router A和router B都有了自己对应的路由表，依据路由表进行数据包的转发。
路由计算方法：
路由计算单元根据从所有网络上的IS得到的LSP进行路由计算，需要执行拓扑计算和部分路由计算(Partial Route Calculation，简称为PRC)。拓扑计算和部分路由计算(PRC)仍然依据原有方法进行：拓扑计算首先使用SPF算法计算从本IS到达每一个IS的下一跳信息，下一跳信息主要包含：下一跳的出接口信息，下一跳的网关信息；部分路由计算依据路由前缀所依附的IS拷贝到达这个IS的下一跳信息构成自己的下一跳信息。
但是，原来每个IS自己执行拓扑计算和部分路由计算(PRC)，计算自己所需要的路由表。在拓扑计算中，依据LSP中的邻居TLV进行拓扑计算，同时，拓扑计算中的下一跳信息计算，是从每个IS所启动接口上的对应邻居中进行获取。而本优选实施例所描述的路由计算单元执行路由计算不在本IS进行。因此，就可以将邻居所需要的下一跳信息携带在LSP中，这样，路由计算单元就可以进行下一跳的计算了。
下面详述本文对ISIS协议进行的扩展，以及路由计算的整个过程，在ISIS协议中分为两种链路类型：广播链路和点对点链路。
1、协议扩展：
(1)原有协议报文格式：
如表1所示，在宽度量情况下，RFC5305中描述，原有LSP的邻居TLV22中的一个邻居信息格式包含：7字节的system Id和伪节点号，3个字节的metric信息，1个字节子TLV长度，0到244个字节的子TLV。
邻居信息可以包含了两个重要的子TLV，详见RFC5305：IPv4地址子TLV和IPv4邻居地址子TLV，但目前只在TE功能中使用，在路由计算中不会使用。
表1：根据本发明实施例一的邻居TLV22中邻居信息格式
邻居system-id(6字节)和伪节点号(1字节)
metric(3字节)
子TLV长度(1字节)
(2)协议报文格式修改：
本文对宽度量情况下，LSP的邻居TLV22的邻居信息格式及其子TLV进行了如下修改和扩展：
(1)邻居TLV信息仍然保持原有格式(如表1所示)：7字节的system Id和伪节点号，3个字节的metric信息，1个字节子TLV长度，后面可以携带0到244个字节的子TLV；
(2)引入RFC5305中IPv4地址子TLV和IPv4邻居地址子TLV(详见RFC5305)：消除原有协议只可以在TE功能中的使用的限制，本文修改为在路由计算中也可以使用，设置为获取下一跳信息中的网关信息。IPv4地址子TLV填写本邻居所在接口上可 以设置为数据转发的本地IPv4接口地址；IPv4邻居地址子TLV填写本邻居所在接口上可以设置为数据转发的邻居IS IPv4接口地址；
(3)提出一种新的子TLV，即本地接口信息子TLV，表2是根据本发明实施例一的本地接口信息子TLV的格式，格式如下：子TLV类型为19，包含一个字节的IS接口编号。设置为获取下一跳信息中的出接口信息。接口信息子TLV填写本邻居所在接口的接口编号。
表2：根据本发明实施例一的本地接口信息子TLV格式
子TLV类型(1字节)19
长度(1字节)
接口号：(1字节)
2、广播链路相关协议扩展和路由计算
图5是根据本发明实施例一的广播链路LSP生成情况的示意图，如图5所示，在广播链路上，router A上接口编号为1，接口Ipv4地址为1.1.1.1/24的接口，和router B上接口编号为1，接口Ipv4地址为1.1.1.2/24的接口建立广播网的邻居。假设，router A的system-id是1111.1111.1111，router B的system-id是2222.2222.2222，同时，router A的接口1为本广播网选举的DIS，那么会创建一个伪节点router A.1。
(1)广播链路协议扩展
在如上拓扑中，LSP的生成情况如下：
router A生成的LSP中会有一个邻居是1111.1111.1111.01(router A.01)，metric默认是10，这个邻居下携带两个子TLV：一个是IPv4接口地址子TLV，本地Ipv4接口地址是1.1.1.1；一个是接口信息子TLV，填写接口编号为1。
router B生成的LSP中会有一个邻居是1111.1111.1111.01(router A.01)，metric默认是10，这个邻居下携带两个子TLV：一个是IPv4接口地址子TLV，本地Ipv4接口地址是1.1.1.2；一个是接口信息子TLV，填写接口编号为1。
Router A.1伪节点生成的LSP中，与现有协议生成内容相同，有两个邻居：一个是1111.1111.1111.00(router A.00)，metric是0；另一个是2222.2222.2222.00(router B.00)，metric是0。
(2)广播链路路由计算
路由计算单元收到router A、router B、router A.01生成的LSP后，会为router A和router B进行路由计算：拓扑计算和部分路由计算。
路由计算单元为router A进行路由计算：首先执行SPF算法进行拓扑计算，最终发现到达router B的下一跳信息是router A的出接口1，下一跳网关是1.1.1.2，下一跳出接口从router A的LSP中，邻居为router A.01的接口子TLV中获取，下一跳的网关从router B的LSP中，邻居为router A.01的本地Ipv4接口地址是1.1.1.2获取。那么，router B上的IP可达性信息通过拷贝到达router B的下一跳信息，构成IP可达性信息的下一跳信息，路由计算结束。最后，路由计算单元就会将router A的路由信息发送给router A，router A就使用其路由表进行路由转发。
同样，路由计算单元为router B进行路由计算：首先执行SPF算法进行拓扑计算，最终发现到达router A的下一跳信息是router B的出接口1，下一跳网关是1.1.1.1，下一跳出接口从router B的LSP中，邻居为router A.01的接口信息子TLV中获取，下一跳的网关从router A的LSP中，邻居为router A.01的本地Ipv4接口地址是1.1.1.1获取。那么，router A上的IP可达性信息通过拷贝到达router A的下一跳信息，构成IP可达性信息的下一跳信息，路由计算结束。最后，路由计算单元就会将router B的路由信息发送给router B，router B就使用其路由表进行路由转发。
3、点对点链路相关协议扩展和路由计算
图6是根据本发明实施例一的点对点链路LSP生成情况的示意图，如图6所示，在点对点链路上，router A上编号为1，接口Ipv4地址为1.1.1.1/24的接口，和router B上编号为1，接口Ipv4地址为1.1.1.2/24的接口建立广播网的邻居。假设，router A的system-id是1111.1111.1111，router B的的system-id是2222.2222.2222。
(1)点对点链路协议扩展
router A生成的LSP中会有一个邻居是2222.2222.2222.00(router A.01)，metric默认是10，这个邻居下携带三个子TLV：一个是IPv4接口地址子TLV，本地Ipv4接 口地址是1.1.1.1；另一个是IPv4邻居地址子TLV，本地Ipv4接口地址是1.1.1.2，最后一个是接口信息子TLV，填写接口编号为1。
router B生成的LSP中会有一个邻居是1111.1111.1111.01(router A.01)，metric默认是10，这个邻居下携带三个子TLV：一个是IPv4接口地址子TLV，本地Ipv4接口地址是1.1.1.1；另一个是IPv4邻居地址子TLV，本地Ipv4接口地址是1.1.1.2，最后一个是接口信息子TLV，填写接口编号为1。
(2)点对点链路路由计算
路由计算单元收到router A、router B生成的LSP后，会为router A和router B进行路由计算：拓扑计算和部分路由计算。
路由计算单元为router A进行路由计算：首先执行SPF算法进行拓扑计算，最终发现到达router B的下一跳信息是router A的出接口1，下一跳网关是1.1.1.2：下一跳出接口从router A的LSP中，邻居为router B.00的接口子TLV中获取；下一跳的网关从router B的LSP中，邻居为router A.00的本地Ipv4接口地址是1.1.1.2获取，但是，在获取此网关Ipv4地址之前，必须确认：router A的LSP中，邻居为router B.00的本地Ipv4接口地址是1.1.1.1，和router B的LSP中，邻居为router A.00的邻居Ipv4接口地址是1.1.1.1，这两个Ipv4地址相等，其实就是确认这两个点对点邻居描述信息是处于同一个点对点链路上。那么，router B上的IP可达性信息通过拷贝到达router B的下一跳信息，构成IP可达性信息的下一跳信息，路由计算结束。最后，路由计算单元就会将router A的路由信息发送给router A，router A就使用其路由表进行路由转发。
路由计算单元为router B进行路由计算：首先执行SPF算法进行拓扑计算，最终发现到达router A的下一跳信息是router B的出接口1，下一跳网关是1.1.1.1：下一跳出接口从router B的LSP中，邻居为router A.00的接口子TLV中获取为1；下一跳的网关从router A的LSP中，邻居为router B.00的本地Ipv4接口地址是1.1.1.1获取，但是，在获取此网关Ipv4地址之前，必须确认：router B的LSP中，邻居为router A.00的本地Ipv4接口地址是1.1.1.2，和router A的LSP中，邻居为router B.00的邻居Ipv4接口地址是1.1.1.2，这两个Ipv4地址相等，其实就是确认这两个点对点邻居描述信息是处于同一个点对点链路上。那么，router A上的IP可达性信息通过拷贝到达router A的下一跳信息，构成IP可达性信息的下一跳信息，路由计算结束。最后，路由计算单元就会将router B的路由信息发送给router B，router B就使用其路由表进行路由转发。
在另外一个实施例中，还提供了一种软件，该软件设置为执行上述实施例及优选实施例中描述的技术方案。
在另外一个实施例中，还提供了一种存储介质，该存储介质中存储有上述软件，该存储介质包括但不限于光盘、软盘、硬盘、可擦写存储器等。
显然，本领域的技术人员应该明白，上述的本发明的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，可选地，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本发明不限制于任何特定的硬件和软件结合。
以上所述仅为本发明的优选实施例而已，并不用于限制本发明，对于本领域的技术人员来说，本发明可以有各种更改和变化。凡在本发明的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本发明的保护范围之内。
工业实用性
如上所述，本发明实施例提供的一种基于ISIS的路由计算方法及装置，具有以下有益效果：解决了相关技术中ISIS的路由计算方式占用计算资源较多且易被攻击的问题，达到了降低ISIS的路由计算方式占用的计算资源，并且由于不需要在各个IS之间互相洪泛、同步、保存其他IS的LSP，减少了能够对ISIS进行攻击的机会，提升系统稳定性及可靠性的效果。

Claims (12)

  1. 一种基于中间系统到中间系统协议ISIS的路由计算方法，包括：
    路由计算单元从网络的每个中间系统IS获取链路状态协议数据包LSP报文；
    所述路由计算单元根据所述LSP报文计算所述每个IS的路由表，并将所述路由表发送给所述每个IS。
  2. 根据权利要求1所述的方法，其中，所述LSP报文包括：所述IS的邻居TLV22的每个邻居条目ITEM中包含该邻居所需要的下一跳信息。
  3. 根据权利要求2所述的方法，其中，路由计算单元从网络的每个IS获取LSP报文包括：
    所述路由计算单元从所述每个IS中获取LSP报文，其中，所述LSP报文中包含所述IS的邻居TLV22的每个邻居条目中该邻居的IPv4接口地址子TLV和本地接口信息子TLV，所述本地接口信息子TLV设置为描述到达所述邻居的下一跳信息中的出接口信息；所述IPv4接口地址子TLV设置为描述到达所述邻居的下一跳信息中的网关信息。
  4. 根据权利要求3所述的方法，其中，
    所述IPv4接口地址子TLV包括该邻居所在接口上设置为数据转发的本地IPv4接口地址。
  5. 根据权利要求3所述的方法，其中，
    所述本地接口信息子TLV包括子TLV类型、长度以及邻居所在接口的接口编号。
  6. 根据权利要求3所述的方法，其中，在所述邻居条目为点对点邻居的情况下，所述LSP报文中还包含所述点对点邻居的IPv4邻居地址子TLV。
  7. 根据权利要求6所述的方法，其中，所述邻居IPv4邻居地址子TLV包括该邻居所在接口上设置为数据转发的邻居的IPv4接口地址。
  8. 一种基于中间系统到中间系统协议ISIS的路由计算装置，位于路由计算单元中，包括：
    获取模块，设置为从网络的每个中间系统IS获取链路状态协议数据包LSP报文；
    计算模块，设置为根据所述LSP报文计算所述每个IS的路由表，并将所述路由表发送给所述每个IS。
  9. 根据权利要求8所述的装置，其中，所述LSP报文包括：所述IS的邻居TLV22中每个邻居条目ITEM中包含的该邻居所需要的下一跳信息。
  10. 根据权利要求9所述的装置，其中，所述获取模块还设置为从所述每个IS中获取LSP报文，其中，所述LSP报文中包含所述IS的邻居TLV22的每个邻居条目中该邻居的IPv4接口地址子TLV和本地接口信息子TLV，所述本地接口信息子TLV设置为描述到达所述邻居的下一跳信息中的出接口信息；所述IPv4接口地址子TLV设置为描述到达所述邻居的下一跳信息中的网关信息。
  11. 根据权利要求10所述的装置，其中，在所述邻居条目为点对点邻居的情况下，所述LSP报文中还包含所述点对点邻居的IPv4邻居地址子TLV。
  12. 根据权利要求8至11中任一项所述的装置，其中，
    所述路由计算单元位于全部IS中的部分IS上；或者，
    所述路由计算单元位于预设的路由计算设备中。
PCT/CN2014/089074 2014-07-01 2014-10-21 基于isis的路由计算方法及装置 WO2015154420A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP14888855.5A EP3166264A4 (en) 2014-07-01 2014-10-21 Isis-based routing calculation method and device
US15/323,088 US20170195214A1 (en) 2014-07-01 2014-10-21 ISIS-Based Routing Calculation Method And Device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410311110.XA CN105323163A (zh) 2014-07-01 2014-07-01 基于isis的路由计算方法及装置
CN201410311110.X 2014-07-01

Publications (1)

Publication Number Publication Date
WO2015154420A1 true WO2015154420A1 (zh) 2015-10-15

Family

ID=54287188

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/089074 WO2015154420A1 (zh) 2014-07-01 2014-10-21 基于isis的路由计算方法及装置

Country Status (4)

Country Link
US (1) US20170195214A1 (zh)
EP (1) EP3166264A4 (zh)
CN (1) CN105323163A (zh)
WO (1) WO2015154420A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116192657A (zh) * 2022-12-29 2023-05-30 中国联合网络通信集团有限公司 一种网络isis路由扩散模拟方法及装置

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109309616B (zh) * 2017-07-27 2022-03-01 中兴通讯股份有限公司 基于isis协议的通告方法及装置
CN107196856A (zh) * 2017-07-31 2017-09-22 杭州迪普科技股份有限公司 一种确定路由转发路径的方法和装置
CN107733917B (zh) * 2017-11-09 2020-07-24 上海海事大学 一种指定目标结点集合的k最大概率攻击路径的渐进式求解方法
CN107911298B (zh) * 2017-12-29 2020-03-06 杭州迪普科技股份有限公司 一种基于isis的路由重分布的方法及装置
FR3081645A1 (fr) * 2018-06-28 2019-11-29 Orange Procede de communication mis en œuvre par un premier routeur d'un systeme autonome utilisant un protocole de routage interne
CN113746747B (zh) * 2021-08-31 2023-05-30 烽火通信科技股份有限公司 一种lsp报文流量控制方法及系统
CN115499361B (zh) * 2022-07-29 2023-08-04 天翼云科技有限公司 路由数据的处理方法及装置、存储介质、处理器

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101453405A (zh) * 2007-11-30 2009-06-10 华为技术有限公司 建立路由的方法、系统和控制管理设备
CN103188149A (zh) * 2011-12-28 2013-07-03 中国移动通信集团广东有限公司 一种路由计算方法和路由器
US20130336164A1 (en) * 2012-06-15 2013-12-19 Cisco Technology, Inc. System and method for virtual portchannel load balancing in a trill network
CN103701696A (zh) * 2013-12-31 2014-04-02 杭州华三通信技术有限公司 一种is-is协议中支持转发地址的方法及其装置

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5467345A (en) * 1994-05-31 1995-11-14 Motorola, Inc. Packet routing system and method therefor
US7460481B2 (en) * 2004-12-01 2008-12-02 Cisco Technology, Inc. Inter-domain TE-LSP with IGP extensions
US7554996B2 (en) * 2005-09-14 2009-06-30 Cisco Technology, Inc. Controlled distribution of inter-area routing information
US7751336B2 (en) * 2006-06-08 2010-07-06 Cisco Technology, Inc. Technique for efficiently avoiding transient routing disturbances in link state routing protocols with link state packet fragmentation
CN103888359B (zh) * 2012-12-21 2017-04-12 杭州华三通信技术有限公司 路由计算方法及网络设备
CN103236990B (zh) * 2013-05-13 2016-10-05 杭州华三通信技术有限公司 一种路由信息同步的方法和设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101453405A (zh) * 2007-11-30 2009-06-10 华为技术有限公司 建立路由的方法、系统和控制管理设备
CN103188149A (zh) * 2011-12-28 2013-07-03 中国移动通信集团广东有限公司 一种路由计算方法和路由器
US20130336164A1 (en) * 2012-06-15 2013-12-19 Cisco Technology, Inc. System and method for virtual portchannel load balancing in a trill network
CN103701696A (zh) * 2013-12-31 2014-04-02 杭州华三通信技术有限公司 一种is-is协议中支持转发地址的方法及其装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3166264A4 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116192657A (zh) * 2022-12-29 2023-05-30 中国联合网络通信集团有限公司 一种网络isis路由扩散模拟方法及装置

Also Published As

Publication number Publication date
EP3166264A1 (en) 2017-05-10
CN105323163A (zh) 2016-02-10
US20170195214A1 (en) 2017-07-06
EP3166264A4 (en) 2017-08-09

Similar Documents

Publication Publication Date Title
WO2015154420A1 (zh) 基于isis的路由计算方法及装置
US10541905B2 (en) Automatic optimal route reflector root address assignment to route reflector clients and fast failover in a network environment
US9887902B2 (en) Traffic switching method, device, and system
US9660897B1 (en) BGP link-state extensions for segment routing
US9288686B2 (en) Topology discovery based on SCTP/X2 snooping
US20140211800A1 (en) Accelerated MAC address resolution for IPv6 traffic with IS-IS Protocol
US8667174B2 (en) Method and system for survival of data plane through a total control plane failure
EP3058777B1 (en) Topology discovery based on explicit signaling
WO2012103731A1 (zh) 路由器邻居建立方法和设备
WO2015154427A1 (zh) Trill isis的路由计算方法及装置
US20230231795A1 (en) Method for Synchronizing Topology Information in SFC Network, and Routing Network Element
EP3157211B1 (en) Isis-based flooding method and device
EP4152701A1 (en) Routing processing method and related device
WO2017000566A1 (zh) 一种获取设备接口mru值的方法及装置
WO2016184022A1 (zh) Ip可达性信息通告方法、路由确定方法及装置
US20200036617A1 (en) Black hole filtering
WO2012163103A1 (en) Method for handling link state advertisement and router

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14888855

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2014888855

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2014888855

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 15323088

Country of ref document: US