Forwarding equipment and forwarding table item updating method

Abstract

The invention provides forwarding equipment and a forwarding table item updating method, and belongs to the technical field of communication. The forwarding device comprises a control module and a forwarding module. The control module is used for acquiring link state updating information, and the link state updating information is used for indicating the state of a first link from the forwarding equipment to a destination node; outputting the link state updating information to the forwarding module; the transmitting module is used for updating the network topology between the forwarding equipment and the destination node based on the link state updating information; and updating a forwarding table item corresponding to the destination node based on the updated network topology.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a forwarding device and a forwarding table entry updating method. Background Art

[0002] When a link failure in the network causes a path to become unavailable, the forwarding devices in the network will send link status update information to other forwarding devices. Each forwarding device recalculates the path based on the link status update information and updates the forwarding table, eventually reaching a stable forwarding state. The above process is called network convergence.

[0003] The forwarding device includes a main control board and an interface board. The main control board is responsible for obtaining link status update information, updating the network topology based on the link status update information, performing path calculation based on the updated network topology, updating the routing information base (FIB) based on the path calculation result, and then refreshing the forwarding information base (FIB) in the interface board based on the updated RIB, so that the interface board can forward packets based on the updated FIB. However, under the above implementation, the network convergence time is relatively long. Summary of the invention

[0004] The present application provides a forwarding device and a forwarding table update method, which can shorten the network convergence time and improve the convergence speed. The technical solution is as follows.

[0005] In a first aspect, a forwarding device is provided, the forwarding device comprising a control module and a forwarding module. The control module is used to obtain link state update information, the link state update information is used to indicate the state of a first link from the forwarding device to a destination node; output the link state update information to the forwarding module; the forwarding module is used to update the network topology between the forwarding device and the destination node based on the link state update information; and update the forwarding table entry corresponding to the destination node based on the updated network topology.

[0006] In this implementation, the control module outputs link state update information indicating the state of the first link from the forwarding device to the destination node to the forwarding module, and the forwarding module updates the network topology between the forwarding device and the destination node according to the link state update information, and then performs self-update of the forwarding table items based on the updated network topology; compared with the control module refreshing the FIB in the forwarding module based on the RIB, the amount of data transmitted is smaller, the time consumption is less, and the network convergence is accelerated. In particular, when there are many address prefixes of nodes in the network, resulting in many forwarding table items that need to be updated, the convergence speed can be greatly accelerated.

[0007] In some possible implementations, the link status update information is used to indicate a first link failure from the forwarding device to the destination node.

[0008] Correspondingly, the forwarding module is used to perform path calculation based on the updated network topology and determine the second link as the forwarding path; based on the second link, the forwarding entry corresponding to the destination node is updated, and the updated forwarding entry corresponding to the destination node includes the next hop information corresponding to the second link.

[0009] In the above implementation, the first link is a link on a path from the forwarding device as a source node to the destination node before the forwarding device obtains the link state update information, and the first link may be all or part of the path. Due to the failure of the first link, the forwarding module selects the second link from the network topology between the forwarding device and the destination node as a new forwarding path.

[0010] In this implementation, the forwarding module updates the network topology based on the link status update information, then determines the new forwarding path based on the network topology calculation path, and updates the forwarding table entry corresponding to the destination node based on the new forwarding path. This ensures that when a link failure occurs, the faulty link can be eliminated, and the forwarding table entry is updated in a timely and accurate manner to ensure message forwarding.

[0011] In some examples, in order to save storage space of the path calculation module, the above network topology can be a simple network topology, that is, the nodes and links in the network topology are represented by simple identifiers. Compared with the network topology represented by the protocol language in the control module, this method greatly saves storage space.

[0012] In some examples, the forwarding module may use the shortest path tree algorithm to calculate the shortest path to the destination node and update the forwarding table entry. In other examples, the forwarding module may also use other path algorithms to calculate the shortest path to the destination node and update the forwarding table entry.

[0013] In some possible implementations, the forwarding table entry includes a destination address prefix and an index of next hop information corresponding to the destination address prefix;

[0014] The forwarding module is used to update the index of the next hop information corresponding to the destination address prefix of the destination node to the index of the next hop information corresponding to the second link.

[0015] The next hop information includes an outbound interface and / or a next hop address.

[0016] In this implementation, the control module allocates indexes based on local links. The local links correspond to the next hop information, so it can be said that the indexes are allocated based on the next hop information. When the path from the local node to the destination node changes, the index associated (corresponding) with the path from the local node to the destination node needs to be updated, and the destination address prefix of the destination node is associated with the new index.

[0017] In some other possible implementations, the forwarding table entry includes a node index and next hop information corresponding to the node index, and the node index corresponds to at least one destination address prefix of the node;

[0018] The forwarding module is used to update the next hop information corresponding to the node index of the destination node to the next hop information corresponding to the second link.

[0019] In this implementation, the control module allocates indexes based on nodes. When the path from the local node to the first node changes, the index associated with the path from the local node to the first node needs to remain unchanged, and the next hop information corresponding to the index can be updated.

[0020] In some possible implementations, the link state update information includes an identifier of the first link and an identifier of a state of the first link.

[0021] For example, the identifier of the first link may be an identifier assigned to the link by the network, or the identifier of the first link may be a combination of the identifiers of the nodes at both ends of the link, such as AB. Different states of the first link have different corresponding state identifiers of the first link; for example, when the state of the first link is faulty, the state identifier of the first link is 0, and when the state of the first link is normal, the state identifier of the first link is 1. The state of the first link indicated in the link state update information is different from the state of the first link before, thereby achieving the purpose of updating the state of the first link.

[0022] For example, the state of the first link before this is normal, and the state of the first link indicated in the link state update information is faulty, indicating that the first link has changed from normal to faulty. For example, the state of the first link before this is faulty, and the state of the first link indicated in the link state update information is normal, indicating that the first link has recovered from the fault to normal. For another example, the state of the first link was not recorded before this, and the state of the first link indicated in the link state update information is normal, indicating that the first link is online. Here, before this refers to before the link state update information is obtained.

[0023] In some possible implementations, the forwarding table entry corresponding to the destination node is an entry in a forwarding information base FIB in the forwarding module.

