Method for accelerating border gateway protocol convergence and related device

Abstract

The application provides a method for accelerating convergence of a border gateway protocol and related equipment, the method comprising reading time stamp root cause information and a path time stamp chain table in an update message and updating a local time stamp record graph when the update message is received; revoking outdated paths according to the local time stamp record graph, and then performing optimal path selection to obtain a new optimal path; judging changes of the optimal path through a sending end of a local router; when the optimal path changes, judging whether a routing change event generates a new reachable path; and when no reachable path is generated and no time stamp root cause information is received, taking an autonomous system number and a current time stamp as new time stamp root cause information. The method for accelerating convergence of the border gateway protocol and the related equipment are simple and convenient, and can shorten convergence time of the BGP after link failure, path revocation and partial policy change.

Description

Technical Field

[0001] This application relates to the field of computer network and Internet routing protocol technology, and in particular to a method and related equipment for accelerating the convergence of border gateway protocols. Background Technology

[0002] BGP (Border Gateway Protocol) is the de facto standard protocol for inter-domain routing on the Internet, but its convergence performance under fault scenarios has long been a concern. Extensive research and practical observations show that inter-domain routing undergoes a significant path exploration process during cancellation and handover scenarios, with convergence times potentially reaching the order of minutes. During this stage, issues such as packet loss, forwarding loops, path jitter, and service quality degradation are prone to occur.

[0003] Existing approaches to BGP convergence optimization can be broadly categorized as follows: First, accelerating the propagation of effective information by modifying announcement timers, updating priorities, or changing processing order; second, reducing the continued spread of outdated paths in the network by limiting path exploration; third, mitigating oscillation risk by improving policy configuration and reducing policy conflicts; fourth, enabling rapid switching after failures through multi-path or backup path mechanisms; and fifth, utilizing stronger centralized control capabilities to uniformly manage inter-domain routing behavior. Each of these approaches has its own emphasis, but in practical deployments, they often face limitations such as implementation complexity, compatibility, incremental deployment capabilities, and impact on existing routing semantics.

[0004] For schemes that determine the relationship between old and new paths based on additional state information, if the autonomous system is directly abstracted as a single ideal node, a key engineering problem arises in real networks: an autonomous system often has multiple boundary routers. If multiple routers can independently write state information, the consistency maintenance problem within the autonomous system must be solved; otherwise, contradictory state expressions may arise between different exit points. On the other hand, if state freshness relies entirely on monotonically increasing integers, problems such as rapid numerical growth, looping, and difficulty in maintaining state continuity after device restarts can easily occur in scenarios with frequent fluctuations.

[0005] Therefore, a fast BGP convergence method is needed that can express root cause changes at the autonomous system level while also taking into account real deployment constraints. This method should be able to propagate critical timing information with low additional overhead without relying on centralized control of the entire network, help each node eliminate outdated candidate paths as early as possible, and support phased deployment. Summary of the Invention

[0006] In view of this, the purpose of this application is to propose a method and related equipment for accelerating the convergence of border gateway protocols to solve the above-mentioned technical problems.

[0007] A first aspect of this application provides a method for accelerating the convergence of a Border Gateway Protocol (BGP), comprising: detecting external state changes through the receiving end of a local router; when a routing change event is detected, determining whether an update message has been received; when the update message is received, reading the timestamp root cause information and the path timestamp linked list in the update message, and updating the local timestamp record graph; canceling outdated paths according to the local timestamp record graph, and then performing optimal path selection to obtain a new optimal path; determining changes in the optimal path through the sending end of the local router; when the optimal path changes, determining whether the local router has enabled node write functionality; when the node write functionality is enabled, determining whether the routing change event generates a new reachable path; when the reachable path is generated, writing the autonomous system number and the current timestamp of the local router into the path timestamp linked list; when the reachable path is not generated, determining whether timestamp root cause information associated with the routing change event has been received; when the timestamp root cause information is not received, using the autonomous system number and the current timestamp as new timestamp root cause information.

[0008] Furthermore, the method for accelerating the convergence of the border gateway protocol also includes: when no update message is received, the optimal path change is determined by the sending end.

