WO2020135339A1 - Procédé de convergence de voies de réseau et dispositif associé - Google Patents

Procédé de convergence de voies de réseau et dispositif associé Download PDF

Info

Publication number
WO2020135339A1
WO2020135339A1 PCT/CN2019/127459 CN2019127459W WO2020135339A1 WO 2020135339 A1 WO2020135339 A1 WO 2020135339A1 CN 2019127459 W CN2019127459 W CN 2019127459W WO 2020135339 A1 WO2020135339 A1 WO 2020135339A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
convergence
cost value
path
faulty
Prior art date
Application number
PCT/CN2019/127459
Other languages
English (en)
Chinese (zh)
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 华为技术有限公司
Publication of WO2020135339A1 publication Critical patent/WO2020135339A1/fr

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/28—Routing or path finding of packets in data switching networks using route fault recovery
    • 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/18—Loop-free operations
    • 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/22—Alternate routing

Definitions

  • the present application relates to the field of communications, and in particular to a method for network path convergence and related equipment.
  • IP Internet protocol
  • nodes In an Internet protocol (IP) network, network device nodes (referred to as nodes) usually deploy an internal gateway protocol (IGP). Since all network device nodes calculate the IP data flow according to the same routing algorithm The path is forwarded, so the calculated paths of all network device nodes are consistent, thereby ensuring that the data stream can be forwarded from the source network device node to the destination network device node.
  • IGP internal gateway protocol
  • the IGP protocol responds to link failures in the network and quickly converges the entire network to the same forwarding path to reduce the impact of link failures on user service forwarding.
  • Each network device node independently calculates and issues a forwarding table (forward information (FIB), and the network device node completes convergence according to the FIB table.
  • the IGP protocol can calculate an optimal forwarding path through the shortest path first (SPF) algorithm, and the sum of the path cost values of all links that the optimal forwarding path passes is the smallest.
  • SPF shortest path first
  • Loop means that if the forwarding paths of two adjacent network device nodes in the network are inconsistent, the data flow will be forwarded between the two network device nodes until the data flow time to live (TTL) When it is exhausted, packets are discarded, causing loss of data flow and interruption of the network connection.
  • TTL data flow time to live
  • Embodiments of the present application provide a method for network path convergence and related equipment, which are used to control the orderly convergence of various network device nodes in a network topology by adjusting the cost value of an ordered release link to avoid the convergence of different network device nodes Time inconsistency causes loop problems.
  • the first aspect of the present application provides a method for network path convergence, including
  • the node convergence relationship includes the first convergence order, which is the convergence order of the nodes on each optimal path through the failed link when the failure occurs;
  • the faulty adjacent device calculates an adjustment cost value for replacing the actual cost value of the faulty link corresponding to each node in the node convergence relationship
  • the adjusted cost value corresponding to each node is issued as the actual cost value of the failed link in an orderly manner, wherein the adjusted cost value is used to control each node to converge according to the node convergence relationship.
  • the faulty neighboring device detects whether the current network is faulty.
  • the network fault includes a link fault or a fault of a network device node, a link with a faulty link, and a link connected to the faulty network device node are also called Faulty link.
  • the faulty neighboring device can also receive the detection results of other network management devices on the current network, and determine whether the current network is faulty according to the detection results.
  • the equipment may include routers or servers.
  • the faulty neighboring device After detecting a fault in the current network, the faulty neighboring device obtains the node convergence relationship in the network.
  • the node convergence relationship includes the order of convergence between the nodes to be converged.
  • the node to be converged is the node with the best path and passes through the failed link.
  • the path is the path with the smallest path cost among the paths from the node to be converged to the destination node.
  • the faulty neighboring device corresponds to each node to be converged in the node convergence relationship, and calculates the adjustment cost value corresponding to each node.
  • the adjustment cost value is used to replace the actual cost value of the failed link.
  • Each node in the node convergence relationship receives After the adjustment cost value is reached, the forwarding path is calculated according to the adjustment cost value.
  • the faulty neighboring device After calculating the adjustment cost value corresponding to each node in the node convergence relationship, the faulty neighboring device publishes the adjustment cost value corresponding to each node in order according to the convergence order. Each node in the node convergence relationship receives the adjustment cost value After that, the effect of the adjusted cost value is the same as the actual cost value of the failed link, and each node uses the adjusted cost value to calculate the path and converge.
  • the faulty neighboring device orderly publishes the adjustment cost value to each node in the node convergence relationship, so that each node converges according to the convergence order in the node convergence relationship, thereby avoiding the occurrence of network loops.
  • the faulty neighboring device calculates an adjustment cost value for replacing the actual cost value of the faulty link corresponding to each node to be converged in the node convergence relationship, including:
  • the convergence order of the convergent nodes is to take the convergent node as the convergent node. It should be noted that when the order of multiple nodes is consistent, the multiple nodes of the same order are taken. The selected node is called convergent. node.
  • the faulty adjacent device calculates the adjustment cost value of the failed link based on the node that should converge.
  • the adjustment cost value corresponding to the convergent node is called the adjustment cost value.
  • the faulty adjacent device calculates the adjustment cost value once .
  • the adjustment cost value is issued to each node to be converged in the node convergence relationship.
  • the faulty neighboring device then takes the next node as the convergent node in the convergence order, calculates the adjustment cost value of the corresponding node and publishes it until the final node in the convergence order is calculated. Adjust the cost value and publish it.
  • the faulty neighboring device takes the nodes in the node convergence relationship according to the convergence order, and uses the taken nodes to calculate the adjustment cost value, so that the faulty neighboring device calculates the adjustment cost value in order, so that the adjustment cost value can be issued in an orderly manner later, avoiding The occurrence of network loops.
  • the adjusted cost values corresponding to the nodes to be converged are ordered and released as the actual cost values of the failed link, including:
  • the faulty adjacent device determines whether the calculation result of this time is the same as the previous calculation result. After determining that the calculation result of this time is different from the previous calculation result, the calculated Adjust the cost value to publish.
  • the convergence sequence is that after a network failure occurs, the faulty neighboring device acquires the node convergence relationship, where the node convergence relationship may be that the faulty neighboring device is based on the relevant information of each node in the network topology. It is generated before the network fault occurs and stored in the faulty neighboring device, or it can be generated according to the relevant information after the network fault occurs.
  • the device generated by the node convergence relationship may be either a faulty neighboring device or other management devices, such as servers or routers, which is not limited here.
  • the convergence order is arranged in ascending order of the path cost difference of the nodes to be converged in the node convergence relationship, where the path cost difference is between the optimal path and the sub-optimal path of the node
  • the optimal path is the path with the smallest path cost to the destination node through the failed link
  • the sub-optimal path is the path with the lowest path cost to the destination node without the failed link.
  • the convergence order of the node convergence relationship is arranged in ascending order of path cost difference, so that the faulty neighboring device calculates the adjustment cost value in order, so that subsequent adjustment cost values can be issued in an orderly manner, avoiding network loops happened.
  • the adjustment cost value of the failed link is greater than the cost value of the sub-optimal path of the node that should converge.
  • each node in the node convergence relationship will use the adjusted cost value as the path cost value of the optimal path of the current node after receiving the adjusted cost value.
  • the cost value of the adjustment is greater than the cost value of the suboptimal path of the convergent node, the path cost value of the original suboptimal path of the convergent node is lower than the path cost value of the original optimal path, according to the principle of shortest path priority (shortest path priority) first, SPF), the convergent node will use the path with the lowest path cost value for forwarding. At this time, the convergent node will use the original suboptimal path for forwarding instead of the original optimal path, which ensures that the convergent node can complete the convergence .
  • shortest path priority shortest path priority
  • the faulty adjacent device calculates an adjustment cost value of the faulty link based on the node that should converge, which specifically includes:
  • Rbase represents the adjustment cost value of the failed link
  • COST(base) represents the actual cost value of the failed link
  • Rn(m, diff) represents the path cost difference of node n
  • node n is the node that should converge
  • x is greater than 0 Is a positive integer and x is less than or equal to Rn(spf)-Rn+1(spf), where Rn(spf) represents the path cost value of the optimal path for node n, and Rn+1(spf) represents node n+1
  • the path cost value of the optimal path of, n+1 is the next node that should converge in the convergence sequence.
  • the node convergence relationship further includes a second convergence order, and the second convergence order is the convergence order of each node in the node convergence relationship when the network failure recovers.
  • the method further includes: the faulty neighboring device detects whether the network fault is recovered; if recovered, the faulty neighboring device obtains the second convergence order in the node convergence relationship; the faulty neighboring device
  • Each node in the second convergence sequence calculates an adjusted cost value to replace the actual cost value of the failed link.
  • the adjusted cost value calculated after the fault recovery is called the second adjusted cost value; according to the node convergence relationship In the second convergence sequence, the second adjusted cost value corresponding to each node is issued in order as the actual cost value of the failed link.
  • the faulty neighboring device After a network failure occurs, the faulty neighboring device detects whether the current network fault is restored, and the network fault is restored.
  • the faulty link or the faulty network device node can communicate normally. It should be noted that except for the faulty neighboring device detection, when the current network fault is detected
  • the faulty neighboring device may also receive the detection results of other network management devices on the current network, and determine whether the current network fault is recovered according to the detection results.
  • Other network devices here may include routers or servers.
  • the faulty neighboring device After detecting the current fault recovery, the faulty neighboring device obtains the node convergence relationship in the network.
  • the node convergence relationship includes the convergence sequence of the nodes on each optimal path through the fault link when a network fault occurs, and the convergence after the fault recovery The order is called the second convergence order.
  • the faulty neighboring device corresponds to each node in the node convergence relationship, and calculates the adjustment cost value corresponding to each node.
  • the adjustment cost value is used to replace the actual cost value of the faulty link.
  • Each node in the node convergence relationship receives the adjustment After the cost value, the forwarding path is calculated based on the adjusted cost value.
  • the faulty neighboring device After calculating the adjustment cost value corresponding to each node in the node convergence relationship, the faulty neighboring device publishes the adjustment cost value corresponding to each node in an orderly manner according to the convergence order of each node in the node convergence relationship. After the node receives the adjusted cost value, the adjusted cost value has the same effect as the actual cost value of the faulty link, and each node uses the adjusted cost value to calculate the path and converge. The faulty neighboring device orderly publishes the adjustment cost value to each node in the node convergence relationship, so that each node converges in a certain order to avoid the occurrence of network loops.
  • the second convergence order is the convergence order in the node convergence relationship obtained by the faulty neighboring device after the network failure is recovered, wherein the second convergence order may be the faulty neighboring device according to the network topology
  • the relevant information of each node is generated and stored in the faulty neighboring device before the network failure is restored, or it can be generated based on the relevant information after the network failure occurs.
  • the device generated in the second convergence sequence may be either a faulty neighbor device or other management devices, such as a server or a router, which is not limited herein.
  • the second convergence order obtained by the faulty neighboring device is arranged in descending order of the path cost difference of each node in the node convergence relationship, where the path cost difference is the optimal path and suboptimal of the node
  • the path cost difference between paths is the optimal path.
  • the optimal path is the path with the smallest path cost for the node to reach the destination node through the faulty link
  • the sub-optimal path is the path with the minimum path cost for the node to reach the destination node without the faulted link.
  • the second convergence order in the node convergence relationship is arranged in descending order according to the path cost difference, so that the faulty neighboring device calculates the adjustment cost value in order, so that the adjustment cost value can be issued in an orderly manner, avoiding the network The occurrence of the loop.
  • the second adjusted cost value of the failed link is less than the cost value of the sub-optimal path of the node that should converge. It should be noted that after the network failure is restored, before the path convergence, each node in the node convergence relationship is forwarded according to the original suboptimal path. At this time, for each node, the current optimal path is the original suboptimal path. The original here refers to before the network failure. Since each node in the node convergence relationship receives the adjusted cost value, it will use the adjusted cost value as the path cost value of the optimal path of the current node.
  • the path cost value of the original optimal path of the convergent node is lower than the path cost value of the original suboptimal path, according to the principle of shortest path priority (shortest path priority) first, SPF), the convergent node will use the path with the lowest path cost value for forwarding. At this time, the convergent node will use the original optimal path for forwarding instead of the original suboptimal path, ensuring that the convergent node can complete the convergence .
  • shortest path priority shortest path priority
  • the faulty adjacent device calculates an adjustment cost value of the faulty link based on the node that should converge, which specifically includes:
  • Rbase represents the adjustment cost value of the failed link
  • COST(base) represents the actual cost value of the failed link
  • Rn(m, diff) represents the path cost difference of node n
  • node n is the node that should converge
  • x is greater than 0 Is a positive integer and x is less than or equal to Rn(spf)-Rn+1(spf), where Rn(spf) represents the path cost value of the optimal path for node n, and Rn+1(spf) represents node n+1
  • the path cost value of the optimal path of, n+1 is the next node that should converge in the convergence sequence.
  • the faulty adjacent device sequentially selects the node to be converged as the convergent node according to the convergence order of the nodes to be converged, including: the faulty adjacent device takes the first node in the convergence order as the convergent node , Use the convergent node to calculate the corresponding adjustment cost value and send it in an orderly manner. After every preset time, the next node is taken as the convergent node in the order of convergence until the last node is taken and the last node is used as the response The convergence node calculates the corresponding adjustment cost value and sends it in order.
  • the preset duration should be greater than or equal to the maximum length of time for the nodes in the network topology to complete the network path convergence.
  • the convergence order includes the convergence order or the convergence order.
  • the corresponding adjustment cost value is the adjustment Cost value.
  • the corresponding adjustment cost value is the adjustment cost value.
  • the preset duration is greater than or equal to the maximum value of the node's network path convergence duration in the network topology, it ensures that the next node corresponds to Before adjusting the cost value, all nodes in the network topology have completed the operation of using this adjustment cost value to converge the network path, which improves the degree of automation of network path convergence.
  • the faulty adjacent device sequentially selects the nodes to be converged as the nodes to be converged according to the convergence order of the nodes to be converged, including:
  • the faulty neighboring device takes the first node in the convergence order as the convergent node, uses the convergent node to calculate the corresponding adjustment cost value and sends it in an orderly manner; after receiving the convergence completion response returned by the convergent node, press Take the next node as the convergent node in the convergence order until the last node is taken and use the last node as the convergent node to calculate the corresponding adjustment cost value and send it in an orderly manner.
  • the convergence order includes the convergence order or the convergence order. When the order is the convergence order, the corresponding adjustment cost value is the adjustment cost value, and when the convergence order is the convergence order, the corresponding adjustment cost value is the adjustment cost value.
  • the next node is selected as the convergent node until the last node. While ensuring that all nodes in the node convergence relationship have converged, the efficiency of network path convergence is improved.
  • the second aspect of the present application provides a faulty adjacent device, including:
  • the acquisition unit is used to acquire the node convergence relationship after the network failure.
  • the node convergence relationship includes the order of convergence between the nodes to be converged.
  • the node to be converged is the node whose optimal path will pass through the failed link, and the optimal path is the node to be converged.
  • the calculation unit is used to calculate an adjustment cost value for replacing the actual cost value of the failed link corresponding to each node to be converged;
  • the publishing unit is used to orderly publish the adjusted cost value corresponding to the node to be converged as the actual cost value of the failed link according to the calculation result and the convergence order of the calculation unit, wherein the adjusted cost value is used to control the node to be converged to converge according to the node
  • the relationship converges.
  • the constituent unit of the faulty adjacent device may also perform the steps described in the foregoing first aspect and various possible implementations. For details, see the foregoing description of the first aspect and various possible implementations. instruction of.
  • the third aspect of the present application provides a fault-adjacent device, including: a receiver, a transmitter, a processor, a memory, and a bus system;
  • the memory is used to store programs and instructions
  • the receiver and transmitter are used to receive or send information under the control of the processor
  • the processor is used to execute the program in the memory
  • the bus system is used to connect the memory, transceiver and processor to enable the memory, transceiver and processor to communicate;
  • the processor is used to call program instructions in the memory to perform the steps described in the first aspect and various possible implementation manners. For details, see the foregoing description of the first aspect and various possible implementation manners.
  • the present application provides a chip system
  • the chip system includes a processor for supporting a network device to implement the functions involved in the above aspects, for example, for example, sending or processing the above methods Data and/or information.
  • the chip system further includes a memory, which is used to store necessary program instructions and data of the network device.
  • the chip system may be composed of chips, and may also include chips and other discrete devices.
  • a system including the above-mentioned faulty adjacent device.
  • a computer-readable storage medium for storing a computer program, the computer program including instructions for performing the method in a possible implementation manner of the first aspect.
  • a computer program product includes: computer program code, which, when the computer program code is run on a computer, causes the computer to perform the method in the above possible implementation manner of the first aspect.
  • the orderly convergence of each network device node in the network topology is controlled to avoid loop problems caused by inconsistent convergence times of different network device nodes.
  • FIG. 1a is a schematic diagram of an implementation environment network topology of a method for network path convergence according to an embodiment of the present application
  • FIG. 1b is a schematic structural diagram of a faulty adjacent device in an embodiment of the present application.
  • FIG. 1c is another schematic structural diagram of a faulty adjacent device in the embodiment of the present application.
  • FIG. 2 is a schematic diagram of an embodiment of a method for network path convergence in an embodiment of the present application
  • FIG. 3 is a schematic diagram of an application scenario provided by an embodiment of the present application.
  • FIG. 4 is a schematic diagram of another application scenario provided by an embodiment of this application.
  • FIG. 5 is a schematic structural diagram of a fault-adjacent device provided by an embodiment of the present application.
  • FIG. 6 is a schematic structural diagram of another faulty adjacent device according to an embodiment of the present application.
  • Embodiments of the present application provide a network path convergence method, related equipment, and a system, which are used in an IP network to control the orderly convergence of various network device nodes in a network topology by orderly publishing link path cost values. Avoid loop problems caused by inconsistent convergence times of different network device nodes.
  • IP Internet protocol address
  • IP address IP address
  • IPv4 IP address
  • IPv6 Internet protocol address
  • IGP Interior gateway protocol
  • IP Internet Protocol
  • a domain is a set of hosts and network device nodes that use the same routing protocol and is managed by a single organization.
  • IGP protocol includes routing information protocol (routing information protocol, RIP), open shortest path priority protocol (open shortest path first, OSPF), intermediate system to intermediate system routing protocol (intermediate system-to-intermediate system, IS-IS) internal Gateway routing protocol (interior gateway routing protocol, IGRP) and enhanced interior gateway routing protocol (enhanced interior gateway routing protocol, EIGRP), etc., among them, RIP, IGRP, BGP are distance vector protocols, OSPF and ISIS are data link state protocols.
  • routing information protocol routing information protocol
  • OSPF open shortest path priority protocol
  • IS-IS intermediate system-to-intermediate system
  • IGRP internal Gateway routing protocol
  • EIGRP enhanced interior gateway routing protocol
  • OSPF is a data link state protocol.
  • the shortest path first algorithm (SPF) is used to calculate the forwarding path.
  • the SPF algorithm is also called the minimum spanning tree algorithm (dijkstar).
  • the SPF algorithm is the foundation of the OSPF routing protocol.
  • the length of the shortest path tree (SPT) that is, the distance from the OSPF router to each destination router, is called the cost value of OSPF.
  • SPF uses cost as the metric value, cost
  • cost Each interface that is assigned to a network device node, by default, the path cost to a specific destination is the sum of the cost of the outgoing interfaces of all links between this network device node and the destination.
  • the network device node In order to generate a routing table (forwarding information base, FIB), the network device node runs the SPF shortest path first algorithm to build the shortest path tree, and uses the network device node itself as the root of the routing tree.
  • the SPF algorithm calculates the path with the lowest cost to each network device node on the network, and the network device node stores the routes of these paths in its FIB table.
  • Loop means that between multiple network equipment nodes in the network, after data traffic is sent from one network equipment node, it will be forwarded back from other network equipment nodes and circulate among multiple network equipment nodes Forwarding, until the time to live (TTL) in the IP message (message) header is reduced to 0, the phenomenon of discarding the message. For example: if the next hop of the route on the network device node A points to the network device node B, and the next hop of the same destination address route on the network device node B points to the network device node A, then two adjacent network device nodes The simplest loop will be formed between A ⁇ -->B.
  • IGP protocols are usually deployed to dynamically respond to link or node failures in the network, and quickly converge the entire network to the same forwarding path to reduce the impact on user service forwarding.
  • the IGP protocol calculates an optimal path through the SPF algorithm, and the sum of the cost values of all links that the optimal path passes is the smallest.
  • the forwarding path of the entire network is consistent.
  • each IGP node in the network calculates and delivers the FIB table independently. The inconsistency between different devices and the completion time of the following table will lead to the formation of forwarding loops on some local links and cause network interruption.
  • FRR Fast Reroute
  • the method for network path convergence proposed in this application can be deployed not only in network device nodes adjacent to unstable links, but also in all network device nodes in the network topology, or in the network topology.
  • the centralized management device may be a device independent of the IGP domain, the device may be a router or a switch, or an application program running on the device, or a functional module integrated on the device.
  • the centralized management device may be a router in the IGP domain or a functional module integrated on the router.
  • the centralized management device may be a controller or network management device in a software defined network (SDN), an application program on the device, or a functional module integrated on the device.
  • SDN software defined network
  • a network device node deployed with the method of network path convergence can establish an IGP monitoring protocol session with all network device nodes in the network topology to monitor the operation of IGP between various network device nodes.
  • the network device node adjacent to the faulted link and deployed with the method of network path convergence can diagnose the fault according to the IGP monitoring protocol session, and the faulty link adjacent network device node can Run the network path convergence method in the embodiments of the present invention.
  • the network device node adjacent to the failed link is referred to as a failed adjacent device.
  • the failed link refers to an unavailable network link, which may include the failure of the link itself, or the failure of the next-hop node connected to the link, or may include an artificially set link or node unavailability.
  • FIG. 1a is a schematic diagram of an implementation environment network topology of a network path convergence method according to an embodiment of the present application.
  • the implementation environment shown in FIG. 1a may be used to implement the network path convergence method of any embodiment or implementation manner of the present application, including network device node R0 to network device node R1, R2, R3, R4, R5, R6, R7, R8, and R9, the network device node R0 and each node in the network device node R9 can be connected through a wireless or wired network.
  • the wireless network can be connected by WiFi (wireless-fidelity) link, Bluetooth basic rate (BR)/enhanced data rate (EDR) link, Bluetooth low energy (bluetooth low energy, BLE ) Links, near field communication (near field communication, NFC) links and other near field communication methods, or mobile network links and other remote communication methods.
  • the WiFi link is used for high-speed transmission of large amounts of data and Internet transmission, and has the characteristics of high power consumption.
  • the WiFi link can also be divided into: a WiFi station link, a WiFi peer-to-peer, P2P) link and WiFi access point (AP) link, where the WiFi station link adopts the mode of connecting the router to the Internet, the WiFi P2P link adopts the mode of WiFi direct connection, and the WiFi AP link adopts the WiFi to establish the AP Mode.
  • the Bluetooth BR/EDR link is classic Bluetooth, which is used for low speed, short distance and long time connection, and has the characteristics of low power consumption.
  • the Bluetooth BLE link is used for low speed, short distance and short time connection, and has the characteristics of very low power consumption, NFC chain
  • the road is used for proximity safe transmission.
  • the mobile network link is used for remote data transmission, but it requires payment to the operator.
  • Each of the network device node R0 to the network device node R9 is a device connected to a corresponding network having an independent address and having a function of transmitting or receiving data, and may include a personal computer, a workstation, a server, a switch, a router, or other network devices. Each network device node is connected through a communication line to form a certain geometric relationship, that is, to form a corresponding network topology. Each of the network device node R0 to the network device node R9 may also be a controller corresponding to the network, and may include at least one of terminal devices such as desktop computers, notebook computers, personal digital assistants, smart phones, and tablet computers.
  • the corresponding network may be a secondary or tertiary network structure, which is not limited here.
  • the value between the network device nodes shown in Fig. 1a represents the cost value of this link.
  • the number of network device nodes is determined according to actual application scenarios, and the number of actually applicable network device nodes is not limited.
  • the nodes appearing in this application refer to network device nodes in the network. In the embodiments of the present application, 10 network device nodes from the network device node R0 to the network device node R9 in FIG. 1a are used for description.
  • Fig. 1a shows a schematic diagram of a network topology composed of a network device node R0 to a network device node R9.
  • the IGP domain is an autonomous system.
  • An autonomous system is a network device node and a network group under the control of a management agency.
  • the management agency can also be regarded as a network device node. It can be a network device node directly connected to a local area network (LAN) and also connected to the Internet; it can also be a multiple local area network interconnected by an enterprise backbone network. All network equipment nodes in an autonomous system are connected to each other, run the same routing protocol, and assign the same autonomous system number at the same time.
  • LAN local area network
  • a connection is established between a network device node and a network device node, that is, an IGP session is established between the network device node and the network device node, and information is transmitted through the IGP session.
  • the same IGP is used for information transmission between the network equipment node and the network equipment node, for example, the OSPF protocol is used for information transmission.
  • the data flow flow1 is sent to the destination network device node R9 through the path network device node R0, and the data flow flow2 is sent to the destination network device node R9 through the path network device node R5.
  • the data flow flow1 passes through the following path network device node R0, network device node R1, network device node R2, network device node R3 to the destination network device node R9 .
  • the data flow flow2 passes through the following path network device node R5, network device node R4, network device node R1, network device node R2, network device node R3 to the destination network device node R9.
  • the network device node R1 or R2 adjacent to the failed link can perceive the link failure through the IGP monitoring protocol session , And trigger the use of SPF algorithm to recalculate the optimal forwarding path, and issue R1-R2 link failure notifications through related routing protocols (such as: IGP routing protocol).
  • the failure notification is used to instruct all network device nodes in the IGP domain to restart After calculating the optimal forwarding path, other network device nodes converge to the calculated optimal forwarding path after recalculating the optimal forwarding path.
  • the fault notification is usually the cost value of the R1-R2 link.
  • the network device node R1 (ie, the faulty neighboring device) releases the cost of the faulty link R1-R2 in an orderly manner through calculation and Value to control the convergence sequence of network device node R4 and network device node R5 to avoid loops.
  • the specific control method is as follows: When the R1-R2 link is normal, the network device node R1 releases the cost value of the R1-R2 link. At this time, each network device node uses the SPF algorithm to calculate the optimal forwarding path (SPF) based on the cost value Path), the SPF path on the R0 network device node is R0, R1, R2, R3, R9, the SPF path on the R1 network device node is R1, R2, R3, R9; the SPF path on the R4 network device node is R4, R1, R2, R3, R9; the SPF path on the R5 network device node is R5, R4, R1, R2, R3, R9.
  • SPF optimal forwarding path
  • the node to be converged can be represented by R space.
  • the R space is a set of network device nodes.
  • the optimal path of all network device nodes in the R space to the destination network device node will pass through the faulty link, such as R ⁇ R0, R1, R4, R5 ⁇ .
  • the network device node R1 that is, the adjacent faulty node adjacent to the R1-R2 link acquires the node convergence relationship.
  • the node convergence relationship includes the order of convergence between the node to be converged and the node to be converged.
  • the node convergence relationship may be acquired in advance and stored in the faulty adjacent node, or may be acquired when convergence is required.
  • the convergence sequence in the node convergence relationship is generated based on the principle that no loops are generated during the convergence process. For example, when the R1-R2 link fails, you can converge in the order of R5, R4, R0, and R1.
  • the network device node R1 publishes the cost values of the R1-R2 links in order according to the convergence order. Among them, the cost value of the R1-R2 link is calculated based on the convergence order (this calculated cost value is referred to as the adjusted cost value of the failed link in the embodiment of the present invention), not the actual value of the R1-R2 link cost value. Taking the convergence sequence as R5, R4, R0, and R1 as an example, the network device node R1 advertises the R1-R2 link cost value as 1901.
  • each node in the R space calculates the SPF path according to the cost value, and the network device node R1
  • the SPF path on the network is R1, R2, R3, R9
  • the SPF path on the network device node R4 is R4, R1, R2, R3, R9
  • the SPF path on the network device node R5 is R5, R6, R7, R2, R3 And R9, only the SPF path of the network device node R5 changes, and the next hop of the network device node R5 changes from the network device node R4 to R6, and convergence occurs.
  • the network device node R1 releases the R1-R2 link cost value of 2101.
  • each node in the R space calculates the SPF path according to the cost value .
  • the SPF path on the network device node R1 is R1, R2, R3, R9;
  • the SPF path on the network device node R4 is R4, R5, R6, R7, R2, R3, R9;
  • the SPF path on the network device node R5 is For R5, R6, R7, R2, R3, and R9, only the SPF path of network device node R4 changes, and the next hop of network device node R4 changes from network device node R1 to R5 and convergence occurs.
  • R1 After the convergence of the network device node R4 is completed, since the convergence of the network device node R0 and the network device node R1 will not cause a loop, R1 does not need to publish the new R1-R2 link cost value, and directly publish the actual R1-R2 link.
  • the link status completes the network path convergence of the IGP domain. It should be noted that the cost value is determined according to the actual situation. 1901 and 2101 are only examples, and the actual cost value is not limited.
  • the method for applying network path convergence in this application may be performed by a faulty adjacent device.
  • the faulty adjacent device proposed in this application is shown in FIG. 1b.
  • FIG. 1b is a schematic structural diagram of the faulty adjacent device in the embodiment of the present application.
  • the fault-adjacent equipment includes protocol processing equipment and line card processing equipment.
  • the protocol processing equipment and line card processing equipment may be hardware devices independent of network device nodes, such as routers, etc., or may be integrated into routers.
  • the main control board A protocol processing device can establish a connection with a line card processing device, or it can establish a connection with multiple line card processing devices according to actual needs to improve the sending and receiving capabilities of the protocol processing device.
  • Figure 1c is Another schematic structural diagram of the faulty adjacent device in the embodiment of the application.
  • the protocol processing device establishes a connection with the line card processing device 1 to the line card processing device n, where n is a positive integer greater than 1.
  • the protocol processing equipment includes: an orderly convergence operation module, an SPF operation module, a network topology library, an orderly convergence library, and a routing protocol processing module.
  • the line card processing equipment includes: a forwarding table adaptation module, a message distribution module, and Forwarding module.
  • the forwarding module receives each of the IGP domains through a network chip (networking processor) and a media access control layer chip (media access control, MAC)
  • the IP data message of the network device node the message distribution module in the line card processing device forwards the IP data message to the routing protocol processing module in the protocol processing device, and the routing protocol processing module circulates the IP data packet redundantly Cyclic redundancy check (CRC).
  • CRC Cyclic redundancy check
  • the routing protocol processing module parses the IP data packet and stores the parsed result in the network topology library.
  • the ordered convergence calculation module obtains the analysis results of IP data packets from each network device node in the network topology library, generates a node convergence relationship and stores the node convergence relationship in the ordered convergence library, and the routing protocol processing module obtains the ordered convergence library
  • the node convergence relationship stored in the router protocol processing module generates the link cost value of the corresponding network device node according to the obtained node convergence relationship.
  • the packet distribution module and the forwarding module in the line card processing device send each link to the IGP domain.
  • the network device node sends the link cost value.
  • each of the above modules can be a software module running in a hardware device or an independent hardware device, for example, the forwarding module in the line card processing device can be an NP processing chip and a MAC chip, or it can be running in NP
  • the application programs in the processing chip and the MAC chip are not limited here.
  • the method of network path convergence in this application will be described below in conjunction with the embodiments and the drawings.
  • the method of network path convergence provided in this application includes the following embodiments, specifically:
  • FIG. 2 is a schematic diagram of an embodiment of a method for network path convergence in an embodiment of the present application. This embodiment can be applied to a path convergence process of a link failure after a network failure occurs, and can also be applied to a network failure occurrence. In the path convergence process after link failure recovery.
  • An embodiment of the method for network path convergence in the embodiments of the present application includes:
  • the faulty adjacent node acquires the node convergence relationship.
  • the faulty neighboring device acquires the node convergence relationship.
  • the node convergence relationship includes the convergence order between each node in the R space (that is, the node to be converged) and each node in the R space in the network topology deployed by the faulty adjacent device.
  • the convergence order can be generated according to the path cost difference corresponding to each node in the R space.
  • the method for generating the node convergence relationship is as follows. For ease of understanding, please refer to Table 1, which is a schematic table of all network node devices in the network topology. Table 1 shows the relevant information of the four network node devices R0, R1, R4 and R5.
  • Rn(spf) is the SPF path cost value of the network node device Rn, and the SPF path cost value is the network node device Rn (hereinafter referred to as node Rn)
  • the path cost value of the optimal path to the destination network node device R9 (hereinafter referred to as the destination node R9), Rm is the faulty adjacent device on the optimal path (that is, the next hop of the device is the faulty link).
  • n and m may be any of 0, 1, 4, and 5.
  • Rn(m, sub-spf) is the sub-optimal path cost value of the node Rn reaching the destination node R9 without passing through the faulty neighboring device Rm, which is calculated by the Rm device using the SPF algorithm.
  • Rn(m,diff) is the difference between the path cost of the optimal path of the node Rn and the destination node R9 and passing through the faulty adjacent node Rm and the path cost of the sub-optimal path Rn(m, sub-spf).
  • the faulty neighboring devices sort the four network node devices R0, R1, R4, and R5 according to the order of Rn(m, diff) to generate the node convergence relationship.
  • the method for network path convergence provided in the embodiment of the present application may further include the following steps:
  • the network state information includes the availability of links between the network node device and other network node devices. Including: when the faulty neighboring device is deployed on a network node device in the network topology, the faulty neighboring device obtains the network state information of the network node device, including the link connection between the network node device and other network node devices happensing.
  • the faulty neighboring device can be deployed either on one network node device in the network topology or on all network node devices in the network topology.
  • the faulty adjacent device When the faulty adjacent device is deployed in the network topology in the form of an independent hardware device, the faulty adjacent device obtains all link connections between all network node devices in the network topology, which is not limited herein.
  • the following operations can be performed.
  • the network status information is a link communication interruption, that is, when the ports at both ends of the link cannot detect the transmission or reception of data, it can be determined that the link is currently in a link failure The status meets the link failure convergence condition.
  • the link is in a fault state, when the faulty neighboring device detects the transmission or reception of port data at both ends of the link, that is, when the network status information is in normal link communication, it can determine that the link is currently in a link fault
  • the recovery state meets the conditions for link failure recovery and convergence.
  • the convergence order in the convergence relationship is arranged in ascending order of Rn(m,diff), specifically: R5, R4, R0, R1; when it is judged that the link failure recovers the convergence condition, the convergence The order is in descending order of Rn(m,diff), specifically R1, R0, R4, R5.
  • Rn(m, diff) of any number of network node devices is equal, the order of network node devices with equal Rn(m, diff) in the node convergence relationship is equal, and they can also be arbitrarily selected to send order of. It should be noted that the values corresponding to Rn(spf), Rn(m, sub-spf) and Rn(m, diff) in Table 1 are for illustrative purposes only and are not limited.
  • the faulty neighboring device calculates the adjustment cost value of the faulty link according to the node convergence relationship.
  • the faulty adjacent device sequentially selects the nodes to be converged in the node convergence relationship as the nodes to be converged in the order of convergence in the node convergence relationship.
  • the following takes node n as an example of a node that should converge.
  • the path cost of acquiring nodes that should converge is poor, that is, acquiring Rn(m,diff).
  • the faulty neighboring device also obtains the actual cost value of the faulty link, which is named COST(base).
  • COST(base) the actual cost value of the faulty link
  • the adjustment cost value corresponding to the node Rn to be converged is calculated.
  • Each network device node uses the received adjustment cost value to replace the actual cost value of the original failed link to calculate the forwarding path. The following describes the calculation of the adjustment cost value in the link failure state and the calculation of the adjustment cost value in the link failure recovery state.
  • Link failure status In the case of link failure status, the convergence order acquired by the faulty neighboring device is arranged in ascending order of the path cost difference of each node to be converged.
  • each network device node in the R space needs to orderly converge to the new SPF network path in.
  • Each network device node (that is, the node to be converged) in the R space needs to use the cost value of the failed link to calculate the new SPF network path.
  • the adjustment cost value of the faulty link is calculated to replace the actual cost value of the faulty link.
  • each network device node in the R space can use the adjusted cost value to perform SPF calculation, generate a new network path, and converge into the network path.
  • COST(base) is the actual cost value of the faulty link
  • k is the path cost of the Rn node to the destination node R9 except for the path cost of the faulty link.
  • Rn(m, sub-spf) is the sub-optimal path cost value of the Rn node, and the path cost difference between the optimal path and the sub-optimal path of the Rn node is Rn(m, diff).
  • Rn(m, sub-spf) COST(base)+Rn(m,diff)+k;
  • the faulty neighboring device delivers the calculated path cost value of the new faulty link, that is, a new COST (base), to each network device node in the R space, each network in the R space
  • the device node performs SPF calculation according to the new COST (base) to generate a new Rn (spf), called Rn' (spf), and the new COST (base) is called Rbase.
  • Rn the path cost of the optimal path of node An is Rn’(spf):
  • Rn’(spf) is smaller than Rn(m,sub-spf), therefore, the optimal path of the Rn node is the sub-optimal path before the link failure state, and the Rn node will converge to the sub-optimal path.
  • Rbase COST(base)+k+R5(m,diff)+1;
  • Network failure recovery state In the case of network failure recovery state, the convergence order in the convergence relationship is arranged in descending order of Rn(m,diff). At this time, the faulty adjacent device can first determine whether the path cost value (Rm(spf)) of the optimal path after link failure recovery is less than the path cost value (Rm'(spf)) of the optimal path in the fault state, if If it is less than or equal to, the following orderly convergence steps are entered. If it is greater, the actual cost value of the failed link is published. which is:
  • the optimal path of the Rn node in the R space passes through the faulty link, and the path cost of the optimal path is Rn(spf).
  • the suboptimal path of the Rn node before the fault is the current optimal path Rn"
  • the path cost of this path is Rn” (spf).
  • the path cost difference between the two paths is Rn(m,diff).
  • Rn"(spf) Rn(m, sub-spf);
  • the faulty neighboring device delivers the path cost value of the new faulty link, that is, the new COST (base), to each network device node in the R space, the Each network device node performs SPF calculation according to the new COST (base) to generate a new Rn (spf), and the new COST (base) is called Rbase.
  • the faulty neighboring device assigns Rbase to COST(base)+Rn(m,diff)-x, x is a positive integer greater than 0, and the path cost value of the optimal path of the node Rn is Rn”'(spf) is :
  • Rn”’(spf) is less than Rn”(spf), therefore, the optimal path of the Rn node at this time is the optimal path before the link failure state, and the Rn node will converge to the optimal path at this time.
  • the adjustment cost value corresponding to R1 is calculated first. First, the path cost difference of R1 is obtained, that is, R1 (m, diff), and then the actual path cost value of the faulty link in the link failure state, that is, COST (base). The value of X is 1, the value of COST(base)+k is 1000, and the adjustment cost value corresponding to computing node R1 is:
  • Rbase COST(base)+R1(m,diff)-1;
  • the faulty neighboring device can either calculate the adjustment cost value corresponding to all network device nodes in the node convergence relationship, and then enter step 203; or it can calculate the corresponding value of one network device node in the node convergence relationship. After adjusting the cost value, proceed to step 203. After completing step 203, continue to calculate the adjustment cost value corresponding to the next network device node in the node convergence relationship until the adjustment cost values corresponding to all network device nodes in the node convergence relationship are all After the calculation is completed and sent, the operation ends, which is not limited here.
  • the faulty adjacent device issues the adjustment cost value of the faulty link.
  • the faulty neighboring device may send the adjustment cost value to the network device nodes in the R space in the order of the node convergence relationship.
  • the method of sending includes:
  • the faulty neighboring device sends the adjustment cost value according to the order of the node convergence relationship: R5, R4, R0, R1.
  • it sends the adjustment cost value corresponding to R5 to the network device nodes R5, R4, R0, and R1.
  • the adjustment cost value corresponding to R4 to the network device nodes R5, R4, R0, and R1, and then wait for a certain preset time, then send to the network device nodes R5, R4, R0, and R1
  • the adjustment overhead value corresponding to R0 and after waiting for a certain preset duration, sends the adjustment overhead value corresponding to R1 to the network device nodes R5, R4, R0, and R1.
  • the preset duration is determined by the maximum time for each network device node in the R space to complete network path convergence, and it can generally be set to 500 milliseconds.
  • the faulty neighboring device sends the adjustment cost value according to the order of the node convergence relationship: R1, R0, R4, and R5.
  • the specific sending method is similar to the link fault status, and is not repeated here.
  • the faulty neighboring device sends the adjustment cost value according to the order of the node convergence relationship: R5, R4, R0, and R1. First, it sends the adjustment cost value corresponding to R5 to R5. When the faulty neighboring device receives R5, it completes the network. When the path convergence command is sent, the adjustment cost value corresponding to R4 is sent to R4. When the faulty adjacent device receives the command to complete the network path convergence of R4, it sends the adjustment cost value corresponding to R0 to R0. When the faulty adjacent device receives R0 When the instruction to converge the network path is completed, the adjustment cost value corresponding to R1 is sent to R1. After the faulty neighboring device sends the adjustment cost value corresponding to R1 to the network device node R1, the operation ends.
  • the faulty neighboring device sends the adjustment cost value according to the order of the node convergence relationship: R1, R0, R4, and R5.
  • the specific sending method is similar to the link fault status, and is not repeated here.
  • a faulty neighboring device may generate a node convergence relationship by sorting the path cost difference of each network device node in the network topology, obtain the node convergence relationship, and converge according to the node The relationship generates the adjustment cost value corresponding to each network device node in the node convergence relationship, and sends the adjustment cost value so that each network device node in the node convergence relationship converges to a new network path in an orderly order, avoiding The generation of loops.
  • the following describes the application scenarios of the network path convergence method shown in FIGS. 3 to 4.
  • the network device node R1 is used as the faulty adjacent device, R1 -The R2 link is an example of a failed link.
  • FIG. 3 is a schematic diagram of an application scenario provided by an embodiment of the present application.
  • an application scenario of the method for network path convergence provided by the embodiments of the present application includes the following process:
  • step S1 the forwarding module in the faulty adjacent device R1 (hereinafter referred to as R1 node) transmits the data originally transmitted through the R1-R2 link through the backup path to ensure the normal forwarding of the data.
  • the backup path may include fast Reroute (fast reroute, FRR).
  • FRR fast reroute
  • R5 (m, diff) is 900 and cost (1,2) is 1000. At this time, x is taken as 1 for calculation.
  • the adjustment cost value of R5 is 1901.
  • the node R1 After calculating the adjustment cost value corresponding to R5, the node R1 sends the adjustment cost value to each node in the node convergence relationship, and the R1, R0, R4, and R5 nodes update the adjustment cost value after receiving the adjustment cost value
  • the network topology library in the respective node device and the new forwarding path are calculated through the SPF calculation module. Because the adjustment cost value is 1901, only the new forwarding path calculated in R5 is the optimal path. The next hop of the R5 node is from The R4 node is switched to the R6 node to complete the network path convergence of the R5 node.
  • step S3 after waiting for a certain preset duration or receiving a node convergence completion response in the node convergence relationship, the R1 node takes the R4 node in the node convergence relationship as the convergent node, and calculates the adjustment cost value corresponding to R4.
  • R4 (m, diff) is 1100
  • cost (1,2) is 1000
  • x is 1 for calculation.
  • the adjustment cost value of R4 is 2101.
  • the node R1 After calculating the adjustment cost value corresponding to R4, the node R1 sends the adjustment cost value to each node in the node convergence relationship. After receiving the adjustment cost value, the nodes R1, R0, R4, and R5 use the adjustment cost value to update The network topology library in the respective node device and the new forwarding path are calculated through the SPF calculation module. Since the adjustment cost value is 2101, only the new forwarding path calculated in R4 is the optimal path. The next hop of the R4 node is from The R1 node is switched to the R5 node to complete the network path convergence of the R4 node.
  • step S4 after waiting for a certain preset duration or receiving a node convergence completion response in the node convergence relationship, the R1 node takes the R1 node in the node convergence relationship as the convergent node, and calculates the adjustment cost value corresponding to R0.
  • R1 (m, diff) is 1300
  • cost (1,2) is 1000.
  • x is 1 for calculation.
  • the adjustment cost value of R0 is 2301.
  • the node R1 After calculating the adjustment cost value corresponding to R1, the node R1 sends the adjustment cost value to each node in the node convergence relationship. After receiving the adjustment cost value, the nodes R1, R0, R4, and R5 use the adjustment cost value to update The network topology library in the respective node device and the new forwarding path are calculated through the SPF calculation module. Because the adjustment cost value is 2301, the next hop node of the R0 node can only be the R1 node. Therefore, only the new forwarding path calculated in R1 For the optimal path, the next hop of the R1 node is switched from the R2 node to the R4 node to complete the network path convergence of the R1 node. At this point, the orderly convergence of all nodes in the node convergence queue is completed.
  • the orderly release link adjustment cost value is used to control the orderly convergence of each network device node in the network topology to avoid loop problems caused by inconsistent convergence times of different network device nodes.
  • FIG. 4 is a schematic diagram of another application scenario provided by an embodiment of the present application.
  • an application scenario of the method for network path convergence provided by the embodiments of the present application includes the following process:
  • step A1 when the current network is recovered from a network failure, that is, when the failed link R1-R2 is restored to a normal link, the R1 node detects whether the current network meets the convergence condition.
  • the specific detection steps are as follows, calculate R1- Whether the R2 link meets the following conditions: [cost(1,2)+R2(spf)] is greater than R1(spf), where cost(1,2) is the path cost value of the R1-R2 link, R1(spf) Is the current optimal path cost value of the R1 node, and R2(spf) is the current optimal path cost value of the R2 node. If it is greater than the convergence condition is met, cost(1,2) is directly used as the adjustment cost value. It will cause a network loop, if it is less than or equal, then go to step A2.
  • R1 (m, diff) is 1300, and cost (1,2) is 1000. At this time, x is 1 for calculation.
  • the adjustment cost value of R1 is 2299.
  • the node R1 After calculating the adjustment cost value corresponding to R1, the node R1 sends the adjustment cost value to each node in the node convergence relationship. After receiving the adjustment cost value, the nodes R1, R0, R4, and R5 use the adjustment cost value to update The network topology library in the respective node device and the new forwarding path are calculated through the SPF calculation module. Because the adjustment cost value is 2299, only the new forwarding path calculated in R1 is the optimal path, and the next hop of the R1 node is from The R4 node is switched to the R2 node to complete the network path convergence of the R1 node.
  • step A3 after waiting for a certain preset duration or receiving a node convergence completion response in the node convergence relationship, the R1 node takes the R4 node in the node convergence relationship as the convergent node, and calculates the adjustment cost value corresponding to R4.
  • R4 (m, diff) is 1100
  • cost (1,2) is 1000
  • x is 1 for calculation.
  • the adjustment cost value of R4 is 2099.
  • the node R1 After calculating the adjustment cost value corresponding to R4, the node R1 sends the adjustment cost value to each node in the node convergence relationship. After receiving the adjustment cost value, the nodes R1, R0, R4, and R5 use the adjustment cost value to update The network topology library in the respective node device and the new forwarding path are calculated through the SPF calculation module. Because the adjustment cost value is 2099, only the new forwarding path calculated in R4 is the optimal path. The next hop of the R4 node is from The R5 node is switched to the R1 node to complete the network path convergence of the R4 node.
  • step A4 after waiting for a certain preset duration or receiving a node convergence completion response in the node convergence relationship, the node R5 is taken as the convergent node, and the adjustment cost value corresponding to R5 is calculated. It can be seen from Table 1: R5 (m, diff) is 900 and cost (1,2) is 1000. At this time, x is taken as 1 for calculation. The adjustment cost value of R5 is 1899.
  • the node R1 After calculating the adjustment cost value corresponding to R5, the node R1 sends the adjustment cost value to each node in the node convergence relationship, and the R1, R0, R4, and R5 nodes update the adjustment cost value after receiving the adjustment cost value
  • the network topology library in the respective node device and the new forwarding path are calculated through the SPF calculation module. Since the adjustment cost value is 1899, only the new forwarding path calculated in R5 is the optimal path.
  • the next hop of the R5 node is from The R6 node is switched to the R4 node to complete the network path convergence of the R5 node. At this point, the orderly convergence of all nodes in the node convergence queue is completed.
  • the orderly release link adjustment cost value is used to control the orderly convergence of each network device node in the network topology to avoid loop problems caused by inconsistent convergence times of different network device nodes.
  • the faulty adjacent device 500 includes:
  • the receiver 501, the transmitter 502, the processor 503, and the memory 504 (where the number of the processor 503 in the faulty adjacent device 500 may be one or more, and one processor is taken as an example in FIG. 5).
  • the receiver 501, the transmitter 502, the processor 503, and the memory 504 may be connected through a bus or in other ways. In FIG. 5, connection through a bus is used as an example.
  • the memory 504 may include a read-only memory and a random access memory, and provide instructions and data to the processor 503. A part of the memory 504 may further include a non-volatile random access memory (English full name: non-volatile random access memory, English abbreviation: NVRAM).
  • the memory 504 stores an operating system and operation instructions, executable modules or data structures, or a subset thereof, or an extended set thereof, where the operation instructions may include various operation instructions for implementing various operations.
  • the operating system may include various system programs for implementing various basic services and processing hardware-based tasks.
  • the processor 503 controls the operation of the network device.
  • the processor 503 may also be called a central processing unit (English full name: Central Processing Unit, English abbreviation: CPU).
  • CPU Central Processing Unit
  • each component of the network device is coupled together through a bus system, where the bus system may include a power bus, a control bus, and a status signal bus in addition to a data bus.
  • bus system may include a power bus, a control bus, and a status signal bus in addition to a data bus.
  • various buses are called bus systems in the figure.
  • the method disclosed in the above embodiments of the present application may be applied to the processor 503 or implemented by the processor 503.
  • the processor 503 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method may be completed by an integrated logic circuit of hardware in the processor 503 or instructions in the form of software.
  • the aforementioned processor 503 may be a general-purpose processor, a digital signal processor (English full name: digital signal processing, English abbreviation: DSP), an application specific integrated circuit (English full name: application specific integrated circuit, English abbreviation: ASIC), field programmable Gate array (English full name: field-programmable gate array, English abbreviation: FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.
  • the methods, steps, and logical block diagrams disclosed in the embodiments of the present application may be implemented or executed.
  • the general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the steps of the method disclosed in conjunction with the embodiments of the present application may be directly embodied and executed by a hardware decoding processor, or may be executed and completed by a combination of hardware and software modules in the decoding processor.
  • the software module may be located in a mature storage medium in the art, such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an electrically erasable programmable memory, and a register.
  • the storage medium is located in the memory 504, and the processor 503 reads the information in the memory 504, and completes the steps of the above method in combination with its hardware.
  • the receiver 501 can be used to receive input digital or character information, and generate signal input related to network device related settings and function control.
  • the transmitter 502 can include a display device such as a display screen, and the transmitter 502 can be used to output numbers through an external interface Or character information.
  • the processor 503 is configured to execute the network path convergence method provided in FIG. 1(a) to FIG. 4.
  • processors mentioned in the embodiments of the present application may be a central processing unit (Central Processing Unit, CPU), and may also be other general-purpose processors, digital signal processors (Digital Signal Processor, DSP), and application-specific integrated circuits ( Application Specific (Integrated Circuit, ASIC), ready-made programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc.
  • the general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the memory mentioned in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory may be read-only memory (Read-Only Memory, ROM), programmable read-only memory (Programmable ROM, PROM), erasable programmable read-only memory (Erasable PROM, EPROM), electronically Erasable programmable read only memory (Electrically, EPROM, EEPROM) or flash memory.
  • the volatile memory may be a random access memory (Random Access Memory, RAM), which is used as an external cache.
  • RAM static random access memory
  • DRAM dynamic random access memory
  • DRAM synchronous dynamic random access memory
  • SDRAM double data rate synchronous dynamic random access memory
  • Double Data Rate SDRAM DDR SDRAM
  • enhanced SDRAM ESDRAM
  • Synchlink DRAM SLDRAM
  • Direct Rambus RAM Direct Rambus RAM
  • the processor is a general-purpose processor, DSP, ASIC, FPGA or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component
  • the memory storage module
  • the memories described herein are intended to include, but are not limited to these and any other suitable types of memories.
  • an embodiment of the present application further provides a fault-adjacent device 600, including:
  • the obtaining unit 601 is used to obtain the node convergence relationship through the obtaining unit 601 after the network failure occurs.
  • the node convergence relationship includes the order of convergence between the nodes to be converged.
  • the optimal path is the path with the least path cost among the paths to be converged from the destination node;
  • the calculation unit 602 is configured to calculate an adjustment cost value for replacing the actual cost value of the failed link corresponding to each node to be converged;
  • the publishing unit 603 is used to orderly publish the adjusted cost value corresponding to the node to be converged as the actual cost value of the faulty link according to the calculation result and the convergence order of the calculating unit 602, wherein the adjusted cost value is used to control the node to be converged according to The node convergence relationship converges.
  • the faulty neighboring device 600 detects whether the current network is faulty.
  • the network fault includes a link fault or a fault of a network device node, a link faulty link, and a link connected to the faulty network device node are also called It is a faulty link.
  • the faulty neighboring device 600 can also receive the detection results of other network management devices on the current network, and determine whether the current network is faulty according to the detection results.
  • Other network equipment may include routers or servers.
  • the faulty neighboring device 600 After detecting that the current network is faulty, the faulty neighboring device 600 obtains the node convergence relationship in the network through the obtaining unit 601.
  • the node convergence relationship includes the convergence order between the nodes to be converged, and the node to be converged will pass through the faulty link as the optimal path
  • the optimal path is the path with the least path cost among the paths from the node to be converged to the destination node.
  • the faulty neighboring device 600 corresponds to each node to be converged in the node convergence relationship, and the calculation unit 602 calculates the adjustment cost value corresponding to each node.
  • the adjustment cost value is used to replace the actual cost value of the faulty link.
  • the fault adjacency device 600 publishes the adjustment cost value corresponding to each node through the publishing unit 603 in an orderly manner according to the convergence order.
  • the adjustment cost value has the same effect as the actual cost value of the failed link, and each node uses the adjustment cost value to calculate the path and converge.
  • the faulty neighboring device 600 releases the adjustment cost value to each node in the node convergence relationship in order, so that each node converges according to the convergence order in the node convergence relationship, thereby avoiding the occurrence of network loops.
  • the faulty neighboring device 600 includes:
  • the calculation unit 602 is specifically configured to sequentially take the nodes to be converged as the nodes to be converged according to the convergence order of the nodes to be converged, and each time the nodes to be converged are taken, the fault neighboring device 600 calculates the adjustment cost value of the failed link based on the nodes to be converged.
  • the faulty neighboring device 600 corresponds to each node to be converged in the node convergence relationship by calculating an adjustment cost value for replacing the actual cost value of the faulty link, including: the faulty neighboring device 600 converges according to In the order of node convergence, the nodes to be converged are selected as convergent nodes. It should be noted that when the order of multiple nodes is consistent, the acquiring unit 601 takes multiple nodes of the same order. The node should converge. Each time the acquisition unit 601 takes a node that should converge, the faulty neighboring device 600 uses the calculation unit 602 to calculate the adjustment cost value of the faulty link based on the convergent node.
  • the adjustment cost value corresponding to the convergent node is called the adjustment cost value, and the faulty neighboring device 600 After using the calculation unit 602 to calculate the adjustment cost value once, it publishes the adjustment cost value to each node in the node convergence relationship through the publishing unit 603. After the adjustment cost value is released to each node, the faulty neighboring device 600 then uses the acquisition unit 601 to take the next node in the convergence order as the convergent node, and uses the calculation unit 602 to calculate the adjustment cost value of the corresponding node and publish it through the release unit 603. Until the calculation is completed, the adjustment cost value corresponding to the last node in the convergence sequence is released.
  • the faulty neighboring device 600 takes the nodes in the node convergence relationship through the acquisition unit 601 according to the convergence order, and uses the taken nodes to calculate the adjustment cost value through the calculation unit 602, so that the faulty neighboring device 600 uses the calculation unit 602 to calculate the adjustment cost in an orderly manner Value to facilitate subsequent orderly release of the adjustment cost value by the release unit 603, which avoids the occurrence of network loops.
  • the publishing unit 603 is specifically configured to determine whether the calculation result of this time is the same as the previous calculation result after the calculation unit 602 calculates the adjustment cost value each time. After the last calculation result is different, the adjusted cost value obtained by this calculation is released.
  • the publishing unit 603 determines whether the calculation result of this time is the same as the calculation result of the previous calculation unit 602, and determines that the calculation result of this time is the same as the previous calculation result. After the calculation results are different, the adjustment cost value obtained by this calculation is released.
  • the convergence order in the node convergence relationship acquired by the acquiring unit 601 is arranged in ascending order of the path cost difference of the nodes to be converged, where the path cost is poor It is the difference between the path cost of the optimal path and the sub-optimal path of the node to be converged.
  • the sub-optimal path is the path with the smallest path cost among the paths of the node to be converged without reaching the destination node through the failed link.
  • the adjusted cost value of the failed link is greater than the cost value of the suboptimal path of the node that should converge.
  • the convergence sequence is that after a network failure occurs, the faulty neighboring device 600 obtains the node convergence relationship through the obtaining unit 601, where the node convergence relationship may be the faulty neighboring device 600 according to the relevant information of each node in the network topology It is generated before the network fault occurs and stored in the fault neighboring device 600, or may be generated according to relevant information after the network fault occurs.
  • the device generated by the node convergence relationship may be either the faulty neighboring device 600 or other management devices, such as servers or routers, which is not limited herein.
  • the convergence order is arranged in ascending order of the path cost difference of each node in the node convergence relationship, where the path cost difference is the optimal path and The path cost difference between sub-optimal paths.
  • the optimal path is the path with the smallest path cost for the node to reach the destination node through the failed link.
  • the sub-optimal path is the path with the lowest path cost for the node to reach the destination node without the failed link .
  • the convergence order in the node convergence relationship is arranged in ascending order of the path cost difference, so that the faulty neighboring device 600 calculates the adjustment cost value in order, so that subsequent adjustment cost values can be issued in an orderly manner, avoiding network loops.
  • the occurrence of the road is arranged in ascending order of the path cost difference, so that the faulty neighboring device 600 calculates the adjustment cost value in order, so that subsequent adjustment cost values can be issued in an orderly manner, avoiding network loops.
  • the adjusted cost value of the failed link is greater than the cost value of the sub-optimal path of the node that should converge.
  • the adjusted cost value of the failed link is greater than the cost value of the sub-optimal path of the node that should converge.
  • each node in the node convergence relationship will use the adjusted cost value as the path cost value of the optimal path of the current node after receiving the adjusted cost value.
  • the cost value of the adjustment is greater than the cost value of the suboptimal path of the convergent node, the path cost value of the original suboptimal path of the convergent node is lower than the path cost value of the original optimal path.
  • shortest path priority shortest path priority
  • SPF shortest path priority
  • the convergent node will use the path with the lowest path cost value for forwarding.
  • the convergent node will use the original suboptimal path for forwarding instead of the original optimal path, which ensures that the convergent node can complete the convergence .
  • the faulty neighboring device 600 includes:
  • the calculation unit 602 is specifically used to calculate the adjustment cost value of the faulty link using the following method:
  • Rbase represents the adjustment cost value of the failed link
  • COST(base) represents the path cost value of the optimal path that should converge to the node
  • Rn(m, diff) represents the path cost difference of the node n that should converge
  • the node n that should converge is One of the nodes on each optimal path through the failed link
  • x is a positive integer greater than 0, and x is less than or equal to Rn(spf)-Rn+1(spf), where Rn(spf) represents the node
  • the path cost value of the optimal path of n, Rn+1 (spf) represents the path cost value of the optimal path of node n+1, and node n+1 is the next node that should converge in the convergence order.
  • the node convergence relationship further includes a convergence order, and the convergence order is the convergence order of each node when the fault is recovered.
  • the faulty neighboring device 600 further includes:
  • the obtaining unit 601 is specifically configured to arrange the convergence order of the acquired node convergence relationship in descending order of the path cost difference of the nodes to be converged if the failed link is in the fault recovery state after the network failure.
  • the faulty neighboring device 600 detects whether the current faulty link is in the fault recovery state, and whether the faulty link recovers includes the faulty link or the faulty network device node can communicate normally, it needs to be explained Yes, in addition to the faulty neighboring device 600 detecting whether the current faulty link is restored, the faulty neighboring device 600 can also receive the detection results of other network management devices for the current faulty link, and determine whether the current faulty link is recovered according to the detection result, here
  • Other network devices may include routers or servers.
  • the faulty neighboring device 600 After detecting that the current faulty link is in the fault recovery state, the faulty neighboring device 600 acquires the node convergence relationship in the network.
  • the node convergence relationship includes the convergence order between the nodes to be converged.
  • the node to be converged is the optimal path and passes through the faulty link
  • the optimal path is the path with the least path cost among the paths from the node to be converged to the destination node.
  • the faulty adjacent device 600 corresponds to each node to be converged in the node convergence relationship, and calculates the adjustment cost value corresponding to each node.
  • the adjustment cost value is used to replace the actual cost value of the failed link.
  • the node to be converged in the node convergence relationship After receiving the adjusted cost value, the forwarding path is calculated according to the adjusted cost value.
  • the fault adjacency device 600 After calculating the adjustment cost value corresponding to the node to be converged in the node convergence relationship, the fault adjacency device 600 releases the adjustment cost value corresponding to the node to be converged in an orderly manner according to the convergence order, and each node to be converged in the node convergence relationship is receiving After the adjustment cost value is reached, the effect of the adjustment cost value is the same as the actual cost value of the failed link, and each node to be converged uses the adjustment cost value to calculate the path and converge.
  • the fault adjacency device 600 distributes the adjustment cost value to each node to be converged in the node convergence relationship in order, so that each node to be converged will converge according to the order of convergence in the node convergence relationship, thereby avoiding the occurrence of network loops.
  • the convergence order is arranged in descending order of the path cost difference of each node in the node convergence relationship.
  • the faulty neighboring device 600 obtains the convergence order in the node convergence relationship through the obtaining unit 601, wherein the convergence order may be the faulty neighboring device 600 according to each node in the network topology.
  • the related information is generated and stored in the faulty neighboring device 600 before the network fault is recovered, or may be generated based on the related information after the network fault occurs.
  • the device generated in this convergence order may be either the faulty neighboring device 600 or other management devices, such as servers or routers, which is not limited herein.
  • the convergence order acquired by the faulty neighboring device 600 through the acquisition unit 601 is arranged in descending order of the path cost difference of each node in the node convergence relationship, where the path cost difference is the optimal path
  • the optimal path is the path with the smallest path cost to the destination node through the failed link
  • the sub-optimal path is the path with the lowest path cost to the destination node without the failed link.
  • the convergence order in the node convergence relationship is arranged in descending order according to the path cost difference, so that the faulty neighboring device 600 calculates the adjustment cost values in order, so that the adjustment cost values can be issued in an orderly manner, avoiding network loops. The occurrence of the road.
  • the adjusted cost value of the failed link is less than the path cost value of the sub-optimal path of the node that should converge.
  • the adjusted cost value of the failed link is less than the path cost value of the suboptimal path of the node that should converge. It should be noted that after the failed link is in the fault recovery state, before the path convergence, each node in the node convergence relationship is forwarded according to the original suboptimal path. At this time, for each node, the current optimal path is the original The sub-optimal path, originally referred to before the network failure. Since each node in the node convergence relationship receives the adjusted cost value, it will use the adjusted cost value as the path cost value of the optimal path of the current node.
  • the path cost value of the original optimal path of the convergent node is lower than the path cost value of the original suboptimal path, according to the shortest path priority principle (shortest path priority) first, SPF), the convergent node will use the path with the lowest path cost value for forwarding. In this case, the convergent node will use the original optimal path for forwarding instead of the original suboptimal path, ensuring that the convergent node can complete the convergence .
  • SPF shortest path priority first
  • the calculation unit 602 uses the following method to calculate the adjustment cost value of the failed link:
  • Rbase represents the adjustment cost value of the failed link
  • COST(base) represents the actual cost value of the failed link
  • Rn(m, diff) represents the path cost difference of node n
  • node n is the node that should converge
  • x is greater than 0 Is a positive integer and x is less than or equal to Rn(spf)-Rn+1(spf), where Rn(spf) represents the path cost value of the optimal path for node n, and Rn+1(spf) represents node n+1
  • the path cost value of the optimal path of, n+1 is the next node that should converge in the convergence sequence.
  • the faulty neighboring device 600 includes:
  • the obtaining unit 601 is specifically used by the faulty neighboring device 600 to take the node in the convergence order of the node convergence relationship as the convergent node through the obtaining unit 601, and take the next node in the convergent order as the convergent node after a preset duration until The last node.
  • the faulty neighboring device 600 uses the adjustment cost value corresponding to each node as the actual cost value of the faulty link to publish it in an orderly manner through the publishing unit 603, including:
  • the current node is the convergent node.
  • the corresponding adjustment cost value is calculated by the calculation unit 602 and sent in an orderly manner through the publishing unit 603.
  • the next node is fetched by the acquisition unit 601 in a convergent order As a convergent node, until the last node is taken and the last node is used as a convergent node, the corresponding adjustment cost value is calculated and sent in order.
  • the preset duration should be greater than or equal to the maximum length of time for the nodes in the network topology to complete the network path convergence.
  • the convergence order includes the convergence order or the convergence order.
  • the corresponding adjustment cost value is the adjustment Cost value.
  • the corresponding adjustment cost value is the adjustment cost value.
  • the preset duration is greater than or equal to the maximum value of the node's network path convergence duration in the network topology, it ensures that the next node corresponds to Before adjusting the cost value, all nodes in the network topology have completed the operation of using this adjustment cost value to converge the network path, which improves the degree of automation of network path convergence.
  • the faulty neighboring device 600 includes:
  • the obtaining unit 601 is specifically used by the faulty neighboring device 600 to obtain, through the obtaining unit 601, the node in the convergence order of the node convergence relationship as the node to be converged;
  • the next node is selected as the convergent node in the order of convergence until the last node.
  • the faulty neighboring device 600 uses the acquiring unit 601 to take the node in the convergence order as the convergent node, and then uses the convergent node to calculate the corresponding adjustment cost value through the calculating unit 602 and sends it in an orderly manner; After the convergence completion response returned by the convergent node, the next node is taken as the convergent node through the acquiring unit 601 in a convergent order until the last node is taken and the last node is used as the convergent node to calculate the corresponding adjustment cost
  • the values are sent in order, and the convergence order includes the convergence order or the convergence order.
  • the corresponding adjustment cost value is the adjustment cost value.
  • the corresponding adjustment cost value is the adjustment cost value.
  • the acquiring unit 601 is used to perform the acquiring operation of the faulty neighboring device in the above embodiment
  • the calculating unit 602 is used to perform the operation of calculating the adjustment cost value of the faulty neighboring device in the above embodiment
  • the issuing unit is used to perform the faulty operation in the above embodiment
  • the adjacent device issues an operation to adjust the cost value.
  • the obtaining unit 601 is used to perform the related obtaining operation of obtaining the node convergence relationship in step 201 in FIG. 2, including obtaining network status information, the path cost value of the node, etc.; the calculating unit 602 is used to execute The calculation operation related to the calculation of the adjustment cost value in step 202 in FIG. 2 includes the path cost difference of the calculation node, the adjustment cost value of the calculation node, etc.; the publishing unit 603 is used to perform the calculation by the publishing calculation unit 602 in step 203 in FIG. 2 Adjust the cost value to the node of the network topology.
  • the obtaining unit 601 is used to perform steps R2, S3, and S4 in FIG. 3 to sequentially obtain the related operations of nodes in the node convergence relationship; the calculating unit 602 is used to execute FIG. 3 In step S2, step S3, and step S4, the R1 node obtains the related information of the node according to the obtaining unit 601, and calculates the related operation of adjusting the cost value; the publishing unit 602 is used to perform step S2, step S3, and R1 in step S4 in FIG. The node issues related operations to adjust the cost value.
  • the obtaining unit 601 is used to perform the related operations of obtaining the nodes in the node convergence relationship in step A2, step A3, and step A4 in FIG. 4 in sequence; the calculating unit 602 is used to execute FIG. 4 In step A2, step A3, and step A4, the R1 node obtains the relevant information of the node according to the obtaining unit 601, and calculates the related operation of adjusting the cost value; the publishing unit 602 is used to perform step A2, step A3, and R1 in step A4 in FIG. The node issues related operations to adjust the cost value.
  • a computer-readable storage medium on which instructions are stored, and when the instructions are executed, the method of network path convergence in the method embodiment shown in FIG. 2 or FIG. 3 described above is executed.
  • a computer program product containing instructions is provided, and when the instructions are executed, the method of network path convergence in the method embodiment shown in FIG. 2 or FIG. 3 is performed.
  • the disclosed system, device, and method may be implemented in other ways.
  • the device embodiments described above are only schematic.
  • the division of the units is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented.
  • the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical, or other forms.
  • 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, they may be located in one place, or may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
  • the above integrated unit can be implemented in the form of hardware or software function unit.
  • the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a computer-readable storage medium.
  • the technical solution of the present application essentially or part of the contribution to the existing technology or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium , Including several instructions to enable a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program code .

Landscapes

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

Abstract

Des modes de réalisation de la présente invention concernent un procédé de convergence de voies de réseau et un dispositif. Le procédé de convergence de voies de réseau proposé dans les modes de réalisation de la présente invention comprend les étapes suivantes : après l'occurrence d'une anomalie de réseau, un dispositif voisin d'une anomalie obtient une relation de convergence de nœuds, la relation de convergence de nœuds comprenant l'ordre de convergence de nœuds à faire converger, lesdits nœuds étant des nœuds où la voie optimale traverse une liaison défaillante, la voie optimale étant la voie dont le surdébit de voie est le plus petit parmi les voies, desdits nœuds à un nœud de destination ; le dispositif voisin d'une anomalie calcule une valeur de surdébit de réglage pour remplacer la valeur réelle de surdébit de la liaison défaillante correspondant à chaque nœud à faire converger ; selon le résultat de calcul et l'ordre de convergence, le dispositif publie de manière ordonnée la valeur de surdébit de réglage correspondant auxdits nœuds sous forme de valeur réelle de surdébit de la liaison défaillante, la valeur de surdébit de réglage servant à placer lesdits nœuds à faire converger dans l'ordre de convergence.
PCT/CN2019/127459 2018-12-29 2019-12-23 Procédé de convergence de voies de réseau et dispositif associé WO2020135339A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811640864.4 2018-12-29
CN201811640864.4A CN111385194B (zh) 2018-12-29 2018-12-29 一种网络路径收敛的方法以及相关设备

Publications (1)

Publication Number Publication Date
WO2020135339A1 true WO2020135339A1 (fr) 2020-07-02

Family

ID=71126809

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/127459 WO2020135339A1 (fr) 2018-12-29 2019-12-23 Procédé de convergence de voies de réseau et dispositif associé

Country Status (2)

Country Link
CN (1) CN111385194B (fr)
WO (1) WO2020135339A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111884927A (zh) * 2020-07-16 2020-11-03 中盈优创资讯科技有限公司 基于ospf链路数据库的链路开销获取方法和装置
CN114844760A (zh) * 2022-05-05 2022-08-02 鹏城实验室 一种网络故障感知与定位方法、装置、终端及存储介质

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116094995A (zh) * 2021-11-08 2023-05-09 中兴通讯股份有限公司 标签处理方法、系统、装置和计算机存储介质
CN116938803A (zh) * 2022-04-02 2023-10-24 华为技术有限公司 路径计算方法、装置及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8456982B2 (en) * 2010-08-26 2013-06-04 Verizon Patent And Licensing Inc. System and method for fast network restoration
CN103210616A (zh) * 2010-11-12 2013-07-17 阿尔卡特朗讯公司 选路信息的预先计算
CN104283789A (zh) * 2014-09-19 2015-01-14 深圳市腾讯计算机系统有限公司 路由收敛方法和系统
CN105247823A (zh) * 2013-09-13 2016-01-13 华为技术有限公司 调整链路开销的方法和装置

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8233905B2 (en) * 2007-06-15 2012-07-31 Silver Spring Networks, Inc. Load management in wireless mesh communications networks

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8456982B2 (en) * 2010-08-26 2013-06-04 Verizon Patent And Licensing Inc. System and method for fast network restoration
CN103210616A (zh) * 2010-11-12 2013-07-17 阿尔卡特朗讯公司 选路信息的预先计算
CN105247823A (zh) * 2013-09-13 2016-01-13 华为技术有限公司 调整链路开销的方法和装置
CN104283789A (zh) * 2014-09-19 2015-01-14 深圳市腾讯计算机系统有限公司 路由收敛方法和系统

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111884927A (zh) * 2020-07-16 2020-11-03 中盈优创资讯科技有限公司 基于ospf链路数据库的链路开销获取方法和装置
CN111884927B (zh) * 2020-07-16 2022-02-15 中盈优创资讯科技有限公司 基于ospf链路数据库的链路开销获取方法和装置
CN114844760A (zh) * 2022-05-05 2022-08-02 鹏城实验室 一种网络故障感知与定位方法、装置、终端及存储介质
CN114844760B (zh) * 2022-05-05 2023-07-25 鹏城实验室 一种网络故障感知与定位方法、装置、终端及存储介质

Also Published As

Publication number Publication date
CN111385194A (zh) 2020-07-07
CN111385194B (zh) 2021-02-26

Similar Documents

Publication Publication Date Title
JP6369698B2 (ja) トラフィック切り替え方法、デバイス、およびシステム
US11411853B2 (en) Link-state advertisement LSA sending method, apparatus, and system
WO2020135339A1 (fr) Procédé de convergence de voies de réseau et dispositif associé
US9729473B2 (en) Network high availability using temporary re-routing
US8576721B1 (en) Local forwarding bias in a multi-chassis router
EP2245792B1 (fr) Système, procédé et programme pour déterminer des routeurs défectueux dans un réseau
US10439880B2 (en) Loop-free convergence in communication networks
JP5488979B2 (ja) コンピュータシステム、コントローラ、スイッチ、及び通信方法
CN106559246B (zh) 集群的实现方法和服务器
WO2014203169A1 (fr) Procédés et systèmes avec une robustesse améliorée pour un groupe d'agrégation de liaisons multi-châssis
US9942138B2 (en) Method and device for policy based routing
US9832121B1 (en) Next hop instruction associations for forwarding unit programming within a network device
US11711243B2 (en) Packet processing method and gateway device
WO2021082812A1 (fr) Procédé d'envoi de message et premier dispositif de réseau
US11863454B2 (en) Systems and methods for scalable validation of multiple paths in a network using segment routing
US20240129223A1 (en) Systems and methods for data plane validation of multiple paths in a network
Papán et al. Analysis of existing IP Fast Reroute mechanisms
CN107770061B (zh) 转发报文的方法及转发设备
Kamamura et al. Autonomous IP fast rerouting with compressed backup flow entries using OpenFlow
CN113366804A (zh) 防止网络拓扑改变期间的微环路的方法和系统
WO2018036453A1 (fr) Procédé de synchronisation d'informations de topologie dans un réseau sfc et élément de réseau de routage
JP5597657B2 (ja) マイクロループ防止設定方法、通信システム、及びマイクロループ防止装置
CN116668352A (zh) 状态指示方法、装置和存储介质
CN116366593A (zh) 报文转发方法及相关装置
PARVEEN MAPCHECK: A DYNAMIC GREEDY PATH MAPPING WITH FAILURE PATH CHECKING

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19903721

Country of ref document: EP

Kind code of ref document: A1