[0024] Optionally, the control module is further used to update the network topology between the forwarding device and the destination node based on the link state update information after outputting the link state update information; update the RIB based on the updated network topology; and refresh the FIB in the forwarding module based on the updated RIB.

[0025] In this implementation, under the premise of achieving accelerated network convergence, the FIB of the forwarding module is refreshed through repeated calculations of the control module, thereby further ensuring the accuracy of the forwarding table entries used by the forwarding module.

[0026] Optionally, the control module is further configured to synchronize the network topology between the forwarding device and the destination node to the forwarding module before outputting the link status update information.

[0027] In this implementation, the control module synchronizes the network topology to the forwarding module to achieve consistency of the network topology in the control module and the forwarding module at the beginning, and then the consistency of the network topology in the control module and the forwarding module is achieved through link state update information. The mirroring function of the network topology in the control module and the forwarding module is achieved through the above process.

[0028] In some possible implementations, the control module is disposed on a main control board of the forwarding device, and the forwarding module is disposed on an interface board of the forwarding device.

[0029] In a second aspect, a forwarding table updating method is provided, the method comprising:

[0030] The forwarding device obtains link state update information through the control module, where the link state update information is used to indicate the state of the first link from the forwarding device to the destination node;

[0031] The forwarding device outputs link status update information to the forwarding module of the forwarding device through the control module;

[0032] The forwarding module of the forwarding device updates the network topology between the forwarding device and the destination node based on the link state update information;

[0033] The forwarding module of the forwarding device updates the forwarding table entry corresponding to the destination node based on the updated network topology.

[0034] Exemplarily, the link state update information is used to indicate a first link failure from the forwarding device to the destination node, and the forwarding module of the forwarding device updates the forwarding table entry corresponding to the destination node based on the updated network topology, including:

[0035] The forwarding module of the forwarding device performs path calculation based on the updated network topology and determines the second link as the forwarding path;

[0036] The forwarding module of the forwarding device updates the forwarding entry corresponding to the destination node based on the second link, and the updated forwarding entry corresponding to the destination node includes the next hop information corresponding to the second link.

[0037] Exemplarily, the forwarding table entry includes a destination address prefix and an index of next hop information corresponding to the destination address prefix, and the forwarding module of the forwarding device updates the forwarding table entry corresponding to the destination node based on the second link, including:

[0038] The forwarding module of the forwarding device updates the index of the next hop information corresponding to the destination address prefix of the destination node to the index of the next hop information corresponding to the second link.

[0039] Exemplarily, the forwarding table entry includes a node index and next hop information corresponding to the node index, the node index corresponds to at least one destination address prefix of the node, and the forwarding module of the forwarding device updates the forwarding table entry corresponding to the destination node based on the second link, including:

[0040] The forwarding module of the forwarding device updates the next hop information corresponding to the node index of the destination node to the next hop information corresponding to the second link.

[0041] Exemplarily, the link state update information includes an identifier of the first link and an identifier of the state of the first link.

[0042] Exemplarily, the forwarding table entry corresponding to the destination node is an entry in a forwarding information base FIB in the forwarding module.

[0043] Optionally, the method further comprises:

[0044] The control module of the forwarding device updates the network topology between the forwarding device and the destination node based on the link state update information;

[0045] The control module of the forwarding device updates the routing information base RIB based on the updated network topology;

[0046] The control module of the forwarding device refreshes the FIB in the forwarding module based on the updated RIB.

[0047] Optionally, the method further comprises:

[0048] The control module of the forwarding device synchronizes the network topology between the forwarding device and the destination node to the forwarding module.

[0049] In a third aspect, a forwarding device is provided, which includes a processor and a memory, wherein the memory is used to store a software program, and the processor runs or executes the software program stored in the memory so that the forwarding device implements the method in the second aspect or any optional method of the second aspect.

[0050] In a fourth aspect, a network is provided, comprising a forwarding device, wherein the forwarding device executes the method in the second aspect or any optional manner of the second aspect.

[0051] In a fifth aspect, a computer-readable storage medium is provided, wherein at least one instruction is stored in the storage medium. When the instruction is executed on a computer, the computer executes the method in the second aspect or any optional manner of the second aspect.

[0052] In a sixth aspect, a computer program product is provided, which includes one or more computer program instructions. When the computer program instructions are loaded and executed by a computer, the computer executes the method in the second aspect or any optional manner of the second aspect.

[0053] In the seventh aspect, a chip is provided, comprising a memory and a processor, wherein the memory is used to store computer instructions, and the processor is used to call and run the computer instructions from the memory to execute the method in the above-mentioned second aspect or any optional manner of the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] Figure 1 is a schematic diagram of a network deployment scenario provided in an embodiment of the present application;

[0055] Figure 2 It is a structural diagram of a forwarding device provided in an embodiment of the present application;

[0056] Figure 3 It is a flow chart of a forwarding table updating method provided in an embodiment of the present application;

[0057] Figure 4 It is a flow chart of a forwarding table updating method provided in an embodiment of the present application;

[0058] Figure 5 This is a network diagram before a link failure provided by an embodiment of the present application;

[0059] Figure 6 This is a network diagram before a link failure provided by an embodiment of the present application;

[0060] Figure 7 This is a network diagram after a link failure provided by an embodiment of the present application;

[0061] Figure 8 This is a network diagram after a link failure provided by an embodiment of the present application;

[0062] Fig. 9 It is a structural diagram of a forwarding device provided in an embodiment of the present application;

[0063] Fig.10 It is a structural diagram of a forwarding device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0064] In order to make the objectives, technical solutions and advantages of the present application clearer, the implementation methods of the present application will be further described in detail below with reference to the drawings.

[0065] Figure 1 Schematic diagram of a network deployment scenario provided by an embodiment of the present application. Figure 1 As shown, the scenario includes nodes A~F, and the above nodes A~F can all be forwarding devices (such as routers, switches, etc.) that support link state protocols. Among them, the link state protocol can be an interior gateway protocol (IGP) link state protocol, or a border gateway protocol (border gateway protocol)-shortest path first (SPF) link state protocol, or other link state protocols. In order to facilitate the description and introduction of the solution provided by this application, IGP will be used as an example for explanation in the following. This application is for Figure 1 The network corresponding to the scenario shown is a network that relies on link state protocol convergence, for example, it can be an operator's metropolitan area network, a backbone network, etc.

