Router forwarding information table updating method and device, storage medium and electronic equipment

Abstract

The present disclosure provides a router forwarding information table updating method and device, a storage medium and an electronic device, and relates to the technical field of communication. The router forwarding information table updating method first acquires link state updating information sent by each router in a domain, determines an updating event type of current link updating according to an updating parameter, determines an updating ranking value of each router according to the updating parameter if the updating event type is a preset event type, determines an updating delay time corresponding to each router based on the updating ranking value and an updating time in the updating parameter, and finally updates the forwarding information table of each router according to the updating delay time corresponding to each router. The technical problem that the updating order of the current router forwarding information table updating method in the ring network topology is disordered in the prior art is solved, and the order, stability and reliability of updating are improved.

Description

Technical Field

[0001] The present disclosure relates to the field of communication technology, and in particular to a method, device, storage medium, and electronic device for updating a router forwarding information table. Background Art

[0002] The topology of the OSPF protocol in the router link interface is updated periodically or on demand. Each topology update causes a convergence phase in its forwarding information base (FIB). Therefore, the forwarding information base of each router also needs to be updated accordingly.

[0003] During the update process, due to convergence, the forwarding information bases of various routers may be temporarily inconsistent. Once the forwarding information bases are inconsistent, it is easy to cause loops or packet loss in the link.

[0004] Therefore, the update order of the current method for updating the router forwarding information table in the ring network topology is disordered. Summary of the Invention

[0005] The present disclosure provides a method, device, storage medium and electronic device for updating a router forwarding information table, thereby improving the update reliability of the router forwarding information table.

[0006] In a first aspect, an embodiment of the present disclosure provides a method for updating a router forwarding information table, comprising:

[0007] Obtain link state update information sent by each router in the domain; wherein the link state information at least includes: an update node identifier and an update parameter;

[0008] Determine the update event type of the current link update according to the update parameters;

[0009] If the update event type is a preset event type, the update ranking value of each router is determined according to the update parameter;

[0010] Determine the update delay time corresponding to each router based on the update ranking value and the update time in the update parameter;

[0011] The forwarding information table of each router is updated according to the update delay time corresponding to each router.

[0012] In an optional embodiment of the present disclosure, if the update event type is a preset event type, determining the update ranking value of each router according to the update parameter includes:

[0013] If the preset event type is a fault type event, then,

[0014] determining a first hop number between the current node router and a node router of the first link update according to the current received update node identifier and a start update node identifier of the received link state update information of the first link update;

[0015] determining the update ranking value corresponding to the current node router according to the first hop number and a preset correction factor.

[0016] In an optional embodiment of the present disclosure, if the update event type is a preset event type, the update ranking value of each router is determined according to the update parameter, comprising:

[0017] if the preset event type is a recovery type event, then,

[0018] determining a second hop number between the current node router and a node router of the last link update according to the current received update node identifier and a terminal update node identifier of the received link state update information of the last link update;

[0019] determining the update ranking value corresponding to the current node router according to the second hop number and a preset correction factor.

[0020] In an optional embodiment of the present disclosure, the update delay time corresponding to each router is determined based on the update ranking value and an update time in the update parameter, comprising:

[0021] determining the update time according to an update initial time and a waiting convergence completion time of each router;

[0022] determining the update delay time corresponding to each router based on the update time and the update ranking value.

[0023] In an optional embodiment of the present disclosure, the update delay time corresponding to each router is determined based on the update time and the update ranking value, comprising:

[0024] determining a target update ranking value corresponding to each router according to the update ranking value corresponding to each router and a corresponding weight coefficient;

[0025] determining the update delay time corresponding to each router according to the target update ranking value and the update time.

[0026] In an optional embodiment of the present disclosure, before determining the update event type of the current link update according to the update parameter, the method further comprises:

[0027] establishing a link event list of each router in the domain according to the link state update information;

[0028] determining whether the current link update type determined according to the link event list is equal cost multi-path routing.

[0029] In an optional embodiment of the present disclosure, the method further includes:

[0030] If the current link update type is equal-cost multi-path routing, the update event type of the current link update is determined according to the update parameters.

