WO2019052488A1 - 链路状态通告lsa发送方法、装置和*** - Google Patents

链路状态通告lsa发送方法、装置和*** Download PDF

Info

Publication number
WO2019052488A1
WO2019052488A1 PCT/CN2018/105326 CN2018105326W WO2019052488A1 WO 2019052488 A1 WO2019052488 A1 WO 2019052488A1 CN 2018105326 W CN2018105326 W CN 2018105326W WO 2019052488 A1 WO2019052488 A1 WO 2019052488A1
Authority
WO
WIPO (PCT)
Prior art keywords
router
lsa
location information
level
path table
Prior art date
Application number
PCT/CN2018/105326
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 EP18855730.0A priority Critical patent/EP3672168B1/en
Publication of WO2019052488A1 publication Critical patent/WO2019052488A1/zh
Priority to US16/818,606 priority patent/US11411853B2/en

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/02—Topology update or discovery
    • H04L45/026—Details of "hello" or keep-alive messages
    • 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/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H04L41/0813—Configuration setting characterised by the conditions triggering a change of settings
    • H04L41/082—Configuration setting characterised by the conditions triggering a change of settings the condition being updates or upgrades of network functionality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
    • H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
    • 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/12—Shortest path evaluation
    • H04L45/123—Evaluation of link metrics
    • 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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • 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/60—Router architectures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06—Management of faults, events, alarms or notifications
    • H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0668—Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure

