WO2017162202A1 - 链路状态信息处理 - Google Patents

链路状态信息处理 Download PDF

Info

Publication number
WO2017162202A1
WO2017162202A1 PCT/CN2017/078064 CN2017078064W WO2017162202A1 WO 2017162202 A1 WO2017162202 A1 WO 2017162202A1 CN 2017078064 W CN2017078064 W CN 2017078064W WO 2017162202 A1 WO2017162202 A1 WO 2017162202A1
Authority
WO
WIPO (PCT)
Prior art keywords
interface
spine
node
lsp
leaf
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.)
Ceased
Application number
PCT/CN2017/078064
Other languages
English (en)
French (fr)
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.)
New H3C Technologies Co Ltd
Original Assignee
New H3C 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 New H3C Technologies Co Ltd filed Critical New H3C Technologies Co Ltd
Publication of WO2017162202A1 publication Critical patent/WO2017162202A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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/32—Flooding

Definitions

  • the present disclosure relates to link state information processing.
  • IS-IS The Intermediate System-to-Intermediate System
  • ISO International Organization for Standardization
  • CLNP Connection-Less Network Protocol Routing Protocol
  • IP Internet Engineering Task Force
  • IETF Internet Engineering Task Force
  • RRC Request For Comments
  • TCP Transmission Control Protocol
  • OSI Open System Interconnection
  • Integrated IS- IS Integrated IS- IS
  • Dual IS-IS Dual IS-IS
  • IS-IS belongs to the Interior Gateway Protocol (IGP) and is used inside the autonomous system.
  • IS-IS is a link state protocol that uses the Shortest Path First (SPF) algorithm for route calculation.
  • SPF Shortest Path First
  • a spine node in a data center network, can represent a core switch, and a leaf node can represent an access switch. If the IS-IS routing protocol is run on the data center network, the Spine node receives the Link State Protocol (LSP) packet from the Leaf node. The LSPs are flooded to all the leaf nodes. The leaf nodes also flood the Spine nodes after receiving the LSPs.
  • LSP Link State Protocol
  • FIG. 1 is a schematic flowchart diagram of a link state information processing method according to an example of the present disclosure.
  • FIG. 2 is a schematic flowchart diagram of a link state information processing method according to another example of the present disclosure.
  • FIG. 3 is a schematic diagram of a data center networking architecture according to an example of the present disclosure.
  • FIG. 4 is a schematic diagram of a hardware structure of a link state information processing apparatus according to an example of the present disclosure.
  • FIG. 5 is a functional block diagram of control logic of link state information processing according to an example of the present disclosure.
  • FIG. 6 is a schematic diagram of a hardware structure of a link state information processing apparatus according to another example of the present disclosure.
  • FIG. 7 is a functional block diagram of control logic of link state information processing according to another example of the present disclosure.
  • FIG. 8 is a functional block diagram of control logic of link state information processing according to another example of the present disclosure.
  • the network may be divided into flooding domains in advance, and a flooding domain may include at least one Spine node and at least A Leaf node.
  • the multiple leaf nodes that access the Spine node can belong to different flooding domains.
  • the Spine node can determine the flooding domain to which the corresponding leaf interface belongs to the node according to the flooding domain to which the connected leaf node belongs.
  • the leaf node can determine the corresponding Spine interface on the node according to the flooding domain to which the connected Spine node belongs.
  • the leaf interface is the interface connected to the leaf node on the Spine node.
  • the Spine interface is the interface connected to the Spine node on the leaf node.
  • FIG. 1 is a schematic flowchart diagram of a link state information processing method according to an example of the present disclosure.
  • the link state information processing method can be applied to a Spine node. As shown in FIG. 1, the link state information processing method may include the following steps.
  • the Spine node receives the first LSP packet from the Leaf interface, and performs route calculation according to each received first LSP packet.
  • the Leaf interface is the interface connected to the Leaf node on the Spine node.
  • the first LSP packet is an LSP packet received by the Spine node from the Leaf node connected to the node. After receiving the first LSP packet from the leaf node, the Spine node does not flood the first LSP packet to other leaf nodes, but performs routing calculation according to each received first LSP packet.
  • step 102 the Spine node selects a target route from all the calculated routes.
  • the Spine node may traverse all the calculated routes and select a target route.
  • the outbound interface type of the selected target route is the Leaf interface.
  • the outbound interface type of the selected destination route is the leaf interface, and the outbound interface belongs to the same flooding domain. That is, the routes with the outbound interface type are all based on the flooding domain to which the outbound interface belongs.
  • step 103 the Spine node encapsulates the selected target route through the second LSP packet to all the Leaf nodes connected to the Spine node.
  • the destination route is packaged and flooded through the second LSP.
  • the outbound interface type of the destination route carried in the flooded second LSP is the leaf interface.
  • the outbound interface of the target route in the flooded second LSP is the leaf interface, and the outbound interface belongs to the same flooding domain.
  • the identifier of the flood domain may be added to the second LSP packet.
  • the second LSP packet carrying the flooding domain identifier is recorded as a second type of LSP packet, and the LSP packet not carrying the flooding domain identifier is recorded as the second type LSP.
  • the Spine node receives a large number of first LSPs from the Leaf node.
  • the calculated route and the number of selected destination routes are large. Therefore, a second LSP cannot carry all the targets. Routes, then all target routes can be packaged separately through two or more second LSPs for flooding.
  • the Spine node floods the second LSP with all the connected leaf nodes.
  • the processing flow after the leaf node receives the second LSP packet flooded by the Spine node will be described below, and details are not described herein again.
  • the Spine node does not need to perform flooding every time the LSP packet of the Leaf node is received, but calculates a route according to each received LSP packet, and calculates the route based on the received LSP.
  • the LSPs generated by the destination route in the outbound route are flooded. In this way, the number of LSPs flooded in the data center network can be effectively reduced, and system resources are saved.
  • FIG. 2 is a schematic flowchart diagram of a link state information processing method according to another example of the present disclosure.
  • the link state information processing method can be applied to a Leaf node. As shown in FIG. 2, the link state information processing method may include the following steps.
  • step 201 the Leaf node receives the second LSP packet from the first Spine interface.
  • the second LSP message received by the Leaf node is the LSP message flooded by the Spine node in the example of FIG.
  • the Spine interface is the interface connected to the Spine node on the Leaf node.
  • the Spine interface that receives the second LSP packet is recorded as the first Spine interface.
  • the leaf node can receive at least one second LSP message, and the leaf node performs the same flooding process for each second LSP message received.
  • This example uses any second LSP message received by the leaf node as an example. Be explained.
  • step 202 the Leaf node determines the flooding domain to which all the second Spine interfaces belong to the node.
  • any Spine interface on the Leaf node except the first Spine interface is recorded as the second Spine interface.
  • the leaf node can traverse all the second Spine interfaces on the node to confirm the flooding domain to which the second Spine interface belongs.
  • the flooding domain corresponding to the flooding domain identifier is different from the flooding domain of the second Spine interface
  • the flooding domain corresponding to the flooding domain identifier is different from the flooding domain of the second Spine interface.
  • the leaf node floods the second LSP packet by using the second Spine interface.
  • the second LSP packet flooded by the Spine node may carry the identifier of the flood domain or may not carry the identifier of the flood domain.
  • the leaf node If the second LSP packet received by the leaf node is a type of second LSP packet carrying the flooding domain identifier, the source of the target route carried in the leaf node belongs to the flooding domain. At this time, the leaf node performs the flooding of the second LSP packet for the second Spine interface that does not belong to the flooding domain. For the non-Spine interface that does not belong to the flooding domain, the leaf node also performs the second LSP report. Flooding of the text; for the second Spine interface that belongs to the flooding domain, the Leaf node refuses to flood the second LSP. In this way, the number of flooding of LSP packets can be effectively reduced, thereby saving system resources.
  • the leaf node passes the second LSP packet that does not carry the flooding domain identifier.
  • the second Spine interface floods the second type of second LSP packet.
  • the leaf node needs to compare the flooding domain to which the first Spine interface and the second Spine interface belong. If the second Spine interface is different from the flooding domain to which the first Spine interface belongs, the leaf node floods the second LSP with the second Spine interface; if the second Spine interface and the first Spine interface belong to the same flooding domain The leaf node does not flood the second LSP packet through the second Spine interface. In this way, the number of flooding of LSP packets can be effectively reduced, thereby saving system resources.
  • the leaf node may receive only the second type of LSPs carrying the flooding domain identifier, or may receive only the second type of LSPs that do not carry the flooding domain identifier.
  • Receiving a second type of LSP message and receiving a second type of second LSP message In the case that only one type of second LSP message is received, the Leaf node may directly perform step 203. In the case that only the second type LSP is received, the Leaf node may directly perform step 204. However, in the case that a second type of LSP message may be received, and the second type of LSP message may be received, the leaf node needs to determine whether the received second LSP message carries the flooding domain identifier. And corresponding to the second LSP packet type, and performing step 203 or step 204 according to the determined second LSP packet type.
  • the second LSP message received by the leaf node may also carry the source information of the target route, where the source information is used to identify the creator information of each target route carried in the second LSP message.
  • the source information may be carried in an extended TLV (Type-Length-Value) of the second LSP.
  • the leaf node After receiving the second LSP packet from the first Spine interface, the leaf node can obtain the source information of the destination route in the second LSP packet, and determine whether the target route is generated by the source information according to the source information. If yes, the Leaf node can refuse to perform route calculation based on the target route to reduce the workload of route calculation and avoid loop loop generation; if not, the Leaf node can perform route calculation according to the target route.
  • the leaf node can determine whether the second LSP packet needs to be flooded from the second Spine interface on the local node, and then determine whether the route calculation needs to be performed.
  • the Leaf node can first determine whether a route calculation is needed, and then judge The second LSP packet needs to be flooded from the second Spine interface on the local node. Or, both can be carried out simultaneously.
  • FIG. 3 is a schematic structural diagram of a data center networking according to an example of the present disclosure.
  • the data center networking is a flooding domain 300.
  • the reference signs C1 and C2 may be core switches in the data center networking, that is, Spine nodes.
  • Reference numerals L1, L2, ..., L100 may be access switches in the data center network, that is, Leaf nodes.
  • the core switches C1 and C2 and the access switches L1, L2, ..., L100 run the IS-IS protocol.
  • the configuration on the access switch L1 the network-id (network identifier) of the IS-IS is 50.0000.0000.0001.00, and the loopback interface address is 1.1.1.1/32.
  • the configuration on the access switch L2 is: the network-id of the IS-IS is 50.0000.0000.0002.00, and the loopback interface address is 2.2.2.2/32.
  • IS-IS network-id is 50.0000.0000.0003.00
  • loopback interface address is 3.3.3.3/32.
  • IS-IS network-id is 50.0000.0000.0100.00
  • loopback interface address is 100.100.100.100/32.
  • IS-IS network-id is 50.0200.0000.0001.00
  • loopback interface address is 100.1.1.1/32.
  • IS-IS network-id is 50.0200.0000.0002.00
  • loopback interface address is 100.2.2.2/32.
  • the access switch L1 establishes an IS-IS neighbor relationship with the core switches C1 and C2, and advertises the route whose destination address is the loopback interface 1.1.1.1.
  • the following may be referred to as 1.1.1.1 route;
  • An IS-IS neighbor is established between the access switch L2 and the core switches C1 and C2, and the 2.2.2.2 route is advertised.
  • An IS-IS neighbor is established between the access switch L3 and the core switches C1 and C2, and the 3.3.3.3 route is advertised.
  • An IS-IS neighbor is established between the access switch L100 and the core switches C1 and C2, and the 100.100.100.100 route is advertised.
  • the first LSP message generated by the access switch L1 includes a 1.1.1.1 route, and is sent to the core switches C1 and C2;
  • the first LSP packet generated by the access switch L2 includes a 2.2.2.2 route and is sent to the core switches C1 and C2.
  • the first LSP packet generated by the access switch L3 includes a 3.3.3.3 route and is sent to the core switches C1 and C2.
  • the first LSP message generated by the access switch L100 includes a route of 100.100.100.100 and is sent to the core switches C1 and C2.
  • the core switch C1 After receiving the first LSPs sent by the access switches L1 to L100, the core switch C1 does not flood the 100 first LSPs to the access switches L1 to L100.
  • the core switch C2 After receiving the first LSPs of the first LSP sent by the access switches L1 to L100, the core switch C2 does not flood the 100 first LSPs to the access switches L1 to L100.
  • the core switch C1 performs route calculation based on the received 100 first LSPs. Since the type of the outbound interface of the calculated route is a leaf interface, the core switch C1 can package the destination routes together through a second LSP. The flooding is provided to the access switches L1 to L100. The outbound interface of the 100 target routes belongs to the flooding domain 300, and the core switch C1 can also report in the second LSP. The identifier of the flooding domain 300 is added in the text. A second LSP with a length of 1500 bytes can carry the 100 routes.
  • the core switch C2 can also perform route calculation based on the received 100 first LSPs. Since the type of the outbound interface of the calculated route is a leaf interface, the core switch C2 can package the destination routes through the same. A second LSP packet is flooded to the access switches L1 to L100. The outbound interface of the 100 target routes belongs to the flooding domain 300. The core switch C1 can also add the identifier of the flooding domain 300 to the second LSP.
  • the core switches C1 and C2 carry the target route in the second LSP, and carry the source information of the target route in the second LSP.
  • the route source is the access switch L1
  • the source information corresponding to the 1.1.1.1 route carried in the second LSP packet may be the network-id of the access switch L1, that is, 50.0000.0000.0001. .00.
  • the route source is the access switch L2
  • the source information corresponding to the 2.2.2.2 route in the second LSP packet may be the network-id of the access switch L2, that is, 50.0000.0000.0002.00.
  • the routing source is the access switch L100
  • the source information corresponding to the 100.100.100.100 route in the second LSP packet may be the network-id of the access switch L100, that is, 50.0000.0000.0100. .00.
  • the core switches C1 and C2 can only flood a second LSP message to the access switches L1 to L100, respectively, when 100 first LSPs are received. In this way, compared with the access switches L1 to L100, the number of flooded LSPs is significantly reduced, which saves system resources.
  • the access switch L1 After the access switch L1 receives the second LSP packet flooded by the core switch C1, the access switch L1 will not be connected because the access switch L1 and the Spine interface connected to the core switches C1 and C2 belong to the same flooding domain 300.
  • the second LSP packet is flooded to the core switch C2.
  • the access switches L2 to L100 will not flood the second LSP received from the core switch C1 to the core. Switch C2. Therefore, the number of flooded packets in the data center networking is further reduced, and system resources are saved.
  • the second LSP packet sent by the core switches C1 and C2 can obtain the source information of each route in the second LSP, and is not the source of the route indicated by the source information. Perform route calculation, and perform route calculation when it is not the source of the route indicated by the source information. For example, the access switch L1 can calculate the 2.2.2.2 route, ..., 100.100.100.100 route, and the route source of the 1.1.1.1 route is not calculated by the access switch L1 itself. When the access switch L1 performs route calculation through the second LSP packet sent by the core switches C1 and C2, the routes to 2.2.2.2, ..., and 100.100.100.100 can be calculated, and the next hop is the core switches C1 and C2. At the price, the access switch L1 does not calculate the wraparound path.
  • the Spine node when the Spine node receives the LSP packet from the Leaf node, the Spine node does not immediately flood the LSP packet to other Leaf nodes, but according to the The LSPs are routed, and the destination routes are selected from the calculated routes.
  • the destination routes are encapsulated and flooded to all Leaf nodes through LSPs. In this way, the number of LSPs flooded in the flooding domain can be effectively reduced, and system resources are saved.
  • the link state information processing apparatus can include a processor 41 and a machine readable storage medium 42.
  • the processor 41 and the machine readable storage medium 42 are usually connected to each other by an internal bus 43.
  • the device may also include an external interface 44 to enable communication with other devices or components.
  • the machine readable storage medium 42 can be: ROM (Read-Only Memory), volatile memory, non-volatile memory, flash memory, storage drive (eg, hard drive), solid state Hard disk, any type of storage disk (such as CD, DVD, etc.), or similar Storage medium, or a combination thereof.
  • ROM Read-Only Memory
  • volatile memory volatile memory
  • non-volatile memory flash memory
  • storage drive eg, hard drive
  • solid state Hard disk any type of storage disk (such as CD, DVD, etc.), or similar Storage medium, or a combination thereof.
  • machine-readable storage medium 42 stores machine-executable instructions corresponding to control logic 50 for link state information processing.
  • the control logic 50 can include a receiving unit 510, a routing computing unit 520, a selecting unit 530, and a flooding unit 540.
  • the receiving unit 510 is configured to receive the first link state message LSP message from the leaf Leaf interface.
  • the leaf interface is an interface connected to the leaf node on the Spine node, and the first LSP packet is an LSP packet received from a Leaf node connected to the Spine node.
  • the route calculation unit 520 is configured to perform route calculation according to each of the received first LSP messages.
  • the selecting unit 530 is configured to select a target route from all the calculated routes.
  • the flooding unit 540 is configured to package the selected target route and flood the second LSP packet to the Leaf node connected to the Spine node.
  • the outbound interface type of the target route selected by the selecting unit 530 is a Leaf interface.
  • the outbound interface type of the target route selected by the selecting unit 530 is a Leaf interface, and the outbound interface belongs to the same flooding domain.
  • the flooding unit 540 may be further configured to carry the target route belonging to the same flooding domain in the same second LSP according to the flooding domain to which the outbound interface of the target route belongs. And adding a corresponding flooding domain identifier to the second LSP packet.
  • the second LSP packet may also carry the routing source information, so that the leaf node that receives the second LSP packet may determine that it is not the target in the second LSP packet.
  • the route source indicated by the route source information indicates the route, the route calculation can be performed according to the target route.
  • FIG. 6 is a schematic diagram of a hardware structure of a link state information processing apparatus according to an example of the present disclosure.
  • the apparatus may be applied to a Leaf node in the above method embodiment.
  • the link state information processing apparatus can include a processor 61 and a machine readable storage medium 62.
  • the processor 61 and the machine readable storage medium 62 are usually connected to each other by an internal bus 63.
  • the device may also include an external interface 64 to enable communication with other devices or components.
  • the machine readable storage medium 62 can be: ROM (Read-Only Memory), volatile memory, non-volatile memory, flash memory, storage drive (eg, hard drive), solid state Hard disk, any type of storage disk (such as a compact disc, DVD, etc.), or similar storage medium, or a combination thereof.
  • ROM Read-Only Memory
  • volatile memory non-volatile memory
  • flash memory storage drive (eg, hard drive), solid state Hard disk, any type of storage disk (such as a compact disc, DVD, etc.), or similar storage medium, or a combination thereof.
  • storage drive eg, hard drive
  • solid state Hard disk any type of storage disk (such as a compact disc, DVD, etc.), or similar storage medium, or a combination thereof.
  • control logic 70 may include a receiving unit 710, a traversing unit 720, a determining unit 730, and a transmitting unit 740.
  • the receiving unit 710 is configured to receive a second link state message LSP message from the first Spine interface.
  • the Spine interface is the interface connected to the Spine node on the leaf Leaf node.
  • the second LSP message is the foregoing LSP packet packed with the target route received from the Spine node connected to the Leaf node.
  • the first Spine interface is a Spine interface that receives the second LSP packet.
  • the traversing unit 720 is configured to traverse all the second Spine interfaces on the leaf node except the first Spine interface, and determine the flooding domain to which the second Spine interface belongs.
  • the second Spine interface is any Spine interface on the leaf node except the first Spine interface.
  • the determining unit 730 when receiving the second LSP message carrying the flooding domain identifier, the determining unit 730 may be configured to determine whether the second Spine interface belongs to the flooding domain corresponding to the flooding domain identifier. In this way, if the determination result of the determining unit 730 is no, that is, the second Spine interface does not belong to the flooding domain corresponding to the flooding domain identifier carried in the second LSP, the sending unit 740 can be used to pass the The second Spine interface floods the second LSP packet.
  • the determining unit 730 is configured to determine whether the second Spine interface is the same as the first Spine interface, when the second LSP packet is received. A flood of floods. In this manner, if the second Spine interface and the first Spine interface are not in the same flooding domain, the sending unit 740 can flood the second LSP packet through the second Spine interface.
  • the sending unit 740 may be specifically configured to: if the received second LSP message carries a flooding domain identifier, and the flooding domain corresponding to the flooding domain identifier belongs to the second Spine interface When the flooding domain is different, the second LSP packet is flooded by the second Spine interface; or the second LSP packet does not carry the flooding domain identifier, and the second Spine interface is When the first Spine interface is not in the same flooding domain, the second LSP packet is flooded by the second Spine interface.
  • the received second LSP message may also carry route source information.
  • the link state information processing control logic 70 may further include an obtaining unit 750 and a route calculating unit 760.
  • the obtaining unit 750 is configured to obtain routing source information of the target route carried in the received second LSP packet.
  • the route calculation unit 760 is configured to perform route calculation according to the target route when determining, according to the route source information, a route source that is not indicated by the route source information of the target route by the leaf node itself.
  • the device embodiment since it basically corresponds to the method embodiment, reference may be made to the partial description of the method embodiment.
  • the device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, ie may be located A place, or it can be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the objectives of the present disclosure. Those of ordinary skill in the art can understand and implement without any creative effort.
  • the Spine node receives the LSP from the Leaf node from the Leaf interface
  • the LSP is not flooded to other Leaf nodes.
  • the route is calculated based on the received LSPs.
  • the destination route in the calculated route is encapsulated through an LSP. Flooding all Leaf nodes connected to this Spine node. Therefore, in the data center networking, the number of LSPs flooded can be reduced, and system resources are saved.