[0031] In a second aspect, an embodiment of the present disclosure provides a device for updating a router forwarding information table, the device comprising:

[0032] An acquisition module is used to acquire link state update information sent by each router in the domain; wherein the link state information at least includes: an update node identifier and an update parameter;

[0033] A first determining module, configured to determine an update event type of a current link update according to an update parameter;

[0034] a second determining module, configured to determine an update ranking value of each router according to an update parameter if the update event type is a preset event type;

[0035] A third determining module is used to determine the update delay time corresponding to each router based on the update ranking value and the update time in the update parameter;

[0036] The updating module is used to update the forwarding information table of each router according to the update delay time corresponding to each router.

[0037] In a third aspect, an embodiment of the present disclosure provides a computer-readable storage medium having a computer program stored thereon, which implements the above method when executed by a processor.

[0038] In a fourth aspect, an embodiment of the present disclosure provides an electronic device, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the above method by executing the executable instructions.

[0039] The technical solution disclosed in this disclosure has the following beneficial effects:

[0040] The method for updating a new router forwarding table provided by the embodiment of the present disclosure first obtains link state update information sent by each router in the domain, then determines the update event type of the current link update based on the update parameters, and when the update event type is a preset event type, determines the update ranking value of each router based on the update parameters and the update time in the update parameters to determine the update delay time corresponding to each router, and finally updates the forwarding information table of each router based on the update delay time corresponding to each router, so that each router can update its own forwarding information table according to its own corresponding update delay time, thereby solving the technical problem of the current method for updating the router forwarding information table in the traditional technology that the update order is disordered in the ring network topology, thereby improving the orderliness, stability and reliability of the update.

[0041] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] The accompanying drawings are incorporated into and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the specification, serve to explain the principles of the present disclosure. Obviously, the drawings described below are only some embodiments of the present disclosure, and it is possible for a person skilled in the art to derive other drawings based on these drawings without inventive effort.

[0043] Figure 1 A schematic diagram illustrating an application scenario of a method for updating a router forwarding information table in this exemplary embodiment is shown;

[0044] Figure 2 A flowchart of a method for updating a router forwarding information table in this exemplary embodiment is shown;

[0045] Figure 3 A flowchart of a method for updating a router forwarding information table in this exemplary embodiment is shown;

[0046] Figure 4 A flowchart of a method for updating a router forwarding information table in this exemplary embodiment is shown;

[0047] Figure 5 A flowchart of a method for updating a router forwarding information table in this exemplary embodiment is shown;

[0048] Figure 6 A flowchart of a method for updating a router forwarding information table in this exemplary embodiment is shown;

[0049] Figure 7 A flowchart of a method for updating a router forwarding information table in this exemplary embodiment is shown;

[0050] Figure 8 A schematic diagram of the structure of a method and apparatus for updating a router forwarding information table in this exemplary embodiment is shown;

[0051] Figure 9 A schematic structural diagram of an electronic device in this exemplary embodiment is shown. DETAILED DESCRIPTION

[0052] The exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; on the contrary, these embodiments are provided so that the present disclosure will be more comprehensive and complete and the concepts of the exemplary embodiments will be fully conveyed to those skilled in the art. The described features, structures, or characteristics may be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present disclosure. However, those skilled in the art will appreciate that the technical solutions of the present disclosure may be practiced while omitting one or more of the specific details, or that other methods, components, devices, steps, etc. may be employed. In other cases, well-known technical solutions are not shown or described in detail to avoid obscuring various aspects of the present disclosure.

[0053] In addition, the accompanying drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. Identical reference numerals in the figures denote identical or similar parts, and thus repetitive descriptions thereof will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities that do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different networks and / or processor devices and / or microcontroller devices.

[0054] The flowcharts shown in the accompanying drawings are merely illustrative and do not necessarily include all steps. For example, some steps may be decomposed, while some steps may be combined or partially combined, so the actual execution order may change according to actual circumstances.