[0009] Furthermore, the step of revoking outdated paths according to the local timestamp record graph includes: traversing candidate paths, searching for autonomous systems and corresponding timestamps in the path timestamp linked list; when the corresponding timestamp of a candidate path is less than the maximum timestamp of the autonomous system in the local timestamp record graph, the candidate path is revoked as an outdated path.

[0010] Furthermore, the method for accelerating the convergence of the border gateway protocol also includes: terminating the process when the optimal path has not changed.

[0011] Furthermore, the method for accelerating the convergence of the border gateway protocol also includes: when the node write function is not enabled, the existing attributes are transparently forwarded and no new timestamp information is generated.

[0012] Furthermore, the method for accelerating the convergence of the border gateway protocol further includes: when the timestamp root cause information is received, transmitting the timestamp root cause information downstream.

[0013] Furthermore, the method for accelerating border gateway protocol convergence is applied to multiple autonomous systems, each autonomous system including multiple routers, and in each autonomous system, at most one router enables the node write function.

[0014] A second aspect of this application provides an electronic device including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, implements the method for accelerating border gateway protocol convergence as described in the first aspect above.

[0015] A third aspect of this application provides a non-transitory computer-readable storage medium storing computer instructions for causing the computer to perform the method for accelerating border gateway protocol convergence as described in the first aspect above.

[0016] A fourth aspect of this application provides a computer program product including computer program instructions that, when executed on a computer, cause the computer to perform the method for accelerating border gateway protocol convergence as described in the first aspect above.

[0017] As can be seen from the above, this application provides a method and related equipment for accelerating the convergence of a border gateway protocol. The method includes detecting external state changes through the receiving end of a local router; when a routing change event is detected, determining whether an update message has been received; when an update message is received, reading the timestamp root cause information and path timestamp linked list from the update message, and updating the local timestamp record graph; canceling outdated paths according to the local timestamp record graph, and then performing optimal path selection to obtain a new optimal path; determining changes in the optimal path through the sending end of the local router; when the optimal path changes, determining whether the local router has enabled node write functionality; when node write functionality is enabled, determining whether the routing change event generates a new reachable path; when a reachable path is generated, writing the local router's Autonomous System Number and current timestamp into the path timestamp linked list; when no reachable path is generated, determining whether timestamp root cause information associated with the routing change event has been received; when timestamp root cause information is not received, using the Autonomous System Number and current timestamp as new timestamp root cause information. This method introduces timestamp root cause information and a path timestamp linked list into the update message, using timestamps to represent path freshness. The sending end is responsible for writing time information when a path is generated or revoked, while the receiving end identifies outdated paths that are behind the latest state based on its local timestamp record graph and revoks them before rerouting. This reduces the probability of outdated paths being used and propagated, improving the efficiency of rerouting after a failure. This method and related equipment for accelerating border gateway protocol convergence are simple and convenient. After link failures, route revocations, and some policy changes, it can shorten the convergence time of BGP, reduce the number of invalid intermediate candidate paths, and reduce the propagation range of outdated paths in the control plane. Attached Figure Description

[0018] To more clearly illustrate the technical solutions in this application or related technologies, the drawings used in the description of the embodiments or related technologies will be briefly introduced below. Obviously, the drawings described below are only embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0019] Figure 1 This is a flowchart illustrating a method for accelerating the convergence of a border gateway protocol according to an embodiment of this application.

[0020] Figure 2 This is a schematic diagram illustrating the logical relationship of a method for accelerating the convergence of a border gateway protocol in an embodiment of this application.

[0021] Figure 3 This is a schematic diagram of the structure of an electronic device according to an embodiment of this application. Detailed Implementation

[0022] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with specific embodiments and the accompanying drawings.

[0023] It should be noted that, unless otherwise defined, the technical or scientific terms used in the embodiments of this application should have the ordinary meaning understood by one of ordinary skill in the art to which this application pertains. Terms such as "comprising" or "including" mean that the element or object preceding the word encompasses the elements or objects listed following the word and their equivalents, without excluding other elements or objects. Terms such as "connected" or "linked" are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect.

[0024] The Internet is composed of a large number of autonomous systems, which exchange prefix reachability information through BGP. BGP uses a path vector mechanism, where each node typically only advertises the current best path to its neighbors. Therefore, when a link fails, a route is revoked, or a policy changes, the nodes in the network need to go through a series of processes, including path failure detection, candidate path reselection, update propagation, and another reselection, before the entire system can reach a stable state again.