[0066] Figure 2 Schematic diagram of the structure of a forwarding device provided in an embodiment of the present application. Figure 2 As shown, the forwarding device includes a control module 10 and a forwarding module 20. The control module 10 is responsible for link state protocol message interaction, link state database (LSDB) maintenance, route calculation, RIB maintenance, etc. The control module 10 refreshes the FIB in the forwarding module 20 based on the RIB, and the forwarding module 20 forwards messages based on the FIB. Among them, the control module 10 can be set as a master and a slave. When the master control module fails, the slave control module is promoted to the master control module to play a role, thereby improving the reliability of the whole machine.

[0067] The control module 10 may be arranged on a main control board of the forwarding device, and the forwarding module 20 may be arranged on an interface board of the forwarding device.

[0068] Taking IGP as an example, the control module 10 includes an IGP module, which is responsible for IGP link state protocol message interaction, LSDB maintenance, route calculation, RIB maintenance, etc. The forwarding module 20 includes a FIB module for performing FIB maintenance, message forwarding, etc. For a multi-board forwarding device, the FIB module is usually located in the forwarding line card of the forwarding module 20.

[0069] exist Figure 1 When a link failure between AB in the network shown causes the path to be unavailable, nodes A and / or B will send link status update information to other nodes. Each node recalculates the path based on the link status update information, updates the RIB and FIB, and finally achieves network convergence.

[0070] In the above scenario, the time required for network convergence includes: link fault detection time, time to generate link state update information, time to transmit link state update information, route calculation time, and time to refresh FIB based on RIB.

[0071] In the related art, methods such as accelerating route calculation and accelerating the transmission of link state update information are often used to accelerate convergence, but the network convergence time is still relatively long. To this end, an embodiment of the present application provides a solution to accelerate network convergence by saving the time for a control module to refresh the FIB in a forwarding module based on the RIB.

[0072] In the solution provided in the embodiment of the present application, the control module 10 is used to obtain link status update information, the link status update information is used to indicate the status of the first link from the forwarding device to the destination node; output the link status update information to the forwarding module; the forwarding module 20 is used to update the network topology between the forwarding device and the destination node based on the link status update information; and update the forwarding table entry corresponding to the destination node based on the updated network topology.

[0073] In the embodiment of the present application, the control module outputs link state update information indicating the state of the first link from the forwarding device to the destination node to the forwarding module, and the forwarding module updates the network topology between the forwarding device and the destination node according to the link state update information, and then performs self-update of the forwarding table items based on the updated network topology; compared with the control module refreshing the FIB in the forwarding module based on the RIB, the amount of data transmitted is smaller, the time consumption is less, and the network convergence is accelerated. In particular, when there are many address prefixes of nodes in the network, resulting in many forwarding table items that need to be updated, the convergence speed can be greatly accelerated.

[0074] For example, the time required to transmit link state update information only between the control module and the forwarding module is usually less than 5 milliseconds, while the method in the related art is used to implement the refresh of FIB between the control module and the forwarding module. If the forwarding table items to be refreshed are large in scale, the required time may even reach 1 second. Therefore, the solution provided by the embodiment of the present application can save the time for the control module to refresh the FIB in the forwarding module based on the RIB, thereby greatly shortening the time required for convergence and accelerating network convergence.

[0075] In the forwarding device, there can be one or more forwarding modules 20. When there are multiple forwarding modules 20, the control module 10 outputs link state update information to each forwarding module, and each forwarding module 20 also updates the forwarding table entry corresponding to the destination node based on the link state update information.

[0076] Optionally, the forwarding module 20 further includes a path calculation module, such as a general shortest path tree (SPT) module, which can be set in a forwarding line card of the forwarding module 20 or in other locations. The path calculation module is responsible for path calculation and updating of forwarding table entries.

[0077] In an implementation of the present application, the link state update information includes an identifier of the first link and a state identifier of the first link.

[0078] For example, the identifier of the first link may be an identifier assigned to the link by the network, or the identifier of the first link may be a combination of the identifiers of the nodes at both ends of the link, such as AB. Different states of the first link have different corresponding state identifiers of the first link; for example, when the state of the first link is faulty, the state identifier of the first link is 0, and when the state of the first link is normal, the state identifier of the first link is 1. The state of the first link indicated in the link state update information is different from the state of the first link before, thereby achieving the purpose of updating the state of the first link.

[0079] For example, the state of the first link before this is normal, and the state of the first link indicated in the link state update information is faulty, indicating that the first link has changed from normal to faulty. For example, the state of the first link before this is faulty, and the state of the first link indicated in the link state update information is normal, indicating that the first link has recovered from the fault to normal. For another example, the state of the first link was not recorded before this, and the state of the first link indicated in the link state update information is normal, indicating that the first link is online. Here, before this refers to before the link state update information is obtained.

[0080] In other implementations, the link status update information may also adopt other structures, for example, including the identifier of the first link and an action identifier, the action identifier indicating deleting the first link (corresponding to a faulty state) or adding / restoring the first link (corresponding to a normal state), etc.

[0081] In a possible implementation of the present application, the link status update information is used to indicate a first link failure from a forwarding device to a destination node.

[0082] In this implementation, the forwarding module 20 is used to perform path calculation based on the updated network topology and determine the second link as the forwarding path; based on the second link, the forwarding entry corresponding to the destination node is updated, and the updated forwarding entry corresponding to the destination node includes the next hop information corresponding to the second link.

[0083] In the above implementation, the first link is a link on a path from the forwarding device as a source node to the destination node before the forwarding device obtains the link state update information, and the first link may be all or part of the path. Due to the failure of the first link, the forwarding module selects the second link from the network topology between the forwarding device and the destination node as a new forwarding path.

[0084] In other implementations, the first link is not a link on a path from the forwarding device as the source node to the destination node before the forwarding device obtains the link status update information. In this case, if the first link fails, the forwarding module 20 may not need to perform path calculation and forwarding table entry update.