[0055] In related technologies, the OSPF protocol topology in router link interfaces is updated periodically or on demand. Each topology update triggers a convergence phase in the forwarding information base (FIB), requiring each router's FIB to be updated accordingly. During this update process, due to convergence, inconsistencies in the FIBs of various routers may occur temporarily. Once these inconsistencies occur, they can easily lead to loops or packet loss within the link. Consequently, current methods for updating router FIBs in ring network topologies produce a disordered update sequence.

[0056] In view of the above problems, the embodiments of the present disclosure provide a method for updating a new router forwarding table. The method first obtains link state update information sent by each router in the domain, then determines the update event type of the current link update based on the update parameters, and when the update event type is a preset event type, determines the update ranking value of each router based on the update parameters and the update time in the update parameters to determine the update delay time corresponding to each router. Finally, the forwarding information table of each router is updated based on the update delay time corresponding to each router, so that each router can update its own forwarding information table according to its own corresponding update delay time, thereby solving the technical problem in the traditional technology that the update order of the current router forwarding information table update method is disordered in a ring network topology, thereby improving the orderliness, stability and reliability of the update.

[0057] The following briefly introduces the application environment of the method for updating the router forwarding information table provided by the embodiment of the present disclosure:

[0058] See Figure 1 The method for updating the router forwarding information table provided by the embodiment of the present disclosure is applied to an intra-domain communication system 10, which includes at least multiple routers 110 and a control terminal 120. The multiple routers 110 are all in the same communication domain, and each router 110 has multiple neighbor routers through an interface protocol. The object that needs to be updated in each router 110 in the embodiment of the present disclosure is the forwarding information table when the router 110 forwards information. The forwarding information table includes the OSPF status protocol corresponding to each router or each router interface, such as forwarding the information in the interface 1 of the router to the interface 2 of the router 3, etc., which will not be enumerated here. The control terminal 120 is used to control the information transmission between the routers 110, such as the update of the forwarding information table.

[0059] The following uses the control terminal 120 as the execution subject, and applies the method for updating the new router forwarding table to the control terminal 120, and takes the updating of the forwarding information table of each router 110 as an example for explanation. Figure 2The method for updating the router forwarding information table provided by the embodiment of the present disclosure includes the following steps 201 to 205:

[0060] Step 201: The control terminal obtains link status update information sent by each router in the domain.

[0061] This link state information includes at least an update node identifier and update parameters. The update node identifier refers to the device identifier of a router in a link node, used to distinguish between routers. The update parameters are status information used by each router to represent the current update state when updating a link. This link state information is typically carried in an update link state notification message, for example. Upon receiving the update link state notification message, the control terminal parses the data to obtain the corresponding update state information for each router. It should be noted that the scope of this field can be set based on actual circumstances and is not specifically limited in this embodiment.

[0062] Step 202: The control terminal determines the update event type of the current link update according to the update parameters.

[0063] The update event type can be categorized as either a cost-increasing event or a cost-reducing event based on the currently updated link information. Cost-increasing events include, for example, link failure events, while cost-reducing events include, for example, link recovery events. Accordingly, the update parameters include at least the link update information and the cost size.

[0064] Step 203: If the update event type is a preset event type, the control terminal determines the update ranking value of each router according to the update parameter.

[0065] Among them, the preset event type can be specifically set according to the actual situation, for example, it can be an overhead increase event, an overhead reduction event, or equal cost multi-path routing (ECMP), or non-equal cost multi-path routing, etc. The update ranking value is used to characterize the importance of the current event type in the link. For example, for a fault type event, the terminal farther away from the current node router is updated later, and the corresponding update ranking value is larger, and the closer the distance is, the smaller the corresponding update ranking value is. For example, if the update type is link recovery, the terminal closer to the current node router is updated earlier, and the corresponding update ranking value is larger, and the farther the distance is, the smaller the corresponding update ranking value is.

[0066] Step 204: The control terminal determines the update delay time corresponding to each router based on the update ranking value and the update time in the update parameter.

[0067] The update time refers to the moment an update instruction is received, or the moment the control terminal receives the first link state update information for a link update, and is not specifically limited in this embodiment. The update delay time refers to the time from when a router receives the update instruction to when it updates its forwarding information table. After obtaining the update ranking value according to the above steps, the control terminal combines this update time to calculate the update delay time corresponding to each router.