[0025] One of the key reasons for slow convergence in the above process is path exploration. Old paths already affected by the same fault may continue to be repeatedly tried and propagated outwards as candidate paths before neighboring nodes have obtained the latest state, leading to an increase in invalid updates, control plane packet bloat, forwarding detours, and even momentary unreachability. Although mechanisms such as minimum route advertisement interval can suppress update storms to some extent, they also delay the spread of effective information. Therefore, relying solely on traditional timer adjustments is insufficient to balance convergence speed and packet overhead.

[0026] To address the aforementioned issues, this application proposes a novel fast BGP convergence method. This method introduces Primary Cause Information (PCI) and a SequenceTimestamp List (STL) into the update message, and maintains a timestamp record graph at the receiving end, pre-defined by prefix. The sending end is responsible for writing time information when a path is generated or withdrawn, while the receiving end identifies candidate paths that are outdated based on its local record graph and withdraws them before rerouting, thereby reducing the probability of outdated paths being used and propagated.

[0027] To further address real-world deployment scenarios of multi-router autonomous systems, it is stipulated that at most one router in each autonomous system is responsible for writing PCI and STL, in order to avoid the complexity caused by repeated state synchronization between multiple border routers within the autonomous system; at the same time, timestamps are used to represent path freshness, thereby enhancing availability and robustness in scenarios such as device restarts, frequent fluctuations, and abnormally large interference values.

[0028] The following describes specific embodiments in conjunction with... Figures 1 to 3 The technical solution of this application will be described in detail below.

[0029] Some embodiments of this application provide a method for accelerating border gateway protocol convergence, such as Figure 1 and Figure 2 As shown, it includes the following steps:

[0030] S1. Detect external state changes through the receiver of the local router. When a routing change event is detected, determine whether an update message has been received.

[0031] S2. When the update message is received, the timestamp root cause information and path timestamp linked list in the update message are read, and the local timestamp record graph is updated.

[0032] In this method, PCI is an optional transitive attribute, containing at least one Autonomous System Number (AS Number) and a corresponding timestamp, used to identify the root cause information triggering this update; STL is an ordered linked list composed of multiple AS-timestamp tuples, used to record the time state during path generation and propagation. When the receiver reads the attributes, the presence or absence of the attributes and their order do not affect the correctness of the protocol, making it fully support incremental deployment and allowing for a smooth transition in existing BGP networks.

[0033] Upon receiving an update message, the receiving end first reads the prefix information, PCI, and STL carried within. Then, it updates the local timestamp record graph using this prefix information as an index. If a timestamp entry for a particular autonomous system does not yet exist in the local timestamp record graph, it is written directly; if it already exists, the larger timestamp is retained as the latest known state under that prefix.

[0034] The process of updating the local timestamp record graph of the prefix information p can be further expressed as equations (1) and (2): (1) (2) Where 'a' represents the autonomous system, τ represents the STL timestamp, and τ pci This represents the PCI timestamp, and U represents the currently received update message. G represents the set of timestamps related to 'a' observed in the message. p This represents a local timestamp record graph for prefix p, where 'new' indicates new and 'old' indicates past. The receiver retains only the maximum timestamp for each autonomous system, ensuring that subsequent decisions are always based on the latest known state under that prefix.

[0035] S3. Based on the local timestamp record map, cancel outdated paths, and then select the optimal path to obtain a new optimal path.

[0036] After updating the local timestamp record graph, the receiver traverses all candidate paths for that prefix and checks each as-time stamp tuple in the STL of each path. If a candidate path contains an autonomous system 'a' and its timestamp 't', and 't' is less than the current maximum timestamp corresponding to autonomous system 'a' in the prefix record graph, then the path was generated from an older state and is outdated compared to the current known state of the network; therefore, it should be classified as an outdated path. For outdated paths, the receiver immediately removes them from the candidate set and they no longer participate in subsequent optimal path selection. After cleaning up the candidate set, the optimal path selection is re-executed.

[0037] Specifically, revoking outdated paths based on the local timestamp record graph includes: S301. Traverse the candidate paths and find the autonomous system and corresponding timestamp in the path timestamp linked list.