[0085] For example, the path calculation module in the forwarding module 20 stores Figure 1 The network topology shown takes node A as the source node and node F as the destination node as an example. For node A, after obtaining the link status update information of the link failure between AB, the AB and BA links in the network topology between node A and node F are deleted to obtain the updated network topology. In some examples, in order to save the storage space of the path calculation module, the above network topology can be a simple network topology, that is, the nodes and links in the network topology are represented by simple identifiers. Compared with the network topology represented by the protocol language in the control module 10, this method greatly saves storage space.

[0086] The path calculation module in the forwarding module 20 may use the SPT algorithm to calculate the shortest path to the destination node and update the forwarding table entry.

[0087] In another possible implementation of the present application, the link status update information is used to indicate that the first link from the forwarding device to the destination node is normal.

[0088] In this implementation, the forwarding module 20 is used to perform path calculation based on the updated network topology and determine the first link as the forwarding path; based on the first link, the forwarding entry corresponding to the destination node is updated, and the updated forwarding entry corresponding to the destination node includes the next hop information corresponding to the first link.

[0089] In the above implementation, the first link is not a link on the path from the forwarding device as the source node to the destination node before the forwarding device obtains the link status update information. Since the first link is online or restored to normal, more optional paths from the forwarding device to the destination node are available, so the forwarding module can select the first link as a new forwarding path from the network topology between the forwarding device and the destination node.

[0090] In other implementations, the forwarding module 20 performs path calculation based on the updated network topology, and the forwarding path determined may remain unchanged, in which case there is no need to update the forwarding table entry.

[0091] In a possible implementation of the present application, the forwarding table entry includes a destination address prefix and an index of next hop information corresponding to the destination address prefix;

[0092] Correspondingly, the forwarding module 20 is used to update the index of the next hop information corresponding to the destination address prefix of the destination node to the index of the next hop information corresponding to the second link.

[0093] The next hop information includes an outbound interface and / or a next hop address.

[0094] In this implementation, the control module 10 allocates indexes based on local links. The local links correspond to the next hop information, so it can be said that the indexes are allocated based on the next hop information. The local link refers to the link starting from the current node. For example, Figure 1 For node A in the example, the local links include A->B and A->C, and the two local links correspond to two different next hop information. When the path from the local node to the destination node changes, the index associated with the path from the local node to the destination node needs to be updated, and the destination address prefix of the destination node is associated with the new index.

[0095] In a possible implementation of the present application, the forwarding table entry includes a node index and next hop information corresponding to the node index, and the node index corresponds to at least one destination address prefix of the node;

[0096] Correspondingly, the forwarding module 20 is used to update the next hop information corresponding to the node index of the destination node to the next hop information corresponding to the second link.

[0097] In this implementation, the control module 10 allocates indexes based on nodes. When the path from the local node to the first node changes, the index associated with the path from the local node to the first node needs to remain unchanged, and the next hop information corresponding to the index can be updated.

[0098] In the implementation of the present application, the forwarding table entry corresponding to the destination node is an entry in the FIB in the forwarding module, and therefore, the update of the forwarding table entry is to refresh the entry in the FIB in the forwarding module.

[0099] In the implementation method based on the local link allocation index, the forwarding module updates the forwarding table entries in units of the destination address prefix; while in the implementation method based on the node allocation index, the forwarding module updates the forwarding table entries in units of nodes. The node scale in the network is usually much smaller than the number of destination address prefixes. Therefore, the implementation method based on the node allocation index can reduce the scale of table flushing when the forwarding module updates the forwarding table entries, and can reduce the cost required to update the forwarding table entries.

[0100] Optionally, the control module 10 is further used to update the network topology between the forwarding device and the destination node based on the link state update information after outputting the link state update information; update the RIB based on the updated network topology; and refresh the FIB in the forwarding module based on the updated RIB.

[0101] In this implementation, under the premise of achieving accelerated network convergence, the FIB of the forwarding module 20 is refreshed through repeated calculations by the control module 10, thereby further ensuring the accuracy of the forwarding table entries used by the forwarding module 20.

[0102] In some examples, the control module 10 updates the RIB in the following manner: performing path calculation based on the updated network topology; and updating the RIB based on the path calculation result. The path calculation method can be the same as the path calculation of the forwarding module, and the process of updating the RIB is similar to the process of updating the forwarding table entry of the forwarding module, which is not further limited in the embodiments of the present application.

[0103] Optionally, the control module 10 is further configured to synchronize the network topology between the forwarding device and the destination node to the forwarding module 20 before outputting the link state update information. The forwarding module 20 stores the network topology between the forwarding device and the destination node.

[0104] In this implementation, the control module synchronizes the network topology to the forwarding module to achieve consistency of the network topology in the control module and the forwarding module at the beginning, and then the consistency of the network topology in the control module and the forwarding module is achieved through link state update information. The mirroring function of the network topology in the control module and the forwarding module is achieved through the above process.

[0105] Figure 3 This is a flowchart of a forwarding table updating method provided in an embodiment of the present application. Figure 3 The method shown includes the following steps S301 to S304. Figure 3 The method shown can be performed by a forwarding device, which can be Figure 1Any node from A to F in the scenario shown.

[0106] S301. The forwarding device obtains link status update information through a control module.

[0107] The link status update information is used to indicate the status of the first link from the forwarding device to the destination node, such as the first link failure, the first link normal, etc.

[0108] S302: The forwarding device outputs link status update information to the forwarding module of the forwarding device through the control module.

[0109] S303: The forwarding module of the forwarding device updates the network topology between the forwarding device and the destination node based on the link state update information.

[0110] S304: The forwarding module of the forwarding device updates the forwarding table entry corresponding to the destination node based on the updated network topology.

[0111] When the link status is updated, the network topology changes. The forwarding module uses a path algorithm to calculate a new path based on the changed network topology, and updates the forwarding table entry corresponding to the destination node based on the new path.