[0068] Step 205: The control terminal updates the forwarding information table of each router according to the update delay time corresponding to each router.

[0069] The control terminal can provide a timed reminder based on a module or component such as an update timer. When the update delay time is satisfied, the control terminal can send a generated update instruction to the corresponding router to instruct the corresponding router to update its forwarding information table. Of course, the update timer can be configured in the control terminal or in each router, and this embodiment does not specifically limit this.

[0070] The method for updating a new router forwarding table provided by the embodiment of the present disclosure first obtains link state update information sent by each router in the domain, then determines the update event type of the current link update based on the update parameters, and when the update event type is a preset event type, determines the update ranking value of each router based on the update parameters and the update time in the update parameters to determine the update delay time corresponding to each router, and finally updates the forwarding information table of each router based on the update delay time corresponding to each router, so that each router can update its own forwarding information table according to its own corresponding update delay time, thereby solving the technical problem of the current method for updating the router forwarding information table in the traditional technology that the update order is disordered in the ring network topology, thereby improving the orderliness, stability and reliability of the update.

[0071] See Figure 3 In an optional embodiment of the present disclosure, if the update event type in step 203 is a preset event type, the control terminal determines the update ranking value of each router according to the update parameter, including the following steps 301-302:

[0072] Step 301: If the preset event type is a fault type event, the control terminal determines the first hop number between the current node router and the node router of the first link update based on the currently received update node identifier and the starting update node identifier of the link state update information of the first link update received.

[0073] The overhead of a fault type event increases due to the need to handle new faults, and is therefore an event with increased overhead. Therefore, the control terminal starts from the node router corresponding to the link state update information of the first link update received, and calculates the first hop number between the starting node router and the current faulty node router on the communication link based on the node identifier corresponding to each node router, where one hop is between two routers in the link.

[0074] Step 302: The control terminal determines an updated ranking value corresponding to the current node router according to the first hop count and a preset correction factor.

[0075] The preset correction factor refers to the hop count reference factor, which can be configured according to actual conditions and is not specifically limited in this embodiment. The updated ranking value can be calculated according to the following formula (1):

[0076] Updated ranking value = first hop count × preset correction factor × (-1) (1)

[0077] In the embodiment of the present disclosure, when the preset event type is a fault type event, the first hop count between the current node router and the node router of the first link update is determined based on the currently received update node identifier and the starting update node identifier of the link state update information of the first link update received. Then, the update ranking value corresponding to the current node router is determined based on the first hop count and a preset correction factor. The update ranking value can be determined in a targeted manner for the fault type event, so that the update ranking value of the terminal farther away from the current node router is larger, and the terminal is updated first. Only after the update of the terminal is completed, the forwarding information table of other non-faulty routers can be successfully updated, which can improve the stability and reliability of the entire update process.

[0078] See Figure 4 In an optional embodiment of the present disclosure, if the update event type in step 203 is a preset event type, the control terminal determines the update ranking value of each router according to the update parameter, including the following steps 401-402:

[0079] Step 401: If the preset event type is a recovery type event, the control terminal determines the second hop number between the current node router and the node router of the last link update based on the currently received update node identifier and the end update node identifier of the link state update information of the last link update received.

[0080] Recovery type events are caused by fault recovery, so their corresponding overhead gradually decreases, and they belong to overhead reduction type events. Therefore, the control terminal determines the second hop number between the current node router and the node router of the last link update based on the currently received update node identifier and the termination update node identifier of the link state update information of the last link update received.

[0081] Step 402: The control terminal determines an updated ranking value corresponding to the current node router according to the second hop count and a preset correction factor.

[0082] The preset correction factor refers to the hop count reference factor, which can be configured according to actual conditions and is not specifically limited in this embodiment. The updated ranking value can be calculated according to the following formula (2):

[0083] Updated ranking value = second hop count × preset correction factor × (-1) (2)