[0038] S302. When the timestamp of a candidate path is less than the maximum timestamp of the autonomous system in the local timestamp record graph, the candidate path is cancelled as an outdated path.

[0039] For any prefix p, let the timestamp record notation corresponding to the prefix be G. p Let P be a candidate path, and let P carry an STL containing several tuples (a, t). If there exists a tuple such that t is less than G... p If the current maximum timestamp of autonomous system a is not less than G, then path P is determined to be an outdated path; if the timestamps of all autonomous systems in path P are not less than G, then path P is determined to be an outdated path. p If the recorded value is not found, then path P remains a valid candidate path.

[0040] Based on the above definitions, the determination of the obsolescence of candidate paths, the construction of effective candidate sets, and the selection of new optimal paths can be further expressed as equations (3), (4), and (5): (3) (4) (5) in, =1 indicates that path P has been determined to be an outdated path. This represents the set of valid candidate paths after cleanup. This represents the path priority function obtained by following the local BGP routing strategy, with the optimal path being... When the valid candidate set is empty, the node performs a revocation process on the prefix; when the valid candidate set is not empty, a new optimal path is selected from the set.

[0041] The purpose of the above rules is to change the determination of "whether something is outdated" from hop-by-hop waiting based on the local perspective of neighbors to a unified comparison based on prefix-level time information. As long as a node has learned of the newer state, that node can proactively delete the path carrying the old timestamp, without having to wait for all old paths to be naturally canceled one by one, thereby reducing the path exploration depth.

[0042] S4. Determine the change of the optimal path through the sending end of the local router.

[0043] Compare the past optimal path with the latest optimal path to see if there is a difference.

[0044] S5. When the optimal path changes, determine whether the local router has enabled the node write function.

[0045] If the new optimal path changes, the update message is reorganized according to the sender's rules and continues to be advertised. Specifically, when the local router detects that the optimal path of a certain prefix has changed, needs to send a cancellation message, or is regenerated due to an upstream update, it first determines whether the current router has enabled the Node Write (RN, RootNode) function.

[0046] S6. When the node write function has been enabled, determine whether the routing change event generates a new reachable path.

[0047] Determine if the new optimal path is valid; if valid, it is a reachable path.

[0048] S7. When the reachable path is generated, the autonomous system number of the local router and the current timestamp are written into the path timestamp linked list.

[0049] If the current router has RN functionality enabled, and this event results in the generation of a new reachable path locally, then the "Local Autonomous System Number - Current Timestamp" will be written to the STL. If an entry for this Autonomous System already exists in the same path, the STL representation will be kept consistent by updating the timestamp of the entry for this Autonomous System; if it is the first occurrence, the entry will be appended to the STL.

[0050] S8. If the reachable path is not generated, determine whether timestamp root cause information associated with the route change event has been received.

[0051] S9. If the timestamp root cause information is not received, the autonomous system number and the current timestamp are used as the new timestamp root cause information.

[0052] If the current router has RN functionality enabled and detects the need to revoke a prefix, but has not previously received a PCI that explains the source of this change (e.g., a neighbor has not yet deployed this capability, or the revocation itself is triggered for the first time by this autonomous system), then the current router writes a new PCI into the revocation message. This PCI includes at least the local autonomous system number and the current timestamp, used to explain the root cause of this update to subsequent nodes.

[0053] Specifically, assuming the RN function is already enabled on the current router, the root cause attribute writing of prefix p and the STL update of path P by the sending end can be further formalized into equations (6) and (7): (6) (7) in, Indicates the autonomous system to which the current router belongs. This indicates the current timestamp written by the autonomous system in this update, where 'in' represents input and 'out' represents output. Prefix In a cancelled state Prefix indicating local storage The corresponding timestamp record graph contains a set of all autonomous system IDs. When the input update already carries a PCI, the sender retains it and propagates it downstream; when a new reachable path is generated, the sender replaces or appends the STL according to the above rules.

[0054] The BGP update message introduces the Root Cause Notification (PCI) attribute and the Path Timestamp List (STL). At the receiving end, a timestamp record graph is maintained by prefix. By comparing the timestamps of each autonomous system in the candidate path with the current maximum timestamp in the timestamp record graph, outdated paths are identified and revoked. Organizing the convergence process around root cause time information allows for the early identification and revocation of outdated paths even when nodes receive only partial updates, reducing invalid propagation caused by path exploration and thus shortening the convergence time of BGP after a failure.