[0112] In the embodiment of the present application, the control module outputs link state update information indicating the state of the first link from the forwarding device to the destination node to the forwarding module, and the forwarding module updates the network topology between the forwarding device and the destination node according to the link state update information, and then performs self-update of the forwarding table items based on the updated network topology; compared with the control module refreshing the FIB in the forwarding module based on the RIB, the amount of data transmitted is smaller, the time consumption is less, and the network convergence is accelerated. In particular, when there are many address prefixes of nodes in the network, resulting in many forwarding table items that need to be updated, the convergence speed can be greatly accelerated.

[0113] Figure 4 This is a flowchart of a forwarding table updating method provided in an embodiment of the present application. Figure 4 The method shown can be executed by a control module and a forwarding module in a forwarding device, and the forwarding device can be Figure 1 Any node from A to F in the scenario shown.

[0114] S400: The control module in the forwarding device synchronizes the network topology between the forwarding device and the destination node with the forwarding module.

[0115] When the network is initialized, the forwarding devices in the network interact with each other through link state protocol messages. The control module in the forwarding device generates LSDB, allocates indexes, performs route calculations, and maintains RIB based on the link state protocol messages of each other node in the network. Then, the control module synchronizes the network topology between the forwarding device and the destination node to the forwarding module so that the forwarding module can subsequently complete the self-update of the forwarding table items. Among them, the network topology synchronization between the forwarding device and the destination node can be achieved by transmitting network topology information. The network topology information may include a network topology description, an index mapping relationship, next hop information, etc. Among them, the network topology description may include local links of each node. Optionally, the control module also refreshes the FIB in the forwarding module based on the RIB.

[0116] Table 1 below is a network topology description table provided in an embodiment of the present application, including each node in the network and the local link of each node. The network topology of Table 1 is Figure 1 Take the network shown as an example.

[0117] Table 1

[0118]

[0119] Optionally, the network topology description may also include the cost of each local link, for example, the cost of A->B in the above table is 10, and the cost of A->C is 20. The cost of the link may be used when the forwarding module or the control module calculates the path to determine the shortest path.

[0120] In the embodiment of the present application, the control module allocates the index including two implementation methods:

[0121] In the first index allocation method, the control module 10 allocates indexes based on local links. The local links correspond to the next hop information, so it can be said that the indexes are allocated based on the next hop information. The local link refers to the link starting from the current node. For example, Figure 1 For node A in the example, the local links include A->B and A->C, and the two local links correspond to two different next hop information. Table 2 below is an example of the index mapping relationship under this implementation.

[0122] Table 2

[0123]

[0124] In this index allocation mode, the forwarding table entry includes the destination address prefix and the index of the next hop information corresponding to the destination address prefix. Table 3 below is an example of the forwarding table entry corresponding to the destination node in this implementation mode. The three destination address prefixes in Table 3 are all address prefixes of node F.

[0125] Table 3

[0126] Destination address prefix index 1.1.1.1 / 32 10001 1.1.1.2 / 32 10001 1.1.1.3 / 32 10001

[0127] Figure 5 This is a network diagram before a link failure in this implementation mode. Figure 5 For example, the local node is node A and the destination node is node F. The address prefixes of node F include 1.1.1.1 / 32, 1.1.1.2 / 32, and 1.1.1.3 / 32.

[0128] like Figure 5 As shown in the figure, before the link failure occurs, the path from node A to node F is ABDF, so the next hop to node F is node B, and the corresponding next hop information is the outgoing interface: Ethernet3 / 0 / 0, and the next hop address: 10.1.1.1. The address prefixes of node F, such as 1.1.1.1 / 32, 1.1.1.2 / 32, and 1.1.1.3 / 32, are associated with the next hop information with an index of 10001.

[0129] In the second index allocation method, the control module 10 allocates indexes based on nodes. Table 4 below is an example of index mapping relationship in this implementation method.

[0130] Table 4

[0131] node index A NA B 10011 C 10012 D 10013 E 10014 F 10015

[0132] In this index allocation mode, the forwarding table entry corresponding to the destination node includes the node index and the next hop information corresponding to the node index, and the node index corresponds to at least one destination address prefix of the node. Table 5 below is an example of the forwarding table entry corresponding to the destination node in this implementation mode.

[0133] Table 5

[0134]

[0135] Figure 6 This is a network diagram before a link failure in this implementation mode. Figure 6 For example, the local node is node A and the destination node is node F. The address prefixes of node F include 1.1.1.1 / 32, 1.1.1.2 / 32, and 1.1.1.3 / 32.

[0136] Compared to Figure 5 In terms of Figure 6 The two next hop information NHP1 and NHP2 in are not assigned indexes, but the nodes are assigned indexes.

[0137] like Figure 6As shown in the figure, before the link failure occurs, the path from node A to node F is ABDF, so the next hop to node F is node B, and the corresponding next hop information is the outbound interface: Ethernet3 / 0 / 0, and the next hop address: 10.1.1.1. The address prefixes 1.1.1.1 / 32, 1.1.1.2 / 32, 1.1.1.3 / 32 of node F are associated with index 10015, and the corresponding outbound interface is Ethernet3 / 0 / 0, and the next hop address is 10.1.1.1.

[0138] S401: A control module in a forwarding device obtains link status update information.

[0139] The link status update information is used to indicate the status of the first link from the forwarding device to the destination node.

[0140] In one implementation, if the local link fails, the forwarding device can obtain link status update information based on its own perception. For example, the control module of the forwarding device senses the local interface Down, the local neighbor Down, etc. through the IGP control protocol, thereby determining that the local link fails.

[0141] Optionally, the forwarding device is further configured to send link state update information to other nodes.

[0142] In another implementation, if the remote link fails, the forwarding device receives a link state protocol message and obtains link state update information through the message. For example, the control module of the forwarding device senses the remote node failure through an IGP link state protocol message.

[0143] For example, when the link between AB fails, the link update information acquired by node A is that the link between AB is down (failure).

[0144] S402: The control module outputs link status update information to the forwarding module.

[0145] Exemplarily, the link status update information can be transmitted through inter-component messages. The link status update information includes an identifier of the first link and a status identifier of the first link. For example, the identifier of the first link can be an identifier assigned to the link by the network, or the identifier of the first link can be a combination of identifiers of nodes at both ends of the link, such as AB. Different states of the first link have different corresponding status identifiers of the first link; for example, when the state of the first link is faulty, the state identifier of the first link is 0, and when the state of the first link is normal, the state identifier of the first link is 1. The state of the first link indicated in the link status update information is different from the state of the first link before, thereby achieving the purpose of updating the state of the first link.