Landscapes

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

Abstract

公开了一种链路状态信息处理方法及装置。根据所述方法的一个示例，Spine节点在从Leaf接口接收第一链路状态报文LSP报文后，根据所述第一LSP报文进行路由计算，并将计算出的路由中出接口为Leaf接口的目标路由携带在第二LSP报文中。这样，一个所述第二LSP报文中可携带多个所述目标路由。接着，所述Spine节点将所述第二LSP报文泛洪给Leaf节点。

Description

链路状态信息处理
相关申请的交叉引用
本专利申请要求于2016年3月25日、申请号为201610182617.9的中国专利申请的优先权，该申请的全文以引用的方式并入本文中。
背景技术
本公开涉及链路状态信息处理。
中间系统到中间系统(Intermediate System-to-Intermediate System，IS-IS)最初是国际标准化组织(International Organization for Standardization，ISO)为无连接网络协议(Connection-Less Network Protocol，CLNP)设计的一种动态路由协议。
为了提供对互联网协议(Internet Protocol，IP)的路由支持，互联网工程任务组(Internet Engineering Task Force，IETF)在一系列以编号排定的文件(Request For Comments，RFC)1195中对IS-IS进行了扩充和修改，使它能够同时应用在传输控制协议(Transmission Control Protocol，TCP)/IP和开放式系统互联(Open System Interconnection，OSI)环境中，可称为集成化IS-IS(Integrated IS-IS)或双IS-IS(Dual IS-IS)。
IS-IS属于内部网关协议(Interior Gateway Protocol，IGP)，用于自治系统内部。IS-IS是一种链路状态协议，可使用最短路径优先(Shortest Path First，SPF)算法进行路由计算。
例如，在数据中心组网中，脊柱(Spine)节点可表示核心交换机，叶子(Leaf)节点可表示接入交换机。若在上述数据中心组网中运行IS-IS路由协议，当Spine节点从Leaf节点接收到链路状态协议(Link State Protocol，LSP)报文 后，会向所有Leaf节点泛洪LSP报文；相应地，Leaf节点接收到LSP报文后，也会向所有Spine节点泛洪。
附图说明
图1是根据本公开一示例提供的一种链路状态信息处理方法的流程示意图。
图2是根据本公开另一示例提供的一种链路状态信息处理方法的流程示意图。
图3是根据本公开一示例提供的一种数据中心组网架构示意图。
图4是根据本公开一示例提供的一种链路状态信息处理装置的硬件结构示意图。
图5是根据本公开一示例提供的一种链路状态信息处理的控制逻辑的功能模块框。
图6是根据本公开另一示例提供的一种链路状态信息处理装置的硬件结构示意图。
图7是根据本公开另一示例提供的一种链路状态信息处理的控制逻辑的功能模块框图。
图8是根据本公开另一示例提供的一种链路状态信息处理的控制逻辑的功能模块框图。
具体实施方式
下面结合附图对本公开示例的技术方案作详细的说明。
在进行本公开示例的技术方案的说明之前，先对泛洪域进行介绍。可以预先对网络进行泛洪域的划分，一个泛洪域可以包括至少一个Spine节点和至少 一个Leaf节点。其中，接入Spine节点的多个Leaf节点可以分别属于不同的泛洪域。Spine节点可根据所连接的Leaf节点所属的泛洪域确定本节点上对应的Leaf接口所属的泛洪域；Leaf节点可根据所连接的Spine节点所属的泛洪域确定本节点上对应的Spine接口所属的泛洪域。Leaf接口为Spine节点上与Leaf节点相连的接口；Spine接口为Leaf节点上与Spine节点相连的接口。
请参见图1，为根据本公开一示例提供的一种链路状态信息处理方法的流程示意图。该链路状态信息处理方法可以应用于Spine节点。如图1所示，该链路状态信息处理方法可以包括以下步骤。
在步骤101、Spine节点从Leaf接口接收第一LSP报文，根据接收到的每个第一LSP报文进行路由计算。
Leaf接口为该Spine节点上与Leaf节点相连的接口。第一LSP报文为Spine节点从与本节点相连接的Leaf节点接收到的LSP报文。该Spine节点从一个Leaf节点接收到第一LSP报文后，不会将该第一LSP报文泛洪给其他leaf节点，而是根据接收到的每个第一LSP报文进行路由计算。
在步骤102、所述Spine节点从计算出的所有路由中选择目标路由。
Spine节点在根据接收到的每个第一LSP报文进行路由计算之后，可以遍历所计算出的所有路由，从中选出目标路由。
在一个示例中，选择出的目标路由的出接口类型均为Leaf接口。
在另一个示例中，选择出的目标路由的出接口类型均为Leaf接口、且出接口属于同一个泛洪域。即：将计算出的出接口类型均为Leaf接口的路由按照出接口所属的泛洪域进行划分。
需要说明的是，与Spine节点连接的除了Leaf节点还可存在其他类型的节点，因此，在Spine节点上除了Leaf接口还可存在其他类型的接口，而在本示例中，仅将出接口类型为Leaf接口的路由作为目标路由。
在步骤103、Spine节点将选择出的目标路由打包通过第二LSP报文泛洪给与本Spine节点连接的所有Leaf节点。
Spine节点选择出目标路由后，将目标路由打包通过第二LSP报文进行泛洪。
在一个示例中，泛洪的第二LSP报文中携带的目标路由的出接口类型均为Leaf接口。
在一个示例中，泛洪的第二LSP报文中目标路由的出接口类型均为Leaf接口、且出接口属于同一个泛洪域。此时，还可以在第二LSP报文添加该泛洪域的标识。为了方便描述，以下可将携带泛洪域标识的第二LSP报文记为一类第二LSP报文，将不携带泛洪域标识的LSP报文记为二类第二LSP报文。
在一些场景下，Spine节点会接收到来自Leaf节点的大量第一LSP报文，由此计算出的路由、以及选择出的目标路由数量巨大，则可能一个第二LSP报文无法承载全部的目标路由，那么可以将全部的目标路由分别打包通过两个或更多的第二LSP报文进行泛洪。
Spine节点向连接的所有Leaf节点泛洪该第二LSP报文。其中，Leaf节点接收到Spine节点泛洪的第二LSP报文后的处理流程将在下文中描述，在此不再赘述。
在图1所描述的方法流程中，Spine节点不需要每次接收到Leaf节点的LSP报文时立即进行泛洪，而是根据所接收到的每个LSP报文计算路由，并对基于所计算出路由中的目标路由打包生成的LSP报文进行泛洪。这样，可有效减少数据中心组网中LSP报文的泛洪数量，节省了系统资源。
请参见图2，为根据本公开另一示例提供的一种链路状态信息处理方法的流程示意图。该链路状态信息处理方法可以应用于Leaf节点。如图2所示，该链路状态信息处理方法可以包括以下步骤。
在步骤201、Leaf节点从第一Spine接口接收第二LSP报文。
这里，Leaf节点接收到的第二LSP报文即为图1示例中Spine节点泛洪的LSP报文。Spine接口为Leaf节点上与Spine节点相连的接口。为了方便描述，将接收到第二LSP报文的Spine接口记为第一Spine接口。
Leaf节点可以接收到至少一个第二LSP报文，Leaf节点对接收到的每个第二LSP报文执行的泛洪处理相同，本示例以Leaf节点接收到的任意一个第二LSP报文为例进行说明。
在步骤202、Leaf节点确定本节点上所有第二Spine接口所属的泛洪域。
为了方便描述，将Leaf节点上除了上述第一Spine接口外的任一Spine接口记为第二Spine接口。Leaf节点可以遍历本节点上的所有第二Spine接口，确认各第二Spine接口所属的泛洪域。
在步骤203、在接收到携带有泛洪域标识的一类第二LSP报文时，若所述泛洪域标识对应的泛洪域与所述第二Spine接口所属的泛洪域不同，则所述Leaf节点通过所述第二Spine接口泛洪所述一类第二LSP报文。
对应图1的示例，Spine节点泛洪的第二LSP报文中可能携带泛洪域的标识，也可能不携带泛洪域的标识。
如果Leaf节点接收到的第二LSP报文为携带有泛洪域标识的一类第二LSP报文，则说明其中携带的目标路由的来源均属于该泛洪域。此时，对于不属于该泛洪域的第二Spine接口，Leaf节点进行该第二LSP报文的泛洪，对于不属于该泛洪域的非Spine接口，Leaf节点也进行该第二LSP报文的泛洪；对于属于该泛洪域的第二Spine接口，Leaf节点拒绝泛洪该第二LSP报文。这样，可有效减少LSP报文的泛洪数量，从而节省了系统资源。
在步骤204、在接收到未携带泛洪域标识的二类第二LSP报文时，若所述第二Spine接口与所述第一Spine接口所属的泛洪域不同，则所述Leaf节点通过所述第二Spine接口泛洪所述二类第二LSP报文。
如果Leaf节点接收到的第二LSP报文为未携带泛洪域标识的二类第二 LSP报文，则Leaf节点需要比较第一Spine接口和第二Spine接口所属的泛洪域。若第二Spine接口与第一Spine接口所属的泛洪域不同，则Leaf节点通过该第二Spine接口泛洪该第二LSP报文；若第二Spine接口与第一Spine接口属于同一泛洪域，则Leaf节点不会通过该第二Spine接口泛洪该第二LSP报文。这样，可有效减少LSP报文的泛洪数量，从而节省了系统资源。
根据Spine节点端的配置，Leaf节点有可能仅接收到携带有泛洪域标识的一类第二LSP报文，也可能仅接收到未携带泛洪域标识的二类第二LSP报文，还可能既接收一类第二LSP报文又接收二类第二LSP报文。在仅可能接收到一类第二LSP报文的情况下，Leaf节点可直接执行步骤203。在仅可能接收到二类第二LSP报文的情况下，Leaf节点可直接执行步骤204。然而，在既可能接收到一类第二LSP报文又可能接收到二类第二LSP报文的情况下，Leaf节点需根据所接收到的第二LSP报文是否携带泛洪域标识来确定对应的第二LSP报文类型，并根据所确定的第二LSP报文类型相应地执行步骤203或步骤204。
此外，Leaf节点接收到的第二LSP报文中可能还携带有目标路由的来源信息，该来源信息用于标识第二LSP报文中携带的各目标路由的产生者信息。该来源信息可以携带在第二LSP报文的扩展TLV(Type-Length-Value，长度类型值)中。
Leaf节点从第一Spine接口接收到第二LSP报文后，可以获取该第二LSP报文中携带目标路由的来源信息，并根据该来源信息判断自身是否为该来源信息指示的目标路由的产生者；若是，则Leaf节点可以拒绝根据该目标路由进行路由计算，以降低路由计算的工作量，并避免环回路由的产生；若否，Leaf节点可以根据目标路由进行路由计算。
值得说明的是，Leaf节点从第一Spine接口接收到第二LSP报文之后，泛洪处理与路由计算之间并不存在必然的时序关系。例如，Leaf节点可以先判断是否需要从本节点上第二Spine接口泛洪该第二LSP报文，后判断是否需要进行路由计算。或者，Leaf节点可以先判断是否需要进行路由计算，后判断是 否需要从本节点上第二Spine接口泛洪该第二LSP报文。亦或者，二者可以同时进行。
为了使本领域技术人员更好地理解本公开示例的技术方案，下面结合应用场景对本公开示例的技术方案进行描述。
请参见图3，为根据本公开示例提供的一种数据中心组网的架构示意图。该数据中心组网为一个泛洪域300。其中，附图标记C1和C2可为该数据中心组网中的核心交换机，即Spine节点。附图标记L1、L2…L100可为该数据中心组网中的接入交换机，即Leaf节点。核心交换机C1、C2和接入交换机L1、L2、…、L100上运行有IS-IS协议。
接入交换机L1上的配置：IS-IS的network-id(网络标识)为50.0000.0000.0001.00，环回接口(Loopback interface)地址为1.1.1.1/32；
接入交换机L2上的配置：IS-IS的network-id为50.0000.0000.0002.00，环回接口地址为2.2.2.2/32；
接入交换机L3上的配置：IS-IS的network-id为50.0000.0000.0003.00，环回接口地址为3.3.3.3/32；
……
接入交换机L100上的配置：IS-IS的network-id为50.0000.0000.0100.00，环回接口地址为100.100.100.100/32。
核心交换机C1上的配置：IS-IS的network-id为50.0200.0000.0001.00，环回接口地址为100.1.1.1/32；
核心交换机C2上的配置：IS-IS的network-id为50.0200.0000.0002.00，环回接口地址为100.2.2.2/32。
接入交换机L1分别和核心交换机C1及C2之间建立IS-IS邻居，发布目的地址为环回接口1.1.1.1的路由，以下可简称为1.1.1.1路由；
接入交换机L2和核心交换机C1及C2之间建立IS-IS邻居，发布2.2.2.2路由；
接入交换机L3和核心交换机C1及C2之间建立IS-IS邻居，发布3.3.3.3路由；
……
接入交换机L100和核心交换机C1及C2之间建立IS-IS邻居，发布100.100.100.100路由。
基于上述配置，在该实施例中：接入交换机L1产生的第一LSP报文包括1.1.1.1路由，发送给核心交换机C1和C2；
接入交换机L2产生的第一LSP报文包括2.2.2.2路由，发送给核心交换机C1和C2；
接入交换机L3产生的第一LSP报文包括3.3.3.3路由，发送给核心交换机C1和C2；
……
接入交换机L100产生的第一LSP报文包括100.100.100.100路由，发送给核心交换机C1和C2。
核心交换机C1接收到接入交换机L1～L100发送的100条第一LSP报文后，不会将该100条第一LSP报文泛洪给接入交换机L1～L100。
同理，核心交换机C2接收到接入交换机L1～L100发送的100条第一LSP报文后，也不会将该100条第一LSP报文泛洪给接入交换机L1～L100。
核心交换机C1根据接收到的100条第一LSP报文做路由计算，由于计算出的路由的出接口的类型均为Leaf接口，核心交换机C1可将这些目标路由打包在一起通过一个第二LSP报文泛洪给接入交换机L1～L100。由于计算出的100条目标路由的出接口都属于泛洪域300，核心交换机C1还可以在该第二LSP报 文中添加泛洪域300的标识。其中，一条长度为1500字节的第二LSP报文即可携带该100条路由。
同理，核心交换机C2也可以根据接收到的100条第一LSP报文做路由计算，由于计算出的路由的出接口的类型均为Leaf接口，核心交换机C2可以将这些目标路由打包在一起通过一个第二LSP报文泛洪给接入交换机L1～L100。由于计算出的100条目标路由的出接口都属于泛洪域300，核心交换机C1还可以在该第二LSP报文中添加泛洪域300的标识。
其中，核心交换机C1和C2将目标路由打包携带在第二LSP报文时，还可以在该第二LSP报文中携带目标路由的来源信息。例如，对于1.1.1.1路由，其路由来源为接入交换机L1，则该第二LSP报文中携带的1.1.1.1路由对应的来源信息可以为接入交换机L1的network-id，即50.0000.0000.0001.00。
对于2.2.2.2路由，其路由来源为接入交换机L2，则该第二LSP报文中携带2.2.2.2路由对应的来源信息可以为接入交换机L2的network-id，即50.0000.0000.0002.00。
依次类推，对于100.100.100.100路由，其路由来源为接入交换机L100，则该第二LSP报文中携带100.100.100.100路由对应的来源信息可以为接入交换机L100的network-id，即50.0000.0000.0100.00。
可见，在该实施例中，核心交换机C1和C2在分别接收到100个第一LSP报文的情况下，仅分别向接入交换机L1～L100泛洪一个第二LSP报文即可。这样，与核心交换机C1和C2将接收到的每个第一LSP报文均泛洪给接入交换机L1～L100相比，泛洪的LSP报文数量明显减少，节省了系统资源。
接入交换机L1接收到核心交换机C1泛洪过来的第二LSP报文后，由于接入交换机L1分别与核心交换机C1和C2连接的Spine接口属于同一泛洪域300，接入交换机L1不会将该第二LSP报文泛洪给核心交换机C2。同理，接入交换机L2～L100也不会将从核心交换机C1接收到的第二LSP报文泛洪给核心 交换机C2。从而，进一步减少了数据中心组网中泛洪的报文数量，节省了系统资源。
接入交换机L1进行路由计算时，通过核心交换机C1和C2发送过来的第二LSP报文，可以获取第二LSP报文中各路由的来源信息，且当自身为来源信息指示的路由来源时不进行路由计算，当自身不为来源信息指示的路由来源时进行路由计算。例如，接入交换机L1可以对2.2.2.2路由、…、100.100.100.100路由进行计算，由于1.1.1.1路由的路由来源为接入交换机L1本身而不会计算。接入交换机L1通过核心交换机C1和C2发过来的第二LSP报文进行路由计算时，可以计算出到2.2.2.2、…、及100.100.100.100的路由，下一跳为核心交换机C1和C2等价，接入交换机L1不会计算回绕路径。
接入交换机L2～L100进行路由计算的处理同理可得。
通过以上描述可以看出，根据本公开示例提供的技术方案，当Spine节点从Leaf接口接收到来自Leaf节点的LSP报文时，不将该LSP报文立即泛洪给其它Leaf节点，而是根据该LSP报文进行路由计算，并从计算出的路由中选择出目标路由，将这些目标路由打包通过LSP报文泛洪给所有Leaf节点。这样，可有效减少泛洪域中LSP报文的泛洪数量，节省了系统资源。
请参见图4，为根据本公开示例提供的一种链路状态信息处理装置的硬件结构示意图。所述装置可以应用于上述方法实施例中的Spine节点。如图4所示，该链路状态信息处理装置可以包括处理器41以及机器可读存储介质42。其中，处理器41和机器可读存储介质42通常借由内部总线43相互连接。在其他可能的实现方式中，所述装置还可能包括外部接口44，以能够与其他设备或者部件进行通信。
在不同的例子中，所述机器可读存储介质42可以是：ROM(Read-Only Memory，只读存储器)、易失存储器、非易失性存储器、闪存、存储驱动器(如硬盘驱动器)、固态硬盘、任何类型的存储盘(如光盘、DVD等)，或者类似 的存储介质，或者它们的组合。
进一步地，机器可读存储介质42上存储有用于链路状态信息处理的控制逻辑50对应的机器可执行指令。从功能上划分，如图5所示，控制逻辑50可以包括接收单元510、路由计算单元520、选择单元530和泛洪单元540。
接收单元510，用于从叶子Leaf接口接收第一链路状态报文LSP报文。其中，Leaf接口为该Spine节点上与Leaf节点相连的接口，第一LSP报文为从与该Spine节点相连接的Leaf节点接收到的LSP报文。
路由计算单元520，用于根据接收到的每个所述第一LSP报文进行路由计算。
选择单元530，用于从计算出的所有路由中选择目标路由。
泛洪单元540，用于将所述选择出的目标路由打包通过第二LSP报文泛洪给与本Spine节点连接的Leaf节点。
根据一个示例，所述选择单元530选择出的目标路由的出接口类型为Leaf接口。
根据另一个示例，所述选择单元530选择出的目标路由的出接口类型为Leaf接口、且出接口属于同一个泛洪域。在这种情况下，所述泛洪单元540还可以具体用于根据所述目标路由的出接口所属的泛洪域，将属于同一泛洪域的目标路由携带在同一个第二LSP报文中，并在所述第二LSP报文中添加对应的泛洪域标识。
根据一个示例，所述第二LSP报文中还可携带有路由来源信息，以使接收到所述第二LSP报文的Leaf节点可在确定自身不为所述第二LSP报文中的目标路由的路由来源信息指示的路由来源时，可根据该目标路由进行路由计算。
请参见图6，为根据本公开示例提供的一种链路状态信息处理装置的硬件结构示意图。所述装置可以应用于上述方法实施例中的Leaf节点。如图6所示， 该链路状态信息处理装置可以包括处理器61以及机器可读存储介质62。其中，处理器61和机器可读存储介质62通常借由内部总线63相互连接。在其他可能的实现方式中，所述装置还可能包括外部接口64，以能够与其他设备或者部件进行通信。
在不同的例子中，所述机器可读存储介质62可以是：ROM(Read-Only Memory，只读存储器)、易失存储器、非易失性存储器、闪存、存储驱动器(如硬盘驱动器)、固态硬盘、任何类型的存储盘(如光盘、DVD等)，或者类似的存储介质，或者它们的组合。
进一步地，机器可读存储介质62上存储有用于链路状态信息处理的控制逻辑90对应的机器可执行指令。从功能上划分，如图7所示，控制逻辑70可以包括接收单元710、遍历单元720、判断单元730和发送单元740。
接收单元710，用于从第一Spine接口接收第二链路状态报文LSP报文。其中，Spine接口为该叶子Leaf节点上与Spine节点相连的接口。所述第二LSP报文为从与该Leaf节点相连接的Spine节点接收到的上述打包有目标路由的LSP报文。所述第一Spine接口为接收到所述第二LSP报文的Spine接口。
遍历单元720，用于遍历本Leaf节点上除该第一Spine接口之外的所有第二Spine接口，确定各所述第二Spine接口所属的泛洪域。其中，所述第二Spine接口为所述Leaf节点上除所述第一Spine接口之外的任一Spine接口。
根据一个示例，在接收到携带有泛洪域标识的一类第二LSP报文时，所述判断单元730可用于判断该第二Spine接口是否属于该泛洪域标识对应的泛洪域。这样，若所述判断单元730的判断结果为否、即该第二Spine接口不属于该第二LSP报文携带的泛洪域标识对应的泛洪域，则所述发送单元740可以用于通过该第二Spine接口泛洪该第二LSP报文。
根据另一个示例，在接收到未携带泛洪域标识的二类第二LSP报文时，所述判断单元730可用于判断该第二Spine接口与该第一Spine接口是否处于同 一泛洪域。这样，若该第二Spine接口与该第一Spine接口未处于同一泛洪域，向所述发送单元740可通过该第二Spine接口泛洪该第二LSP报文。
综上，所述发送单元740可具体用于：若接收到的该第二LSP报文携带有泛洪域标识、且所述泛洪域标识对应的泛洪域与所述第二Spine接口所属的泛洪域不同时，通过所述第二Spine接口泛洪该第二LSP报文；或者，若接收到的该第二LSP报文未携带泛洪域标识、且所述第二Spine接口与该第一Spine接口未处于同一泛洪域时，通过该第二Spine接口泛洪该第二LSP报文。
根据一个示例，所述接收到的第二LSP报文中还可携带有路由来源信息。相应地，如图8所示，从功能上划分，链路状态信息处理的控制逻辑70还可以包括获取单元750和路由计算单元760。
获取单元750，用于获取所述接收到的第二LSP报文中携带的目标路由的路由来源信息。
路由计算单元760，用于当根据所述路由来源信息确定本Leaf节点自身不为该目标路由的路由来源信息指示的路由来源时，根据该目标路由进行路由计算。
上述装置中各个单元的功能和作用的实现过程具体详见上述方法中对应步骤的实现过程，在此不再赘述。
对于装置实施例而言，由于其基本对应于方法实施例，所以相关之处参见方法实施例的部分说明即可。以上所描述的装置实施例仅仅是示意性的，其中所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本公开的目的。本领域普通技术人员在不付出创造性劳动的情况下，即可以理解并实施。
由上述实施例可见，当Spine节点从Leaf接口接收到来自Leaf节点的LSP 报文时，不将该LSP报文直接泛洪给其它Leaf节点，而是根据所接收到的每个LSP报文进行路由计算，并将计算出的路由中的目标路由打包通过一个LSP报文泛洪给本Spine节点所连接的所有Leaf节点。从而在数据中心组网中，可减少了LSP报文的泛洪数量，节省了系统资源。
应当理解的是，本公开并不局限于上面已经描述并在附图中示出的精确结构，并且可以在不脱离其范围进行各种修改和改变。本公开的保护范围仅由所附的权利要求来限制。