[0055] In some embodiments, such as Figure 2 As shown, the method for accelerating border gateway protocol convergence further includes: S101. If the update message is not received, the optimal path change is determined by the sending end.

[0056] This method supports incremental deployment. When a real fault is detected by a neighbor that has not yet enabled this capability, as the information propagates through the network, nodes that have enabled this feature may observe the route failure but will not receive a PCI in the update message. In this case, the node closest to the fault and with this capability enabled will treat itself as the injection point for this change, adding a new local PCI to the subsequent reversal message. This allows the root cause notification capability to take effect from this node to the rest of the network, ensuring the correctness of the PCI information in the incremental deployment scenario. For STL, the information is a tuple of AS number and timestamp. Even if some routers or ASs do not have this feature enabled during propagation, the correctness of the STL can still be guaranteed for use by subsequent router nodes.

[0057] In some embodiments, such as Figure 2 As shown, the method for accelerating border gateway protocol convergence further includes: S401. If the optimal path has not changed, the process ends.

[0058] If the new optimal path remains unchanged, no additional invalid updates will be triggered.

[0059] In some embodiments, such as Figure 2 As shown, the method for accelerating border gateway protocol convergence further includes: S501. When the node write function is not enabled, existing attributes are transparently forwarded and no new timestamp information is generated.

[0060] If node write functionality is not enabled, it maintains behavior compatible with regular BGP, transparently forwards existing attributes, and does not actively generate new local timestamp information.

[0061] In some embodiments, such as Figure 2 As shown, the method for accelerating border gateway protocol convergence further includes: S801. When the timestamp root cause information is received, the timestamp root cause information is transmitted downstream.

[0062] If the path change is triggered by a PCI carried upstream, the sending end will retain or propagate the PCI when announcing the new update downstream, allowing root cause information to spread outward along the affected area. In this way, subsequent nodes can learn about the latest time state corresponding to this change earlier, even if they have not yet directly encountered the actual fault point.

[0063] In some embodiments, the method for accelerating border gateway protocol convergence is applied to multiple autonomous systems, each autonomous system including multiple routers, and in each autonomous system, at most one router enables the node write function.

[0064] By defining a unique PCI write node (RN) within each Autonomous System (AS), complex synchronization around the same state number is avoided within multiple router ASs, improving the deployability of the solution in real network environments. At most one router in each AS is configured as a PCI write node, used to write the corresponding timestamp information for the AS when generating new paths or revocation messages, thus avoiding complex synchronization of the same state among multiple routers within the AS. This method significantly reduces the complexity of state synchronization within ASs, avoids introducing complex architectures, maintains protocol correctness, and maintains good performance under reasonable network topologies.

[0065] The advantages of using timestamps instead of monotonically increasing integer status numbers to represent path freshness in this application are: firstly, when devices frequently switch paths, there is no risk of looping due to rapid incrementing of simple integers; secondly, when the router restarts, it can re-participate in state writing using the new current time, mitigating the impact of local state loss on protocol behavior.

[0066] Furthermore, the receiving end can perform a validity check on the timestamps based on equipment deployment requirements, such as only accepting timestamps within the allowed time window, to mitigate the interference of abnormal messages or abnormally large values ​​on the local decision-making logic. Through the above design, this application exhibits better fault tolerance and maintainability during engineering implementation.

[0067] In some embodiments, the validity check of the timestamp by the receiver can be formally expressed as equation (8): (8) in, This represents the local clock, and Δ represents the allowed time deviation window. When Accept(T)=0, the receiver can directly discard the timestamp or not use it to update the record graph, thereby reducing the interference of abnormal time values ​​on the determination of outdated paths and the convergence process.