[0146] As mentioned above, when the link between AB fails, the control module in node A outputs link status update information indicating that the link between AB is down to the forwarding module, instructing the forwarding module to delete LINK1 and LINK2. LINK1 refers to the A->B link, and LINK2 refers to the B->A link.

[0147] In addition to indicating a link failure, the link status update information may also indicate that the first link from the forwarding device to the destination node is normal, for example, the first link is online or restored to normal.

[0148] S403: The forwarding module updates the network topology between the forwarding device and the destination node based on the link status update information.

[0149] Table 6 below is a network topology description table provided in an embodiment of the present application, including each node in the network and a local link of each node. Table 6 is the result of updating Table 1 when a link between AB fails.

[0150] Table 6

[0151]

[0152] Referring to Table 6, compared with Table 1, Table 6 deletes the link A->B and the link B->A, that is, the updated network topology no longer includes the link A->B and the link B->A. Accordingly, the local link of node A only has A->C, and the next hop from node A to other nodes in the network is node C.

[0153] In the implementation of the present application, in order to save the storage space of the path calculation module, the above-mentioned network topology can be a simple network topology, that is, the nodes and links in the network topology are represented by simple identifiers. Compared with the network topology represented by the protocol language in the control module, this method greatly saves storage space.

[0154] In the implementation of the present application, both the control module and the forwarding module will update the network topology based on the link state update information, and the network topology structures maintained in the control module and the forwarding module are consistent.

[0155] S404: The forwarding module performs path calculation based on the updated network topology and determines the second link as the forwarding path.

[0156] In a possible implementation, the forwarding module uses the SPT algorithm to calculate the shortest path to the destination node and updates the forwarding table entry.

[0157] Taking the path calculation from node A to node F as an example, before the link between AB fails, the calculated path is ABDF. After the link between AB fails, the calculated path is ACEF.

[0158] In other possible implementations, the forwarding module may also use other path algorithms to calculate the shortest path to the destination node and update the forwarding table entries whose paths have changed, which is not limited in this application.

[0159] S405: The forwarding module updates the forwarding entry corresponding to the destination node based on the second link, and the updated forwarding entry corresponding to the destination node includes next hop information corresponding to the second link.

[0160] In the first index allocation method, the forwarding module updates the index of the next hop information corresponding to the destination address prefix of the destination node to the index of the next hop information corresponding to the second link.

[0161] Table 7 below is an example of a forwarding table entry corresponding to the destination node under this implementation mode. Table 7 is the result after updating Table 3 when the link between AB fails.

[0162] Table 7

[0163] Destination address prefix index 1.1.1.1 / 32 10002 1.1.1.2 / 32 10002 1.1.1.3 / 32 10002

[0164] Figure 7 This is a network diagram after a link failure in this implementation mode. Figure 7 For example, the local node is node A and the destination node is node F. The address prefixes of node F include 1.1.1.1 / 32, 1.1.1.2 / 32, and 1.1.1.3 / 32.

[0165] like Figure 7 As shown in the figure, after the link failure occurs, the path from node A to node F is ACEF, so the next hop to node F is node C, and the corresponding next hop information is the outgoing interface: Ethernet3 / 0 / 1, and the next hop address: 10.1.2.1. The address prefixes of node F, 1.1.1.1 / 32, 1.1.1.2 / 32, 1.1.1.3 / 32, etc., are associated with the next hop information with index 10002.

[0166] In the second index allocation method, the forwarding module updates the next hop information corresponding to the node index of the destination node to the next hop information corresponding to the second link.

[0167] Table 8 below is an example of a forwarding table entry corresponding to the destination node under this implementation mode. Table 8 is the result after updating Table 5 when the link between AB fails.

[0168] Table 8

[0169]

[0170] Figure 8This is a network diagram before a link failure in this implementation mode. Figure 8 For example, the local node is node A and the destination node is node F. The address prefixes of node F include 1.1.1.1 / 32, 1.1.1.2 / 32, and 1.1.1.3 / 32.

[0171] like Figure 8 As shown in the figure, after the link failure occurs, the path from node A to node F is ACEF, so the next hop to node F is node C, and the corresponding next hop information is the outbound interface: Ethernet3 / 0 / 1, and the next hop address: 10.1.2.1. The address prefixes 1.1.1.1 / 32, 1.1.1.2 / 32, 1.1.1.3 / 32 of node F are associated with the index 10015, and the corresponding outbound interface is Ethernet3 / 0 / 1, and the next hop address is 10.1.2.1.

[0172] S406: After outputting the link status update information, the control module updates the network topology between the forwarding device and the destination node based on the link status update information.

[0173] Here, the control module may update the network topology in the same manner as the forwarding module updates the network topology, that is, in accordance with step S403.

[0174] S407: Update the RIB based on the updated network topology.

[0175] In the embodiment of the present application, the control module updates the RIB in the following manner: perform path calculation based on the updated network topology; and update the RIB based on the path calculation result. The path calculation method can be the same as the path calculation of the forwarding module, that is, it is performed in the manner of step S404. The process of updating the RIB is similar to the process of updating the forwarding table entry by the forwarding module, and the embodiment of the present application does not make further restrictions.

[0176] S408. Refresh the FIB in the forwarding module based on the updated RIB.

[0177] Exemplarily, in this step, refreshing the FIB in the forwarding module may refresh the entire FIB or refresh part of the FIB. For example, when only part of the RIB is updated, only the table entries corresponding to the updated part of the RIB are refreshed.

[0178] Since the update of the forwarding table entries in the related technology is implemented by the control module, it can be considered that the accuracy of the updated forwarding table entries of the control module is sufficiently guaranteed. In this case, the network convergence speed is improved by executing steps S400 to S405, and then the accuracy of the forwarding table update is guaranteed by executing steps S406 to S408, thereby ensuring message forwarding.

[0179] Fig. 9 1 is a schematic diagram of a forwarding device 1000 provided in an embodiment of the present application. The forwarding device 1000 may be the aforementioned forwarding device, and the forwarding device 1000 includes at least one processor 1001 , a memory 1002 , and at least one network interface 1003 .