Claims (15)

  1. 一种链路状态信息处理方法，包括：
    脊柱Spine节点从叶子Leaf接口接收第一链路状态LSP报文，所述leaf接口为所述Spine节点上与Leaf节点连接的接口；
    所述Spine节点根据接收到的每个所述第一LSP报文进行路由计算；
    所述Spine节点从计算出的所有路由中选择目标路由；
    所述Spine节点将选择出的目标路由打包通过第二LSP报文泛洪给与本Spine节点连接的Leaf节点。
  2. 根据权利要求1所述的方法，其中，所述目标路由的出接口类型均为leaf接口。
  3. 根据权利要求1所述的方法，其中，所述目标路由的出接口类型均为leaf接口、且出接口属于同一个泛洪域。
  4. 根据权利要求3所述的方法，其中，所述第二LSP报文中携带所述泛洪域的标识。
  5. 根据权利要求1所述的方法，其中，所述第二LSP报文中携带所述目标路由的来源信息。
  6. 一种链路状态信息处理方法，包括：
    叶子Leaf节点从第一脊柱Spine接口接收第二链路状态报文LSP报文，所述Spine接口为所述Leaf节点上与Spine节点相连的接口；
    所述Leaf节点确定本节点上各第二Spine接口所属的泛洪域，所述第二Spine接口为所述Leaf节点上除所述第一Spine接口之外的任一Spine接口；
    在接收到携带有泛洪域标识的一类第二LSP报文时，若所述泛洪域标识对应的泛洪域与所述第二Spine接口所属的泛洪域不同，则所述Leaf节点通过所述第二Spine接口泛洪所述一类第二LSP报文；
    在接收到未携带泛洪域标识的二类第二LSP报文时，若所述第二Spine接口与所述第一Spine接口所属的泛洪域不同，则所述Leaf节点通过所述第二 Spine接口泛洪所述二类第二LSP报文。
  7. 根据权利要求6所述的方法，其中，
    在接收到携带有泛洪域标识的一类第二LSP报文时，若所述泛洪域标识对应的泛洪域与所述第二Spine接口所属的泛洪域相同，则所述Leaf节点不通过所述第二Spine接口泛洪所述一类第二LSP报文。
  8. 根据权利要求6所述的方法，其中，
    在接收到未携带泛洪域标识的二类第二LSP报文时，若所述第二Spine接口与所述第一Spine接口所属的泛洪域相同，则所述Leaf节点不通过所述第二Spine接口泛洪所述二类第二LSP报文。
  9. 根据权利要求6所述的方法，其中，接收到的所述第二LSP报文携带有目标路由和目标路由的来源信息。
  10. 根据权利要求9所述的方法，其中，还包括：
    当所述Leaf节点根据所述来源信息确定所述目标路由的来源不为本Leaf节点时，根据所述目标路由进行路由计算。
  11. 一种脊柱Spine节点设备，包括：处理器和存储有机器可读指令的机器可读存储介质，所述指令被所述处理器执行以实现：
    从叶子Leaf接口接收第一链路状态LSP报文，所述leaf接口为所述Spine节点上与Leaf节点连接的接口；
    根据接收到的每个所述第一LSP报文进行路由计算；
    从计算出的所有路由中选择目标路由；
    将选择出的目标路由打包通过第二LSP报文泛洪给与本Spine节点连接的Leaf节点。
  12. 根据权利要求11所述的设备，其中，所述目标路由的出接口类型均为leaf接口。
  13. 根据权利要求11所述的设备，其中，所述目标路由的出接口类型均为leaf接口、且出接口属于同一个泛洪域。
  14. 根据权利要求13所述的设备，其中，所述第二LSP报文中携带所述泛洪域的标识。
  15. 根据权利要求11所述的设备，其中，所述第二LSP报文中携带所述目标路由的来源信息。