[0068] This method for accelerating BGP convergence organizes the convergence process primarily around root cause time information. It can identify and revoke outdated paths early, even when nodes receive only partial updates, reducing invalid propagation caused by path exploration and thus shortening BGP convergence time after a failure. By limiting each autonomous system to only one PCI write node, the complex multi-router state synchronization problem within the autonomous system is transformed into a single-write-point deployment problem, reducing engineering complexity and making it more suitable for gradual implementation in real-world network environments. Using timestamps instead of simple integers to represent path freshness helps mitigate issues such as device restarts, value wraparound, and abnormally large value interference, improving the robustness and maintainability of the solution. Only limited root cause information and path timestamp information are added to necessary update messages, maintaining autonomous system-level semantics and avoiding the exposure of finer-grained internal physical topology to the entire network, thus balancing information expression capabilities and deployment overhead. Incremental deployment is supported, allowing coexistence with traditional BGP nodes that do not have this capability enabled.

[0069] Example 1 In a test topology consisting of multiple autonomous systems, each autonomous system selects at most one border router to enable RN. Suppose that the primary path from one autonomous system to the target prefix fails and triggers revocation. If the autonomous system has not yet received a reusable upstream PCI, its unique write node writes a PCI containing its own autonomous system number and the current timestamp into the revocation message and sends an update to its neighbors.

[0070] Upon receiving the update, the downstream node updates the timestamp record graph corresponding to the prefix and checks the STL of all local candidate paths. Any path that still carries the old timestamp of the failed autonomous system is immediately marked as an outdated path and removed from the candidate set. If the timestamps of all autonomous systems carried by an alternative path are not behind the record graph, the path is retained to participate in the optimal path selection and may become the new optimal path to continue to be advertised.

[0071] Through the above process, nodes do not need to try multiple alternative paths that are actually invalid in turn. They can quickly complete the cleaning of invalid paths and re-route after receiving the latest root cause information, thus significantly shortening the convergence link after a failure.

[0072] It is understood that before using the technical solutions of the various embodiments in this disclosure, users will be informed of the type, scope of use, and usage scenarios of the personal information involved in an appropriate manner, and user authorization will be obtained.

[0073] For example, upon receiving a user's active request, a prompt message is sent to the user to explicitly inform them that the requested operation will require the acquisition and use of the user's personal information. This allows the user to independently choose, based on the prompt message, whether to provide personal information to the software or hardware such as electronic devices, applications, servers, or storage media performing the operations of this disclosed technical solution.

[0074] As an optional but not limited implementation, in response to a user's active request, sending a prompt message to the user can be done via a pop-up window, where the prompt message can be presented in text format. Furthermore, the pop-up window can also include a selection control allowing the user to choose "agree" or "disagree" to provide personal information to the electronic device.

[0075] It is understood that the above notification and user authorization process are merely illustrative and do not constitute a limitation on the implementation of this disclosure. Other methods that comply with relevant laws and regulations may also be applied to the implementation of this disclosure.

[0076] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the method for accelerating the convergence of the border gateway protocol as described in any of the above embodiments.

[0077] Figure 3This embodiment illustrates a more specific hardware structure of an electronic device, which may include a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, memory 1020, input / output interface 1030, and communication interface 1040 are interconnected internally via the bus 1050.

[0078] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0079] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.

[0080] The input / output interface 1030 is used to connect input / output modules to realize information input and output. The input / output modules can be configured as components within the device (not shown in the figure) or externally connected to the device to provide corresponding functions. The input devices can include keyboards, mice, touchscreens, microphones, various sensors, etc., and the output devices can include displays, speakers, vibrators, indicator lights, etc.

[0081] The communication interface 1040 is used to connect a communication module (not shown in the figure) to enable communication between this device and other devices. The communication module can communicate via wired means (e.g., USB, Ethernet cable, etc.) or wireless means (e.g., mobile network, WIFI, Bluetooth, etc.).

[0082] Bus 1050 includes a pathway for transmitting information between various components of the device, such as processor 1010, memory 1020, input / output interface 1030, and communication interface 1040.

[0083] It should be noted that although the above-described device only shows the processor 1010, memory 1020, input / output interface 1030, communication interface 1040, and bus 1050, in specific implementations, the device may also include other components necessary for normal operation. Furthermore, those skilled in the art will understand that the above-described device may only include the components necessary for implementing the embodiments of this specification, and not necessarily all the components shown in the figures.

[0084] The electronic devices described above are used to implement the corresponding accelerated border gateway protocol convergence method in any of the foregoing embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0085] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides a non-transitory computer-readable storage medium storing computer instructions for causing the computer to execute the method for accelerating border gateway protocol convergence as described in any of the above embodiments.