Definitions

  • the present application relates to the field of communications, and in particular, to a link state advertisement (LSA) flooding method, apparatus, and system.
  • LSA link state advertisement
  • Leaf-Spine or Fat-Tree are two widely used hierarchical and structured topologies that are widely used in data centers.
  • a topology diagram of Leaf-Spine includes a spine node 11 and a leaf node 12.
  • a schematic structural diagram of Fat-Tree including a core network 21, an aggregation network 22, and an edge network (leaf node) 23, the edge network 23 and the aggregation network 22 may be divided into different clusters (Pods), The topology in each cluster is equivalent to the Leaf-Spine topology.
  • the Open Shortest Path First (OSPF) protocol is the most widely used Interior Gateway Protocol (IGP) protocol in the network.
  • the basic principle is that each router in the network establishes an adjacency relationship with its neighbor router through Hello packets; each router sends an LSA to each neighbor router, and each neighbor router must sequentially send it to the LSA after receiving it.
  • the neighbor router forwards these LSAs, that is, flooding; each router keeps a backup of the received LSAs in its respective Link State Database (LSDB), and all routers hold the same LSDB; each router follows the topology database.
  • the shortest path to each node on the network is calculated by the Shortest Path First (SPF) algorithm, and the result is output into a routing table.
  • SPF Shortest Path First
  • the mechanism for flooding LSAs in the OSPF protocol in the prior art has the following problems: First, when the LSA floods the network. A large amount of repetition or redundancy will occur, which will further generate LSA bounce. Secondly, when a link failure occurs between adjacent nodes, the other party will still receive the LSA of the other party, but the two nodes are not There will be data transfer, so there is no need to maintain the exact same LSDB.
  • Embodiments of the present application provide an LSA transmission method, apparatus, and system for reducing the number of LSA transmissions. To achieve the above objective, the embodiment of the present application adopts the following technical solutions:
  • the first aspect provides a link state advertisement LSA sending method, where the method includes: the first router generates the first according to the hierarchical location information, the hierarchical location information of the second router, and the hierarchical location information of the at least one third router. a path table, wherein the second router is a neighbor router that is effective with the link between the first router, and the third router is a router that is effective with the link between the second router and the second router, except for the router other than the first router, first The path table includes an identifier of the at least one third router, where the identifier in the first path table is used to indicate that the first LSA is sent to the corresponding router, where the first LSA includes a valid link between the advertising router and its neighboring router, and the advertising router refers to the link.
  • the router that sends the LSA generates a path table according to the hierarchical location information, the hierarchical location information of the next hop router, and the hierarchical location information of the next next hop router, and sends the LSA router to the next
  • the hop router sends the LSA and sends the path table.
  • the path table includes the identifier of the next next hop router, indicating that the next hop router forwards the LSA to the corresponding next hop router until the router that is the leaf node receives the LSA. Do not forward afterwards.
  • the router that sends the LSA instructs the next hop router to selectively forward the LSA to the next hop router, which reduces the number of LSA transmissions and prevents the next next hop router from repeatedly receiving the LSA.
  • the method further includes: the first router receives the second LSU message from the fourth router, where the second LSU message includes the first LSA, where the fourth router is valid with the link between the first router Among the neighbor routers, routers other than the second router; the first router updates its link state database LSDB according to the first LSA.
  • This embodiment provides one possible source of the first LSA.
  • the first router sends the first link state update LSU message to the second router, where: when the second path table is further included in the second LSU message, the first router sends the first router to the second router.
  • An LSU message where the second path table includes an identifier of the at least one second router, and the identifier in the second path table is used to indicate that the first LSA is sent to the corresponding router.
  • the first router is an advertising router. This embodiment provides one possible implementation of the first router.
  • the first LSA includes hierarchical location information of the advertising router and/or hierarchical location information of the neighboring routers that are valid with the advertising router link. This embodiment provides a possible delivery of hierarchical location information for each router.
  • the method before the first router generates the first path table according to the hierarchical location information of the first router, the hierarchical location information of the second router, and the hierarchical location information of the at least one third router, the method further includes: the first router Receiving a second LSA from the second router, the second LSA including hierarchical location information of the second router and/or hierarchical location information of the at least one third router.
  • This embodiment provides another possible delivery of hierarchical location information for each router.
  • the method before the first router generates the first path table according to the hierarchical location information of the first router, the hierarchical location information of the second router, and the hierarchical location information of the at least one third router, the method further includes: the first router Sending a first open shortest path first OSPF negotiation message to the second router; the first router receives the second OSPF negotiation message from the second router, where the first OSPF negotiation message includes the hierarchical location information of the first router, and the second OSPF The negotiation message includes the hierarchical location information of the second router, where the first OSPF negotiation message and the second OSPF negotiation message are used to establish and maintain a neighbor relationship between the first router and the second router.
  • This embodiment provides yet another possible delivery of hierarchical location information for each router.
  • a second aspect provides a link state advertisement LSA sending method, where the method includes: the second router receives a first link state update LSU message from the first router, where the first LSU message includes the first LSA and the first A path table, the first LSA includes a valid link between the advertising router and its neighboring router, and the advertising router refers to a router whose link state changes or periodically performs link state update, and the first path table includes at least one third router.
  • the second router is a neighbor router that is effective with the link between the first router, and the third router is a router other than the first router in the neighboring router that is effective with the second router; the second router is according to the second router.
  • An LSA updates its link state database LSDB; the second router sends a first LSA to the router corresponding to the identifier in the first path table.
  • the router that sends the LSA generates a path table according to the hierarchical location information, the hierarchical location information of the next hop router, and the hierarchical location information of the next next hop router, and sends the LSA router to the next
  • the hop router sends the LSA and sends the path table.
  • the path table includes the identifier of the next next hop router, indicating that the next hop router forwards the LSA to the corresponding next hop router until the router that is the leaf node receives the LSA. Do not forward afterwards.
  • the router that sends the LSA instructs the next hop router to selectively forward the LSA to the next hop router, which reduces the number of LSA transmissions and prevents the next next hop router from repeatedly receiving the LSA.
  • the method further includes: generating, by the second router, a second path table according to the hierarchical location information, the hierarchical location information of the third router, and the hierarchical location information of the at least one fifth router, where the second path The table includes an identifier of the at least one fifth router, the identifier in the second path table is used to indicate that the first LSA is sent to the corresponding router, and the fifth router is in the neighboring router that is valid with the link between the third router, except the second router.
  • the second router sends the first LSU message to the router corresponding to the identifier in the first path table, where the second router sends the second LSU message to the router corresponding to the identifier in the first path table, where the second LSU
  • the message includes a first LSA and a second path table. This embodiment provides that the path table can also be carried simultaneously when the LSA is sent.
  • the method before the second router generates the second path table according to the hierarchical location information, the hierarchical location information of the third router, and the hierarchical location information of the at least one fifth router, the method further includes: the second router The second LSA is received from the third router, and the second LSA includes hierarchical location information of the third router and/or hierarchical location information of the at least one fifth router.
  • This embodiment provides a possible delivery of hierarchical location information for each router.
  • the first LSA includes hierarchical location information of the advertising router and/or hierarchical location information of the neighboring routers that are valid with the advertising router link. This embodiment provides another possible delivery of hierarchical location information for each router.
  • the first router is an advertising router. This embodiment provides one possible implementation of the first router.
  • the method before the second router receives the first link state update LSU message from the first router, the method further includes: the second router sending the first open shortest path first OSPF negotiation message to the first router; The second router receives the second OSPF negotiation message from the first router, where the first OSPF negotiation message includes the hierarchical location information of the second router, and the second OSPF negotiation message includes the hierarchical location information of the first router, and the first OSPF negotiation The message and the second OSPF negotiation message are used to establish and maintain a neighbor relationship between the first router and the second router.
  • This embodiment provides yet another possible delivery of hierarchical location information for each router.
  • a first router in a third aspect, includes: a generating unit, configured to generate a first path table according to the hierarchical location information, the hierarchical location information of the second router, and the hierarchical location information of the at least one third router
  • the second router is a neighbor router that is effective with the link between the first router
  • the third router is a router with a link between the second router and the second router, except for the router other than the first router, the first path table And including the identifier of the at least one third router, where the identifier in the first path table is used to send the first link state advertisement LSA to the corresponding router, where the first LSA includes a valid link between the advertisement router and its neighbor router, and the advertisement router is notified.
  • the sending unit is configured to send a first link state update LSU message to the second router, where the first LSU message includes the first LSA and the first path table.
  • a second router includes: a receiving unit, configured to receive a first link state update LSU message from the first router, where the first LSU message includes a first link state advertisement LSA And the first path table, the first LSA includes a valid link between the advertising router and its neighboring router, and the advertising router refers to a router whose link state changes or periodically performs link state update, and the first path table includes at least one third The identifier of the router, the second router is a neighbor router that is effective with the link between the first router, and the third router is a router other than the first router in the neighboring router that is valid with the link between the second router; the update unit, And the sending unit is configured to send the first LSA to the router corresponding to the identifier in the first path table.
  • the principle and benefit of the second router can be solved.
  • the implementation of the second router may be implemented.
  • the repetition will not be repeated.
  • an embodiment of the present application provides a router, including: a processor, a memory, a bus, and a communication interface; the memory is configured to store a computer execution instruction, and the processor is connected to the memory through the bus, when the router is running.
  • the processor executes the computer-executed instructions stored in the memory to cause the router to perform the method of any one of the preceding aspects.
  • the embodiment of the present application provides a computer storage medium, comprising instructions, when executed on a computer, causing the computer to perform the method of any one of the first aspect or the second aspect .
  • the embodiment of the present application provides a computer program product comprising instructions, when executed on a computer, causing the computer to perform the method of any one of the first aspect or the second aspect method.
  • the embodiment of the present application provides a communication system, including the first router according to the third aspect and the second router according to the fourth aspect.
  • FIG. 1 is a schematic structural diagram of a communication system of a Leaf-Spine topology according to an embodiment of the present application
  • FIG. 2 is a schematic structural diagram of a communication system of a Fat-Tree topology provided by an embodiment of the present application
  • FIG. 3 is a schematic flowchart 1 of an LSA sending method according to an embodiment of the present application.
  • FIG. 4 is a schematic diagram 1 of an LSA packet format provided by an embodiment of the present application.
  • FIG. 5 is a schematic diagram of a format of an extended LSU message packet according to an embodiment of the present application.
  • FIG. 6 is a second schematic flowchart of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 7 is a schematic flowchart 3 of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 8 is a schematic flowchart 4 of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 9 is a schematic diagram of a format of a HELLO message packet according to an embodiment of the present application.
  • FIG. 10 is a schematic flowchart 5 of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 11 is a second schematic diagram of an LSA packet format provided by an embodiment of the present application.
  • FIG. 12 is a schematic flowchart 6 of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 13 is a schematic flowchart diagram of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 14 is a schematic diagram of a Level 2 layer router in a complete topology as a notification router performing periodic LSA update according to an embodiment of the present disclosure
  • 15 is a schematic flowchart 8 of an LSA transmission method according to an embodiment of the present application.
  • FIG. 16 is a schematic diagram of a periodic_2 layer router as a notification router performing periodic LSA update in a non-complete topology according to an embodiment of the present disclosure
  • FIG. 17 is a schematic flowchart nin of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 18 is a schematic diagram of a periodic LSA update performed by a Level_1 layer router as a notification router in a complete topology according to an embodiment of the present application;
  • FIG. 19 is a schematic flowchart of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 20 is a schematic diagram of a periodic LSA update performed by a Level_1 layer router as an advertising router in a non-complete topology according to an embodiment of the present application;
  • FIG. 21 is a schematic flowchart 11 of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 22 is a schematic diagram of a Level 0 layer router in a complete topology as a notification router performing periodic LSA update according to an embodiment of the present disclosure
  • FIG. 23 is a schematic flowchart of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 24 is a schematic diagram of a periodic OLA update performed by a Level_0 layer router in an incomplete topology according to an embodiment of the present application
  • FIG. 25 is a schematic flowchart diagram of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 26 is a schematic diagram of a periodic OLA update performed by a Level_0 layer router in an incomplete topology according to an embodiment of the present application
  • FIG. 27 is a schematic flowchart diagram of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 28 is a schematic diagram of an event LSA update of a link fault between a Level_1 layer router and a Level_2 layer router in a non-complete topology according to an embodiment of the present disclosure
  • FIG. 29 is a schematic flowchart of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 30 is a schematic diagram of an event LSA update of a link fault between a Level_1 layer router and a Level_0 layer router in a complete topology according to an embodiment of the present application;
  • FIG. 31 is a schematic flowchart diagram of a method for transmitting an LSA according to an embodiment of the present application.
  • 32 is a schematic diagram of event LSA update of a link fault between a Level_1 layer router and a Level_0 layer router in a non-complete topology according to an embodiment of the present application;
  • FIG. 34 is a schematic diagram of event LSA update for a Level 2 layer router fault in a complete topology according to an embodiment of the present application.
  • FIG. 35 is a schematic flowchart diagram of an LSA transmitting method according to an embodiment of the present application.
  • FIG. 36 is a schematic diagram of an event LSA update of a Level_1 layer router fault in a complete topology according to an embodiment of the present application
  • FIG. 38 is a schematic diagram of an event LSA update of a Level_0 layer router fault in a complete topology according to an embodiment of the present application.
  • FIG. 39 is a schematic flowchart diagram of a method for transmitting an LSA according to an embodiment of the present application.
  • FIG. 40 is a schematic structural diagram 1 of a router according to an embodiment of the present application.
  • FIG. 41 is a schematic structural diagram 2 of a router according to an embodiment of the present disclosure.
  • FIG. 42 is a schematic structural diagram 3 of a router according to an embodiment of the present application.
  • the core network 21 in the Fat-Tree topology shown in FIG. 2 is referred to as level 2 (Level_2), and the aggregation network 22 is referred to as level 1 (Level_1), and the edge network (leaf node) ) 23 is called level 0 (Level_0).
  • Level_2 level 2
  • Level_1 level 1
  • Level_0 level 0
  • the spine (Spine) node 11 in the Leaf-Spine topology shown in FIG. 1 can be referred to as level 1
  • the leaf node 12 is referred to as level 0.
  • the embodiment of the present application will be described by taking the propagation of LSA in the Fat-Tree topology as an example, which can also be applied to a Leaf-Spine topology or other topology having a similar tree structure.
  • the hierarchical location information described in the embodiment of the present application refers to a hierarchical location of the router in the hierarchical tree topology described above.
  • the hierarchical location information of the router 224 is Level 2 (Level_2)
  • the hierarchical location information of the router 412 is Level 1 (Level_1)
  • the hierarchical location information of the Router 404 is Level 0 (Level_0).
  • the complete topology described in the embodiment of the present application refers to the topology of the regular Fat-Tree topology networking.
  • the incomplete topology described in the embodiments of the present application refers to the topology of some links or nodes missing from the rule Fat-Tree topology.
  • the north direction finger in the embodiment of the present application refers to the direction from Level_0 to Level_2, and the south direction refers to the direction from Level_2 to Level_0.
  • the first router, the second router, the third router, the fourth router, the fifth router, and the like are based on relative positions on the LSA transmission path (eg, next hop, last hop, lower down) A hop, a hop, etc.) to classify the router.
  • LSA transmission path e.g., next hop, last hop, lower down
  • routers 404, 412, 224, 111, 101 may constitute one LSA transmission path from router 404 to router 101
  • routers 404, 411, 221, 111, 101 may constitute slave router 404.
  • Another LSA transmission path to router 101 In the actual transmission process, one path can be selected for transmission according to the algorithm.
  • the LSA can be selected to be sent to the router 411 or 412, that is, the router 411 or 412 is the next hop router of the router 404, and the routers 411 and 412 can be classified as a type of router. For example, the router can be made. As the first router, 404 makes routers 411 and 412 as the second router.
  • the LSA transmission path may be a Shortest Path First (SPF) path.
  • SPF Shortest Path First
  • the leaf node described in the embodiment of the present application refers to a router node that does not forward the LSA on the LSA transmission path.
  • the non-leaf node or the intermediate node in the embodiment of the present application refers to a router node that continues to forward the LSA on the LSA transmission path.
  • routers 404, 412, 224, 111, 101 may constitute an LSA transmission path from router 404 to router 101, then router 101 is a leaf node, and routers 412, 224, 111 are non- Leaf node.
  • the periodic link state update described in the embodiment of the present application refers to the router periodically checking the link state between the router and the neighbor router.
  • the neighboring routers in the embodiments of the present application refer to routers directly connected to the router. For example, as shown in FIG. 2, the routers 412 and 224 are neighbor routers, and the routers 412 and 112 are not neighboring routers.
  • the link state change described in the embodiment of the present application includes a link disconnection between neighboring routers, a router node failure, a router access network, and the like.
  • the path table described in this embodiment of the present application may also be referred to as a Flooding Optimization Reflector List (FORL).
  • FORL Flooding Optimization Reflector List
  • the method, device, and system for transmitting an LSA according to the embodiment of the present application are applied to the above-mentioned Fat-Tree topology, Leaf-Spine topology, or other similar tree topology, when the link state changes or the link state update is performed periodically.
  • the advertising router generates an LSA, which includes a valid link between the advertising router and its neighboring router.
  • the advertising router sends the LSA to the neighboring router. After the neighboring router updates its LSDB according to the LSA, it continues to forward the LSA.
  • the purpose of the embodiment of the present application is to minimize the number of LSA transmissions during the LSA forwarding process.
  • An embodiment of the present application provides an LSA sending method. Referring to FIG. 3, the method includes:
  • step S101 When the first router determines that the second router is a non-leaf node, step S102-S106 is performed. When the first router determines that the second router is a leaf node, steps S107-S109 are performed.
  • the second router is a neighbor router that is valid with the link between the first router.
  • the first router acts as a router that transmits the LSA
  • the second router acts as the next hop router that receives the LSA from the first router.
  • the second router is a non-leaf node, which means that the second router can continue to forward the LSA sent by the first router.
  • the second router is a leaf node, which means that the second router cannot continue to forward the LSA sent by the first router.
  • the manner of determining that the second router is a leaf node or a non-leaf node may include: the second router is located at the Level_0 layer, and the second router may serve as a leaf node; the second router has no other neighbor routers with other links except the first router.
  • the second router may serve as a leaf node, otherwise the second router may serve as a non-leaf node; on the LSA transmission path, if multiple second routers have a common next hop neighbor router, at least one of the second routers may be selected as a non- The leaf node and the remaining second router act as leaf nodes.
  • the first router generates a first path table according to the hierarchical location information, the hierarchical location information of the second router, and the hierarchical location information of the at least one third router.
  • the third router is a router other than the first router among the neighbor routers that are effective in the link with the second router.
  • the first router acts as the router that sends the LSA
  • the second router acts as the next hop router that receives and forwards the LSA from the first router
  • the third router acts as the next hop that receives and forwards the LSA from the second router. router.
  • the third router is defined to be different from the first router in order to prevent the LSA from being transmitted back to the first router after being forwarded through the second router.
  • the router 404 is the first router
  • the router 412 is the second router
  • the routers 221 and 224 can both function as the third router, but the router 404 cannot serve as the third router, which can prevent the LSA from being returned. Pass to router 404.
  • the first path table includes an identifier of the at least one third router, and the identifier in the first path table is used to indicate that the first LSA is sent to the corresponding router.
  • the first path table may include an identification of some or all of the third routers.
  • the identifier in the first path table actually corresponds to the identifier of the next hop neighbor router of the second router. Exemplarily, as shown in FIG. 2, it is assumed that the router 404 is the first router, the router 412 is the second router, and the routers 221 and 224 are the third router. If the generated first path table includes only the identifier of the router 221, It is indicated that the router 404 instructs the router 412 to forward only the first LSA to the router 221. If the generated first path table includes the identifiers of the routers 221 and 224, it indicates that the router 404 instructs the router 412 to forward the first LSA to both the routers 221 and 224.
  • the first LSA includes a valid link between the advertising router and its neighboring router
  • the advertising router refers to a router that generates an LSA when the link state changes or periodically performs link state update.
  • the router 101 is an advertising router
  • the LSA it generates includes a valid link between the routers 101 and 111 and a valid link between the routers 101 and 112.
  • FIG. 4 which is a schematic diagram of an LSA message format
  • the LSA includes an identifier of an advertising router and an identifier of a neighbor router (ie, a Link ID in the figure) that is valid with the advertising router link.
  • the first router may be an advertising router, that is, the first LSA is generated by the first router, and the first LSA includes a valid link between the first router and its neighboring router; or the first router may also be an LSA.
  • the router of the intermediate node on the transmission path, that is, the first LSA is not generated by the first router, but is forwarded by the first router.
  • the first LSA includes: an identifier of the router 404, and an identifier of the neighbor routers 411 and 412 that are valid with the router 404 link.
  • router 412 is the first router and router 404 is the advertising router.
  • the first LSA also includes the identity of router 404 and the identity of neighbor routers 411 and 412 that are valid with router 404 link.
  • the first router sends a first link state update (LSU) message to the second router, where the first LSU message includes the first LSA and the first path table.
  • LSU link state update
  • An LSU message is a type of packet in the OSPF protocol and can be used to encapsulate an LSA.
  • the embodiment of the present application extends the LSU message.
  • the extended LSU message includes an OSPF header, a path table, and an LSA.
  • the path table includes flag F, number of router IDs N, and router ID0 to router ID (N-1).
  • the number of router IDs N is used to indicate the number of router IDs included in the path table.
  • Router ID0 to Router ID (N-1) are used to indicate a specific router ID, which may include the identity of some or all of the routers in the third router as previously described.
  • path table can also be located after the LSA.
  • the second router receives the first LSU message from the first router.
  • the second router updates its LSDB according to the first LSA.
  • the second router updates the LSDB saved by the second router by using the first LSA generated by the advertising router.
  • the LSDB can obtain the topology of the entire network through continuous updating.
  • the second router sends the first LSA to the router corresponding to the identifier in the first path table.
  • the first LSA can also be carried in the LSU message.
  • the router 404 is the first router and the router 412 is the second router. If the first path table sent by the router 404 to the router 412 includes only the identifier of the router 221, the router 412 forwards only to the router 221. An LSA, if the first path table includes the identifiers of routers 221 and 224, router 412 forwards the first LSA to both routers 221 and 224.
  • steps S105 and S106 have no sequential execution order.
  • steps S102-S106 are branches in which the second router is a non-leaf node
  • steps S107-S09 are branches in which the second router is a leaf node.
  • the first router sends a second LSU message to the second router, where the second LSU message includes the first LSA.
  • step S103 Since the second router is not required to forward the LSA according to the path table, the path table does not need to be carried in the LSU message.
  • the second router receives the second LSU message from the first router.
  • the second router updates its LSDB according to the first LSA.
  • This step is the same as S105.
  • the router that sends the LSA generates a path table according to the hierarchical location information, the hierarchical location information of the next hop router, and the hierarchical location information of the next next hop router, and sends the LSA router to the next
  • the hop router sends the LSA and sends the path table.
  • the path table includes the identifier of the next next hop router, indicating that the next hop router forwards the LSA to the corresponding next hop router until the router that is the leaf node receives the LSA. Do not forward afterwards.
  • the router that sends the LSA instructs the next hop router to selectively forward the LSA to the next hop router, which reduces the number of LSA transmissions and prevents the next next hop router from repeatedly receiving the LSA.
  • the method further includes steps S121 and S122:
  • the first router receives a third LSU message from the fourth router, where the third LSU message includes a first LSA, where the fourth router is a neighbor router that is valid with the link between the first router, except the second router. Router.
  • the fourth router may be an advertising router, and the first LSA is generated by the fourth router; or, like the first router, a router that is an intermediate node on the LSA transmission path, that is, the first LSA is not generated by the fourth router, but is configured by the fourth router.
  • the router forwards. Similar to the definition of the third router in step S102, the fourth router is defined to be different from the second router in order to prevent the LSA from being transmitted back to the fourth router after being forwarded by the first router.
  • the first router updates its LSDB according to the first LSA.
  • step S122 This step is similar to S105 and will not be described here. It should be noted that there is no sequential execution sequence between step S122 and steps S101-S109.
  • This embodiment provides a way to obtain an LSA when the first router is not an advertising router.
  • step S103 specifically includes:
  • the first router sends a first LSU message to the second router, where the second path table includes the identifier of the at least one second router, where the second path table is The identifier is used to indicate that the first LSA is sent to the corresponding router.
  • This step is equivalent to the first router determining whether the LSA can be forwarded according to whether there is a path table in the received LSU message.
  • the LSA in the LSU message is forwarded according to the path table; when there is no path table in the received LSU message, the LSA in the LSU message is not forwarded.
  • the second path table may include an identification of some or all of the second routers.
  • the identifier in the second path table actually corresponds to the identifier of the next hop neighbor router of the first router.
  • the first router does not send the first LSU message to the second router, that is, does not forward the LSA.
  • This embodiment provides that the first router determines whether to forward the LSAs according to whether there is a path table in the received LSU message.
  • the method further includes step S151, where step S106 specifically includes step S1061:
  • the second router generates a third path table according to the hierarchical location information, the hierarchical location information of the third router, and the hierarchical location information of the at least one fifth router.
  • the third path table includes an identifier of the at least one fifth router, where the identifier in the third path table is used to indicate that the first LSA is sent to the corresponding router, and the fifth router is in the neighboring router that is valid with the link between the third router. , except for the router other than the second router.
  • This step is similar to S102 and will not be described here.
  • the second router sends a fourth LSU message to the router corresponding to the identifier in the first path table, where the fourth LSU message includes the first LSA and the third path table.
  • This step is similar to S103 and will not be described here.
  • This embodiment provides a way for the second router to send the LSA and path table to the third router.
  • the neighboring routers extend the OSFP negotiation message, the HELLO message, and the HELLO message is used to establish and maintain a neighbor relationship between the neighboring routers. All interfaces periodically send HELLO messages out.
  • FIG. 9 it is a schematic diagram of a HELLO message message format in which a total of 8 bits are selectable, 5 of which have been used, and 3 bits remain (shown by * in the figure).
  • the embodiment expresses two of the bits as hierarchical position information LC, and the remaining one is represented as flag H.
  • step S101 the method further includes steps S161-S164:
  • the first router sends a first OSPF negotiation message to the second router.
  • the first OSPF negotiation message includes hierarchical location information of the first router.
  • the first OSPF negotiation message may be the above HELLO message. This step causes the second router to know the hierarchical location information of the first router.
  • the second router receives the first OSPF negotiation message from the first router.
  • the second router sends a second OSPF negotiation message to the first router.
  • the second OSPF negotiation message includes hierarchical location information of the second router.
  • the second OSPF negotiation message may be the above HELLO message.
  • the first OSPF negotiation message and the second OSPF negotiation message are used to establish and maintain a neighbor relationship between the first router and the second router. This step causes the first router to know the hierarchical location information of the second router.
  • the first router receives the second OSPF negotiation message from the second router.
  • This embodiment provides a way for neighbor routers to obtain each other's hierarchical location information from each other.
  • the embodiment of the present application extends the LSA packet format shown in FIG. 4: refer to FIG. Shown, on the one hand, a field for advertising the hierarchical location information of the router is added to the LSA. On the other hand, since the Link ID is used to identify the identity of the neighboring router that is valid with the advertising router link, a field of hierarchical location information can be added for each Link ID to indicate the level of the neighboring router that is valid with the advertising router link. location information.
  • the LSA may include the two fields at the same time, or may include only one of the fields, and finally the LSA includes hierarchical location information of the advertising router and/or hierarchical location information of the neighboring router that is effective with the advertising router link.
  • the first router described in step S102 is optional.
  • the method further includes S171. :
  • the first router receives the second LSA from the second router, where the second LSA includes hierarchical location information of the second router and/or hierarchical location information of the at least one third router.
  • the second router can be used as the advertising router, and the third router is used as the neighboring router that is effective with the second router.
  • the second router generates and sends an LSA to the first router, where the LSA carries the hierarchical location information of the second router. / or at least one hierarchical location information of the third router.
  • the third router can be used as the advertising router, and the second router acts as a neighboring router that is valid with the third router link, and the second router forwards the LSA generated by the third router to the first router, where the LSA carries the second Hierarchical location information of the router and/or hierarchical location information of at least one third router.
  • the second router described in step S151 is optional. Referring to FIG. 13, before step S151, the method further includes S181. :
  • the second router receives the third LSA from the third router, where the third LSA includes hierarchical location information of the third router and/or hierarchical location information of the at least one fifth router.
  • This step is similar to S171 and will not be described here.
  • This embodiment provides a way for mutually non-neighbor routers that are separated by one neighbor router to obtain each other's hierarchical location information.
  • the LSA sending method may include:
  • the Level_2 layer router 224 generates an LSA as an advertising router.
  • the LSA includes the identity of the router 224 and the identity of the routers 112, 212, 312, 412.
  • the LSA may also include hierarchical location information for router 224 and hierarchical location information for routers 112, 212, 312, 412.
  • the router 224 Because the Level_1 layer routers 112, 212, 312, and 412 are non-leaf nodes, the router 224 generates a path table for the neighbor routers 112, 212, 312, and 412, respectively.
  • the path table generated for each neighbor router is different.
  • the router 224 needs to be combined with the Level_2 layer, the router 112 is located at the Level_1 layer, and the routers 101-104 are located at the Level_0 layer to generate a path table, and the path table includes the router 101- 104 logo.
  • the method for generating a path table for other neighboring routers is similar, and details are not described herein.
  • Level_2 layer router 224 corresponds to the first router in step S102
  • Level_1 layer routers 112, 212, 312, and 412 correspond to the second router in step S102
  • Level_0 layer router 224 corresponds to the step S102.
  • the router 224 sends an LSU message to the Level_1 layer routers 112, 212, 312, and 412 to the south.
  • Each LSU message includes an LSA and a path table respectively generated for the neighbor routers 112, 212, 312, and 412.
  • the LSAs sent by the LSU messages sent by each neighbor router are the same, but the path tables are different.
  • the path table in the LSU message sent by router 224 to router 112 includes the identity of routers 101-104
  • the path table in the LSU message sent by router 224 to router 212 includes the identity of routers 201-204, and so on.
  • Level_2 layer router 224 corresponds to the first router described in step S103
  • Level_1 layer routers 112, 212, 312, and 412 correspond to the second router described in step S103.
  • the Level_1 layer router After receiving the LSU message, the Level_1 layer router updates the local LSDB according to the LSA, and determines the forwarding LSA according to the path table included in the LSU message.
  • the router 112 after receiving the LSU message sent for it, the router 112 updates the local LSDB according to the LSA.
  • Level_1 layer router corresponds to the second router described in steps S104 and S105.
  • Level_0 layer router is a leaf node
  • the Level_1 layer router sends an LSU message to the southbound Level_0 layer router corresponding to the identifier of the path table.
  • the LSU message includes only the LSA and does not include the path table.
  • the Level_1 layer router 112 updates the local LSDB according to the LSA.
  • the Level_0 layer router is a leaf node, so the router 112 sends an LSU message to the routers 101-104, which includes the LSA but does not include the path table.
  • the Level_1 layer router 112 may correspond to the second router in step S106, and the Level_0 layer router corresponds to the third router in step S106; the Level_1 layer router 112 may further correspond to the first router in step S107.
  • the Level_0 layer router corresponds to the second router described in step S107.
  • the Level_0 layer router determines that the LSA is not forwarded according to the path table, and only updates the local LSDB according to the LSA.
  • the routers 101-104 after receiving the LSA in the LSU message, the routers 101-104 respectively update the local LSDB according to the LSA, and terminate the LSA to further forward.
  • Level_0 layer router corresponds to the second router described in S108 and S109.
  • Level_0 layer router knows which Level_0 layer routers of other clusters (Pods) can be reached through the Level_2 layer router 224.
  • Level_1 layer routers including 111, 211, 311, 411) that are not neighbors to the Level_2 layer router 224 do not receive the LSAs they send because the routing entries on these routers do not occur according to the LSAs sent by the router 224.
  • the change that is, the next hop of the packet processed by these routers does not pass through the router 224, nor does it receive the packet directly from the router 224.
  • Level_2 layer routers (such as 221, 222, and 223) do not receive the LSAs sent by routers 224 because the routing entries on these routers do not change according to the LSAs sent by 224, that is, the data processed by these routers. The next hop does not pass through router 224 and does not receive packets directly from router 224.
  • This embodiment not only ensures the necessary update of the LSA generated by the Level_2 layer router 224 in the network, but also avoids unnecessary duplication or redundancy, greatly reduces the transmission amount of the LSA in the Fat-Tree network, and reduces the router processing LSU. The burden of the message.
  • Method 2 Referring to FIG. 16, a schematic diagram of a periodic LSA update performed by a Level_2 layer router in an incomplete topology as an advertising router, compared with FIG. 14, lacks a link between routers 224 and 212.
  • the LSA transmission method may include:
  • Level_2 layer router 224 generates an LSA as an advertising router.
  • the LSA includes the identity of the router 224 and the identity of the routers 112, 312, 412.
  • the LSA may also include hierarchical location information for router 224 and hierarchical location information for routers 112, 312, 412.
  • the router 224 Because the Level_1 layer routers 112, 312, and 412 are non-leaf nodes, the router 224 generates a path table for the neighbor routers 112, 312, and 412, respectively.
  • This step differs from S202 in that no path table needs to be generated for router 212.
  • the router 224 sends an LSU message to the Level_1 layer routers 112, 312, and 412 to the south.
  • Each LSU message includes an LSA and a path table respectively generated by the neighbor routers 112, 312, and 412.
  • This step differs from S203 in that there is no need to send an LSU message to the router 212.
  • the Level_1 layer router After receiving the LSU message, the Level_1 layer router updates the local LSDB according to the LSA, and determines the forwarding LSA according to the path table included in the LSU message.
  • the difference between this step and S204 is that the router 212 does not receive the LSU message and does not update the local LSDB.
  • Level_0 layer router is a leaf node
  • the Level_1 layer router sends an LSU message to the southbound Level_0 layer router corresponding to the identifier of the path table.
  • the LSU message includes only the LSA and does not include the path table.
  • the difference between this step and S205 is that the router 212 does not send the LSA to the Level-0 layer neighbor router to the south.
  • the Level_0 layer router After receiving the LSU message, the Level_0 layer router determines that the LSA is not forwarded according to the path table, and only updates the local LSDB according to the LSA.
  • Level_0 layer router knows which Level_0 layer routers of other clusters (Pods) can be reached through the Level_2 layer router 224.
  • Level_0 layer routers including 201, 202, 203, and 204 that are not the next hop neighbors of the Level_2 layer router do not receive the LSAs they send, because the next hop of the packets processed by these routers does not pass through the router 224. It also does not receive packets that are sent from router 224 via 2 hops, that is, packets from these leaf nodes to other clusters (Pods) are not forwarded by router 224.
  • Level_1 layer routers including 111, 211, 212, 311, 411) that are not neighbors to the Level_2 layer router 224 do not receive the LSAs they send because the routing entries on these routers do not pass the LSAs sent by the router 224. Any change occurs, that is, the next hop of the packet processed by these routers does not pass through the router 224, nor does it receive the packet directly from the router 224.
  • Level_2 layer routers (such as 221, 222, and 223) do not receive the LSAs sent by routers 224 because the routing entries on these routers do not change according to the LSAs sent by 224, that is, the data processed by these routers. The next hop will not pass through the 224 router, nor will it receive the packet directly from the 224 router.
  • This embodiment not only ensures the necessary update of the LSA generated by the Level_2 layer router 224 in the network, but also avoids unnecessary duplication or redundancy, greatly reduces the transmission amount of the LSA in the Fat-Tree network, and reduces the router processing LSU. The burden of the message.
  • the second method is different from the improvement of the prior art. See the first method, and details are not described herein again.
  • the LSA sending method may include:
  • the Level_1 layer router 412 generates an LSA as an advertising router.
  • the LSA includes the identity of the router 412 and the identity of the routers 224, 222, 401-404.
  • the LSA may also include hierarchical location information for router 412 and hierarchical location information for routers 224, 222, 401-404.
  • Level_1 layer router After the Level_1 layer router generates the LSA, it determines whether it is the LSA update triggered by the link fault between the router and the northbound Level_2 router. If it is, the LSA needs to be sent to the Level_2 layer router. If not, the LSA needs to be sent.
  • routers 222 and 224 are equivalent, and one of them can be selected as a leaf node and the other as a non-leaf node.
  • Level_2 layer router 224 and the Level_0 layer routers 401-404 are leaf nodes, the router 412 sends an LSU message to the routers 224 and 401-404 respectively.
  • Each LSU message includes only the foregoing LSA excluding the path table.
  • the router 412 corresponds to the first router, the Level_2 layer router 224 and the Level_0 layer router 401-404 described in the step S107, corresponding to the second router described in the step S107.
  • the S403, the routers 224, and the 401-404 respectively determine that the LSA is not forwarded according to the path table not included, and only the local LSDB is updated according to the LSA.
  • Level_2 layer router 224 and the Level_0 layer routers 401-404 correspond to the second routers described in steps S108 and S109.
  • the router 412 Because the Level_2 layer router 222 is a non-leaf node, the router 412 generates a path table for the neighbor router 222.
  • the router 412 needs to be combined with the Level_1 layer, the router 222 is located at the Level_2 layer, and the routers 112, 212, and 312 are located at the Level_1 layer to generate a path table including the router. Identification of 112, 212, 312.
  • Level_1 layer router 412 corresponds to the first router in step S102
  • Level_2 layer router 222 corresponds to the second router in step S102
  • Level_1 layer routers 112, 212, and 312 correspond to the third step in step S102. router.
  • the router 412 sends an LSU message to the router 222.
  • the LSU message includes an LSA and the path table.
  • router 412 informs router 222 to further transmit the received LSAs to its southbound Level_1 layer neighbor routers 112, 212, and 312.
  • Level_1 layer router 412 corresponds to the first router described in step S103
  • Level_2 layer router 222 corresponds to the second router described in step S103.
  • the router 222 After receiving the LSU message, the router 222 updates the local LSDB according to the LSA, and determines the forwarding LSA according to the path table included in the LSU message.
  • Level_2 layer router 222 corresponds to the second router described in steps S104 and S105.
  • router 222 Because Level_1 layer routers 112, 212, and 312 are non-leaf nodes, router 222 generates a path table for neighbor routers 112, 212, and 312, respectively.
  • the router 222 needs to be combined with the Level_2 layer, the router 112 is located at the Level_1 layer, and the routers 101-104 are located at the Level_0 layer to generate a path table, and the path table includes the router 101- 104 logo.
  • the method for generating a path table for other neighboring routers is similar, and details are not described herein.
  • Level_2 layer router 222 corresponds to the first router in step S102
  • Level_1 layer routers 112, 212, and 312 correspond to the second router in step S102
  • Level_0 layer router corresponds to the third router in step S102.
  • the router 222 sends an LSU message to the Level_1 layer routers 112, 212, and 312 to the south.
  • Each LSU message includes an LSA and a path table respectively generated by the neighboring routers 112, 212, and 312.
  • Level_2 layer router 222 corresponds to the first router described in step S103
  • Level_1 layer routers 112, 212, and 312 correspond to the second router described in step S103.
  • Level_1 layer routers 112, 212, and 312 After receiving the LSU message, the Level_1 layer routers 112, 212, and 312 update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • Level_1 layer routers 112, 212, and 312 correspond to the second routers described in steps S104 and S105.
  • Level_0 layer router is a leaf node
  • Level_1 layer routers 112, 212, and 312 send an LSU message to the southbound Level_0 layer router corresponding to the identifier of the path table.
  • the LSU message includes only the LSA and does not include the path table.
  • the Level_1 layer routers 112, 212, and 312 correspond to the second router in step S106, and the Level_0 layer router corresponds to the third router in step S106; or, the Level_1 layer routers 112, 212, and 312 correspond to the step S107.
  • the first router, the Level_0 layer router corresponds to the second router described in step S107.
  • the STI and the Level_0 layer router After receiving the LSU message, the STI and the Level_0 layer router determine that the LSA is not forwarded according to the path table, and the local LSDB is updated only according to the LSA.
  • Level_0 layer router corresponds to the second router described in S108 and S109.
  • Level_0 layer router knows the latest status information of the Level_1 layer router, so as to adjust its own routing entries to other Level_0 layer routers.
  • Level_2 layer routers (including 221, 223) that are not neighbors with the Level_1 layer router 412 do not receive the LSAs sent by them, because the routing entries on these routers do not change according to the LSAs sent by the router 412, that is, The next hop of the packet processed by these routers does not pass through router 412 and does not receive packets directly from router 412.
  • the Level_1 routers (such as 111, 211, and 311) that are not the next hop of the router 412 do not receive the LSAs generated by the router 412 because the routing entries on these nodes do not change according to the LSAs generated by the router 412. That is, the next hop of the packet processed by these routers does not pass through the router 224, nor does it receive the data packet sent from the router 224 via 2; although the router 411 is topologically the next hop of the router 412. Node, but the traffic in the actual cluster (Pod) 4 will not be transmitted back through the Level_0 layer router, 411, Level_0 layer router, 412, Level_0 layer router. The traffic between the Level_0 layer routers in the cluster (Pod) 4 is only After being relayed by the router 411, it is only relayed through the router 412, so the router 411 does not need to receive the LSA generated by the router 412.
  • This embodiment not only ensures the necessary update of the LSA generated by the Level_1 layer router 412 in the network, but also avoids unnecessary duplication/redundancy, greatly reduces the transmission amount of the LSA in the Fat-Tree network, and reduces the router processing LSU. The burden of the message.
  • the second method is different from the improvement of the prior art. See the first method, and details are not described herein again.
  • the LSA transmission method may include:
  • the Level_1 layer router 412 generates an LSA as an advertising router.
  • This step is the same as that of S401, and details are not described herein again.
  • Each LSU message includes only the foregoing LSA excluding the path table.
  • This step differs from S402 in that, due to the lack of a link between routers 222 and 312, there is only a link between routers 224 and 312, so router 224 acts as a non-leaf node.
  • the routers 401-404 After receiving the LSU message, the routers 401-404 respectively determine that the LSA is not forwarded according to the path table not included, and only the local LSDB is updated according to the LSA.
  • This step differs from S403 in that router 224 does not receive the LSU message at this time.
  • the router 412 Because the Level_2 layer routers 222, 224 are non-leaf nodes, the router 412 generates a path table for the neighbor routers 222, 224, respectively.
  • This step differs from S404 in that router 412 also generates a path table for router 224 at this time.
  • the router 412 sends an LSU message to the routers 222 and 224, where each LSU message includes an LSA and a path table respectively generated for the neighbor routers 222 and 224.
  • This step differs from S405 in that the path table is included in the LSU message sent by the router 412 to the router 224 at this time.
  • the S506 and the routers 222 and 224 respectively update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • This step differs from S406 in that router 224 also receives the LSU message at this time.
  • router 222 Because Level_1 layer routers 112, 212, and 312 are non-leaf nodes, router 222 generates a path table for neighbor routers 112, 212, respectively, and router 224 generates a path table for neighbor routers 312.
  • This step differs from S407 in that router 312 is now at the next hop of router 224.
  • the router 222 sends an LSU message to the Level_1 layer routers 112 and 212 to the south.
  • the LSU message includes an LSA and a path table respectively generated by the neighboring routers 112 and 212.
  • the router 224 sends an LSU message to the Level_1 layer router 312 to the south.
  • the LSU message includes an LSA and a path table generated for the neighbor router 312.
  • This step differs from S408 in that router 312 is now at the next hop of router 224.
  • Steps S509-S511 are the same as steps S409-S411, and are not described herein again.
  • Level_0 layer router knows the latest status information of the Level_1 layer router, so as to adjust its own routing entries to other Level_0 layer routers.
  • Level_2 layer routers (including 221, 223) that are not neighbors with Level_1 layer router 412 do not receive the LSAs they send because the routing entries on these routers do not change according to the LSA sent by 412. The next hop of the packet processed by the router does not pass through the router 412, nor does it receive the packet directly from the router 412.
  • Level_1 layer routers (such as 111, 211, and 311) that are not next hops of router 412 do not receive the LSAs generated by router 412 because the routing entries on these routers do not change according to the LSA generated by 412. That is, the next hop of the packet processed by these routers does not pass through the router 224, nor does it receive the packet sent from the router 224 via 2 hops; although the router 411 is topologically the next hop router of 412. However, the traffic in the actual cluster (Pod) 4 will not be transmitted back through the Level_0 layer router, 411, Level_0 layer router, 412, Level_0 layer router, and the traffic between the Level_0 layer routers in the cluster (Pod) 4 will only pass through. The router 411 transits or only transits through the router 412, so the router 411 does not need to receive the LSA generated by the router 412.
  • This embodiment not only ensures the necessary update of the LSA generated by the Level_1 layer router 412 in the network, but also avoids unnecessary duplication or redundancy, greatly reduces the transmission amount of the LSA in the Fat-Tree network, and reduces the router processing LSU. The burden of the message.
  • the fourth method is different from the improvement of the prior art, and the method is not described here.
  • the LSA sending method may include:
  • the Level_0 layer router 404 generates an LSA as an advertising router.
  • the LSA includes the identity of the router 404 and the identity of the routers 411, 412.
  • the LSA may also include hierarchical location information of the router 404 and hierarchical location information of the routers 411, 412.
  • the router 404 Because the Level_2 layer routers 411 and 412 are non-leaf nodes, the router 404 generates a path table for the neighbor routers 411 and 412, respectively.
  • the router 404 needs to be combined with the Level_0 layer, the router 412 is located at the Level_1 layer, the routers 222, 224 are located at the Level_2 layer, and the router 403 is located at the Level_0 layer to generate a path table.
  • the table includes the identifiers of routers 222, 224, and 403.
  • the Level_0 layer router 404 corresponds to the first router in step S102
  • the Level_1 layer router 411 corresponds to the second router in step S102
  • the Level_2 layer routers 221 and 223 and the Level_0 layer routers 401 and 402 correspond to the step S102.
  • the third router; the Level_1 layer router 412 corresponds to the second router in step S102
  • the Level_2 layer routers 222 and 224 and the Level_0 layer router 403 correspond to the third router in step S102.
  • routers 401-403 are equivalent, and the routers 411-412 are equivalent, so the combination between the two is arbitrary.
  • routers 401-403 and 411 may be combined; or routers 401 and 403 may be combined with 422, and routers 402 and 422 may be combined.
  • Routers 222 and 224 are equivalent, so one of them can be selected as a leaf node and the other as a non-leaf node.
  • Routers 221 and 223 are equivalent, so one of them can be selected as a leaf node and the other as a non-leaf node.
  • the router 404 sends an LSU message to the Level_1 layer routers 411 and 412.
  • the LSU message includes an LSA and the path table.
  • the router 404 informs the router 411 to further transmit the received LSA to its north Level_1 layer neighbor routers 221, 223 and south level Level_1 neighbor routers 401, 402; the router 404 informs 412 to further transmit the received LSA to It is directed to the Level_0 layer neighbor router 403 and the North Level_2 layer neighbor routers 222 and 224.
  • the Level_0 layer router 404 corresponds to the first router in step S103
  • the Level_1 layer routers 411 and 412 correspond to the second router, the Level_2 layer router 221-224 and the Level_0 layer router 401-403 corresponding to the step S103.
  • Level_1 layer routers 411 and 412 After receiving the LSU message, the Level_1 layer routers 411 and 412 update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • Level_1 layer routers 411, 412 correspond to the second routers described in steps S104 and S105.
  • Level_0 layer router and the Level_2 layer router routers 224 and 223 are leaf nodes, the Level_1 layer routers 411 and 412 send an LSU message to the router corresponding to the identifier of the path table.
  • the LSU message includes only the LSA and does not include the path table.
  • the Level_1 layer router 411 sends an LSU message to the routers 401 and 402 corresponding to the identifier of the path table and the northbound Level_0 layer router 223.
  • the LSU message includes only the LSA excluding the path table; and the Level_1 layer router 412 corresponds to the southbound Level_0 corresponding to the path table identifier.
  • the layer router 403 and the northbound Level_2 layer router 224 send an LSU message, and the LSU message includes only the LSA and does not include the path table.
  • Level_1 layer routers 411 and 412 correspond to the second routers described in step S106, and the Level_0 layer routers 401-403 and Level_2 layer routers 224 and 223 correspond to the third routers described in step S106; or, the Level_1 layer router 411 412 corresponds to the first router described in step S107, and Level_0 layer routers 401-403 and Level_2 layer routers 224 and 223 correspond to the second router described in step S107.
  • the S606, the Level_0 layer router and the routers 223 and 224 determine that the LSA is not forwarded according to the path table, and only the local LSDB is updated according to the LSA.
  • Level_0 layer routers and routers 223 and 224 correspond to the second routers described in S108 and S109.
  • the router 411 Because the Level_2 layer router 221 is a non-leaf node, the router 411 generates a path table for the neighbor router 221; since the Level_2 layer router 222 is a non-leaf node, the router 412 generates a path table for the neighbor router 222.
  • the router 412 needs to be combined with the Level_1 layer, the router 222 is located at the Level_2 layer, and the routers 112, 212, and 312 are located at the Level_1 layer to generate a path table including the router. Identification of 112, 212, 312. The method for generating a path table for other neighboring routers is similar, and details are not described herein.
  • Level_1 layer routers 411 and 412 correspond to the first routers in the step S102
  • Level_2 layer routers 221 and 222 correspond to the second routers in the step S102
  • Level_1 layer routers correspond to the third routers in the step S102.
  • Level_1 layer routers 411 and 412 respectively send LSU messages to the Level_2 layer routers in the north.
  • Each LSU message includes an LSA and a path table respectively generated for each router.
  • the Level_1 layer router 411 sends an LSU message to the Level_2 layer router 221 to the north.
  • the LSU message includes an LSA and a path table generated for the neighbor router 221.
  • the Level_1 layer router 412 sends an LSU message to the Level_2 layer router 222 to the north.
  • the LSU message includes the LSA and the The path table generated by the neighbor router 222.
  • Level_1 layer routers 411 and 412 correspond to the first routers described in step S103
  • Level_2 layer routers 221 and 222 correspond to the second routers described in step S103.
  • the S_2 and the Level_2 layer routers 221 and 222 After receiving the LSU message, the S_2 and the Level_2 layer routers 221 and 222 update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • Level_2 layer routers 221 and 222 correspond to the second routers described in steps S104 and S105.
  • the router 221 Because the Level_1 layer routers 112, 211, and 311 are non-leaf nodes, the router 221 generates a path table for the neighbor routers 211, 211, and 311, and the router 222 generates a path table for the neighbor routers 112, 212, and 312.
  • Level_2 layer routers 221 and 222 correspond to the first router in step S102
  • Level_1 layer routers 112, 211, and 311 correspond to the second router in step S102
  • Level_0 layer router corresponds to the first step described in step S102.
  • the S611 and the Level_2 layer routers 221 respectively send LSU messages to the Level_1 layer routers 111, 211, and 311, and each LSU message includes an LSA and a path table respectively generated for the neighboring routers 111, 211, and 311.
  • the Level_2 layer router 222 transmits LSU messages to the Level_1 layer routers 112, 212, and 312, respectively.
  • Each LSU message includes an LSA and a path table generated for the neighbor router 112.
  • Level_2 layer routers 221 and 222 correspond to the first routers described in step S103
  • Level_1 layer routers 111, 211, 311, 112, 212, and 312 correspond to the second routers described in step S103.
  • Level_1 layer routers 111, 211, 311, 112, 212, and 312 After receiving the LSU message, the Level_1 layer routers 111, 211, 311, 112, 212, and 312 update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • Level_1 layer routers 111, 211, 311, 112, 212, and 312 correspond to the second routers described in steps S104 and S105.
  • Level_0 layer router is a leaf node
  • the Level_1 layer routers 111, 211, 311, 112, 212, and 312 send an LSU message to the southbound Level_0 layer router corresponding to the identifier of the path table, and the LSU message includes only the LSA excluding the path table.
  • the Level_1 layer routers 111, 211, 311, 112, 212, and 312 correspond to the second router in step S106, and the Level_0 layer router corresponds to the third router in step S106; or, the Level_1 layer routers 111 and 211 311, 112, 212, and 312 correspond to the first router in step S107, and the Level_0 layer router corresponds to the second router in step S107.
  • the Level_0 layer router After receiving the LSU message, the Level_0 layer router determines that the LSA is not forwarded according to the path table, and only updates the local LSDB according to the LSA.
  • Level_0 layer router corresponds to the second router described in S108 and S109.
  • Level_0 layer routers know the latest status information of the router's Level_0 layer router to adjust its routing entries to other Level_0 layer routers.
  • This embodiment not only ensures the necessary update of the LSA generated by the Level_0 layer router 404 in the network, but also avoids unnecessary duplication or redundancy, greatly reduces the transmission amount of the LSA in the Fat-Tree network, and reduces the router processing LSU. The burden of the message.
  • the fifth method is different from the improvement of the prior art, and is not described here.
  • Method 6 is a schematic diagram of a Level 0 layer router in a non-complete topology as a notification router for periodic LSA update.
  • the link between the routers 221 and 311 and the router 222 are missing.
  • the LSA transmission method may include:
  • Steps S701-S704 are the same as steps S601-S604, and are not described herein again.
  • Level_0 layer router is a leaf node
  • Level_1 layer routers 411 and 412 send an LSU message to the router corresponding to the identifier of the path table.
  • the LSU message includes only the LSA and does not include the path table.
  • the Level_1 layer router 411 sends an LSU message to the southbound Level_0 layer routers 401 and 402 corresponding to the identifier of the path table.
  • the LSU message includes only the LSA excluding the path table.
  • the Level_1 layer router 412 indicates the southbound Level_0 layer router corresponding to the path table identifier.
  • 403 sends an LSU message, and the LSU message includes only the LSA and does not include the path table.
  • This step differs from S605 in that, due to the lack of a link between routers 222 and 312, there is only a link between routers 224 and 312, so router 224 acts as a non-leaf node; due to the lack of routers 311 and 221 The link has only the link between routers 223 and 311, so router 223 acts as a non-leaf node.
  • the S706 and the Level_0 layer router After receiving the LSU message, the S706 and the Level_0 layer router determine that the LSA is not forwarded according to the path table, and the local LSDB is updated only according to the LSA.
  • This step differs from S606 in that the routers 223, 224 do not receive the above-mentioned LSU message including only the LSA excluding the path table.
  • the router 411 Because the Level_2 layer routers 221 and 223 are non-leaf nodes, the router 411 generates a path table for the neighbor routers 221 and 223 respectively. Because the Level_2 layer routers 222 and 224 are non-leaf nodes, the router 412 generates paths for the neighbor routers 222 and 224 respectively. table.
  • This step differs from S607 in that at this time the router 411 generates a path table for the router 223, and the router 412 generates a path table for the router 224.
  • Level_1 layer routers 411 and 412 respectively send LSU messages to the Level_2 layer routers in the north.
  • Each LSU message includes an LSA and a path table respectively generated for each router.
  • the Level_1 layer router 411 sends an LSU message to the Level_2 layer routers 221 and 223, and each LSU message includes an LSA and a path table respectively generated for the neighboring routers 221 and 223.
  • the Level_1 layer router 412 sends the route to the Level_2 layer routers 222 and 224 to the north.
  • the LSU message includes an LSA and a path table respectively generated for the neighbor routers 222 and 224.
  • This step differs from S608 in that an LSU message including the LSA and the path table is sent to the routers 223, 224 at this time.
  • Steps S705 and S708 do not have a sequential execution sequence.
  • the S_2 and the Level_2 layer routers 221-224 After receiving the LSU message, the S_2 and the Level_2 layer routers 221-224 update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • the difference between this step and S609 is that the routers 223 and 224 update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • the router 221 Because the Level_1 layer routers 111, 112, 211, 311, and 312 are non-leaf nodes, the router 221 generates a path table for the neighbor routers 111, 211, the router 222 generates a path table for the neighbor routers 112, 212, and the router 223 for the neighbor router 311. The path table is generated and router 224 generates a path table for neighbor router 312.
  • This step differs from S610 in that router 223 generates a path table for neighbor router 311, router 224 generates a path table for neighbor router 312, and router 221 generates a path table for neighbor router 111.
  • Each LSU message includes an LSA and a path table respectively generated for the neighbor routers 111, 112, 211, 212, 311, and 312.
  • This step differs from S611 in that router 223 sends an LSU message to router 311 at this time, and router 221 no longer sends an LSU message to router 311; router 224 sends an LSU message to router 312, and router 222 no longer sends an LSU message to router 312. .
  • the S_1, the Level_1 layer routers 111, 112, 211, 212, 311, and 312 update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • This step differs from S612 in that router 312 receives an LSU message from router 224 and router 311 receives an LSU message from router 223.
  • Level_0 layer router is a leaf node
  • the Level_1 layer routers 111, 112, 211, 212, 311, and 312 send an LSU message to the southbound Level_0 layer router corresponding to the identifier of the path table, and the LSU message includes only the LSA excluding the path table. .
  • the Level_0 layer router After receiving the LSU message, the Level_0 layer router determines that the LSA is not forwarded according to the path table, and only updates the local LSDB according to the LSA.
  • Level_0 layer routers know the latest status information of the router's Level_0 layer router to adjust its routing entries to other Level_0 layer routers.
  • This embodiment not only ensures the necessary update of the LSA generated by the Level_0 layer router 404 in the network, but also avoids unnecessary duplication or redundancy, greatly reduces the transmission amount of the LSA in the Fat-Tree network, and reduces the router processing LSU. The burden of the message.
  • the method for performing the event LSA update for the link fault between the Level_1 layer router and the Level_2 layer router in the complete topology is as shown in FIG. 26, and as shown in FIG. 27, the LSA sending method may include:
  • the LSA generated by router 412 includes the identity of router 412 and the identity of routers 401-404.
  • the LSA may also include hierarchical location information for router 412 and hierarchical location information for routers 401-404.
  • the LSA generated by router 224 includes the identity of router 224 and the identity of routers 112, 212, 312.
  • the LSA may also include hierarchical location information for router 224 and hierarchical location information for routers 112, 212, 312.
  • Level_0 layer router is a leaf node
  • Level_1 layer router 412 sends an LSU message to the Level-0 layer router 401-404 to the south.
  • the LSU message includes only the LSA and does not include the path table.
  • Level_1 layer router 412 corresponds to the first router described in step S107
  • Level_0 layer routers 401-404 correspond to the second router described in step S107.
  • the S803 and the Level-0 layer routers 401-404 determine that the LSA is not forwarded according to the path table, and only the local LSDB is updated according to the LSA.
  • Level_0 layer routers 401-404 correspond to the second routers described in S108 and S109.
  • the router 224 Because the Level_1 layer routers 112, 212, and 312 are non-leaf nodes, the router 224 generates a path table for the neighbor routers 112, 212, and 312, respectively.
  • Level_2 layer router 224 corresponds to the first router in step S102
  • Level_1 layer routers 112, 212, and 312 correspond to the second router in step S102
  • Level_0 layer routers 101-304 correspond to the steps described in step S102.
  • the Level_2 layer router 224 sends an LSU message to the Level_1 layer routers 112, 212, and 312, and each LSU message includes an LSA and a path table respectively generated for the neighbor routers 112, 212, and 312.
  • Level_2 layer router 224 corresponds to the first router described in step S102
  • Level_1 layer routers 112, 212, and 312 correspond to the second router described in step S102.
  • Level_1 layer routers 112, 212, and 312 After receiving the LSU message, the Level_1 layer routers 112, 212, and 312 update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • Level_1 layer routers 112, 212, and 312 correspond to the second routers described in steps S104 and S105.
  • Level_0 layer router is a leaf node
  • Level_1 layer routers 112, 212, and 312 send an LSU message to the southbound Level-0 layer routers 101-304 corresponding to the identifier of the path table.
  • the LSU message includes only the LSA and does not include the path table.
  • Level_1 layer routers 112, 212, and 312 correspond to the second routers described in step S106, and the Level_0 layer routers 101-304 correspond to the third routers described in step S106; or, the Level_1 layer routers 112, 212, and 312 correspond to The first router, Level_0 layer routers 101-304 described in step S107 corresponds to the second router described in step S107.
  • the S808 and the Level-0 layer routers 101-304 determine that the LSA is not forwarded according to the path table, and only the local LSDB is updated according to the LSA.
  • Level_0 layer routers 101-304 correspond to the second routers described in S108 and S109.
  • Level_0 layer router knows the faulty link condition to calculate or flush to the path affected by the faulty Level_0 layer router based on the latest topology.
  • This embodiment not only ensures the necessary update of the LSA generated by the fault associated Level_1 layer router 412 and Level_2 layer router 224 in the network, but also avoids unnecessary duplication or redundancy, and greatly reduces the transmission of LSA in the Fat-Tree network. The amount reduces the burden on the router to process LSU messages.
  • the method 7 is different from the improvement of the prior art, and the method is not described here.
  • Method 8 is a schematic diagram of performing event LSA update for a link failure between a Level_1 layer router and a Level_2 layer router in a non-complete topology. Compared with FIG. 26, there is a lack of between routers 224 and 212. link. As shown in FIG. 29, the LSA transmission method may include:
  • Steps S901-S903 are the same as steps S801-S803, and are not described herein again.
  • the router 224 Because the Level_1 layer routers 112, 312 are non-leaf nodes, the router 224 generates a path table for the neighbor routers 112, 312, respectively.
  • This step differs from S804 in that router 224 no longer generates a path table for neighbor router 212.
  • the Level_2 layer router 224 sends an LSU message to the Level_1 layer routers 112 and 312, and each LSU message includes an LSA and a path table generated for the neighbor routers 112 and 312 respectively.
  • This step differs from S805 in that router 224 no longer sends an LSU message to router 212.
  • the S_1, the Level_1 layer routers 112 and 312 After receiving the LSU message, the S_1, the Level_1 layer routers 112 and 312 update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • This step differs from S806 in that router 212 no longer receives LSU messages.
  • Level_0 layer router is a leaf node
  • Level_1 layer routers 112 and 312 send an LSU message to the southbound Level_0 layer routers 101-104 and 301-304 corresponding to the identifier of the path table.
  • the LSU message includes only the LSA excluding the path table.
  • This step differs from S807 in that router 212 does not send an LSU message to 201-204.
  • the S908 and the Level_0 layer routers 101-104 and 301-304 determine that the LSA is not forwarded according to the path table, and the local LSDB is updated only according to the LSA.
  • This step differs from S808 in that routers 201-204 no longer receive LSU messages.
  • Level_0 layer router knows the faulty link condition to calculate or flush to the path affected by the faulty Level_0 layer router based on the latest topology.
  • Level_1 layer routers including 111, 211, 212, 311, 411) that are not the next hop neighbors of the Level_2 layer routers do not receive the LSAs they send, because the next hop of the packets processed by these routers does not pass through the 224 routers. It will not receive packets sent directly from the 224 router.
  • This embodiment not only ensures the necessary update of the LSA generated by the fault associated Level_1 layer router 412 and Level_2 layer router 224 in the network, but also avoids unnecessary duplication or redundancy, and greatly reduces the transmission of LSA in the Fat-Tree network. The amount reduces the burden on the router to process LSU messages.
  • the eighth method is different from the improvement of the prior art. See mode one, and details are not described herein again.
  • the LSA sending method may include:
  • Level_0 layer router 404 it is only used as a local LSDB update, and the LSA is not sent to the Level_1 layer router.
  • the generated LSA differs from the LSA generated in step S401 in that the identifier of the router 404 is not included.
  • the hierarchical location information of the router 404 is also not included.
  • Each LSU message includes only the foregoing LSA excluding the path table.
  • This step differs from S402 in that router 412 does not send an LSU message to router 404.
  • the S1003, the routers 224, and the 401-403 respectively determine that the LSA is not forwarded according to the path table, and only the local LSDB is updated according to the LSA.
  • This step differs from S403 in that the router 404 does not receive the LSU message.
  • Steps S1004-S1011 are the same as steps S404-S411, and are not described herein again.
  • Level_0 layer router knows the faulty link condition to calculate or flush to the path affected by the faulty Level_0 layer router based on the latest topology.
  • This embodiment not only ensures the necessary update of the LSA generated by the fault associated Level_1 layer router 412 and Level_0 layer router 404 in the network, but also avoids unnecessary duplication or redundancy, and greatly reduces the transmission of LSA in the Fat-Tree network. The amount reduces the burden on the router to process LSU messages.
  • the method 9 is different from the improvement of the prior art. See mode 1 and no further details are provided here.
  • the LSA sending method may include:
  • Steps S1101-S1103 are the same as steps S1001-S1003, and are not described herein again.
  • Steps S1104-S11011 are the same as steps S504-S5011, and are not described herein again.
  • Level_0 layer router knows the faulty link condition to calculate/refresh to the path affected by the faulty Level_0 layer router based on the latest topology.
  • This embodiment not only ensures the necessary update of the LSA generated by the fault associated Level_1 layer router 412 and Level_0 layer router 404 in the network, but also avoids unnecessary duplication or redundancy, and greatly reduces the transmission of LSA in the Fat-Tree network. The amount reduces the burden on the router to process LSU messages.
  • the LSA sending method may include:
  • Level_2 layer router for example, router 224 in the figure
  • the southward Level_1 layer neighbor routers for example, routers 112, 212, 312, and 412 in the figure
  • the LSA generated by the router 112 includes the identity of the router 112 and the identity of the routers 101-104.
  • the LSA may also include hierarchical location information for router 112 and hierarchical location information for routers 101-104.
  • Level_0 layer router is a leaf node
  • Level_1 layer routers 112, 212, 312, and 412 send LSU messages to the corresponding south level Level 0 layer routers 101-404.
  • the LSU message includes only the LSA excluding the path table.
  • Level_1 layer routers 112, 212, 312, and 412 correspond to the second routers described in step S106, and the Level_0 layer routers 101-404 correspond to the third routers described in step S106; or, the Level_1 layer routers 112, 212, 312, 412 corresponds to the first router described in step S107, and Level_0 layer routers 101-404 correspond to the second router described in step S107.
  • the S1203 and the Level-0 layer routers 101-404 After receiving the LSU message, the S1203 and the Level-0 layer routers 101-404 determine that the LSA is not forwarded according to the path table, and the local LSDB is updated only according to the LSA.
  • Level_0 layer router and the router 101-404 correspond to the second router described in S108 and S109.
  • Level_0 layer router knows the router failure condition to calculate or flush to the path affected by the failure Level_layer router based on the latest topology.
  • This embodiment not only ensures the necessary update of the LSA generated by the fault associated Level_1 layer routers 112, 212, 312, and 412 in the network, but also avoids unnecessary duplication or redundancy, and greatly reduces the LSA in the Fat-Tree network.
  • the amount of transmission reduces the burden on the router to process LSU messages.
  • the method 11 is different from the improvement of the prior art, and the method is not described here.
  • the method for performing the event LSA update for the Level_1 layer router fault in the complete topology is as shown in FIG. 36.
  • the LSA sending method may include:
  • Level_1 layer router (the router 412 in the figure) fails, it is equivalent to multiple links failing at the same time, and the neighbor routers 222, 224, and 401-404 all generate the LSA as the advertising router.
  • Level_0 layer routers 401-404 it is only used as a local LSDB update and does not send the LSA to the Level_1 layer router.
  • the LSA generated by the Level_2 layer router router 222 includes the identifier of the router 222 and the identifiers of the routers 112, 212, and 312.
  • the LSA may also include hierarchical location information for router 222 and hierarchical location information for routers 112, 212, 312.
  • the LSA generated by the Level-2 layer router router 224 includes the identifier of the router 224 and the identifiers of the routers 112, 212, and 312.
  • the LSA may also include hierarchical location information for router 224 and hierarchical location information for routers 112, 212, 312.
  • the router 222 because the Level_1 layer routers 112, 212, and 312 are non-leaf nodes, the router 222 generates a path table for the neighbor routers 112, 212, and 312, respectively, and the router 224 generates a path table for the neighbor routers 112, 212, and 312, respectively.
  • Level_2 layer routers 222 and 224 correspond to the first routers in step S102
  • Level_1 layer routers 112, 212, and 312 correspond to the second routers in step S102
  • Level_0 layer routers 101-304 correspond to the steps S102.
  • S1303 and Level_2 layer routers 222 and 224 respectively transmit LSU messages to the Level_1 layer routers 112, 212, and 312, and each LSU message includes an LSA and a path table respectively generated for the neighbor routers 112, 212, and 312.
  • Level_2 layer routers 222 and 224 correspond to the first routers described in step S103
  • Level_1 layer routers 112, 212, and 312 correspond to the second routers described in step S103.
  • the S1304 and the Level_1 layer routers 112, 212, and 312 After receiving the LSU message, the S1304 and the Level_1 layer routers 112, 212, and 312 update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • Level_1 layer routers 112, 212, and 312 correspond to the second routers described in steps S104 and S105.
  • Level_0 layer router knows the router failure condition to calculate or flush to the path affected by the failure Level_layer router based on the latest topology.
  • This embodiment not only ensures the necessary update of the LSA generated by the fault associated Level_2 layer routers 222 and 224 in the network, but also avoids unnecessary duplication or redundancy, and greatly reduces the transmission amount of the LSA in the Fat-Tree network and reduces the transmission amount of the LSA in the Fat-Tree network. The burden on the router to process LSU messages.
  • the LSA sending method may include:
  • Level_0 layer router the router 404 in the figure
  • the neighbor routers such as the routers 411 and 412 in the figure
  • the process of the router 412 is described with reference to the description of the steps S1001-S1011, and details are not described herein again. Only the processing procedure of the router 411 will be described below.
  • the LSA generated by the router 411 includes the identifier of the router 411 and the identifiers of the routers 221, 223, and 401-403.
  • the LSA may also include hierarchical location information of the router 411 and hierarchical location information of the routers 221, 223, 401-403.
  • Routers 221 and 223 are equivalent, so one of them can be selected as a leaf node and the other as a non-leaf node.
  • the router 411 sends LSU messages to the routers 401-403 and 223 respectively.
  • Each LSU message includes only the foregoing LSA excluding the path table.
  • the router 411 corresponds to the first router, the Level_2 layer router 223, and the Level_0 layer routers 401-403 described in step S107, corresponding to the second router described in step S107.
  • the S1403 and the routers 401-403 and 223 respectively determine that the LSA is not forwarded according to the path table, and only the local LSDB is updated according to the LSA.
  • Level_2 layer router 223 and the Level_0 layer routers 401-403 correspond to the second routers described in steps S108 and S109.
  • the router 411 Because the Level_2 layer router 221 is a non-leaf node, the router 411 generates a path table for the neighbor router 221.
  • the router 411 needs to be located in the Level_1 layer, the router 221 is located in the Level_2 layer, and the routers 111, 211, and 311 are located in the Level_1 layer to generate a path table, where the path table includes the identifiers of the routers 111, 211, and 311.
  • Level_1 layer router 411 corresponds to the first router in step S102
  • Level_2 layer router 221 corresponds to the second router in step S102
  • Level_1 layer routers 111, 211, and 311 correspond to the third step in step S102. router.
  • the router 411 sends an LSU message to the router 221.
  • the LSU message includes an LSA and the path table.
  • router 411 informs router 221 to further transmit the received LSA to its southbound Level_1 layer neighbor routers 111, 211, 311.
  • Level_1 layer router 411 corresponds to the first router described in step S103
  • Level_2 layer router 221 corresponds to the second router described in step S103.
  • the S1406 and the router 221 After receiving the LSU message, the S1406 and the router 221 update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • Level_2 layer router 221 corresponds to the second router described in steps S104 and S105.
  • the router 221 Since the Level_1 layer routers 111, 211, and 311 are non-leaf nodes, the router 221 generates a path table for each of the routers 111, 211, and 311.
  • the router 221 needs to be combined with the Level_2 layer, the router 111 is located at the Level_1 layer, and the routers 101-104 are located at the Level_0 layer to generate a path table, and the path table includes the router 101- 104 logo.
  • the method for generating a path table for other neighboring routers is similar, and details are not described herein.
  • the Level_2 layer router 221 corresponds to the first router in step S102
  • the Level_1 layer routers 111, 211, and 311 correspond to the second router in step S102
  • the Level_0 layer router corresponds to the third router in step S102.
  • the router 221 sends an LSU message to the Level_1 layer routers 111, 211, and 311 to the south.
  • Each LSU message includes an LSA and a path table respectively generated by the neighboring routers 111, 211, and 311.
  • Level_2 layer router 221 corresponds to the first router described in step S103
  • Level_1 layer routers 111, 211, and 311 correspond to the second router described in step S103.
  • the S1409 and the Level_1 layer routers 111, 211, and 311 After receiving the LSU message, the S1409 and the Level_1 layer routers 111, 211, and 311 update the local LSDB according to the LSA, and determine the forwarding LSA according to the path table included in the LSU message.
  • Level_1 layer routers 111, 211, and 311 correspond to the second routers described in steps S104 and S105.
  • Level_0 layer router is a leaf node
  • Level_1 layer routers 111, 211, and 311 send an LSU message to the southbound Level_0 layer router corresponding to the identifier of the path table.
  • the LSU message includes only the LSA and does not include the path table.
  • the Level_1 layer routers 111, 211, and 311 correspond to the second routers in the step S106, and the Level_0 layer routers correspond to the third routers in the step S106; or the Level_1 layer routers 111, 211, and 311 correspond to the step S107.
  • the first router, the Level_0 layer router corresponds to the second router described in step S107.
  • the S1131 and the Level_0 layer router After receiving the LSU message, the S1131 and the Level_0 layer router determine that the LSA is not forwarded according to the path table, and only the local LSDB is updated according to the LSA.
  • Level_0 layer router corresponds to the second router described in S108 and S109.
  • Level_0 layer router knows the router failure condition to calculate/refresh to the path affected by the failure Level_0 layer router based on the latest topology.
  • This embodiment not only ensures the necessary update of the LSA generated by the fault associated Level_1 layer routers 401 and 402 in the network, but also avoids unnecessary duplication or redundancy, and greatly reduces the transmission amount of the LSA in the Fat-Tree network and reduces the transmission amount. The burden on the router to process LSU messages.
  • the embodiment of the present application provides a router for performing the foregoing method.
  • the embodiment of the present application may perform the division of the function module on the terminal device according to the foregoing method example.
  • each function module may be divided according to each function, or two or more functions may be integrated into one processing module.
  • the above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of the module in the embodiment of the present application is schematic, and is only a logical function division, and the actual implementation may have another division manner.
  • FIG. 40 is a schematic diagram showing a possible structure of a router involved in the foregoing embodiment.
  • the router 100 includes: a receiving unit 1011, a generating unit 1012, and an updating unit 1013.
  • the receiving unit 1011 is configured to support the router 100 to perform the processes S104, S108 in FIG. 3, the processes S104, S108, S121 in FIG. 6, the processes S104, S108, S121 in FIG. 7, and the processes S104, S108 in FIG. Processes S104, S108 in 8, processes S104, S108, S162, S164 in Fig. 10, processes S104, S108 in Fig. 12, processes S104, S108, S181 in Fig.
  • the updating unit 1013 is configured to support the router 100 to perform the processes S105, S109 in FIG. 3, the processes S105, S109, S122 in FIG. 6, the processes S105, S109, S122 in FIG. 7, the process in FIG. S105, S109, processes S105, S109 in Fig. 12, processes S105, S109 in Fig. 13, processes S204, S206 in Fig. 15, processes S304, S306 in Fig.
  • the transmitting unit 1014 is configured to support the router 100 to execute the process S103 in FIG. , S106, S107, processes S103, S106, S107 in FIG. 6, processes S1031, S106, S107 in FIG. 7, processes S1061, S107 in FIG. 8, processes S103, S106, S161, S163 in FIG. Processes S103, S106, S171 in 12, processes S103, S1061 in Fig. 13, processes S203, S205 in Fig. 15, processes S303, S305 in Fig. 17, processes S402, S405, S408, S410 in Fig. 19, Processes S502, S505, S508, S510 in Fig. 21, processes S603, S605, S608, S611, S613 in Fig.
  • the determining unit 1015 is configured to support the router 100 to perform the process in FIG. Process S101, process S101 in Fig. 6, process S101 in Fig. 7, process S101 in Fig. 8, process S101 in Fig. 10, process S101 in Fig. 12, and process S101 in Fig. 13. All the related content of the steps involved in the foregoing method embodiments may be referred to the functional descriptions of the corresponding functional modules, and details are not described herein again.
  • FIG. 41 shows a possible structural diagram of the router involved in the above embodiment.
  • the router 100 includes a processing module 1022 and a communication module 1023.
  • the processing module 1022 is configured to control and manage the action of the router 100.
  • the processing module 1022 is configured to support the router 100 to perform the functions of the generating unit, the updating unit, and the determining unit.
  • Communication module 1023 is used to support communication between the router and other entities, such as with the functional modules or network entities shown in FIG.
  • the router 100 may further include a storage module 1021 for storing program codes and data of the router.
  • the processing module 1022 can be a processor or a controller, and can be, for example, a central processing unit (CPU), a general-purpose processor, a digital signal processor (DSP), and an application-specific integrated circuit (Application-Specific). Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA) or other programmable logic device, transistor logic device, hardware component, or any combination thereof. It is possible to implement or carry out the various illustrative logical blocks, modules and circuits described in connection with the present disclosure.
  • the processor may also be a combination of computing functions, for example, including one or more microprocessor combinations, a combination of a DSP and a microprocessor, and the like.
  • the communication module 1023 may be a transceiver, a transceiver circuit, a network interface or a communication interface, or the like.
  • the storage module 1021 can be a memory.
  • the processing module 1022 may be the processor 1032 in FIG. 42
  • the communication module 1023 may be the network interface 1033 in FIG. 42
  • the storage module 1021 may be the memory 1031 in FIG. 42 .
  • the router involved in the embodiment of the present application may be the router 100 shown in FIG.
  • the router 100 includes a processor 1032, a network interface 1033, a memory 1031, and a bus 1034.
  • the network interface 1033, the processor 1032, and the memory 1031 are connected to each other through a bus 1034.
  • the bus 1034 may be a peripheral component interconnection standard bus or an extended industry standard structure bus.
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in the figure, but it does not mean that there is only one bus or one type of bus.
  • the size of the sequence numbers of the foregoing processes does not mean the order of execution sequence, and the order of execution of each process should be determined by its function and internal logic, and should not be applied to the embodiment of the present application.
  • the implementation process constitutes any limitation.
  • the disclosed systems, devices, and methods may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • there may be another division manner for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be electrical, mechanical or otherwise.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above embodiments it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof.
  • a software program it may be implemented in whole or in part in the form of a computer program product.
  • the computer program product includes one or more computer instructions.
  • the computer program instructions When the computer program instructions are loaded and executed on a computer, the processes or functions described in accordance with embodiments of the present application are generated in whole or in part.
  • the computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device.
  • the computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be from a website site, computer, server or data center Transmission to another website site, computer, server, or data center by wire (eg, coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (eg, infrared, wireless, microwave, etc.).
  • the computer readable storage medium can be any available media that can be accessed by a computer or a data storage device that includes one or more servers, data centers, etc. that can be integrated with the media.
  • the usable medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (such as a Solid State Disk (SSD)) or the like.
  • a magnetic medium eg, a floppy disk, a hard disk, a magnetic tape
  • an optical medium eg, a DVD
  • a semiconductor medium such as a Solid State Disk (SSD)

Landscapes

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

Abstract

本申请公开了一种链路状态通告LSA发送方法、装置和***，涉及通信领域，用于减少LSA发送次数。该方法包括：第一路由器根据其层次位置信息、第二路由器的层次位置信息和至少一个第三路由器的层次位置信息，生成第一路径表；第一路由器向第二路由器发送第一链路状态更新LSU消息；第二路由器从第一路由器接收第一链路状态更新LSU消息；第二路由器根据第一LSA更新其链路状态数据库LSDB；第二路由器向第一路径表中的标识对应的路由器发送第一LSA。本申请实施例应用于叶脊拓扑或胖树拓扑中LSA的发送。

Description

链路状态通告LSA发送方法、装置和***
本申请要求于2017年9月14日提交中国专利局、申请号为201710829090.9、申请名称为“链路状态通告LSA发送方法、装置和***”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信领域，尤其涉及一种链路状态通告(Link State Advertisement，LSA)泛洪方法、装置和***。
背景技术
叶脊(Leaf-Spine)或胖树(Fat-Tree)作为两种特殊的层次化、结构化拓扑，在数据中心中有着广泛的应用。参照图1中所示，为Leaf-Spine的拓扑示意图，包括脊(Spine)节点11和叶子(Leaf)节点12。参照图2中所示，为Fat-Tree的结构示意图，包括核心网络21、汇聚网络22和边缘网络(叶子节点)23，边缘网络23和汇聚网络22可以被划分为不同的集群(Pod)，每个集群中的拓扑等效于Leaf-Spine拓扑。
开放式最短路径优先(Open Shortest Path First，OSPF)协议，是目前网络中使用最广泛的内部网关(Interior Gateway Protocol，IGP)协议。其基本原理是：位于网络中的每台路由器通过Hello报文与它的邻居路由器建立邻接关系；每台路由器向每个邻居路由器发送LSA，每个邻居路由器在收到LSA之后要依次向它的邻居路由器转发这些LSA，即泛洪；每台路由器在各自链路状态数据库(Link State Database，LSDB)保存一份所收到的LSA的备份，所有路由器保存的LSDB相同；每台路由器依照拓扑数据库通过最短路径优先(Shortest Path First，SPF)算法计算出到网络上每个节点的最短路径，并将结果输出形成路由选择表。
对于Leaf-Spine拓扑或Fat-Tree拓扑，每对叶子节点之间存在多条等价路径，因此，现有技术中OSPF协议泛洪LSA的机制存在以下问题：首先，LSA在网络中泛洪时会产生大量的重复或冗余，会进一步产生LSA反弹现象；其次，当相邻节点之间发生链路故障时，仍然会通过其他节点接收到对方的LSA，但是这两个节点之间并不会有数据传输，因此没有必要维护完全相同的LSDB。
发明内容
本申请的实施例提供一种LSA发送方法、装置和***，用于减少LSA发送次数。为达到上述目的，本申请的实施例采用如下技术方案：
第一方面，提供了一种链路状态通告LSA发送方法，该方法包括：第一路由器根据其层次位置信息、第二路由器的层次位置信息和至少一个第三路由器的层次位置信息，生成第一路径表，其中，第二路由器是与第一路由器之间链路有效的邻居路由器，第三路由器是与第二路由器之间链路有效的邻居路由器中，除了第一路由器以外的路由器，第一路径表包括至少一个第三路由器的标识，第一路径表中的标识用于指示向对应路由器发送第一LSA，第一LSA包括通告路由器与其邻居路由器之间的有效链路，通告路由器指链路状态发生改变或周期性进行链路状态更新的路由器；第一路由器向 第二路由器发送第一链路状态更新LSU消息，其中，第一LSU消息中包括第一LSA和第一路径表。本申请实施例提供的LSA发送方法，发送LSA的路由器根据其层次位置信息、下一跳路由器的层次位置信息和下下一跳路由器的层次位置信息，生成路径表，发送LSA的路由器向下一跳路由器发送LSA的同时发送该路径表，由于该路径表中包括下下一跳路由器的标识，指示下一跳路由器向对应的下下一跳路由器转发LSA，直到作为叶子节点的路由器接收到LSA后不作转发。通过发送LSA的路由器指示下一跳路由器有选择地向下下一跳路由器转发LSA，减少了LSA的发送次数，避免下下一跳路由器重复收到LSA。
在一种实施方式中，该方法还包括：第一路由器从第四路由器接收第二LSU消息，第二LSU消息中包括第一LSA，其中，第四路由器是与第一路由器之间链路有效的邻居路由器中，除了第二路由器以外的路由器；第一路由器根据第一LSA更新其链路状态数据库LSDB。该实施方式提供了第一LSA的一种可能的来源。
在一种实施方式中，第一路由器向第二路由器发送第一链路状态更新LSU消息，包括：当第二LSU消息中还包括第二路径表时，第一路由器向第二路由器发送第一LSU消息，其中，第二路径表中包括至少一个第二路由器的标识，第二路径表中的标识用于指示向对应路由器发送第一LSA。该实施方式提供了发送LSU消息的一种可能的条件。
在一种实施方式中，第一路由器为通告路由器。该实施方式提供了第一路由器的一种可能的实现方式。
在一种实施方式中，第一LSA包括通告路由器的层次位置信息和/或与通告路由器链路有效的邻居路由器的层次位置信息。该实施方式提供了各路由器的层次位置信息的一种可能传递方式。
在一种实施方式中，在第一路由器根据其层次位置信息、第二路由器的层次位置信息和至少一个第三路由器的层次位置信息，生成第一路径表之前，该方法还包括：第一路由器从第二路由器接收第二LSA，第二LSA包括第二路由器的层次位置信息和/或至少一个第三路由器的层次位置信息。该实施方式提供了各路由器的层次位置信息的另一种可能传递方式。
在一种实施方式中，在第一路由器根据其层次位置信息、第二路由器的层次位置信息和至少一个第三路由器的层次位置信息，生成第一路径表之前，该方法还包括：第一路由器向第二路由器发送第一开放式最短路径优先OSPF协商消息；第一路由器从第二路由器接收第二OSPF协商消息；其中，第一OSPF协商消息中包括第一路由器的层次位置信息，第二OSPF协商消息中包括第二路由器的层次位置信息，第一OSPF协商消息和第二OSPF协商消息用于建立和维护第一路由器与第二路由器的邻居关系。该实施方式提供了各路由器的层次位置信息的又一种可能传递方式。
第二方面，提供了一种链路状态通告LSA发送方法，该方法包括：第二路由器从第一路由器接收第一链路状态更新LSU消息，其中，第一LSU消息中包括第一LSA和第一路径表，第一LSA包括通告路由器与其邻居路由器之间的有效链路，通告路由器指链路状态发生改变或周期性进行链路状态更新的路由器，第一路径表包括至少一个第三路由器的标识，第二路由器是与第一路由器之间链路有效的邻居路由器，第三 路由器是与第二路由器之间链路有效的邻居路由器中，除了第一路由器以外的路由器；第二路由器根据第一LSA更新其链路状态数据库LSDB；第二路由器向第一路径表中的标识对应的路由器发送第一LSA。本申请实施例提供的LSA发送方法，发送LSA的路由器根据其层次位置信息、下一跳路由器的层次位置信息和下下一跳路由器的层次位置信息，生成路径表，发送LSA的路由器向下一跳路由器发送LSA的同时发送该路径表，由于该路径表中包括下下一跳路由器的标识，指示下一跳路由器向对应的下下一跳路由器转发LSA，直到作为叶子节点的路由器接收到LSA后不作转发。通过发送LSA的路由器指示下一跳路由器有选择地向下下一跳路由器转发LSA，减少了LSA的发送次数，避免下下一跳路由器重复收到LSA。
在一种实施方式中，该方法还包括：第二路由器根据其层次位置信息、第三路由器的层次位置信息和至少一个第五路由器的层次位置信息，生成第二路径表，其中，第二路径表包括至少一个第五路由器的标识，第二路径表中的标识用于指示向对应路由器发送第一LSA，第五路由器是与第三路由器之间链路有效的邻居路由器中，除了第二路由器以外的路由器；第二路由器向第一路径表中的标识对应的路由器发送第一LSA，包括：第二路由器向第一路径表中的标识对应的路由器发送第二LSU消息，其中，第二LSU消息中包括第一LSA和第二路径表。该实施方式提供了在发送LSA时还可以同时携带路径表。
在一种实施方式中，在第二路由器根据其层次位置信息、第三路由器的层次位置信息和至少一个第五路由器的层次位置信息，生成第二路径表之前，该方法还包括：第二路由器从第三路由器接收第二LSA，第二LSA包括第三路由器的层次位置信息和/或至少一个第五路由器的层次位置信息。该实施方式提供了各路由器的层次位置信息的一种可能传递方式。
在一种实施方式中，第一LSA包括通告路由器的层次位置信息和/或与通告路由器链路有效的邻居路由器的层次位置信息。该实施方式提供了各路由器的层次位置信息的另一种可能传递方式。
在一种实施方式中，第一路由器为通告路由器。该实施方式提供了第一路由器的一种可能的实现方式。
在一种实施方式中，在第二路由器从第一路由器接收第一链路状态更新LSU消息之前，该方法还包括：第二路由器向第一路由器发送第一开放式最短路径优先OSPF协商消息；第二路由器从第一路由器接收第二OSPF协商消息；其中，第一OSPF协商消息中包括第二路由器的层次位置信息，第二OSPF协商消息中包括第一路由器的层次位置信息，第一OSPF协商消息和第二OSPF协商消息用于建立和维护第一路由器与第二路由器的邻居关系。该实施方式提供了各路由器的层次位置信息的又一种可能传递方式。
第三方面，提供了一种第一路由器，该路由器包括：生成单元，用于根据其层次位置信息、第二路由器的层次位置信息和至少一个第三路由器的层次位置信息，生成第一路径表，其中，第二路由器是与第一路由器之间链路有效的邻居路由器，第三路由器是与第二路由器之间链路有效的邻居路由器中，除了第一路由器以外的路由器，第一路径表包括至少一个第三路由器的标识，第一路径表中的标识用于指示向对应路 由器发送第一链路状态通告LSA，第一LSA包括通告路由器与其邻居路由器之间的有效链路，通告路由器指链路状态发生改变或周期性进行链路状态更新的路由器；发送单元，用于向第二路由器发送第一链路状态更新LSU消息，其中，第一LSU消息中包括第一LSA和第一路径表。基于同一发明构思，由于该第一路由器解决问题的原理以及有益效果可以参见上述第一方面和第一方面的各可能的方法实施方式以及所带来的有益效果，因此该第一路由器的实施可以参见上述第一方面和第一方面的各可能的方法的实施方式，重复之处不再赘述。
第四方面，提供了一种第二路由器，该路由器包括：接收单元，用于从第一路由器接收第一链路状态更新LSU消息，其中，第一LSU消息中包括第一链路状态通告LSA和第一路径表，第一LSA包括通告路由器与其邻居路由器之间的有效链路，通告路由器指链路状态发生改变或周期性进行链路状态更新的路由器，第一路径表包括至少一个第三路由器的标识，第二路由器是与第一路由器之间链路有效的邻居路由器，第三路由器是与第二路由器之间链路有效的邻居路由器中，除了第一路由器以外的路由器；更新单元，用于根据第一LSA更新其链路状态数据库LSDB；发送单元，用于向第一路径表中的标识对应的路由器发送第一LSA。基于同一发明构思，由于该第二路由器解决问题的原理以及有益效果可以参见上述第二方面和第二方面的各可能的方法实施方式以及所带来的有益效果，因此该第二路由器的实施可以参见上述第二方面和第二方面的各可能的方法的实施方式，重复之处不再赘述。
第五方面，本申请实施例提供一种路由器，包括：处理器、存储器、总线和通信接口；该存储器用于存储计算机执行指令，该处理器与该存储器通过该总线连接，当该路由器运行时，该处理器执行该存储器存储的该计算机执行指令，以使路由器执行上述第一方面中任意一项或第二方面中任意一项所述的方法。
第六方面，本申请实施例提供了一种计算机存储介质，包括指令，当其在计算机上运行时，使得计算机执行如第一方面中任意一项或第二方面中任意一项所述的方法。
第七方面，本申请实施例提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得该计算机执行如第一方面中任意一项或第二方面中任意一项所述的方法。
第八方面，本申请实施例提供了一种通信***，包括如第三方面所述的第一路由器和如第四方面所述的第二路由器。
另外，第五方面至第八方面中所带来的技术效果可参见第一方面中任意一项或第二方面中任意一项中不同设计方式所带来的技术效果，此处不再赘述。
附图说明
为了更清楚地说明本申请实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍。
图1为本申请的实施例提供的Leaf-Spine拓扑的通信***的结构示意图；
图2为本申请的实施例提供的Fat-Tree拓扑的通信***的结构示意图；
图3为本申请的实施例提供的LSA发送方法的流程示意图一；
图4为本申请的实施例提供的LSA报文格式的示意图一；
图5为本申请的实施例提供的扩展后的LSU消息报文格式的示意图；
图6为本申请的实施例提供的LSA发送方法的流程示意图二；
图7为本申请的实施例提供的LSA发送方法的流程示意图三；
图8为本申请的实施例提供的LSA发送方法的流程示意图四；
图9为本申请的实施例提供的HELLO消息报文格式的示意图；
图10为本申请的实施例提供的LSA发送方法的流程示意图五；
图11为本申请的实施例提供的LSA报文格式的示意图二；
图12为本申请的实施例提供的LSA发送方法的流程示意图六；
图13为本申请的实施例提供的LSA发送方法的流程示意图七；
图14为本申请的实施例提供的完备拓扑下的Level_2层路由器作为通告路由器进行周期性LSA更新的示意图；
图15为本申请的实施例提供的LSA发送方法的流程示意图八；
图16为本申请的实施例提供的非完备拓扑下的Level_2层路由器作为通告路由器进行周期性LSA更新的示意图；
图17为本申请的实施例提供的LSA发送方法的流程示意图九；
图18为本申请的实施例提供的完备拓扑下的Level_1层路由器作为通告路由器进行周期性LSA更新的示意图；
图19为本申请的实施例提供的LSA发送方法的流程示意图十；
图20为本申请的实施例提供的非完备拓扑下的Level_1层路由器作为通告路由器进行周期性LSA更新的示意图；
图21为本申请的实施例提供的LSA发送方法的流程示意图十一；
图22为本申请的实施例提供的完备拓扑下的Level_0层路由器作为通告路由器进行周期性LSA更新的示意图；
图23为本申请的实施例提供的LSA发送方法的流程示意图十二；
图24为本申请的实施例提供的非完备拓扑下的Level_0层路由器作为通告路由器进行周期性LSA更新的示意图；
图25为本申请的实施例提供的LSA发送方法的流程示意图十三；
图26为本申请的实施例提供的非完备拓扑下的Level_0层路由器作为通告路由器进行周期性LSA更新的示意图；
图27为本申请的实施例提供的LSA发送方法的流程示意图十四；
图28为本申请的实施例提供的非完备拓扑下的Level_1层路由器与Level_2层路由器之间链路故障进行事件性LSA更新的示意图；
图29为本申请的实施例提供的LSA发送方法的流程示意图十五；
图30为本申请的实施例提供的完备拓扑下的Level_1层路由器与Level_0层路由器之间链路故障进行事件性LSA更新的示意图；
图31为本申请的实施例提供的LSA发送方法的流程示意图十六；
图32为本申请的实施例提供的非完备拓扑下的Level_1层路由器与Level_0层路由器之间链路故障进行事件性LSA更新的示意图；
图33为本申请的实施例提供的LSA发送方法的流程示意图十七；
图34为本申请的实施例提供的完备拓扑下的Level_2层路由器故障进行事件性 LSA更新的示意图；
图35为本申请的实施例提供的LSA发送方法的流程示意图十八；
图36为本申请的实施例提供的完备拓扑下的Level_1层路由器故障进行事件性LSA更新的示意图；
图37为本申请的实施例提供的LSA发送方法的流程示意图十九；
图38为本申请的实施例提供的完备拓扑下的Level_0层路由器故障进行事件性LSA更新的示意图；
图39为本申请的实施例提供的LSA发送方法的流程示意图二十；
图40为本申请的实施例提供的路由器的结构示意图一；
图41为本申请的实施例提供的路由器的结构示意图二；
图42为本申请的实施例提供的路由器的结构示意图三。
具体实施方式
下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行清楚、完整地描述。
为便于描述，本申请实施例将图2中所示的Fat-Tree拓扑中的核心网络21称为层次2(Level_2)，将汇聚网络22称为层次1(Level_1)，将边缘网络(叶子节点)23称为层次0(Level_0)。由于Fat-Tree拓扑每个集群中的拓扑等效于图1中所示的Leaf-Spine拓扑，因此，可以将图1中所示的Leaf-Spine拓扑中脊(Spine)节点11称为层次1，将叶子(Leaf)节点12称为层次0。示例性的，本申请实施例将以Fat-Tree拓扑中LSA的传播为例进行说明，其同样也可以应用于Leaf-Spine拓扑或其他具有类似树形结构的拓扑中。
本申请实施例所述的层次位置信息指路由器在上述分层树形拓扑结构中的层次位置。示例性的，如图2中所示，路由器224的层次位置信息为层次2(Level_2)，路由器412的层次位置信息为层次1(Level_1)，路由器404的层次位置信息为层次0(Level_0)。
本申请实施例所述的完备拓扑指按规则Fat-Tree拓扑组网的拓扑。本申请实施例所述的非完备拓扑指相对于规则Fat-Tree拓扑，缺失其中某些链路或者节点的拓扑。本申请实施例所述的北向指从Level_0至Level_2方向，南向指从Level_2至Level_0方向。
本申请实施例所述的第一路由器、第二路由器、第三路由器、第四路由器、第五路由器等，是根据在LSA传输路径上的相对位置(例如下一跳、上一跳、下下一跳、上上一跳等)来分类的路由器。示例性的，如图2中所示，路由器404、412、224、111、101可以构成从路由器404至路由器101的一条LSA传输路径，路由器404、411、221、111、101可以构成从路由器404至路由器101的另一条LSA传输路径。在实际传输过程中，可以根据算法从中选择一条路径进行传输。对于路由器404来说，可以选择向路由器411或412发送LSA，即路由器411或412均为路由器404的下一跳路由器，则路由器411和412可以归为一类路由器，示例性的，可以令路由器404作为第一路由器，令路由器411和412作为第二路由器。另外需要说明的是，该LSA传输路径可以是最短路径优先(Shortest Path First，SPF)路径。
本申请实施例所述的叶子节点指在LSA传输路径上不再转发LSA的路由器节点。本申请实施例所述的非叶子节点或者中间节点指在LSA传输路径上继续转发LSA的路由器节点。示例性的，如图2中所示，路由器404、412、224、111、101可以构成从路由器404至路由器101的一条LSA传输路径，则路由器101为叶子节点，路由器412、224、111为非叶子节点。
本申请实施例所述的周期性进行链路状态更新指路由器周期性检查其与邻居路由器之间的链路状态。本申请实施例所述的邻居路由器指与本路由器直连的路由器，示例性的，参照图2中所示，路由器412与224互为邻居路由器，路由器412与112互相不为邻居路由器。本申请实施例所述的链路状态发生改变包括邻居路由器之间的链路断开、路由器节点故障、路由器接入网络等。
本申请实施例所述的路径表也可以被称为洪泛优化路径表(Flooding Optimization Reflector List，FORL)。
本申请实施例所述的LSA发送方法、装置和***，应用于上述Fat-Tree拓扑、Leaf-Spine拓扑或其他类似树形拓扑结构中，当链路状态发生改变或周期性进行链路状态更新时，通告路由器生成LSA，该LSA中包括通告路由器与其邻居路由器之间的有效链路。通告路由器向邻居路由器发送该LSA，由邻居路由器根据LSA更新其LSDB后，继续转发LSA。本申请实施例的目的在于在LSA转发过程中尽量减少LSA发送次数。
本申请实施例提供一种LSA发送方法，参照图3中所示，该方法包括：
S101、当第一路由器判断第二路由器是非叶子节点时，执行步骤S102-S106，当第一路由器判断第二路由器是叶子节点时，执行步骤S107-S109。
第二路由器是与第一路由器之间链路有效的邻居路由器。在LSA传输路径上，第一路由器作为发送LSA的路由器，第二路由器作为从第一路由器接收LSA的下一跳路由器。
第二路由器为非叶子节点，是指第二路由器还可以继续转发由第一路由器发送的LSA；第二路由器为叶子节点，是指第二路由器不能继续转发由第一路由器发送的LSA。
判断第二路由器为叶子节点或非叶子节点的方式可以包括：第二路由器位于Level_0层，此时第二路由器可以作为叶子节点；第二路由器除了第一路由器没有其他链路有效的邻居路由器，此时第二路由器可以作为叶子节点，否则第二路由器可以作为非叶子节点；在LSA传输路径上，多个第二路由器具有共同的下一跳邻居路由器，则可以选择其中至少一个第二路由器作为非叶子节点，其余第二路由器作为叶子节点。
S102、第一路由器根据其层次位置信息、第二路由器的层次位置信息和至少一个第三路由器的层次位置信息，生成第一路径表。
第三路由器是与第二路由器之间链路有效的邻居路由器中，除了第一路由器以外的路由器。在LSA传输路径上，第一路由器作为发送LSA的路由器，第二路由器作为从第一路由器接收并转发LSA的下一跳路由器，第三路由器作为从第二路由器接收并转发LSA的下下一跳路由器。
限定第三路由器与第一路由器不同是为了防止通过第二路由器转发后，将LSA回传至第一路由器。示例性的，如图2中所示，假设路由器404为第一路由器，路由器 412为第二路由器，路由器221和224均可以作为第三路由器，但是路由器404不能作为第三路由器，可以防止LSA回传至路由器404。
第一路径表包括至少一个第三路由器的标识，第一路径表中的标识用于指示向对应路由器发送第一LSA。第一路径表可以包括部分或全部第三路由器的标识。第一路径表中的标识实际对应第二路由器的下一跳邻居路由器的标识。示例性的，如图2中所示，假设路由器404为第一路由器，路由器412为第二路由器，路由器221和224为第三路由器，如果生成的第一路径表中只包括路由器221的标识，则表明路由器404指示路由器412仅向路由器221转发第一LSA，如果生成的第一路径表中包括路由器221和224的标识，则表明路由器404指示路由器412向路由器221和224均转发第一LSA。
第一LSA包括通告路由器与其邻居路由器之间的有效链路，通告路由器指当链路状态发生改变或周期性进行链路状态更新而生成LSA的路由器。示例性的，参照图2中所示，如果路由器101是通告路由器，则其所生成的LSA中包括路由器101与111之间的有效链路以及路由器101与112之间的有效链路。参照图4中所示，为LSA报文格式的示意图，LSA包括通告路由器的标识和与该通告路由器链路有效的邻居路由器的标识(即图中的Link ID)链路ID。
可选的，第一路由器可以为通告路由器，即第一LSA由第一路由器生成，则第一LSA中包括第一路由器与其邻居路由器之间的有效链路；或者，第一路由器也可以为LSA传输路径上的中间节点的路由器，即第一LSA不由第一路由器生成，而是由第一路由器进行转发。示例性的，参照图2中所示，假设路由器404为第一路由器并且为通告路由器，则第一LSA中包括：路由器404的标识，以及与路由器404链路有效的邻居路由器411和412的标识。假设路由器412为第一路由器，路由器404为通告路由器，第一LSA中同样包括：路由器404的标识，以及与路由器404链路有效的邻居路由器411和412的标识。
对于第一路由器如何获取第二路由器的层次位置信息以及第三路由器的层次位置信息将在后面进行详细介绍。
S103、第一路由器向第二路由器发送第一链路状态更新(Link State Update，LSU)消息，其中，第一LSU消息中包括第一LSA和第一路径表。
LSU消息是OSPF协议中的一种报文，可以用于封装LSA。本申请实施例对LSU消息进行扩展，参照图5中所示，扩展后的LSU消息报文包括OSPF报头、路径表和LSA。路径表包括标志位F、路由器ID数量N以及路由器ID0至路由器ID(N-1)。
其中，标志位F用于表示是否携带路径表信息，例如，F＝0可以表示不携带路径表信息，F＝1可以表示携带路径表信息，或者相反地，F＝1可以表示不携带路径表信息，F＝0可以表示携带路径表信息。
路由器ID数量N用于表示路径表中包括路由器ID的数量。
路由器ID0至路由器ID(N-1)用于表示具体的路由器ID，如前所述，其可以包括第三路由器中的部分或全部路由器的标识。
需要说明的是路径表也可以位于LSA之后。
S104、第二路由器从第一路由器接收第一LSU消息。
S105、第二路由器根据第一LSA更新其LSDB。
具体的，第二路由器用通告路由器所产生的第一LSA更新第二路由器保存的LSDB。LSDB通过不断更新可以获得整个网络的拓扑。
S106、第二路由器向第一路径表中的标识对应的路由器发送第一LSA。
该第一LSA同样可以在LSU消息中携带。
如前面示例所述，假设路由器404为第一路由器，路由器412为第二路由器，如果路由器404向路由器412发送的第一路径表中只包括路由器221的标识，则路由器412仅向路由器221转发第一LSA，如果第一路径表中包括路由器221和224的标识，则路由器412向路由器221和224均转发第一LSA。
需要说明的是，步骤S105和S106没有先后执行顺序。
以上步骤S102-S106是第二路由器为非叶子节点的分支，下面的步骤S107-S09是第二路由器为叶子节点的分支。
S107、第一路由器向第二路由器发送第二LSU消息，其中，第二LSU消息中包括第一LSA。
该步骤与步骤S103的区别在于，由于不需要第二路由器按照路径表转发LSA，所以不需要在LSU消息中携带路径表。
S108、第二路由器从第一路由器接收第二LSU消息。
S109、第二路由器根据第一LSA更新其LSDB。
该步骤与S105相同。
本申请实施例提供的LSA发送方法，发送LSA的路由器根据其层次位置信息、下一跳路由器的层次位置信息和下下一跳路由器的层次位置信息，生成路径表，发送LSA的路由器向下一跳路由器发送LSA的同时发送该路径表，由于该路径表中包括下下一跳路由器的标识，指示下一跳路由器向对应的下下一跳路由器转发LSA，直到作为叶子节点的路由器接收到LSA后不作转发。通过发送LSA的路由器指示下一跳路由器有选择地向下下一跳路由器转发LSA，减少了LSA的发送次数，避免下下一跳路由器重复收到LSA。
可选的，在一种实施方式中，参照图6中所示，当第一路由器为LSA传输路径上的中间节点的路由器时，该方法还包括步骤S121和S122：
S121、第一路由器从第四路由器接收第三LSU消息，第三LSU消息中包括第一LSA，其中，第四路由器是与第一路由器之间链路有效的邻居路由器中，除了第二路由器以外的路由器。
第四路由器可以是通告路由器，第一LSA由第四路由器生成；或者，与第一路由器一样是LSA传输路径上的中间节点的路由器，即第一LSA不由第四路由器生成，而是由第四路由器进行转发。与步骤S102中对第三路由器的限定类似的，限定第四路由器与第二路由器不同同样是为了防止通过第一路由器转发后，LSA回传至第四路由器。
S122、第一路由器根据第一LSA更新其LSDB。
该步骤与S105类似，在此不再赘述。需要说明的是，步骤S122与步骤S101-S109之间没有先后执行顺序。
该实施方式提供了第一路由器不是通告路由器时，如何获取LSA的一种方式。
基于图6所述方法进一步可选的，在一种实施方式中，参照图7中所示，步骤S103具体包括：
S1031、当第二LSU消息中还包括第二路径表时，第一路由器向第二路由器发送第一LSU消息，其中，第二路径表中包括至少一个第二路由器的标识，第二路径表中的标识用于指示向对应路由器发送第一LSA。
该步骤相当于第一路由器根据接收到的LSU消息中是否有路径表，来决定是否可以继续转发其中的LSA。当接收到LSU消息中有路径表时，根据路径表转发LSU消息中的LSA；当接收到LSU消息中没有路径表时，不转发LSU消息中的LSA。
第二路径表可以包括部分或全部第二路由器的标识。第二路径表中的标识实际对应第一路由器的下一跳邻居路由器的标识。
可选地，当第二LSU消息中不包括第二路径表时，第一路由器不向第二路由器发送第一LSU消息，即不转发LSA。
该实施方式提供了第一路由器根据接收到的LSU消息中是否有路径表，来决定是否转发其中的LSA。
可选的，在一种实施方式中，参照图8中所示，该方法还包括步骤S151，步骤S106具体包括步骤S1061：
S151、第二路由器根据其层次位置信息、第三路由器的层次位置信息和至少一个第五路由器的层次位置信息，生成第三路径表。
其中，第三路径表包括至少一个第五路由器的标识，第三路径表中的标识用于指示向对应路由器发送第一LSA，第五路由器是与第三路由器之间链路有效的邻居路由器中，除了第二路由器以外的路由器。
该步骤与S102类似，在此不再赘述。
S1061、第二路由器向第一路径表中的标识对应的路由器发送第四LSU消息，其中，第四LSU消息中包括第一LSA和第三路径表。
该步骤与S103类似，在此不再赘述。
该实施方式提供了第二路由器向第三路由器发送LSA和路径表的一种方式。
下面介绍本路由器如何获取其他路由器的层次位置关系：
可选的，在一种实施方式中，对于邻居路由器之间来说，本申请实施例对OSFP协商消息——HELLO消息进行扩展，HELLO消息用于建立和维护邻居路由器之间的邻居关系，路由器的所有接口周期性向外发送HELLO消息。
参照图9中所示，为HELLO消息报文格式的示意图，其中的可选项共8比特位，其中有5个比特位已经使用，还剩余3个比特位(图中*所示)，本申请实施例将其中两个比特位表示为层次位置信息LC，剩余一个比特位表示为标志位H。
其中，标志位H用于表示本路由器是否需要层次化设置，例如，H＝0可以表示本路由器无需层次化设置，H＝1可以表示本路由器需要层次化设置，或者相反地，H＝1可以表示本路由器无需层次化设置，H＝0可以表示本路由器需要层次化设置。
层次位置信息LC用于表示本路由器位于分层树形拓扑结构中的层次位置，例如，LC＝1可以表示本路由器位于Level_0层，LC＝2可以表示本路由器位于Level_1层， LC＝3可以表示本路由器位于Level_2层。或者LC可以按照其他方式取0-3中不同值来表示本路由器位于不同层，本申请实施不作限定。
参照图10中所示，在步骤S101之前，该方法还包括步骤S161-S164：
S161、第一路由器向第二路由器发送第一OSPF协商消息。
其中，第一OSPF协商消息中包括第一路由器的层次位置信息。第一OSPF协商消息可以是上述HELLO消息。该步骤使得第二路由器获知第一路由器的层次位置信息。
S162、第二路由器从第一路由器接收第一OSPF协商消息。
S163、第二路由器向第一路由器发送第二OSPF协商消息。
其中，第二OSPF协商消息中包括第二路由器的层次位置信息。第二OSPF协商消息可以是上述HELLO消息。第一OSPF协商消息和第二OSPF协商消息用于建立和维护第一路由器与第二路由器的邻居关系。该步骤使得第一路由器获知第二路由器的层次位置信息。
S164、第一路由器从第二路由器接收第二OSPF协商消息。
需要说明的是，本申请实施例虽然仅示例性地说明以第一路由器与第二路由器之间互相发送和接收HELLO消息的方式，来获取对方的层次位置信息，但是可以理解的是，对于其他互为邻居路由器的路由器之间同样可以通过该方式来获取对方的层次位置信息。
该实施方式提供了邻居路由器之间互相获取对方层次位置信息的一种方式。
可选的，在另一种实施方式中，对于间隔了一个邻居路由器的非邻居路由器之间来说，本申请实施例对图4中所示的LSA报文格式进行扩展：参照图11中所示，一方面，在LSA中添加通告路由器的层次位置信息的字段。另一方面，由于Link ID用于标识与通告路由器链路有效的邻居路由器的标识，因此可以针对每个Link ID添加一个层次位置信息的字段，来表示与通告路由器链路有效的邻居路由器的层次位置信息。需要说明的是，LSA可以同时包括这两个字段，或者可以只包括其中一个字段，最终使得LSA中包括通告路由器的层次位置信息和/或与通告路由器链路有效的邻居路由器的层次位置信息。
对于步骤S102中所述的第一路由器获取第二路由器的层次位置信息以及第三路由器的层次位置信息来说，可选的，参照图12中所示，在步骤S102之前，该方法还包括S171：
S171、第一路由器从第二路由器接收第二LSA，第二LSA包括第二路由器的层次位置信息和/或至少一个第三路由器的层次位置信息。
可以将第二路由器作为通告路由器，将第三路由器作为与第二路由器链路有效的邻居路由器，由第二路由器生成并向第一路由器发送LSA，该LSA中携带第二路由器的层次位置信息和/或至少一个第三路由器的层次位置信息。或者，可以将第三路由器作为通告路由器，将第二路由器作为与第三路由器链路有效的邻居路由器，由第二路由器向第一路由器转发由第三路由器生成的LSA，该LSA中携带第二路由器的层次位置信息和/或至少一个第三路由器的层次位置信息。
对于步骤S151中所述的第二路由器获取第三路由器的层次位置信息以及第五路 由器的层次位置信息来说，可选的，参照图13中所示，在步骤S151之前，该方法还包括S181：
S181、第二路由器从第三路由器接收第三LSA，第三LSA包括第三路由器的层次位置信息和/或至少一个第五路由器的层次位置信息。
该步骤与S171类似，在此不再赘述。
该实施方式提供了间隔一个邻居路由器的非邻居路由器之间互相获取对方层次位置信息的一种方式。
如表1所示，下面结合一些具体实施方式对上述方法进行详细说明。
表1
Figure PCTCN2018105326-appb-000001
方式一、参照图14中所示，为完备拓扑下的Level_2层路由器作为通告路由器进行周期性LSA更新的示意图，结合图15中所示，该LSA发送方法可以包括：
S201、Level_2层路由器224作为通告路由器生成LSA。
该LSA中包括路由器224的标识以及路由器112、212、312、412的标识。该LSA还可以包括路由器224的层次位置信息以及路由器112、212、312、412的层次位置信息。
S202、因为Level_1层路由器112、212、312、412是非叶子节点，因此路由器224针对邻居路由器112、212、312、412分别生成路径表。
也就是说，针对每个邻居路由器所生成的路径表都不相同。
示例性的，对于针对路由器112生成的路径表来说，路由器224需要结合其位于Level_2层，路由器112位于Level_1层，路由器101-104位于Level_0层来生成路径表，该路径表中包括路由器101-104的标识。针对其他邻居路由器生成路径表的方法类似，具体不再赘述。
此时，Level_2层路由器224对应步骤S102中所述的第一路由器，Level_1层路由器112、212、312、412对应步骤S102中所述的第二路由器，Level_0层路由器224对应步骤S102中所述的第三路由器。
S203、路由器224向南向Level_1层路由器112、212、312、412分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器112、212、312、412分别生成的 路径表。
也就是说，针对每个邻居路由器所发送的LSU消息中LSA相同，但路径表都不相同。
示例性的，路由器224向路由器112发送的LSU消息中的路径表包括路由器101-104的标识，路由器224向路由器212发送的LSU消息中的路径表包括路由器201-204的标识，依此类推。
此时，Level_2层路由器224对应步骤S103中所述的第一路由器，Level_1层路由器112、212、312、412对应步骤S103中所述的第二路由器。
S204、Level_1层路由器接收到上述LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
示例性的，路由器112接收到针对其发送的LSU消息后，根据LSA更新本地LSDB。
此时，Level_1层路由器对应步骤S104和S105中所述的第二路由器。
S205、因为Level_0层路由器是叶子节点，因此Level_1层路由器向路径表的标识对应的南向Level_0层路由器发送LSU消息，LSU消息中只包括LSA不包括路径表。
示例性的，Level_1层路由器112接收到针对其发送的LSU消息后，根据LSA更新本地LSDB。Level_0层路由器为叶子节点，因此路由器112向路由器101-104发送LSU消息，该LSU消息中包括LSA但不包括路径表。
此时，Level_1层路由器112可以对应步骤S106中所述的第二路由器，Level_0层路由器对应步骤S106中所述的第三路由器；Level_1层路由器112还可以对应步骤S107中所述的第一路由器，Level_0层路由器对应步骤S107中所述的第二路由器。
S206、Level_0层路由器接收到上述LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
示例性的，路由器101-104分别收到LSU消息中LSA后，仅根据LSA更新本地LSDB，终止该LSA进一步转发。
此时，Level_0层路由器对应S108和S109中所述的第二路由器。
方式一的技术效果：
(1)确保了Level_0层路由器知道通过Level_2层路由器224可以到达其他集群(Pod)的哪些Level_0层路由器。
(2)与Level_2层路由器224不是邻居的Level_1层路由器(包括111、211、311、411)不用接收到其发送的LSA，因为这些路由器上的路由表项不会根据路由器224发送的LSA发生任何更改，即经过这些路由器处理的数据包下一跳不会经过路由器224，也不会直接从路由器224接收到数据包。
(3)其他Level_2层路由器(如221、222、223)不用接收到路由器224发送的LSA，因为这些路由器上的路由表项不会根据224发送的LSA发生任何更改，即经过这些路由器处理的数据包下一跳不会经过路由器224，也不会直接从路由器224接收到数据包。
该实施例既保证了Level_2层路由器224生成的LSA在网络中的必要更新，又避免了不必要的重复或冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由 器处理LSU消息的负担。
方式一区别于现有技术的改进之处包括：
(1)不需要每个路由器维护完全相同的LSDB信息。
(2)某个路由器生成的LSA不一定需要泛洪至其他所有路由器。
(3)避免了某个路由器重复接收相同的LSA。
方式二、参照图16中所示，为非完备拓扑下的Level_2层路由器作为通告路由器进行周期性LSA更新的示意图，与图14相比较，缺少路由器224与212之间的链路。结合图17中所示，该LSA发送方法可以包括：
S301、Level_2层路由器224作为通告路由器生成LSA。
该LSA中包括路由器224的标识以及路由器112、312、412的标识。该LSA还可以包括路由器224的层次位置信息以及路由器112、312、412的层次位置信息。
S302、因为Level_1层路由器112、312、412是非叶子节点，路由器224针对邻居路由器112、312、412分别生成路径表。
该步骤与S202的区别在于不需要针对路由器212生成路径表。
S303、路由器224向南向Level_1层路由器112、312、412分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器112、312、412分别生成的路径表。
该步骤与S203的区别在于不需要向路由器212发送LSU消息。
S304、Level_1层路由器接收到上述LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
该步骤与S204的区别在于路由器212不会收到LSU消息，不会更新本地LSDB。
S305、因为Level_0层路由器是叶子节点，Level_1层路由器向路径表的标识对应的南向Level_0层路由器发送LSU消息，LSU消息中只包括LSA不包括路径表。
该步骤与S205的区别在于路由器212不会向南向Level_0层邻居路由器发送LSA。
S306、Level_0层路由器接收到上述LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
该步骤与S206的区别在于路由器201-204不会收到LSA。
方式二的技术效果：
(1)确保了Level_0层路由器知道通过Level_2层路由器224可以到达其他集群(Pod)的哪些Level_0层路由器。
(2)不是Level_2层路由器下下一跳邻居的Level_0层路由器(包括201、202、203及204)不用接收到其发送的LSA，因为这些路由器处理的数据包下下一跳不会经过路由器224，也不会接收从路由器224经过2跳发来的数据包，即这些叶子节点到其他集群(Pod)的数据包不会经过路由器224转发。
(3)与Level_2层路由器224不是邻居的Level_1层路由器(包括111、211、212、311、411)不用接收到其发送的LSA，因为这些路由器上的路由表项不会根据路由器224发送的LSA发生任何更改，即经过这些路由器处理的数据包下一跳不会经过路由器224，也不会直接从路由器224接收到数据包。
(4)其他Level_2层路由器(如221、222、223)不用接收到路由器224发送的LSA，因为这些路由器上的路由表项不会根据224发送的LSA发生任何更改，即经过 这些路由器处理的数据包下一跳不会经过224路由器，也不会直接从224路由器接收到数据包。
该实施例既保证了Level_2层路由器224生成的LSA在网络中的必要更新，又避免了不必要的重复或冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由器处理LSU消息的负担。
方式二区别于现有技术的改进之处见方式一，在此不再赘述。
方式三、参照图18中所示，为完备拓扑下的Level_1层路由器作为通告路由器进行周期性LSA更新的示意图，结合图19中所示，该LSA发送方法可以包括：
S401、Level_1层路由器412作为通告路由器生成LSA。
该LSA中包括路由器412的标识以及路由器224、222、401-404的标识。该LSA还可以包括路由器412的层次位置信息以及路由器224、222、401-404的层次位置信息。
Level_1层路由器生成LSA后，判断是否为它与北向Level_2层路由器间的链路故障触发的LSA更新，如果是，则不需要向Level_2层路由器发送该LSA，如果不是，才需要发送LSA。
需要说明的是，路由器222与224是等价的，可以选择其中一个作为叶子节点，另一个作非叶子节点。
S402、因为Level_2层路由器224以及Level_0层路由器401-404是叶子节点，因此路由器412向路由器224、401-404分别发送LSU消息，各LSU消息中仅包括上述LSA不包括路径表。
此时，路由器412对应步骤S107中所述的第一路由器，Level_2层路由器224以及Level_0层路由器401-404对应步骤S107中所述的第二路由器。
S403、路由器224、401-404分别接收到LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
此时，Level_2层路由器224以及Level_0层路由器401-404对应步骤S108和S109中所述的第二路由器。
S404、因为Level_2层路由器222是非叶子节点，因此路由器412针对邻居路由器222生成路径表。
示例性的，对于针对路由器222生成的路径表来说，路由器412需要结合其位于Level_1层，路由器222位于Level_2层，路由器112、212、312位于Level_1层来生成路径表，该路径表中包括路由器112、212、312的标识。
此时，Level_1层路由器412对应步骤S102中所述的第一路由器，Level_2层路由器222对应步骤S102中所述的第二路由器，Level_1层路由器112、212、312对应步骤S102中所述的第三路由器。
S405、路由器412向路由器222发送LSU消息，LSU消息中包括LSA以及上述路径表。
通过该路径表，路由器412告知路由器222将接收到的LSA进一步发送到其南向Level_1层邻居路由器112、212及312。
此时，Level_1层路由器412对应步骤S103中所述的第一路由器，Level_2层路 由器222对应步骤S103中所述的第二路由器。
S406、路由器222接收到LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
此时，Level_2层路由器222对应步骤S104和S105中所述的第二路由器。
S407、因为Level_1层路由器112、212及312是非叶子节点，因此路由器222针对邻居路由器112、212及312分别生成路径表。
示例性的，对于针对路由器112生成的路径表来说，路由器222需要结合其位于Level_2层，路由器112位于Level_1层，路由器101-104位于Level_0层来生成路径表，该路径表中包括路由器101-104的标识。针对其他邻居路由器生成路径表的方法类似，具体不再赘述。
此时，Level_2层路由器222对应步骤S102中所述的第一路由器，Level_1层路由器112、212及312对应步骤S102中所述的第二路由器，Level_0层路由器对应步骤S102中所述的第三路由器。
S408、路由器222向南向Level_1层路由器112、212、312分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器112、212、312分别生成的路径表。
此时，Level_2层路由器222对应步骤S103中所述的第一路由器，Level_1层路由器112、212及312对应步骤S103中所述的第二路由器。
S409、Level_1层路由器112、212、312接收到上述LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
此时，Level_1层路由器112、212及312对应步骤S104和S105中所述的第二路由器。
S410、因为Level_0层路由器是叶子节点，Level_1层路由器112、212、312向路径表的标识对应的南向Level_0层路由器发送LSU消息，LSU消息中只包括LSA不包括路径表。
此时，Level_1层路由器112、212及312对应步骤S106中所述的第二路由器，Level_0层路由器对应步骤S106中所述的第三路由器；或者，Level_1层路由器112、212及312对应步骤S107中所述的第一路由器，Level_0层路由器对应步骤S107中所述的第二路由器。
S411、Level_0层路由器接收到上述LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
此时，Level_0层路由器对应S108和S109中所述的第二路由器。
方式三的技术效果：
(1)确保了Level_0层路由器知道Level_1层路由器的最新状态信息，以便调整自己到其他Level_0层路由器的路由表项。
(2)与Level_1层路由器412不是邻居的Level_2层路由器(包括221、223)不用接收到其发送的送LSA，因为这些路由器上的路由表项不会根据路由器412发送的LSA发生任何更改，即经过这些路由器处理的数据包下一跳不会经过路由器412，也不会直接从路由器412接收到数据包。
(3)不是路由器412下下一跳的Level_1路由器(如111、211、311)不用接收 到路由器412生成的LSA，因为这些节点上的路由表项不会根据路由器412生成的LSA发生任何更改，即经过这些路由器处理的数据包下下一跳不会经过路由器224，也不会接收到从路由器224经由2跳发来的数据包；尽管从拓扑上看路由器411是路由器412的下下一跳节点，但是实际的集群(Pod)4中的流量不会经过Level_0层路由器、411、Level_0层路由器、412、Level_0层路由器这样迂回传送，集群(Pod)4中的Level_0层路由器间的流量要么只经过路由器411中转，要么只经过路由器412中转，所以路由器411也没有必要接收到路由器412生成的LSA。
该实施例既保证了Level_1层路由器412生成的LSA在网络中的必要更新，又避免了不必要的重复/冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由器处理LSU消息的负担。
方式二区别于现有技术的改进之处见方式一，在此不再赘述。
方式四、参照图20中所示，为非完备拓扑下的Level_1层路由器作为通告路由器进行周期性LSA更新的示意图，与图18相比较，缺少路由器222与312之间的链路。结合图21中所示，该LSA发送方法可以包括：
S501、Level_1层路由器412作为通告路由器生成LSA。
该步骤与S401相同，在此不再赘述。
S502、因为Level_0层路由器401-404是叶子节点，因此路由器412向路由器401-404分别发送LSU消息，各LSU消息中仅包括上述LSA不包括路径表。
该步骤与S402的区别在于，由于缺少了路由器222与312之间的链路，仅有路由器224与312之间的链路，因此路由器224作为非叶子节点。
S503、路由器401-404分别接收到LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
该步骤与S403的区别在于此时路由器224不会收到LSU消息。
S504、因为Level_2层路由器222、224是非叶子节点，因此路由器412针对邻居路由器222、224分别生成路径表。
该步骤与S404的区别在于此时路由器412还要针对路由器224生成路径表。
S505、路由器412向路由器222、224分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器222、224分别生成的路径表。
该步骤与S405的区别在于此时路由器412向路由器224发送的LSU消息中包括路径表。
S506、路由器222、224分别接收到LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
该步骤与S406的区别在于此时路由器224也会接收到LSU消息。
S507、因为Level_1层路由器112、212及312是非叶子节点，因此路由器222针对邻居路由器112、212分别生成路径表，路由器224针对邻居路由器312生成路径表。
该步骤与S407的区别在于此时路由器312在路由器224的下一跳。
S508、路由器222向南向Level_1层路由器112、212分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器112、212分别生成的路径表，路由器224向南向Level_1层路由器312发送LSU消息，LSU消息中包括LSA以及针对邻居路由器 312生成的路径表。
该步骤与S408的区别在于此时路由器312在路由器224的下一跳。
步骤S509-S511与步骤S409-S411相同，在此不再赘述。
方式四的技术效果：
(1)确保了Level_0层路由器知道Level_1层路由器的最新状态信息，以便调整自己到其他Level_0层路由器的路由表项。
(2)与Level_1层路由器412不是邻居的Level_2层路由器(包括221、223)不用接收到其发送的LSA，因为这些路由器上的路由表项不会根据412发送的LSA发生任何更改，即经过这些路由器处理的数据包下一跳不会经过路由器412，也不会直接从路由器412接收到数据包。
(3)不是路由器412下下一跳的Level_1层路由器(如111、211、311)不用接收到路由器412生成的LSA，因为这些路由器上的路由表项不会根据412生成的LSA发生任何更改，即经过这些路由器处理的数据包下下一跳不会经过路由器224，也不会接收到从路由器224经由2跳发来的数据包；尽管从拓扑上看路由器411是412的下下一跳路由器，但是实际的集群(Pod)4中的流量不会经过Level_0层路由器、411、Level_0层路由器、412、Level_0层路由器这样迂回传送，集群(Pod)4中的Level_0层路由器间的流量要么只经过路由器411中转，要么只经过路由器412中转，所以路由器411也没有必要接收到路由器412生成的LSA。
该实施例既保证了Level_1层路由器412生成的LSA在网络中的必要更新，又避免了不必要的重复或冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由器处理LSU消息的负担。
方式四区别于现有技术的改进之处见方式一，在此不再赘述。
方式五、参照图22中所示，为完备拓扑下的Level_0层路由器作为通告路由器进行周期性LSA更新的示意图，结合图23中所示，该LSA发送方法可以包括：
S601、Level_0层路由器404作为通告路由器生成LSA。
该LSA中包括路由器404的标识以及路由器411、412的标识。该LSA还可以包括路由器404的层次位置信息以及路由器411、412的层次位置信息。
S602、因为Level_2层路由器411、412是非叶子节点，因此路由器404针对邻居路由器411、412分别生成路径表。
示例性的，对于针对路由器412生成的路径表来说，路由器404需要结合其位于Level_0层，路由器412位于Level_1层，路由器222、224位于Level_2层，路由器403位于Level_0层来生成路径表，该路径表中包括路由器222、224、403的标识。
此时，Level_0层路由器404对应步骤S102中所述的第一路由器，Level_1层路由器411对应步骤S102中所述的第二路由器，Level_2层路由器221、223和Level_0层路由器401、402对应步骤S102中所述的第三路由器；Level_1层路由器412对应步骤S102中所述的第二路由器，Level_2层路由器222、224和Level_0层路由器403对应步骤S102中所述的第三路由器。
需要说明的是，路由器401-403是等价的，路由器411-412是等价的，因此二者之间的组合是任意的。例如，可以路由器401-403与411组合；或者，路由器401和 403与411组合，路由器402与422组合。路由器222与224是等价的，因此可以选择其中一个作叶子节点，另一个作非叶子节点。路由器221与223是等价的，因此可以选择其中一个作叶子节点，另一个作非叶子节点。
S603、路由器404向Level_1层路由器411、412发送LSU消息，LSU消息中包括LSA以及上述路径表。
通过上述路径表，路由器404告知路由器411将接收到的LSA进一步发送到其北向Level_1层邻居路由器221、223以及南向Level_1层邻居路由器401、402；路由器404告知412将接收到的LSA进一步发送到其南向Level_0层邻居路由器403及北向Level_2层邻居路由器222、224。
此时，Level_0层路由器404对应步骤S103中所述的第一路由器，Level_1层路由器411、412对应步骤S103中所述的第二路由器，Level_2层路由器221-224和Level_0层路由器401-403对应步骤S103中所述的第三路由器。
S604、Level_1层路由器411、412接收到LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
此时，Level_1层路由器411、412对应步骤S104和S105中所述的第二路由器。
S605、因为Level_0层路由器以及Level_2层路由器路由器224和223是叶子节点，Level_1层路由器411、412向路径表的标识对应的路由器发送LSU消息，LSU消息中只包括LSA不包括路径表。
Level_1层路由器411向路径表的标识对应的路由器401、402和北向Level_0层路由器223发送LSU消息，LSU消息中只包括LSA不包括路径表；Level_1层路由器412向路径表的标识对应的南向Level_0层路由器403以及北向Level_2层路由器224发送LSU消息，LSU消息中只包括LSA不包括路径表。
此时，Level_1层路由器411、412对应步骤S106中所述的第二路由器，Level_0层路由器401-403以及Level_2层路由器224和223对应步骤S106中所述的第三路由器；或者，Level_1层路由器411、412对应步骤S107中所述的第一路由器，Level_0层路由器401-403以及Level_2层路由器224和223对应步骤S107中所述的第二路由器。
S606、Level_0层路由器及路由器223、224接收到上述LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
此时，Level_0层路由器及路由器223、224对应S108和S109中所述的第二路由器。
S607、因为Level_2层路由器221是非叶子节点，因此路由器411针对邻居路由器221生成路径表；因为Level_2层路由器222是非叶子节点，因此路由器412针对邻居路由器222生成路径表。
示例性的，对于针对路由器222生成的路径表来说，路由器412需要结合其位于Level_1层，路由器222位于Level_2层，路由器112、212、312位于Level_1层来生成路径表，该路径表中包括路由器112、212、312的标识。针对其他邻居路由器生成路径表的方法类似，具体不再赘述。
此时，Level_1层路由器411和412对应步骤S102中所述的第一路由器，Level_2 层路由器221和222对应步骤S102中所述的第二路由器，Level_1层路由器对应步骤S102中所述的第三路由器。
S608、Level_1层路由器411、412向北向Level_2层路由器分别发送LSU消息，各LSU消息中包括LSA以及针对各路由器分别生成的路径表。
Level_1层路由器411向北向Level_2层路由器221发送LSU消息，LSU消息中包括LSA以及针对邻居路由器221生成的路径表；Level_1层路由器412向北向Level_2层路由器222发送LSU消息，LSU消息中包括LSA以及针对邻居路由器222生成的路径表。
此时，Level_1层路由器411、412对应步骤S103中所述的第一路由器，Level_2层路由器221和222对应步骤S103中所述的第二路由器。
S609、Level_2层路由器221和222接收到上述LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
此时，Level_2层路由器221和222对应步骤S104和S105中所述的第二路由器。
S610、因为Level_1层路由器112、211、311是非叶子节点，因此路由器221针对邻居路由器211、211、311生成路径表，路由器222针对邻居路由器112、212、312生成路径表。
此时，Level_2层路由器221和222对应步骤S102中所述的第一路由器，Level_1层路由器112、211、311对应步骤S102中所述的第二路由器，Level_0层路由器对应步骤S102中所述的第三路由器。
S611、Level_2层路由器221向南向Level_1层路由器111、211、311分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器111、211、311分别生成的路径表。Level_2层路由器222向南向Level_1层路由器112、212、312分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器112生成的路径表。
此时，Level_2层路由器221和222对应步骤S103中所述的第一路由器，Level_1层路由器111、211、311、112、212、312对应步骤S103中所述的第二路由器。
S612、Level_1层路由器111、211、311、112、212、312接收到上述LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
此时，Level_1层路由器111、211、311、112、212、312对应步骤S104和S105中所述的第二路由器。
S613、因为Level_0层路由器是叶子节点，Level_1层路由器111、211、311、112、212、312向路径表的标识对应的南向Level_0层路由器发送LSU消息，LSU消息中只包括LSA不包括路径表。
此时，Level_1层路由器111、211、311、112、212、312对应步骤S106中所述的第二路由器，Level_0层路由器对应步骤S106中所述的第三路由器；或者，Level_1层路由器111、211、311、112、212、312对应步骤S107中所述的第一路由器，Level_0层路由器对应步骤S107中所述的第二路由器。
S614、Level_0层路由器接收到上述LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
此时，Level_0层路由器对应S108和S109中所述的第二路由器。
方式五的技术效果：
确保了其他Level_0层路由器知道通告路由器Level_0层路由器的最新状态信息，以便调整自己到其他Level_0层路由器的路由表项。
该实施例既保证了Level_0层路由器404生成的LSA在网络中的必要更新，又避免了不必要的重复或冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由器处理LSU消息的负担。
方式五区别于现有技术的改进之处见方式一，在此不再赘述。
方式六、参照图24中所示，为非完备拓扑下的Level_0层路由器作为通告路由器进行周期性LSA更新的示意图，与图22相比较，缺少路由器221与311之间的链路、路由器222与312之间的链路、路由器223与211之间的链路、路由器224与212之间的链路、路由器111与104之间的链路、路由器112与101之间的链路、路由器311与304之间的链路、路由器312与301之间的链路、路由器412与401之间的链路、路由器412与402之间的链路、路由器311与221之间的链路。结合图25中所示，该LSA发送方法可以包括：
步骤S701-S704与步骤S601-S604相同，在此不再赘述。
S705、因为Level_0层路由器是叶子节点，Level_1层路由器411、412向路径表的标识对应的路由器发送LSU消息，LSU消息中只包括LSA不包括路径表。
Level_1层路由器411向路径表的标识对应的南向Level_0层路由器401、402发送LSU消息，LSU消息中只包括LSA不包括路径表；Level_1层路由器412向路径表的标识对应的南向Level_0层路由器403发送LSU消息，LSU消息中只包括LSA不包括路径表。
该步骤与S605的区别在于，由于缺少了路由器222与312之间的链路，仅有路由器224与312之间的链路，因此路由器224作为非叶子节点；由于缺少了路由器311与221之间的链路，仅有路由器223与311之间的链路，因此路由器223作为非叶子节点。
S706、Level_0层路由器接收到上述LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
该步骤与S606区别在于，此时路由器223、224不会接收到上述只包括LSA不包括路径表的LSU消息。
S707、因为Level_2层路由器221、223是非叶子节点，因此路由器411针对邻居路由器221、223分别生成路径表；因为Level_2层路由器222、224是非叶子节点，因此路由器412针对邻居路由器222、224分别生成路径表。
该步骤与S607区别在于，此时路由器411针对路由器223生成路径表，路由器412针对路由器224生成路径表。
S708、Level_1层路由器411、412向北向Level_2层路由器分别发送LSU消息，各LSU消息中包括LSA以及针对各路由器分别生成的路径表。
Level_1层路由器411向北向Level_2层路由器221、223分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器221、223分别生成的路径表；Level_1层路由器412向北向Level_2层路由器222、224分别发送LSU消息，各LSU消息中包括 LSA以及针对邻居路由器222、224分别生成的路径表。
该步骤与S608区别在于，此时会向路由器223、224发送包括LSA和路径表的LSU消息。
步骤S705和S708没有先后执行顺序。
S709、Level_2层路由器221-224接收到上述LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
该步骤与S609区别在于，此时路由器223、224根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
S710、因为Level_1层路由器111、112、211、311、312是非叶子节点，因此路由器221针对邻居路由器111、211生成路径表，路由器222针对邻居路由器112、212生成路径表，路由器223针对邻居路由器311生成路径表，路由器224针对邻居路由器312生成路径表。
该步骤与S610区别在于，此时路由器223针对邻居路由器311生成路径表，路由器224针对邻居路由器312生成路径表，路由器221针对邻居路由器111生成路径表。
S711、Level_2层路由器221-224向南向Level_1层路由器分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器111、112、211、212、311、312分别生成的路径表。
该步骤与S611区别在于，此时路由器223向路由器311发送LSU消息，而路由器221不再向路由器311发送LSU消息；路由器224向路由器312发送LSU消息，而路由器222不再向路由器312发送LSU消息。
S712、Level_1层路由器111、112、211、212、311、312接收到上述LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
该步骤与S612区别在于，此时路由器312从路由器224接收LSU消息，路由器311从路由器223接收LSU消息。
S713、因为Level_0层路由器是叶子节点，Level_1层路由器111、112、211、212、311、312向路径表的标识对应的南向Level_0层路由器发送LSU消息，LSU消息中只包括LSA不包括路径表。
S714、Level_0层路由器接收到上述LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
方式六的技术效果：
确保了其他Level_0层路由器知道通告路由器Level_0层路由器的最新状态信息，以便调整自己到其他Level_0层路由器的路由表项。
该实施例既保证了Level_0层路由器404生成的LSA在网络中的必要更新，又避免了不必要的重复或冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由器处理LSU消息的负担。
方式六区别于现有技术的改进之处见方式一，在此不再赘述。
方式七、参照图26中所示，为完备拓扑下的Level_1层路由器与Level_2层路由器之间链路故障进行事件性LSA更新的示意图，结合图27中所示，该LSA发送方法可以包括：
S801、当链路故障发生在Level_1层路由器与Level_2层路由器之间(如路由器412与224之间)时，该事件关联的两个路由器412及224均作为通告路由器生成LSA。
路由器412生成的LSA中包括路由器412的标识以及路由器401-404的标识。该LSA还可以包括路由器412的层次位置信息以及路由器401-404的层次位置信息。
路由器224生成的LSA中包括路由器224的标识以及路由器112、212、312的标识。该LSA还可以包括路由器224的层次位置信息以及路由器112、212、312的层次位置信息。
S802、因为Level_0层路由器是叶子节点，Level_1层路由器412向南向Level_0层路由器401-404发送LSU消息，LSU消息中只包括LSA不包括路径表。
此时，Level_1层路由器412对应步骤S107中所述的第一路由器，Level_0层路由器401-404对应步骤S107中所述的第二路由器。
S803、Level_0层路由器401-404接收到上述LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
此时，Level_0层路由器401-404对应S108和S109中所述的第二路由器。
S804、因为Level_1层路由器112、212、312是非叶子节点，因此路由器224针对邻居路由器112、212、312分别生成路径表。
此时，Level_2层路由器224对应步骤S102中所述的第一路由器，Level_1层路由器112、212、312对应步骤S102中所述的第二路由器，Level_0层路由器101-304对应步骤S102中所述的第三路由器。
S805、Level_2层路由器224向南向Level_1层路由器112、212、312分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器112、212、312分别生成的路径表。
此时，Level_2层路由器224对应步骤S102中所述的第一路由器，Level_1层路由器112、212、312对应步骤S102中所述的第二路由器。
S806、Level_1层路由器112、212、312接收到上述LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
此时，Level_1层路由器112、212、312对应步骤S104和S105中所述的第二路由器。
S807、因为Level_0层路由器是叶子节点，Level_1层路由器112、212、312向路径表的标识对应的南向Level_0层路由器101-304发送LSU消息，LSU消息中只包括LSA不包括路径表。
此时，Level_1层路由器112、212、312对应步骤S106中所述的第二路由器，Level_0层路由器101-304对应步骤S106中所述的第三路由器；或者，Level_1层路由器112、212、312对应步骤S107中所述的第一路由器，Level_0层路由器101-304对应步骤S107中所述的第二路由器。
S808、Level_0层路由器101-304接收到上述LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
此时，Level_0层路由器101-304对应S108和S109中所述的第二路由器。
方式七的技术效果：
确保了Level_0层路由器知道故障链路情况，以便基于最新拓扑计算或刷新到受故障影响Level_0层路由器的路径。
该实施例既保证了故障关联Level_1层路由器412及Level_2层路由器224生成的LSA在网络中的必要更新，又避免了不必要的重复或冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由器处理LSU消息的负担。
方式七区别于现有技术的改进之处见方式一，在此不再赘述。
方式八、参照图28中所示，为非完备拓扑下的Level_1层路由器与Level_2层路由器之间链路故障进行事件性LSA更新的示意图，与图26相比较，缺少路由器224与212之间的链路。结合图29中所示，该LSA发送方法可以包括：
步骤S901-S903与步骤S801-S803相同，在此不再赘述。
S904、因为Level_1层路由器112、312是非叶子节点，因此路由器224针对邻居路由器112、312分别生成路径表。
该步骤与S804的区别在于，路由器224不再针对邻居路由器212生成路径表。
S905、Level_2层路由器224向南向Level_1层路由器112、312分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器112、312分别生成的路径表。
该步骤与S805的区别在于，路由器224不再向路由器212发送LSU消息。
S906、Level_1层路由器112、312接收到上述LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
该步骤与S806的区别在于，路由器212不再接收LSU消息。
S907、因为Level_0层路由器是叶子节点，Level_1层路由器112、312向路径表的标识对应的南向Level_0层路由器101-104、301-304发送LSU消息，LSU消息中只包括LSA不包括路径表。
该步骤与S807的区别在于，路由器212不向201-204发送LSU消息。
S908、Level_0层路由器101-104、301-304接收到上述LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
该步骤与S808的区别在于，路由器201-204不再接收LSU消息。
方式八的技术效果：
(1)确保了Level_0层路由器知道故障链路情况，以便基于最新拓扑计算或刷新到受故障影响Level_0层路由器的路径。
(2)不是Level_2层路由器下一跳邻居的Level_1层路由器(包括111、211、212、311、411)不用接收到其发送的LSA，因为这些路由器处理的数据包下一跳不会经过224路由器，也不会接收直接从224路由器发来的数据包。
该实施例既保证了故障关联Level_1层路由器412及Level_2层路由器224生成的LSA在网络中的必要更新，又避免了不必要的重复或冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由器处理LSU消息的负担。
方式八区别于现有技术的改进之处见方式一，在此不再赘述。
方式九、参照图30中所示，为完备拓扑下的Level_1层路由器与Level_0层路由器之间链路故障进行事件性LSA更新的示意图，结合图31中所示，该LSA发送方法可以包括：
S1001、当链路故障发生在Level_0层路由器与Level_1层路由器之间(如路由器404与412之间)时，该事件关联的两个路由器404与412均作为通告路由器生成LSA。
对于Level_0层路由器404而言，其仅作本地LSDB更新，不向Level_1层路由器发送该LSA。
对于Level_1层路由器412而言，其生成的LSA与步骤S401中生成的LSA的区别在于，不包括路由器404的标识。也不包括路由器404的层次位置信息。
S1002、因为Level_2层路由器224以及Level_0层路由器401-403是叶子节点，因此路由器412向路由器224、401-403分别发送LSU消息，各LSU消息中仅包括上述LSA不包括路径表。
该步骤与S402的区别在于，路由器412不会向路由器404发送LSU消息。
S1003、路由器224、401-403分别接收到LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
该步骤与S403的区别在于，路由器404不会接收到LSU消息。
步骤S1004-S1011与步骤S404-S411相同，在此不再赘述。
方式九的技术效果：
确保了Level_0层路由器知道故障链路情况，以便基于最新拓扑计算或刷新到受故障影响Level_0层路由器的路径。
该实施例既保证了故障关联Level_1层路由器412及Level_0层路由器404生成的LSA在网络中的必要更新，又避免了不必要的重复或冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由器处理LSU消息的负担。
方式九区别于现有技术的改进之处见方式一，在此不再赘述。
方式十、参照图32中所示，为非完备拓扑下的Level_1层路由器与Level_0层路由器之间链路故障进行事件性LSA更新的示意图，结合图33中所示，该LSA发送方法可以包括：
步骤S1101-S1103与步骤S1001-S1003相同，在此不再赘述。
步骤S1104-S11011与步骤S504-S5011相同，在此不再赘述。
方式十的技术效果：
确保了Level_0层路由器知道故障链路情况，以便基于最新拓扑计算/刷新到受故障影响Level_0层路由器的路径。
该实施例既保证了故障关联Level_1层路由器412及Level_0层路由器404生成的LSA在网络中的必要更新，又避免了不必要的重复或冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由器处理LSU消息的负担。
方式十一、参照图34中所示，为完备拓扑下的Level_2层路由器故障进行事件性LSA更新的示意图，结合图35中所示，该LSA发送方法可以包括：
S1201、当Level_2层路由器(例如图中的路由器224)失效时，等效于多条链路同时发生故障，其南向Level_1层邻居路由器(例如图中的路由器112、212、312、412)均作为通告路由器生成LSA。
示例性的，路由器112生成的LSA中包括路由器112的标识以及路由器101-104的标识。该LSA还可以包括路由器112的层次位置信息以及路由器101-104的层次位 置信息。
S1202、因为Level_0层路由器是叶子节点，Level_1层路由器112、212、312、412向对应的南向Level_0层路由器101-404发送LSU消息，LSU消息中只包括LSA不包括路径表。
此时，Level_1层路由器112、212、312、412对应步骤S106中所述的第二路由器，Level_0层路由器101-404对应步骤S106中所述的第三路由器；或者，Level_1层路由器112、212、312、412对应步骤S107中所述的第一路由器，Level_0层路由器101-404对应步骤S107中所述的第二路由器。
S1203、Level_0层路由器101-404接收到上述LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
此时，Level_0层路由器及路由器101-404对应S108和S109中所述的第二路由器。
方式十一的技术效果：
确保了Level_0层路由器知道路由器失效情况，以便基于最新拓扑计算或刷新至受故障影响Level_0层路由器的路径。
该实施例既保证了故障关联Level_1层路由器112、212、312、412生成的LSA在网络中的必要更新，又避免了不必要的重复或冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由器处理LSU消息的负担。
方式十一区别于现有技术的改进之处见方式一，在此不再赘述。
方式十二、参照图36中所示，为完备拓扑下的Level_1层路由器故障进行事件性LSA更新的示意图，结合图37中所示，该LSA发送方法可以包括：
S1301、当Level_1层路由器(如图中的路由器412)失效时，等效于多条链路同时发生故障，其邻居路由器222、224、401-404均作为通告路由器生成LSA。
对于Level_0层路由器401-404而言，其仅作本地LSDB更新，不向Level_1层路由器发送该LSA。
Level_2层路由器路由器222生成的LSA中包括路由器222的标识以及路由器112、212、312的标识。该LSA还可以包括路由器222的层次位置信息以及路由器112、212、312的层次位置信息。
Level_2层路由器路由器224生成的LSA中包括路由器224的标识以及路由器112、212、312的标识。该LSA还可以包括路由器224的层次位置信息以及路由器112、212、312的层次位置信息。
S1302、因为Level_1层路由器112、212、312是非叶子节点，因此路由器222针对邻居路由器112、212、312分别生成路径表，路由器224针对邻居路由器112、212、312分别生成路径表。
此时，Level_2层路由器222、224对应步骤S102中所述的第一路由器，Level_1层路由器112、212、312对应步骤S102中所述的第二路由器，Level_0层路由器101-304对应步骤S102中所述的第三路由器。
S1303、Level_2层路由器222、224向南向Level_1层路由器112、212、312分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器112、212、312分别生成的路径表。
此时，Level_2层路由器222、224对应步骤S103中所述的第一路由器，Level_1层路由器112、212、312对应步骤S103中所述的第二路由器。
S1304、Level_1层路由器112、212、312接收到上述LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
此时，Level_1层路由器112、212、312对应步骤S104和S105中所述的第二路由器。
方式十二的技术效果：
确保了Level_0层路由器知道路由器失效情况，以便基于最新拓扑计算或刷新到受故障影响Level_0层路由器的路径。
该实施例既保证了故障关联Level_2层路由器222、224生成的LSA在网络中的必要更新，又避免了不必要的重复或冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由器处理LSU消息的负担。
方式十三、参照图38中所示，为完备拓扑下的Level_0层路由器故障进行事件性LSA更新的示意图，结合图39中所示，该LSA发送方法可以包括：
S1401、当Level_0层路由器(如图中的路由器404)失效时，等效于多条链路同时发生故障，其邻居路由器(如图中的路由器411、412)均作为通告路由器生成LSA。
路由器412的处理过程参照步骤S1001-S1011的描述，在此不再赘述，下面只对路由器411的处理过程进行描述。
路由器411生成的LSA中包括路由器411的标识以及路由器221、223、401-403的标识。该LSA还可以包括路由器411的层次位置信息以及路由器221、223、401-403的层次位置信息。
路由器221与223是等价的，因此可以选择其中一个作叶子节点，另一个作非叶子节点。
S1402、因为Level_0层路由器401-403和Level_2层路由器223是叶子节点，因此路由器411向路由器401-403、223分别发送LSU消息，各LSU消息中仅包括上述LSA不包括路径表。
此时，路由器411对应步骤S107中所述的第一路由器，Level_2层路由器223以及Level_0层路由器401-403对应步骤S107中所述的第二路由器。
S1403、路由器401-403、223分别接收到LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
此时，Level_2层路由器223以及Level_0层路由器401-403对应步骤S108和S109中所述的第二路由器。
S1404、因为Level_2层路由器221是非叶子节点，因此路由器411针对邻居路由器221生成路径表。
示例性的，路由器411需要结合其位于Level_1层，路由器221位于Level_2层，路由器111、211、311位于Level_1层来生成路径表，该路径表中包括路由器111、211、311的标识。
此时，Level_1层路由器411对应步骤S102中所述的第一路由器，Level_2层路由器221对应步骤S102中所述的第二路由器，Level_1层路由器111、211、311对应 步骤S102中所述的第三路由器。
S1405、路由器411向路由器221发送LSU消息，LSU消息中包括LSA以及上述路径表。
通过该路径表，路由器411告知路由器221将接收到的LSA进一步发送到其南向Level_1层邻居路由器111、211、311。
此时，Level_1层路由器411对应步骤S103中所述的第一路由器，Level_2层路由器221对应步骤S103中所述的第二路由器。
S1406、路由器221接收到LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
此时，Level_2层路由器221对应步骤S104和S105中所述的第二路由器。
S1407、因为Level_1层路由器111、211、311是非叶子节点，因此路由器221针对路由器111、211、311分别生成路径表。
示例性的，对于针对路由器111生成的路径表来说，路由器221需要结合其位于Level_2层，路由器111位于Level_1层，路由器101-104位于Level_0层来生成路径表，该路径表中包括路由器101-104的标识。针对其他邻居路由器生成路径表的方法类似，具体不再赘述。
此时，Level_2层路由器221对应步骤S102中所述的第一路由器，Level_1层路由器111、211、311对应步骤S102中所述的第二路由器，Level_0层路由器对应步骤S102中所述的第三路由器。
S1408、路由器221向南向Level_1层路由器111、211、311分别发送LSU消息，各LSU消息中包括LSA以及针对邻居路由器111、211、311分别生成的路径表。
此时，Level_2层路由器221对应步骤S103中所述的第一路由器，Level_1层路由器111、211、311对应步骤S103中所述的第二路由器。
S1409、Level_1层路由器111、211、311接收到上述LSU消息后，根据LSA更新本地LSDB，并根据LSU消息中包括路径表确定转发LSA。
此时，Level_1层路由器111、211、311对应步骤S104和S105中所述的第二路由器。
S1410、因为Level_0层路由器是叶子节点，Level_1层路由器111、211、311向路径表的标识对应的南向Level_0层路由器发送LSU消息，LSU消息中只包括LSA不包括路径表。
此时，Level_1层路由器111、211、311对应步骤S106中所述的第二路由器，Level_0层路由器对应步骤S106中所述的第三路由器；或者，Level_1层路由器111、211、311对应步骤S107中所述的第一路由器，Level_0层路由器对应步骤S107中所述的第二路由器。
S1411、Level_0层路由器接收到上述LSU消息后，根据其中不包括路径表确定不转发LSA，仅根据LSA更新本地LSDB。
此时，Level_0层路由器对应S108和S109中所述的第二路由器。
方式十三的技术效果：
确保了Level_0层路由器知道路由器失效情况，以便基于最新拓扑计算/刷新到受 故障影响Level_0层路由器的路径。
该实施例既保证了故障关联Level_1层路由器401、402生成的LSA在网络中的必要更新，又避免了不必要的重复或冗余，大幅度降低LSA在Fat-Tree网络中的传送量，减轻了路由器处理LSU消息的负担。
本申请实施例提供一种路由器，用于执行上述方法。本申请实施例可以根据上述方法示例对终端设备进行功能模块的划分，例如，可以对应各个功能划分各个功能模块，也可以将两个或两个以上的功能集成在一个处理模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。需要说明的是，本申请实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。
在采用对应各个功能划分各个功能模块的情况下，图40示出了上述实施例中所涉及的路由器的一种可能的结构示意图，路由器100包括：接收单元1011、生成单元1012、更新单元1013、发送单元1014、判断单元1015。接收单元1011用于支持路由器100执行图3中的过程S104、S108，图6中的过程S104、S108、S121，图7中的过程S104、S108、S121，图9中的过程S104、S108，图8中的过程S104、S108，图10中的过程S104、S108、S162、S164，图12中的过程S104、S108，图13中的过程S104、S108、S181，图15中的过程S204、S206，图17中的过程S304、S306，图19中的过程S403、S406、S409、S411，图21中的过程S503、S506、S509、S511，图23中的过程S604、S606、S609、S612、S614，图25中的过程S704、S706、S709、S712、S714，图27中的过程S803、S806、S808，图29中的过程S903、S906、S908，图31中的过程S1003、S1006、S1009、S1011，图33中的过程S1103、S1106、S1109、S1111，图35中的过程S1203，图37中的过程S1304，图39中的过程S1403、S1406、S1409、S1411；生成单元1012用于支持路由器100执行图3中的过程S102，图6中的过程S102，图7中的过程S102，图8中的过程S102、S151，图10中的过程S102，图12中的过程S102，图13中的过程S102、S151，图15中的过程S201、S202，图17中的过程S301、S302，图19中的过程S401、S404、S407，图21中的过程S501、S504、S507，图23中的过程S601、S602、S607、S610，图25中的过程S701、S702、S707、S710，图27中的过程S801、S804，图29中的过程S901、S904，图31中的过程S1001、S1004、S1007，图33中的过程S1101、S1104、S1107，图35中的过程S1201，图37中的过程S1301、S1302，图39中的过程S1401、S1404、S1407；更新单元1013用于支持路由器100执行图3中的过程S105、S109，图6中的过程S105、S109、S122，图7中的过程S105、S109、S122，图10中的过程S105、S109，图12中的过程S105、S109，图13中的过程S105、S109，图15中的过程S204、S206，图17中的过程S304、S306，图19中的过程S406、S409、S411，图21中的过程S506、S509、S511，图23中的过程S604、S606、S609、S612、S614，图25中的过程S704、S706、S709、S712、S714，图27中的过程S803、S806、S808，图29中的过程S903、S906、S908，图31中的过程S1003、S1006、S1009、S1011，图33中的过程S1103、S1106、S1109、S1111，图35中的过程S1203，图37中的过程S1304，图39中的过程S1403、S1406、S1409、S1411；发送单元1014用于支持路由器100执行图3中的过程S103、S106、S107，图6中的过 程S103、S106、S107，图7中的过程S1031、S106、S107，图8中的过程S1061、S107，图10中的过程S103、S106、S161、S163，图12中的过程S103、S106、S171，图13中的过程S103、S1061，图15中的过程S203、S205，图17中的过程S303、S305，图19中的过程S402、S405、S408、S410，图21中的过程S502、S505、S508、S510，图23中的过程S603、S605、S608、S611、S613，图25中的过程S703、S705、S708、S711、S713，图27中的过程S802、S805、S807，图29中的过程S902、S905、S907，图31中的过程S1002、S1005、S1008、S1010，图33中的过程S1102、S1105、S1108、S1110，图35中的过程S1202，图37中的过程S1303，图39中的过程S1402、S1405、S1408、S1410；判断单元1015用于支持路由器100执行图3中的过程S101，图6中的过程S101，图7中的过程S101，图8中的过程S101，图10中的过程S101，图12中的过程S101，图13中的过程S101。其中，上述方法实施例涉及的各步骤的所有相关内容均可以援引到对应功能模块的功能描述，在此不再赘述。
在采用集成的单元的情况下，图41示出了上述实施例中所涉及的路由器的一种可能的结构示意图。路由器100包括：处理模块1022和通信模块1023。处理模块1022用于对路由器100的动作进行控制管理，例如，处理模块1022用于支持路由器100执行上述生成单元、更新单元、判断单元的功能。通信模块1023用于支持路由器与其他实体的通信，例如与图1中示出的功能模块或网络实体之间的通信。路由器100还可以包括存储模块1021，用于存储路由器的程序代码和数据。
其中，处理模块1022可以是处理器或控制器，例如可以是中央处理器(Central processing unit，CPU)，通用处理器，数字信号处理器(Digital Signal Processor，DSP)，专用集成电路(Application-Specific Integrated Circuit，ASIC)，现场可编程门阵列(Field Programmable Gate Array，FPGA)或者其他可编程逻辑器件、晶体管逻辑器件、硬件部件或者其任意组合。其可以实现或执行结合本申请公开内容所描述的各种示例性的逻辑方框，模块和电路。所述处理器也可以是实现计算功能的组合，例如包含一个或多个微处理器组合，DSP和微处理器的组合等等。通信模块1023可以是收发器、收发电路、网络接口或通信接口等。存储模块1021可以是存储器。
具体的，处理模块1022可以为图42中的处理器1032，通信模块1023可以为图42中的网络接口1033，存储模块1021可以为图42中的存储器1031。
当处理模块1022为处理器，通信模块1023为网络接口，存储模块1021为存储器时，本申请实施例所涉及的路由器可以为图42所示的路由器100。
参阅图42所示，该路由器100包括：处理器1032、网络接口1033、存储器1031、总线1034。其中，网络接口1033、处理器1032、存储器1031通过总线1034相互连接；总线1034可以是外设部件互连标准总线或扩展工业标准结构总线等。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示，图中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
应理解，在本申请的各种实施例中，上述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本申请实施例的实施过程构成任何限定。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单 元及算法步骤，能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，上述描述的***、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的***、设备和方法，可以通过其他的方式实现。例如，以上所描述的设备实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个***，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，设备或单元的间接耦合或通信连接，可以是电性，机械或其他的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件程序实现时，可以全部或部分地以计算机程序产品的形式来实现。该计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行计算机程序指令时，全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或者数据中心通过有线(例如同轴电缆、光纤、数字用户线(Digital Subscriber Line，DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可以用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质(例如，软盘、硬盘、磁带)，光介质(例如，DVD)、或者半导体介质(例如固态硬盘(Solid State Disk，SSD))等。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (26)

  1. 一种链路状态通告LSA发送方法，其特征在于，包括：
    第一路由器根据其层次位置信息、第二路由器的层次位置信息和至少一个第三路由器的层次位置信息，生成第一路径表，其中，所述第二路由器是与所述第一路由器之间链路有效的邻居路由器，所述第三路由器是与所述第二路由器之间链路有效的邻居路由器中，除了所述第一路由器以外的路由器，所述第一路径表包括至少一个所述第三路由器的标识，所述第一路径表中的标识用于指示向对应路由器发送第一LSA，所述第一LSA包括通告路由器与其邻居路由器之间的有效链路，所述通告路由器指链路状态发生改变或周期性进行链路状态更新的路由器；
    所述第一路由器向所述第二路由器发送第一链路状态更新LSU消息，其中，所述第一LSU消息中包括所述第一LSA和所述第一路径表。
  2. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    所述第一路由器从第四路由器接收第二LSU消息，所述第二LSU消息中包括所述第一LSA，其中，所述第四路由器是与所述第一路由器之间链路有效的邻居路由器中，除了所述第二路由器以外的路由器；
    所述第一路由器根据所述第一LSA更新其链路状态数据库LSDB。
  3. 根据权利要求2所述的方法，其特征在于，所述第一路由器向所述第二路由器发送第一链路状态更新LSU消息，包括：
    当所述第二LSU消息中还包括第二路径表时，所述第一路由器向所述第二路由器发送所述第一LSU消息，其中，所述第二路径表中包括至少一个所述第二路由器的标识，所述第二路径表中的标识用于指示向对应路由器发送所述第一LSA。
  4. 根据权利要求1所述的方法，其特征在于，所述第一路由器为所述通告路由器。
  5. 根据权利要求1所述的方法，其特征在于，所述第一LSA包括所述通告路由器的层次位置信息和/或与所述通告路由器链路有效的邻居路由器的层次位置信息。
  6. 根据权利要求1所述的方法，其特征在于，在所述第一路由器根据其层次位置信息、第二路由器的层次位置信息和至少一个第三路由器的层次位置信息，生成第一路径表之前，所述方法还包括：
    所述第一路由器从所述第二路由器接收第二LSA，所述第二LSA包括所述第二路由器的层次位置信息和/或至少一个所述第三路由器的层次位置信息。
  7. 根据权利要求1-6任一项所述的方法，其特征在于，在所述第一路由器根据其层次位置信息、第二路由器的层次位置信息和至少一个第三路由器的层次位置信息，生成第一路径表之前，所述方法还包括：
    所述第一路由器向所述第二路由器发送第一开放式最短路径优先OSPF协商消息；
    所述第一路由器从所述第二路由器接收第二OSPF协商消息；
    其中，所述第一OSPF协商消息中包括所述第一路由器的层次位置信息，所述第二OSPF协商消息中包括所述第二路由器的层次位置信息，所述第一OSPF协商消息和所述第二OSPF协商消息用于建立和维护所述第一路由器与所述第二路由器的邻居关系。
  8. 一种链路状态通告LSA发送方法，其特征在于，包括：
    第二路由器从第一路由器接收第一链路状态更新LSU消息，其中，所述第一LSU消息中包括第一LSA和第一路径表，所述第一LSA包括通告路由器与其邻居路由器之间的有效链路，所述通告路由器指链路状态发生改变或周期性进行链路状态更新的路由器，所述第一路径表包括至少一个第三路由器的标识，所述第二路由器是与所述第一路由器之间链路有效的邻居路由器，所述第三路由器是与所述第二路由器之间链路有效的邻居路由器中，除了所述第一路由器以外的路由器；
    所述第二路由器根据所述第一LSA更新其链路状态数据库LSDB；
    所述第二路由器向所述第一路径表中的标识对应的路由器发送所述第一LSA。
  9. 根据权利要求8所述的方法，其特征在于，
    所述方法还包括：所述第二路由器根据其层次位置信息、第三路由器的层次位置信息和至少一个第五路由器的层次位置信息，生成第二路径表，其中，所述第二路径表包括至少一个所述第五路由器的标识，所述第二路径表中的标识用于指示向对应路由器发送所述第一LSA，所述第五路由器是与所述第三路由器之间链路有效的邻居路由器中，除了所述第二路由器以外的路由器；
    所述第二路由器向所述第一路径表中的标识对应的路由器发送所述第一LSA，包括：所述第二路由器向所述第一路径表中的标识对应的路由器发送第二LSU消息，其中，所述第二LSU消息中包括所述第一LSA和所述第二路径表。
  10. 根据权利要求9所述的方法，其特征在于，在所述第二路由器根据其层次位置信息、第三路由器的层次位置信息和至少一个第五路由器的层次位置信息，生成第二路径表之前，所述方法还包括：
    所述第二路由器从所述第三路由器接收第二LSA，所述第二LSA包括所述第三路由器的层次位置信息和/或至少一个所述第五路由器的层次位置信息。
  11. 根据权利要求8所述的方法，其特征在于，所述第一LSA包括所述通告路由器的层次位置信息和/或与所述通告路由器链路有效的邻居路由器的层次位置信息。
  12. 根据权利要求8所述的方法，其特征在于，所述第一路由器为所述通告路由器。
  13. 根据权利要求8-12任一项所述的方法，其特征在于，在所述第二路由器从第一路由器接收第一链路状态更新LSU消息之前，所述方法还包括：
    所述第二路由器向所述第一路由器发送第一开放式最短路径优先OSPF协商消息；
    所述第二路由器从所述第一路由器接收第二OSPF协商消息；
    其中，所述第一OSPF协商消息中包括所述第二路由器的层次位置信息，所述第二OSPF协商消息中包括所述第一路由器的层次位置信息，所述第一OSPF协商消息和所述第二OSPF协商消息用于建立和维护所述第一路由器与所述第二路由器的邻居关系。
  14. 一种第一路由器，其特征在于，包括：
    生成单元，用于根据其层次位置信息、第二路由器的层次位置信息和至少一个第三路由器的层次位置信息，生成第一路径表，其中，所述第二路由器是与所述第一路由器之间链路有效的邻居路由器，所述第三路由器是与所述第二路由器之间链路有效的邻居路由器中，除了所述第一路由器以外的路由器，所述第一路径表包括至少一个 所述第三路由器的标识，所述第一路径表中的标识用于指示向对应路由器发送第一链路状态通告LSA，所述第一LSA包括通告路由器与其邻居路由器之间的有效链路，所述通告路由器指链路状态发生改变或周期性进行链路状态更新的路由器；
    发送单元，用于向所述第二路由器发送第一链路状态更新LSU消息，其中，所述第一LSU消息中包括所述第一LSA和所述第一路径表。
  15. 根据权利要求14所述的第一路由器，其特征在于，所述第一路由器还包括：
    接收单元，用于从第四路由器接收第二LSU消息，所述第二LSU消息中包括所述第一LSA，其中，所述第四路由器是与所述第一路由器之间链路有效的邻居路由器中，除了所述第二路由器以外的路由器；
    更新单元，用于根据所述第一LSA更新其链路状态数据库LSDB。
  16. 根据权利要求15所述的第一路由器，其特征在于，所述发送单元具体用于：
    当所述第二LSU消息中还包括第二路径表时，向所述第二路由器发送所述第一LSU消息，其中，所述第二路径表中包括至少一个所述第二路由器的标识，所述第二路径表中的标识用于指示向对应路由器发送所述第一LSA。
  17. 根据权利要求14所述的第一路由器，其特征在于，所述第一路由器为所述通告路由器。
  18. 根据权利要求14所述的第一路由器，其特征在于，所述第一LSA包括所述通告路由器的层次位置信息和/或与所述通告路由器链路有效的邻居路由器的层次位置信息。
  19. 根据权利要求14所述的第一路由器，其特征在于，所述第一路由器还包括接收单元，
    所述接收单元，用于在所述生成单元根据其层次位置信息、第二路由器的层次位置信息和至少一个第三路由器的层次位置信息，生成第一路径表之前，从所述第二路由器接收第二LSA，所述第二LSA包括所述第二路由器的层次位置信息和/或至少一个所述第三路由器的层次位置信息。
  20. 根据权利要求14-19任一项所述的第一路由器，其特征在于，所述第一路由器还包括接收单元，
    所述发送单元，还用于在所述生成单元根据其层次位置信息、第二路由器的层次位置信息和至少一个第三路由器的层次位置信息，生成第一路径表之前，向所述第二路由器发送第一开放式最短路径优先OSPF协商消息；
    所述接收单元用于从所述第二路由器接收第二OSPF协商消息；
    其中，所述第一OSPF协商消息中包括所述第一路由器的层次位置信息，所述第二OSPF协商消息中包括所述第二路由器的层次位置信息，所述第一OSPF协商消息和所述第二OSPF协商消息用于建立和维护所述第一路由器与所述第二路由器的邻居关系。
  21. 一种第二路由器，其特征在于，包括：
    接收单元，用于从第一路由器接收第一链路状态更新LSU消息，其中，所述第一LSU消息中包括第一链路状态通告LSA和第一路径表，所述第一LSA包括通告路由器与其邻居路由器之间的有效链路，所述通告路由器指链路状态发生改变或周期性进 行链路状态更新的路由器，所述第一路径表包括至少一个第三路由器的标识，所述第二路由器是与所述第一路由器之间链路有效的邻居路由器，所述第三路由器是与所述第二路由器之间链路有效的邻居路由器中，除了所述第一路由器以外的路由器；
    更新单元，用于根据所述第一LSA更新其链路状态数据库LSDB；
    发送单元，用于向所述第一路径表中的标识对应的路由器发送所述第一LSA。
  22. 根据权利要求21所述的第二路由器，其特征在于，所述第二路由器还包括生成单元，
    所述生成单元用于：根据其层次位置信息、第三路由器的层次位置信息和至少一个第五路由器的层次位置信息，生成第二路径表，其中，所述第二路径表包括至少一个所述第五路由器的标识，所述第二路径表中的标识用于指示向对应路由器发送所述第一LSA，所述第五路由器是与所述第三路由器之间链路有效的邻居路由器中，除了所述第二路由器以外的路由器；
    所述发送单元具体用于：向所述第一路径表中的标识对应的路由器发送第二LSU消息，其中，所述第二LSU消息中包括所述第一LSA和所述第二路径表。
  23. 根据权利要求22所述的第二路由器，其特征在于，
    所述接收单元，还用于在所述生成单元根据其层次位置信息、第三路由器的层次位置信息和至少一个第五路由器的层次位置信息，生成第二路径表之前，从所述第三路由器接收第二LSA，所述第二LSA包括所述第三路由器的层次位置信息和/或至少一个所述第五路由器的层次位置信息。
  24. 根据权利要求22所述的第二路由器，其特征在于，所述第一LSA包括所述通告路由器的层次位置信息和/或与所述通告路由器链路有效的邻居路由器的层次位置信息。
  25. 根据权利要求22所述的第二路由器，其特征在于，所述第一路由器为所述通告路由器。
  26. 根据权利要求21-25任一项所述的第二路由器，其特征在于，
    所述发送单元，还用于在所述接收单元从第一路由器接收第一链路状态更新LSU消息之前，向所述第一路由器发送第一开放式最短路径优先OSPF协商消息；
    所述接收单元，还用于从所述第一路由器接收第二OSPF协商消息；
    其中，所述第一OSPF协商消息中包括所述第二路由器的层次位置信息，所述第二OSPF协商消息中包括所述第一路由器的层次位置信息，所述第一OSPF协商消息和所述第二OSPF协商消息用于建立和维护所述第一路由器与所述第二路由器的邻居关系。
PCT/CN2018/105326 2017-09-14 2018-09-12 链路状态通告lsa发送方法、装置和*** WO2019052488A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP18855730.0A EP3672168B1 (en) 2017-09-14 2018-09-12 Link state advertisement (lsa) transmission method, device, and system
US16/818,606 US11411853B2 (en) 2017-09-14 2020-03-13 Link-state advertisement LSA sending method, apparatus, and system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710829090.9 2017-09-14
CN201710829090.9A CN109510768B (zh) 2017-09-14 2017-09-14 链路状态通告lsa发送方法、装置和***

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/818,606 Continuation US11411853B2 (en) 2017-09-14 2020-03-13 Link-state advertisement LSA sending method, apparatus, and system

Publications (1)

Publication Number Publication Date
WO2019052488A1 true WO2019052488A1 (zh) 2019-03-21

Family

ID=65722433

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/105326 WO2019052488A1 (zh) 2017-09-14 2018-09-12 链路状态通告lsa发送方法、装置和***

Country Status (4)

Country Link
US (1) US11411853B2 (zh)
EP (1) EP3672168B1 (zh)
CN (1) CN109510768B (zh)
WO (1) WO2019052488A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111865797A (zh) * 2020-06-30 2020-10-30 北京华三通信技术有限公司 传播链路标记的方法及装置
WO2020227412A1 (en) * 2019-05-07 2020-11-12 Futurewei Technologies, Inc. Open shortest path first (ospf) path-aware flooding
CN113014481A (zh) * 2019-12-20 2021-06-22 华为技术有限公司 传输链路状态通告的方法、装置、设备及存储介质

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112398729B (zh) * 2019-08-14 2022-03-29 华为技术有限公司 一种链路状态信息的处理方法及装置
CN112558504B (zh) * 2019-09-10 2021-11-02 中国电信股份有限公司 基于ospf协议的关键路径信息转发方法、装置和***
CN112511325B (zh) 2019-09-16 2022-03-11 华为技术有限公司 网络拥塞控制方法、节点、***及存储介质
US20210243125A1 (en) * 2020-01-31 2021-08-05 Hewlett Packard Enterprise Development Lp System and method for avoiding congestion in a computer network
US11716276B2 (en) * 2020-03-06 2023-08-01 Juniper Networks, Inc. Detecting miswirings in a spine and leaf topology of network devices
CN111614666A (zh) * 2020-05-20 2020-09-01 中国电子科技集团公司第五十四研究所 一种基于dd报文漏洞的ospf协议安全性测试方法
US11777844B2 (en) 2020-07-03 2023-10-03 Huawei Technologies Co., Ltd. Distributing information in communication networks
CN112422418B (zh) * 2020-10-26 2022-09-20 锐捷网络股份有限公司 一种链路状态通告的负载均衡方法、装置、介质和设备
CN114531623B (zh) * 2020-10-31 2023-04-28 华为技术有限公司 一种信息传输方法、装置及网络节点
WO2022149680A1 (ko) * 2021-01-05 2022-07-14 한국과학기술원 안전한 개별분리 시스템을 위한 인터커넥트 설계 및 구현방법
US11757753B2 (en) 2021-02-25 2023-09-12 Huawei Technologies Co., Ltd. Link state steering
CN113433850B (zh) * 2021-06-04 2022-06-03 电子科技大学 一种fpga异态逻辑修复方法
US20230057463A1 (en) * 2021-08-18 2023-02-23 Ciena Corporation Network timing topology discovery and visualization using Interior Gateway Protocols
US11736385B1 (en) * 2022-08-17 2023-08-22 Juniper Networks, Inc. Distributed flooding technique

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101150523A (zh) * 2007-11-09 2008-03-26 杭州华三通信技术有限公司 一种路由信息传播方法和路由器
US20090086622A1 (en) * 2007-09-28 2009-04-02 General Instrument Corporation Method and Apparatus for Performing a Graceful Restart in a NSF-Capable Router Without Enhancing Link State Routing Protocols
CN104038420A (zh) * 2014-06-05 2014-09-10 杭州华三通信技术有限公司 一种路由计算方法和设备
CN107147576A (zh) * 2016-03-01 2017-09-08 华为技术有限公司 一种路由计算方法及装置

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6606325B1 (en) * 1999-12-10 2003-08-12 Nortel Networks Limited Fast path forwarding of link state advertisements using multicast addressing
US20030026246A1 (en) * 2001-06-06 2003-02-06 Zarlink Semiconductor V.N. Inc. Cached IP routing tree for longest prefix search
US7334047B1 (en) 2002-03-18 2008-02-19 Cisco Technology, Inc. Method and system for selective link state advertisement blocking over a data network area
US7554981B2 (en) * 2003-11-26 2009-06-30 Wind River Systems, Inc. System and method for efficient storage and processing of IPv6 addresses
US7801857B2 (en) * 2003-12-19 2010-09-21 Solace Systems, Inc. Implicit routing in content based networks
US7483387B2 (en) * 2005-05-23 2009-01-27 Cisco Technology, Inc. Hierarchical label distribution for inter-area summarization of edge-device addresses
US7835378B2 (en) * 2006-02-02 2010-11-16 Cisco Technology, Inc. Root node redundancy for multipoint-to-multipoint transport trees
US7889642B2 (en) * 2007-09-06 2011-02-15 Infinera Corporation GMPLS fast re-route for OADM and AUX 10Mbps support
CN102158397B (zh) * 2011-02-17 2016-06-29 中兴通讯股份有限公司 一种重路由的方法和本地修复点节点
US8761053B2 (en) * 2012-02-09 2014-06-24 Futurewei Technologies, Inc. Link state fast flood with computed multi-protocol-label-switching (MPLS) broadcast tree
CN103581013B (zh) * 2012-07-25 2017-02-15 杭州华三通信技术有限公司 实现路由协议的不中断路由的方法和装置
US9608900B2 (en) 2012-08-08 2017-03-28 Cisco Technology, Inc. Techniques for flooding optimization for link state protocols in a network topology
US10021014B2 (en) * 2014-10-21 2018-07-10 Futurewei Technologies, Inc. Avoiding routing interruption during transition to a virtual entity
CN104935513B (zh) * 2015-04-30 2018-05-15 新华三技术有限公司 一种清除链路状态通告的方法和装置
CN108075981B (zh) * 2016-11-16 2021-04-09 华为技术有限公司 一种链路状态数据包的传输方法及路由节点

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090086622A1 (en) * 2007-09-28 2009-04-02 General Instrument Corporation Method and Apparatus for Performing a Graceful Restart in a NSF-Capable Router Without Enhancing Link State Routing Protocols
CN101150523A (zh) * 2007-11-09 2008-03-26 杭州华三通信技术有限公司 一种路由信息传播方法和路由器
CN104038420A (zh) * 2014-06-05 2014-09-10 杭州华三通信技术有限公司 一种路由计算方法和设备
CN107147576A (zh) * 2016-03-01 2017-09-08 华为技术有限公司 一种路由计算方法及装置

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020227412A1 (en) * 2019-05-07 2020-11-12 Futurewei Technologies, Inc. Open shortest path first (ospf) path-aware flooding
CN113014481A (zh) * 2019-12-20 2021-06-22 华为技术有限公司 传输链路状态通告的方法、装置、设备及存储介质
CN113014481B (zh) * 2019-12-20 2022-06-24 华为技术有限公司 传输链路状态通告的方法、装置、设备及存储介质
CN111865797A (zh) * 2020-06-30 2020-10-30 北京华三通信技术有限公司 传播链路标记的方法及装置
CN111865797B (zh) * 2020-06-30 2022-07-12 北京华三通信技术有限公司 传播链路标记的方法及装置

Also Published As

Publication number Publication date
EP3672168B1 (en) 2023-11-01
CN109510768B (zh) 2021-02-12
US20200220803A1 (en) 2020-07-09
EP3672168A1 (en) 2020-06-24
CN109510768A (zh) 2019-03-22
US11411853B2 (en) 2022-08-09
EP3672168A4 (en) 2020-06-24

Similar Documents

Publication Publication Date Title
WO2019052488A1 (zh) 链路状态通告lsa发送方法、装置和***
US20240152410A1 (en) Single Node and Multiple Node Datastore Architecture in a Network Routing Environment
CN113261245B (zh) 网络链路或节点故障的恢复***和方法
US7334047B1 (en) Method and system for selective link state advertisement blocking over a data network area
CN103703727B (zh) 用于分体式架构***中控制业务的弹性路由的方法和设备
CN114615198A (zh) 内部网关协议洪泛最小化
JP2015136168A (ja) ネットワークにおけるメッセージおよび計算オーバーヘッドの軽減
US11627066B2 (en) IGP topology information and use for BIER-TE
JP6204168B2 (ja) 転送装置、サーバ、および経路変更方法
CN107534611B (zh) 用于逻辑到物理拓扑发现的***和方法
JP3945656B2 (ja) 管理ノード装置、ノード装置、ネットワーク構成管理システム、ネットワーク構成管理方法、ノード装置の制御方法、管理ノード装置の制御方法
US10404598B1 (en) Managing next hop groups in routers
US11431619B2 (en) Hierarchical ECMP control plane for dense topologies
JP2018185650A (ja) 情報処理装置、情報処理方法及びプログラム
EP3442172A1 (en) Network topology system and building methods for topologies and routing tables thereof
CN113872868A (zh) 通知消息传输方法、装置及***、存储介质
US20220116306A1 (en) Routing in fat tree networks using negative disaggregation advertisements
WO2013166978A1 (zh) 多处理器***的节点路由方法、控制器及多处理器***
US20220006731A1 (en) Distributing information in communication networks
JP6003893B2 (ja) グループ毎同報配信経路設定方法および通信装置
US20080212585A1 (en) Preventing Loops during Recovery in Network Rings Using Cost Metric Routing Protocol
US11394638B2 (en) Method and apparatus for forwarding network traffic on maximally disjoint paths
US10505809B1 (en) Object-based prefix and attribute distribution for network devices
WO2022161379A1 (zh) 一种最短路径的确定方法以及相关设备
WO2022078052A1 (zh) 一种节点的配置方法、控制器和节点

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: 18855730

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2018855730

Country of ref document: EP

Effective date: 20200317