[0180] Optionally, combined Figure 1 From the network deployment scenario shown in the figure, Fig. 9 The forwarding device 1000 shown is Figure 1 Any node in .

[0181] Optionally, combined Figure 3 According to the method flow shown, Fig. 9 The forwarding device 1000 shown is used to perform Figure 3 In the method shown, the network interface 1003 is used to support the forwarding device to execute S301, and the processor 1001 is used to support the forwarding device to execute S302-S304.

[0182] The processor 1001 is, for example, a general-purpose central processing unit (CPU), a network processor (NP), a graphics processing unit (GPU), a neural-network processing unit (NPU), a data processing unit (DPU), a microprocessor, or one or more integrated circuits for implementing the solution of the present application. For example, the processor 1001 includes an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The PLD is, for example, a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL), or any combination thereof.

[0183] The memory 1002 is, for example, a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices that can store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical disc, laser disc, optical disc, digital versatile disc, Blu-ray disc, etc.), a magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto. Optionally, the memory 1002 exists independently and is connected to the processor 1001 through the internal connection 1004. Alternatively, the memory 1002 and the processor 1001 are optionally integrated together.

[0184] The network interface 1003 uses any transceiver-like device for communicating with other devices or communication networks. The network interface 1003 includes, for example, at least one of a wired network interface or a wireless network interface. The wired network interface is, for example, an Ethernet interface. The Ethernet interface is, for example, an optical interface, an electrical interface, or a combination thereof. The wireless network interface is, for example, a cellular network interface, or a combination thereof.

[0185] In some embodiments, the processor 1001 includes one or more CPUs, such as Fig. 9 CPU0 and CPU1 are shown in the figure.

[0186] In some embodiments, the forwarding device 1000 may optionally include multiple processors, such as Fig. 9 1001 and 1005 are shown in FIG. Each of these processors is, for example, a single-CPU, or a multi-CPU. The processor herein optionally refers to one or more devices, circuits, and / or processing cores for processing data (such as computer program instructions).

[0187] In some embodiments, the forwarding device 1000 further includes an internal connection 1004. The processor 1001, the memory 1002, and the at least one network interface 1003 are connected via the internal connection 1004. The internal connection 1004 includes a path to transmit information between the above components. Optionally, the internal connection 1004 is a single board or a bus. Optionally, the internal connection 1004 is divided into an address bus, a data bus, a control bus, etc.

[0188] In some embodiments, the forwarding device 1000 further includes an input / output interface 1006 . The input / output interface 1006 is connected to the internal connection 1004 .

[0189] In some embodiments, the input-output interface 1006 is used to connect to an input device to receive commands or data involved in the above-mentioned method embodiments input by a user through the input device, such as setting commands, setting expected results of commands, setting regular expressions corresponding to commands, address information corresponding to the forensic server, setting strings, etc.

[0190] Optionally, the processor 1001 implements the method in the above embodiment by reading the program code 1010 stored in the memory 1002, or the processor 1001 implements the method in the above embodiment by the program code stored internally. In the case where the processor 1001 implements the method in the above embodiment by reading the program code 1010 stored in the memory 1002, the memory 1002 stores the program code for implementing the method provided in the embodiment of the present application.

[0191] For more details on how the processor 1001 implements the above functions, please refer to the descriptions in the previous method embodiments, which will not be repeated here.

[0192] Fig.10 A schematic diagram of the hardware structure of another forwarding device 1200 provided in an embodiment of the present application. Fig.10 The forwarding device 1200 shown can execute the corresponding steps executed by the forwarding device in the method of the above embodiment.

[0193] like Fig.10 The forwarding device 1200 includes: a main control board 1210, an interface board 1230, a switching network board 1220 and an interface board 1240. The main control board 1210, the interface boards 1230 and 1240, and the switching network board 1220 are connected to the system backplane through a system bus to achieve intercommunication. Among them, the main control board 1210 is used to complete functions such as system management, equipment maintenance, and protocol processing. The switching network board 1220 is used to complete data exchange between various interface boards (interface boards are also called line cards or service boards). The interface boards 1230 and 1240 are used to provide various service interfaces (for example, POS interfaces, GE interfaces, ATM interfaces, etc.) and realize the forwarding of data packets.

[0194] The interface board 1230 may include a central processor 1231, a forwarding table entry memory 1234, a physical interface card 1233, and a network processor 1232. The central processor 1231 is used to control and manage the interface board and communicate with the central processor on the main control board. The forwarding table entry memory 1234 is used to store forwarding table entries. The physical interface card 1233 is used to complete the reception and transmission of traffic. The network memory 1232 is used to control the physical interface card 1233 to receive and send traffic according to the forwarding table entries.

[0195] Specifically, the main control board 1210 is used to obtain link state update information and output the link state update information to the interface board 1230. The interface board 1230 is used to update the network topology between the forwarding device and the destination node based on the link state update information and update the forwarding table entry corresponding to the destination node based on the updated network topology.

[0196] It should be understood that the operation on the interface board 1240 in the embodiment of the present invention is consistent with the operation of the interface board 1230, and for the sake of brevity, it will not be repeated. It should be understood that the forwarding device 1200 of this embodiment can correspond to the functions and / or various steps implemented in the above method embodiment, and it will not be repeated here.

[0197] In addition, there may be one or more main control boards, and when there are multiple boards, they may include a main main control board and a standby main control board. There may be one or more interface boards. The stronger the data processing capability of the forwarding device, the more interface boards are provided. There may also be one or more physical interface cards on the interface board. There may be no switching network board, or there may be one or more switching network boards. When there are multiple switching network boards, they can jointly realize load sharing and redundant backup. In a centralized forwarding architecture, the forwarding device may not need a switching network board, and the interface board is responsible for processing the service data of the entire system. In a distributed forwarding architecture, the forwarding device may have at least one switching network board, and the switching network board is used to realize data exchange between multiple interface boards, providing large-capacity data exchange and processing capabilities. Therefore, the data access and processing capabilities of the forwarding device with a distributed architecture are greater than those of the device with a centralized architecture. Which architecture to adopt depends on the specific networking deployment scenario, and no limitation is made here.