PCT/CN2017/078064 2016-03-25 2017-03-24 链路状态信息处理 Ceased WO2017162202A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610182617.9A CN105763446B (zh) 2016-03-25 2016-03-25 一种链路状态信息处理方法及装置
CN201610182617.9 2016-03-25

Publications (1)

Publication Number Publication Date
WO2017162202A1 true WO2017162202A1 (zh) 2017-09-28

Family

ID=56345729

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/078064 Ceased WO2017162202A1 (zh) 2016-03-25 2017-03-24 链路状态信息处理

Country Status (2)

Country Link
CN (1) CN105763446B (zh)
WO (1) WO2017162202A1 (zh)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112291160A (zh) * 2020-09-23 2021-01-29 浪潮思科网络科技有限公司 一种bum报文抑制方法、设备及介质
CN114143853A (zh) * 2020-09-03 2022-03-04 华为技术有限公司 通信链路选择方法、装置及存储介质
CN114339298A (zh) * 2020-09-29 2022-04-12 华为技术有限公司 一种无压缩音视频流的处理方法、装置、设备及系统
CN116866288A (zh) * 2023-07-28 2023-10-10 中国电信股份有限公司技术创新中心 数据中心网络系统、管控方法、管控平台装置以及介质
CN119835219A (zh) * 2024-12-19 2025-04-15 新华三技术有限公司 一种流量转发方法、装置及相关设备

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105763446B (zh) * 2016-03-25 2019-05-07 新华三技术有限公司 一种链路状态信息处理方法及装置
EP4618502A1 (en) * 2024-03-15 2025-09-17 Juniper Networks, Inc. Seamless support and node-by-node migration for multiple distributed flood reduction algorithms in the same network

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008134584A2 (en) * 2007-04-27 2008-11-06 Yong Kang Routing method and system for wireless network
CN101442497A (zh) * 2008-12-25 2009-05-27 中兴通讯股份有限公司 一种实现数据报文转发的系统及方法
CN103716169A (zh) * 2012-09-29 2014-04-09 华为技术有限公司 点到多点的组播实现方法、网络节点和系统
CN103746922A (zh) * 2013-12-17 2014-04-23 福建星网锐捷网络有限公司 一种组播报文的转发方法及装置
CN105763446A (zh) * 2016-03-25 2016-07-13 杭州华三通信技术有限公司 一种链路状态信息处理方法及装置

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101834794B (zh) * 2010-05-06 2012-09-26 杭州华三通信技术有限公司 通过骨干网进行报文转发的方法及设备
CN102932260B (zh) * 2012-10-31 2016-03-30 福建星网锐捷网络有限公司 路由计算方法、设备及系统
CN103986650B (zh) * 2013-02-07 2017-08-11 新华三技术有限公司 一种TRILL网络中nickname冲突的处理方法和装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008134584A2 (en) * 2007-04-27 2008-11-06 Yong Kang Routing method and system for wireless network
CN101442497A (zh) * 2008-12-25 2009-05-27 中兴通讯股份有限公司 一种实现数据报文转发的系统及方法
CN103716169A (zh) * 2012-09-29 2014-04-09 华为技术有限公司 点到多点的组播实现方法、网络节点和系统
CN103746922A (zh) * 2013-12-17 2014-04-23 福建星网锐捷网络有限公司 一种组播报文的转发方法及装置
CN105763446A (zh) * 2016-03-25 2016-07-13 杭州华三通信技术有限公司 一种链路状态信息处理方法及装置

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114143853A (zh) * 2020-09-03 2022-03-04 华为技术有限公司 通信链路选择方法、装置及存储介质
CN112291160A (zh) * 2020-09-23 2021-01-29 浪潮思科网络科技有限公司 一种bum报文抑制方法、设备及介质
CN112291160B (zh) * 2020-09-23 2022-03-01 浪潮思科网络科技有限公司 一种bum报文抑制方法、设备及介质
CN114339298A (zh) * 2020-09-29 2022-04-12 华为技术有限公司 一种无压缩音视频流的处理方法、装置、设备及系统
CN116866288A (zh) * 2023-07-28 2023-10-10 中国电信股份有限公司技术创新中心 数据中心网络系统、管控方法、管控平台装置以及介质
CN119835219A (zh) * 2024-12-19 2025-04-15 新华三技术有限公司 一种流量转发方法、装置及相关设备