[0084] In the embodiment of the present disclosure, when the preset event type is a recovery type event, the second hop count between the current node router and the node router of the last link update is determined based on the currently received update node identifier and the termination update node identifier of the link state update information of the last link update received. Then, the update ranking value corresponding to the current node router is determined based on the second hop count and a preset correction factor. For failure recovery type events, the update ranking value can be determined in a targeted manner, so that the update ranking value of the terminal closer to the current node router is larger, and the recovery update processing is performed on it first. Only after the update of the terminal is completed, the forwarding information table of other non-recovery type routers can be successfully updated, which can improve the stability and reliability of the entire update process.

[0085] See Figure 5 In an optional embodiment of the present disclosure, the control terminal determines the update delay time corresponding to each router based on the update ranking value and the update time in the update parameter in step 204, including the following steps 501-502:

[0086] Step 501: The control terminal determines the update time according to the initial update time and the waiting time for convergence completion of each router.

[0087] The update time refers to the initial time when each router configured by the control terminal updates the forwarding information table. The update time can be determined based on the initial update time and the time each router waits for convergence to complete. For example, starting at 5:15, the waiting convergence time of the first router is 2 hours, then the corresponding update time is 7:15, and so on, to calculate the update time of each router.

[0088] Step 502: The control terminal determines the update delay time corresponding to each router based on the update time and the update ranking value.

[0089] The update delay time refers to the required interval after the update time. The update ranking value is used to represent the update order of the current update node in the entire link, and the update time is the target time when the update is required. After obtaining the update time and the update ranking value, the control terminal can query the duration corresponding to the update ranking value based on the pre-configured update ranking value and duration correspondence table, and then calculate the time interval or total duration between the duration and the update time to obtain the corresponding update delay time.

[0090] The disclosed embodiment determines the update time based on the initial update moment and the waiting time for convergence completion of each router, then determines the update delay time corresponding to each router based on the update time and the update ranking value, and finally delays the update of each router based on the update delay time. This can ensure that the time when each router updates its own forwarding information table does not conflict, thereby ensuring the stable progress of the update and further improving the timing, stability and reliability of the forwarding information table update.

[0091] See Figure 6 In an optional embodiment of the present disclosure, the control terminal determines the update delay time corresponding to each router based on the update time and the update ranking value in step 502, including the following steps 601-602:

[0092] Step 601: The control terminal determines a target update ranking value corresponding to each router according to the update ranking and weight coefficient corresponding to each router.

[0093] The weight coefficient refers to the adjustment factor for each router and can be set based on the importance of each router within the entire domain or other reference criteria. This embodiment does not impose any specific limitations. It should be noted that different routers have different weights associated with their update rankings. The update ranking of all routers in the domain can be based on a certain indeterminate ratio, or the sum of all weight coefficients can be equal to 1.

[0094] Step 602: The control terminal determines the update delay time corresponding to each router according to the target update ranking value and the update time.

[0095] As shown in step 502 above, after the control terminal obtains the update time and the target update ranking value, it can query the duration corresponding to the update ranking value based on the pre-configured correspondence table of update ranking values ​​and durations, and then calculate the time interval or total duration between the duration and the update time, thereby obtaining the corresponding update delay time.

[0096] The embodiments of the present disclosure determine the target update ranking value of each router according to the update ranking corresponding to each router and the corresponding weight coefficient, and then determine the update delay time of each router according to the target update ranking value and the update time. By introducing the weight coefficient, the update ranking value corresponding to different routers can be adjusted according to the actual situation, so that the obtained update delay time is more consistent with the actual situation, and the reliability of the update of the forwarding information table of each router is further improved.

[0097] Please refer to Figure 7 In an optional embodiment of the present disclosure, before the step 202 of controlling the terminal to determine the update event type of the current link update according to the update parameter, the method further includes steps 701-703 as follows:

[0098] Step 701, the control terminal establishes a link event list of each router in the domain according to the link state update information.

[0099] The link event list is used to represent the current update state of the routers of each link in the domain. The link event list can be determined according to the update nodes of all node routers in the link state update information as above, or can be determined according to the update parameters of the near-end node router and the update parameters of the far-end node router. This can avoid the increase of calculation amount caused by the introduction of too many parameters, and further improve the update efficiency.