[0198] In some embodiments, a computer program product is also provided, which includes one or more computer program instructions. When the computer program instructions are loaded and executed by a computer, the computer executes the method provided by the above method embodiment.

[0199] In some embodiments, a chip is also provided, including a memory and a processor, wherein the memory is used to store computer instructions, and the processor is used to call and run the computer instructions from the memory to execute the method provided by the above method embodiment.

[0200] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can refer to each other, and each embodiment focuses on the differences from other embodiments. A refers to B, which means that A is the same as B or A is a simple deformation of B. The terms "first" and "second" in the description and claims of the embodiments of the present application are used to distinguish different objects, rather than to describe the specific order of objects, and cannot be understood as indicating or implying relative importance. For example, the first node and the second node are used to distinguish different nodes, rather than to describe the specific order of nodes, and cannot be understood as the first node is more important than the second node. In the embodiments of the present application, unless otherwise specified, the meaning of "at least one" refers to one or more, and the meaning of "multiple" refers to two or more.

[0201] The above embodiments can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in accordance with the embodiment of the present application is generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integrated. The available medium may be a magnetic medium, (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state hard disk SolidState Disk (SSD)), etc.

[0202] The above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present application.

Claims

1. A forwarding device, characterized in that: The forwarding device includes a control module and a forwarding module; The control module is used to obtain link status update information, where the link status update information is used to indicate the status of a first link from the forwarding device to a destination node; Outputting the link status update information to the forwarding module; The forwarding module is used to update the network topology between the forwarding device and the destination node based on the link state update information; and update the forwarding table entry corresponding to the destination node based on the updated network topology.

2. The forwarding device according to claim 1, characterized in that: The link status update information is used to indicate a first link failure from the forwarding device to the destination node, and the forwarding module is used to: Performing path calculation based on the updated network topology to determine the second link as a forwarding path; The forwarding entry corresponding to the destination node is updated based on the second link, and the updated forwarding entry corresponding to the destination node includes next hop information corresponding to the second link.

3. The forwarding device according to claim 2, characterized in that: The forwarding table entry includes a destination address prefix and an index of next hop information corresponding to the destination address prefix, and the forwarding module is used to: The index of the next hop information corresponding to the destination address prefix of the destination node is updated to the index of the next hop information corresponding to the second link.

4. The forwarding device according to claim 2, characterized in that: The forwarding table entry includes a node index and next hop information corresponding to the node index, the node index corresponds to at least one destination address prefix of a node, and the forwarding module is used to: The next hop information corresponding to the node index of the destination node is updated to be the next hop information corresponding to the second link.

5. The forwarding device according to any one of claims 1 to 4, characterized in that: The link status update information includes an identifier of the first link and a status identifier of the first link.

6. The forwarding device according to any one of claims 1 to 5, characterized in that: The forwarding table entry corresponding to the destination node is an entry in the forwarding information base FIB in the forwarding module.

7. The forwarding device according to claim 6, characterized in that: The control module is also used for: After outputting the link state update information, updating the network topology between the forwarding device and the destination node based on the link state update information; Update the routing information base RIB based on the updated network topology; The FIB in the forwarding module is refreshed based on the updated RIB.

8. The forwarding device according to any one of claims 1 to 7, characterized in that: The control module is also used for: Before outputting the link status update information, the network topology between the forwarding device and the destination node is synchronized to the forwarding module.

9. The forwarding device according to any one of claims 1 to 8, characterized in that: The control module is arranged on the main control board of the forwarding device, and the forwarding module is arranged on the interface board of the forwarding device.

10. A method for updating a forwarding table entry, characterized in that: The method comprises: The forwarding device obtains link state update information through the control module, where the link state update information is used to indicate the state of a first link from the forwarding device to a destination node; The forwarding device outputs the link state update information to the forwarding module of the forwarding device through the control module; The forwarding module of the forwarding device updates the network topology between the forwarding device and the destination node based on the link state update information; The forwarding module of the forwarding device updates the forwarding table entry corresponding to the destination node based on the updated network topology.

11. The method according to claim 10, characterized in that The link status update information is used to indicate a first link failure from the forwarding device to the destination node, and the forwarding module of the forwarding device updates the forwarding table entry corresponding to the destination node based on the updated network topology, including: The forwarding module of the forwarding device performs path calculation based on the updated network topology, and determines the second link as the forwarding path; The forwarding module of the forwarding device updates the forwarding entry corresponding to the destination node based on the second link, and the updated forwarding entry corresponding to the destination node includes next hop information corresponding to the second link.

12. The method according to claim 11, characterized in that The forwarding table entry includes a destination address prefix and an index of next hop information corresponding to the destination address prefix, and the forwarding module of the forwarding device updates the forwarding table entry corresponding to the destination node based on the second link, including: The forwarding module of the forwarding device updates the index of the next hop information corresponding to the destination address prefix of the destination node to the index of the next hop information corresponding to the second link.

13. The method according to claim 11, characterized in that The forwarding table entry includes a node index and next hop information corresponding to the node index, the node index corresponds to at least one destination address prefix of a node, and the forwarding module of the forwarding device updates the forwarding table entry corresponding to the destination node based on the second link, including: The forwarding module of the forwarding device updates the next hop information corresponding to the node index of the destination node to the next hop information corresponding to the second link.

14. The method according to any one of claims 10 to 13, characterized in that The link status update information includes an identifier of the first link and a status identifier of the first link.

15. The method according to any one of claims 10 to 14, characterized in that The forwarding table entry corresponding to the destination node is an entry in the forwarding information base FIB in the forwarding module.

16. The method according to claim 15, characterized in that The method further comprises: The control module of the forwarding device updates the network topology between the forwarding device and the destination node based on the link state update information; The control module of the forwarding device updates the routing information base RIB based on the updated network topology; The control module of the forwarding device refreshes the FIB in the forwarding module based on the updated RIB.

17. The method according to any one of claims 10 to 16, characterized in that The method further comprises: The control module of the forwarding device synchronizes the network topology between the forwarding device and the destination node to the forwarding module.

Images