[0086] The non-transitory computer-readable medium of this embodiment includes both permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0087] The computer instructions stored in the storage medium of the above embodiments are used to cause the computer to execute the method for accelerating the convergence of the border gateway protocol as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0088] Based on the same concept, corresponding to the methods of any of the above embodiments, this application also provides a computer program product, including computer program instructions, which, when run on a computer, cause the computer to execute the method for accelerating the convergence of the border gateway protocol as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0089] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of this application is limited to these examples; under the concept of this application, the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations of different aspects of the embodiments of this application as described above, which are not provided in detail for the sake of brevity.

[0090] Furthermore, to simplify the description and discussion, and to avoid obscuring the embodiments of this application, the apparatus may be shown in block diagram form. This is to prevent the embodiments of this application from being difficult to understand, and it also takes into account the fact that the details of the implementation of these block diagram apparatuses are highly dependent on the platform on which the embodiments of this application will be implemented (i.e., these details should be fully within the understanding of those skilled in the art). In setting forth specific details to describe exemplary embodiments of this application, it will be apparent to those skilled in the art that the embodiments of this application may be implemented without these specific details or with variations thereof. Therefore, these descriptions should be considered illustrative rather than restrictive.

[0091] Although this application has been described in conjunction with specific embodiments thereof, many substitutions, modifications and variations of these embodiments will be apparent to those skilled in the art from the foregoing description.

[0092] The embodiments of this application are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the embodiments of this application should be included within the protection scope of this application.

Claims

1. A method for accelerating the convergence of a border gateway protocol, characterized in that, include: The local router detects external state changes through its receiver. When a routing change event is detected, it determines whether an update message has been received. When the update message is received, the timestamp root cause information and path timestamp linked list in the update message are read, and the local timestamp record graph is updated. Based on the local timestamp record graph, outdated paths are revoked, and then optimal path selection is performed to obtain a new optimal path. The optimal path change is determined by the sending end of the local router; When the optimal path changes, it is determined whether the local router has enabled the node write function. When the node write function is enabled, determine whether the route change event generates a new reachable path; When the reachable path is generated, the autonomous system number of the local router and the current timestamp are written into the path timestamp linked list; If the reachable path is not generated, determine whether timestamp root cause information associated with the route change event has been received; If the timestamp root cause information is not received, the autonomous system number and the current timestamp will be used as the new timestamp root cause information.

2. The method for accelerating border gateway protocol convergence according to claim 1, characterized in that, Also includes: If the update message is not received, the optimal path change is determined by the sending end.

3. The method for accelerating border gateway protocol convergence according to claim 1, characterized in that, The step of revoking outdated paths based on the local timestamp record graph includes: Traverse the candidate paths and find the autonomous system and its corresponding timestamp in the path timestamp linked list; If the timestamp of a candidate path is less than the maximum timestamp of the autonomous system in the local timestamp record graph, then the candidate path is cancelled as an outdated path.

4. The method for accelerating border gateway protocol convergence according to claim 1, characterized in that, Also includes: The process ends when the optimal path remains unchanged.

5. The method for accelerating border gateway protocol convergence according to claim 1, characterized in that, Also includes: When the node write function is not enabled, existing attributes are transparently forwarded and no new timestamp information is generated.

6. The method for accelerating border gateway protocol convergence according to claim 1, characterized in that, Also includes: When the timestamp root cause information is received, it is transmitted downstream.

7. The method for accelerating border gateway protocol convergence according to claim 1, characterized in that, The method is applied to multiple autonomous systems, each of which includes multiple routers, and in each autonomous system, at most one router enables the node write function.

8. An electronic device, characterized in that, The device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, implements the method for accelerating border gateway protocol convergence as described in any one of claims 1-7.

9. A non-transitory computer-readable storage medium storing computer instructions, characterized in that, The computer instructions are used to cause the computer to perform the method for accelerating border gateway protocol convergence as described in any one of claims 1-7.

10. A computer program product comprising computer program instructions, characterized in that, When the computer program instructions are executed on a computer, the computer performs the method for accelerating border gateway protocol convergence as described in any one of claims 1-7.

Images