[0100] Step 702, the control terminal determines whether the current link update type determined according to the link event list is equal cost multi-path routing.

[0101] The equal cost multi-path routing refers to ECMP (Equal Cost Multi-path, ECMP) link, and there are multiple different links to reach the same destination address. The link state at different times is different, so the control terminal can determine whether the current multi-link change is ECMP link or non-ECMP link according to whether the cost between two links is equivalent within the update delay time determined as above.

[0102] Step 703, if the current link update type is equal cost multi-path routing, the control terminal determines the update event type of the current link update according to the update parameter.

[0103] If the current link update type is equal-cost multipath routing, that is, an ECMP link, this means that the two links have changed, or the update costs between the two links are equivalent. The control terminal urgently needs to determine the update event type of the current link update so that it can further update using the router forwarding information list update method provided by the embodiment of the present disclosure. Conversely, if the current link update type is non-equal-cost multipath routing, that is, a non-ECMP link, this means that the update costs of the two link changes are not equivalent. In this case, the update can be performed manually or based on other conventional convergence methods.

[0104] In an optional embodiment of the present disclosure, the control terminal may also determine, based on current link parameters, such as interface protocols, whether the current node router is a directly affected node or an indirect affected node of the respective router. If it is a directly affected node, the current update link is determined to be a local link. The current update identifier is then directly compared with the identifiers of neighboring routers, and the router corresponding to the largest or smallest identifier is used as the main body for determining the update delay time. Correspondingly, if the current update link is a non-local link, the current update node is an indirect affected node. The received link status update information is then compared with the currently updated link node, and the router with the largest or smallest identifier is used to calculate the update delay time.

[0105] See Figure 8 In order to implement the above service processing method, an embodiment of the present disclosure provides a router forwarding information table updating device 800. Figure 8 A schematic architecture diagram of a router forwarding information table updating device 800 is shown. The router forwarding information table updating device 800 includes: an acquisition module 810, a first determination module 820, a second determination module 830, a third determination module 840, and an update module 850, wherein:

[0106] The acquisition module 810 is configured to acquire link state update information sent by each router in the domain; wherein the link state information includes at least: an update node identifier and update parameters;

[0107] A first determining module 820 is configured to determine an update event type of a current link update according to update parameters;

[0108] A second determining module 830 is configured to determine an update ranking value of each router according to the update parameter if the update event type is a preset event type;

[0109] A third determining module 840 is configured to determine an update delay time corresponding to each router based on the update ranking value and the update time in the update parameter;

[0110] The updating module 850 is configured to update the forwarding information table of each router according to the updating delay time corresponding to each router.

[0111] In an optional embodiment of the present disclosure, the second determining module 830 is specifically configured to, if the preset event type is a fault type event, determine a first hop number between the current node router and the node router of the first link update according to the currently received updating node identifier and the starting updating node identifier of the received link state update information of the first link update; and determine the updating ranking value corresponding to the current node router according to the first hop number and the preset correction factor.

[0112] In an optional embodiment of the present disclosure, the second determining module 830 is specifically configured to, if the preset event type is a recovery type event, determine a second hop number between the current node router and the node router of the last link update according to the currently received updating node identifier and the ending updating node identifier of the received link state update information of the last link update; and determine the updating ranking value corresponding to the current node router according to the second hop number and the preset correction factor.

[0113] In an optional embodiment of the present disclosure, the third determining module 840 is specifically configured to determine the updating time according to the updating initial time and the waiting convergence completion time of each router; and determine the updating delay time corresponding to each router based on the updating time and the updating ranking value.

[0114] In an optional embodiment of the present disclosure, the third determining module 840 is specifically configured to determine the target updating ranking value corresponding to each router according to the updating ranking corresponding to each router and the corresponding weight coefficient; and determine the updating delay time corresponding to each router according to the target updating ranking value and the updating time.

[0115] In an optional embodiment of the present disclosure, the first determining module 820 is further configured to establish a link event list of the routers in the domain according to the link state update information; and determine whether the current link update type is equal cost multi-path routing according to the link event list.