Also Published As

Publication number Publication date
CN105763446A (zh) 2016-07-13
CN105763446B (zh) 2019-05-07

Similar Documents

Publication Publication Date Title
US11962496B2 (en) Method for establishing segment routing for IPv6 tunnel
US20230353490A1 (en) Method and Apparatus for Processing Transmission Path Fault, and System
US11743204B2 (en) Tunnel establishment method, apparatus, and system
EP2978176B1 (en) Packet processing method and router
US9143395B2 (en) Scalable BGP protection from edge node failure using context labels in data packets identifying backup router mirror table
RU2704714C1 (ru) Технологии для предоставления максимальной глубины идентификатора сегмента узла и/или линии связи, использующие ospf
WO2018188464A1 (zh) 一种实现ioam的方法、装置及存储介质
CN104378292B (zh) 一种转发mpls数据包的方法及装置
CN112087386B (zh) 一种报文处理的方法、设备和系统
WO2017162202A1 (zh) 链路状态信息处理
CN112019433B (zh) 一种报文转发方法和装置
WO2018082652A1 (zh) 信息传输方法、装置及系统及装置
CN111490937A (zh) 一种建立跨域转发路径的方法、装置及系统
CN111224870B (zh) 一种SR-MPLS Anycast场景下的故障修复方法、设备和存储介质
CN107786442B (zh) 一种元数据的传输方法及装置
WO2023016550A1 (zh) 一种路由发送方法及设备
CN111147376B (zh) 一种路由更新方法、装置及设备、介质
US12513074B2 (en) System and method for abstracting an IGP zone
CN113691446B (zh) 一种报文发送的方法和装置
WO2022246693A1 (en) Method and apparatus for path switchover management
WO2019080927A1 (zh) 一种报文处理方法和装置、计算机可读存储介质
WO2024152527A1 (zh) 路由方法及其装置、存储介质、计算机程序产品
CN118055138A (zh) 标签分发协议邻居保活方法、装置和设备

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

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

Ref document number: 17769479

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 17769479

Country of ref document: EP

Kind code of ref document: A1