[0116] In an optional embodiment of the present disclosure, the first determining module 820 is further configured to, if the current link update type is equal cost multi-path routing, determine the updating event type of the current link update according to the updating parameter.

[0117] The exemplary embodiments of the present disclosure also provide a computer-readable storage medium that can be implemented in the form of a program product, which includes program code. When the program product is run on an electronic device, the program code is used to cause the electronic device to perform the steps described in the "Exemplary Method" section above of this specification according to the various exemplary embodiments of the present disclosure. In one embodiment, the program product can be implemented as a portable compact disc read-only memory (CD-ROM) and includes program code, and can be run on an electronic device, such as a personal computer. However, the program product of the present disclosure is not limited to this, and in this document, a readable storage medium can be any tangible medium that contains or stores a program that can be used by or in combination with an instruction execution system, apparatus, or device.

[0118] The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or component, or any combination thereof. More specific examples (a non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof.

[0119] A computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, which carries readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable signal medium may also be any readable medium other than a readable storage medium that can transmit, propagate, or transfer a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0120] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0121] The program code for performing the operations of the present disclosure can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and also conventional procedural programming languages ​​such as "C" language or similar programming languages. The program code can be executed entirely on the user computing device, partially on the user device, as an independent software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device can be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (e.g., using an Internet service provider to connect through the Internet). In the embodiment of the present disclosure, the program code stored in the computer-readable storage medium can implement any step in the above router forwarding information table update method when it is executed.

[0122] See Figure 9 The exemplary embodiment of the present disclosure further provides an electronic device 900, which may be a background server of an information platform. Figure 9 The electronic device 900 will be described. It should be understood that Figure 9 The electronic device 900 shown is merely an example and should not limit the functionality and scope of use of the embodiments of the present disclosure.

[0123] like Figure 9 As shown, electronic device 900 is implemented as a general-purpose computing device. Components of electronic device 900 may include, but are not limited to, at least one processing unit 910, at least one storage unit 920, and a bus 930 connecting various system components (including storage unit 920 and processing unit 910).

[0124] The storage unit stores program codes, which can be executed by the processing unit 910, so that the processing unit 910 performs the steps according to various exemplary embodiments of the present invention described in the "Exemplary Method" section above. For example, the processing unit 910 can perform the following steps: Figure 2 The method steps shown, etc.

[0125] The storage unit 920 may include a volatile storage unit, such as a random access memory unit (RAM) 921 and / or a cache memory unit 922 , and may further include a read-only memory unit (ROM) 923 .

[0126] The storage unit 920 can also include a program / utility 924 having a set (at least one) of program modules 925, including but not limited to an operating system, one or more application programs, other program modules, and program data, each of which or a combination of which can include implementation of a network environment, as in each of these examples or a combination thereof.

[0127] The bus 930 can include a data bus, an address bus, and a control bus.

[0128] The electronic device 900 can also communicate with one or more external devices 2000 such as a keyboard or pointing device, through Input / Output (I / O) interfaces 940. The electronic device 900 can further communicate with one or more networks, such as a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet, through a network adapter 950. As depicted, the network adapter 950 communicates with the other modules of the electronic device 900 through the bus 930. It should be appreciated that although not shown in the figure, other hardware and / or software modules could be used in conjunction with the electronic device 900. These include, but are not limited to, microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data archival storage systems, etc.

[0129] In embodiments of the present disclosure, the program code stored in the electronic device can be executed to implement any of the steps in the above method for updating a router forwarding information table.

[0130] It should be noted that although several modules or units of a device for action execution are mentioned in the above detailed description, such a division is not mandatory. Indeed, according to exemplary embodiments of the present disclosure, features and functions of two or more modules or units described above can be embodied in one module or unit. Conversely, features and functions of one module or unit described above can be further divided into embodied by multiple modules or units.

[0131] Those skilled in the art can understand that various aspects of the present disclosure can be implemented as a system, a method or a program product. Therefore, various aspects of the present disclosure can be embodied in a form of an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.), or an embodiment combining hardware and software aspects in a manner that can all be generally referred to herein as a "circuit", "module" or "system". Other embodiments of the present disclosure will be readily apparent to those skilled in the art, and the general principles defined herein can be applied to other embodiments without departing from the scope of the present disclosure. The present disclosure is intended to encompass all such variations, uses or adaptations of the present disclosure and is intended to be protected by the claims hereafter. The specification and examples are to be considered exemplary only, with the true scope and spirit of the present disclosure being indicated by the following claims.

[0132] It is to be understood that the present disclosure is not limited to the precise construction here described and illustrated and that various modifications and changes can be made by those skilled in the art without departing from the scope of the present disclosure. The scope of the present disclosure is limited only by the claims appended hereto.

Claims

1. A method for updating a router forwarding information table, characterized in that: include: Obtaining link state update information sent by each router in the domain; wherein the link state update information includes: an update node identifier and an update parameter; Determine the update event type of the current link update according to the update parameter; If the update event type is a preset event type, determining an update ranking value of each router according to the update parameter; Determine the update delay time corresponding to each of the routers based on the update ranking value and the update time in the update parameter; updating the forwarding information table of each router according to the update delay time corresponding to each router; If the update event type is a preset event type, determining the update ranking value of each router according to the update parameter includes: If the preset event type is a fault type event, then, Determine the first hop number between the current node router and the node router of the first link update according to the currently received update node identifier and the start update node identifier of the link state update information of the first link update received; Determine an updated ranking value corresponding to the current node router according to the first hop count and a preset correction factor; If the preset event type is a recovery type event, then, Determine the second hop number between the current node router and the node router of the last link update according to the currently received update node identifier and the end update node identifier of the link state update information of the last link update received; The updated ranking value corresponding to the current node router is determined according to the second hop count and the preset correction factor.

2. The method for updating the router forwarding information table according to claim 1, wherein: The determining the update delay time corresponding to each of the routers based on the update ranking value and the update time in the update parameter includes: Determining the update time according to the initial update time and the waiting time for convergence completion of each router; The update delay time corresponding to each of the routers is determined based on the update time and the update ranking value.

3. The method for updating the router forwarding information table according to claim 2, wherein: The determining the update delay time corresponding to each router based on the update time and the update ranking value includes: Determine the target update ranking value corresponding to each router according to the update ranking corresponding to each router and the corresponding weight coefficient; The update delay time corresponding to each of the routers is determined according to the target update ranking value and the update time.

4. The method for updating the router forwarding information table according to claim 1, wherein: Before determining the update event type of the current link update according to the update parameter, the method further includes: Establishing a link event list for each router in the domain according to the link state update information; Whether the current link update type is equal-cost multi-path routing is determined according to the link event list.

5. The method for updating the router forwarding information table according to claim 4, wherein: The method further comprises: If the current link update type is equal-cost multi-path routing, the update event type of the current link update is determined according to the update parameter.

6. A router forwarding information table updating device, characterized in that: The device comprises: An acquisition module is used to acquire link state update information sent by each router in the domain; wherein the link state update information includes: an update node identifier and an update parameter; A first determining module, configured to determine an update event type of a current link update according to the update parameters; a second determining module, configured to determine an update ranking value of each router according to the update parameter if the update event type is a preset event type; A third determining module is configured to determine an update delay time corresponding to each of the routers based on the update ranking value and the update time in the update parameter; An updating module, configured to update the forwarding information table of each router according to the update delay time corresponding to each router; The second determining module is configured to: If the preset event type is a fault type event, then, Determine the first hop number between the current node router and the node router of the first link update according to the currently received update node identifier and the start update node identifier of the link state update information of the first link update received; Determine an updated ranking value corresponding to the current node router according to the first hop count and a preset correction factor; If the preset event type is a recovery type event, then, Determine the second hop number between the current node router and the node router of the last link update according to the currently received update node identifier and the end update node identifier of the link state update information of the last link update received; The updated ranking value corresponding to the current node router is determined according to the second hop count and the preset correction factor.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 5 is implemented.

8. An electronic device, characterized in that: include: processor; as well as a memory for storing executable instructions of the processor; The processor is configured to perform the method according to any one of claims 1 to 5 by executing the executable instructions.

Images