Route issuing method and device and related equipment

Abstract

The invention relates to the technical field of network communication, in particular to a route issuing method and device and related equipment. The method is applied to network equipment, and comprises the following steps: generating original next hop information based on a standard routing protocol; on the basis of a predefined rule, the generated original next-hop information is divided into at least one equivalent next-hop group, and one equivalent next-hop group comprises at least two next-hop interfaces; and for each equivalent next hop group, generating a corresponding routing table item, and issuing the generated routing table item to a hardware forwarding table.

Description

Technical Field

[0001] The present application relates to the field of network communication technology, and in particular to a method, apparatus and related equipment for issuing routes. Background Art

[0002] In existing IP (Internet Protocol) network routing and forwarding systems, routing table entries are typically delivered on a per-next-hop basis. When there are multiple equal-cost next hops (such as in ECMP (Equal-cost multi-path routing) scenarios), the control plane must generate and deliver routing table entries for each next-hop interface. This mechanism leads to three core issues:

[0003] (1) During the routing convergence process, due to the difference in learning speed of each interface, the interface that completes learning first will take on the traffic first, causing instantaneous bandwidth overload;

[0004] (2) The efficiency of routing table entry delivery is low, and N next hops require N table entry operations;

[0005] (3) Non-steady-state routing combinations occur during convergence, leading to inconsistency in traffic scheduling. Summary of the Invention

[0006] The present application provides a routing method, apparatus, and related equipment.

[0007] In a first aspect, the present application provides a route delivery method, applied to a network device, the method comprising:

[0008] Generate original next-hop information based on standard routing protocols;

[0009] Based on a predefined rule, the generated original next hop information is divided into at least one equal-cost next hop group, wherein an equal-cost next hop group includes at least two next hop interfaces;

[0010] For each equal-cost next-hop group, a corresponding routing table entry is generated and sent to the hardware forwarding table.

[0011] Optionally, for each equal-cost next-hop group, generating a corresponding routing table entry includes:

[0012] Allocate a group identifier for uniquely identifying each group of equal-cost next hops, and establish a mapping relationship between the group identifier of the equal-cost next hop group and at least two next-hop interfaces included in the equal-cost next hop group;

[0013] For each equal-cost next-hop group, a routing table entry is generated, whose next-hop information is the group identifier of the equal-cost next-hop group.

[0014] Optionally, the step of sending the generated routing table entry to the hardware forwarding table includes:

[0015] For each equal-cost next hop group, a mapping relationship between the group identifier of the equal-cost next hop group and at least two next hop interfaces included in the equal-cost next hop group and a routing table entry whose next hop information is the group identifier of the equal-cost next hop group are delivered to the hardware forwarding table.

[0016] Optionally, the method further includes:

[0017] If a failure of the first next-hop interface included in the target equal-cost next-hop group is detected, the first next-hop interface is deleted from the mapping relationship between the group identifier of the target equal-cost next-hop group and the next-hop interface, and the updated mapping relationship between the group identifier of the target equal-cost next-hop group and the next-hop interface is sent to the hardware forwarding table;

[0018] If a new second next-hop interface is detected in the target equal-cost next-hop group, the second next-hop interface is added to the mapping relationship between the group identifier of the target equal-cost next-hop group and the next-hop interface, and the updated mapping relationship between the group identifier of the target equal-cost next-hop group and the next-hop interface is sent to the hardware forwarding table.

[0019] In a second aspect, the present application provides a routing delivery device, which is applied to a network device, and the device includes:

[0020] A generation unit, configured to generate original next hop information based on a standard routing protocol;

[0021] a dividing unit, configured to divide the generated original next hop information into at least one equal-cost next hop group based on a predefined rule, wherein an equal-cost next hop group includes at least two next hop interfaces;

[0022] The generating unit is further configured to generate a corresponding routing table entry for each equal-cost next-hop group;

[0023] The sending unit is used to send the generated routing table entries to the hardware forwarding table.

[0024] Optionally, when generating a corresponding routing table entry for each equal-cost next hop group, the generating unit is specifically configured to:

[0025] Allocate a group identifier for uniquely identifying each group of equal-cost next hops, and establish a mapping relationship between the group identifier of the equal-cost next hop group and at least two next-hop interfaces included in the equal-cost next hop group;

[0026] For each equal-cost next-hop group, a routing table entry is generated, whose next-hop information is the group identifier of the equal-cost next-hop group.

[0027] Optionally, when sending the generated routing table entry to the hardware forwarding table, the sending unit is specifically configured to:

[0028] For each equal-cost next hop group, a mapping relationship between the group identifier of the equal-cost next hop group and at least two next hop interfaces included in the equal-cost next hop group and a routing table entry whose next hop information is the group identifier of the equal-cost next hop group are delivered to the hardware forwarding table.

[0029] Optionally,

[0030] If a failure of the first next hop interface included in the target equivalent next hop group is detected, the sending unit is further used to delete the first next hop interface from the mapping relationship between the group identifier of the target equivalent next hop group and the next hop interface, and send the updated mapping relationship between the group identifier of the target equivalent next hop group and the next hop interface to the hardware forwarding table;

[0031] If it is detected that a new second next hop interface is added in the target equivalent next hop group, the sending unit is also used to add the second next hop interface to the mapping relationship between the group identifier of the target equivalent next hop group and the next hop interface, and send the updated mapping relationship between the group identifier of the target equivalent next hop group and the next hop interface to the hardware forwarding table.

[0032] In a third aspect, an embodiment of the present application provides a routing delivery device, the routing delivery device comprising:

[0033] a memory for storing program instructions;

[0034] The processor is configured to call the program instructions stored in the memory and execute the steps of the method as described in any one of the first aspects above according to the obtained program instructions.

[0035] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to enable the computer to execute the steps of the method described in any one of the above-mentioned first aspects.

[0036] In summary, the routing delivery method provided in the embodiment of the present application is applied to a network device, and the method includes: generating original next-hop information based on a standard routing protocol; dividing the generated original next-hop information into at least one equal-cost next-hop group based on predefined rules, wherein an equal-cost next-hop group includes at least two next-hop interfaces; for each equal-cost next-hop group, generating a corresponding routing table entry, and delivering the generated routing table entry to the hardware forwarding table.

[0037] The routing method provided in the embodiment of the present application is adopted to bind multiple next-hop interfaces into a single logical identifier. Based on the single logical identifier, routing table entries corresponding to multiple next-hop interfaces are generated, reducing the rate of routing table entries to be issued. The routing effectiveness time of multiple next-hop interfaces corresponding to a logical identifier is synchronous, which improves the efficiency of routing delivery while more evenly sharing the side-carrying traffic of equivalent next-hop interfaces. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments of the present application or the description of the prior art. Obviously, the drawings described below are only some embodiments recorded in this application. For ordinary technicians in this field, other drawings can also be obtained based on these drawings of the embodiments of the present application.

[0039] Figure 1 A detailed flow chart of a routing method provided in an embodiment of the present application;

[0040] Figure 2 A schematic diagram of the structure of a routing distribution device provided in an embodiment of the present application;

[0041] Figure 3 A schematic diagram of the hardware architecture of a routing delivery device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0042] The terms used in the embodiments of this application are only for the purpose of describing specific embodiments and are not intended to limit this application. The singular forms "a," "the," and "the" used in this application and claims are also intended to include plural forms unless the context clearly indicates otherwise. It should also be understood that the term "and / or" used herein refers to any or all possible combinations of one or more associated listed items.

[0043] It should be understood that although the terms first, second, third, etc. may be used to describe various information in the embodiments of the present application, such information should not be limited to these terms. These terms are only used to distinguish information of the same type from each other. For example, without departing from the scope of the present application, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the word "if" used may also be interpreted as "at the time of" or "when" or "in response to determining".

[0044] Currently, Link Aggregation (LAG) technology can achieve load balancing by binding multiple physical ports into logical ports (e.g., IEEE 802.1AX). However, this technology only operates at the data link layer and cannot address the efficiency of routing table entry delivery at the network layer. Regarding routing protocol implementation, current protocols such as OSPF (Open Shortest Path First) and BGP (Border Gateway Protocol) still use an iterative processing mode for each next hop, lacking the ability to atomically operate on next hop groups.

[0045] (1) Convergence efficiency defects: Experimental data shows that in a scenario with 1000 ECMP routes and 16 next hops, the traditional method takes about 2.3 seconds to complete the delivery of all table entries, and 80% of the interfaces enter the forwarding state within the first 400 milliseconds.

[0046] (2) Bandwidth surge risk: During the BGP routing convergence test, the first three next-hop interfaces learned experienced an abnormal situation where they instantaneously carried 70% of the traffic.

[0047] (3) Table entry redundancy: Each next hop needs to independently generate a TCAM (Ternary Content Addressable Memory) table entry, resulting in a decrease in hardware resource utilization by about 40%.

[0048] This application

[0049] For example, see Figure 1 FIG. 1 is a detailed flow chart of a route delivery method provided in an embodiment of the present application. The method is applied to a network device and includes the following steps:

[0050] Step 100: Generate original next hop information based on a standard routing protocol.

[0051] In an embodiment of the present application, the incoming routing protocol processing architecture includes a control plane, a next-hop group management layer, and a forwarding plane. When receiving routing notifications sent by other network devices and performing routing learning, the control plane runs a standard routing protocol stack to generate original next-hop information. Specifically, the original next-hop information is the next-hop interface information.

[0052] Step 110: Based on a predefined rule, the generated original next hop information is divided into at least one equal-cost next hop group, wherein one equal-cost next hop group includes at least two next hop interfaces.

[0053] In the embodiments of the present application, a next-hop group management layer is added between the control plane and the forwarding plane. During route learning, the control plane generates a number of raw next-hop information and then, based on predefined rules, divides the raw next-hop information into one or more equal-cost next-hop groups. It should be noted that an equal-cost next-hop group includes at least two next-hop interfaces. In other words, the multiple next-hop interfaces included in the same equal-cost next-hop group are equal-cost next hops.

[0054] Step 120: Generate a corresponding routing table entry for each equal-cost next-hop group, and send the generated routing table entry to the hardware forwarding table.

[0055] In the embodiment of the present application, when generating corresponding routing table entries for each equal-cost next-hop group, a preferred implementation method is as follows:

[0056] For each group of equivalent next hops, a group identifier is assigned for uniquely identifying the equivalent next hop group, and a mapping relationship is established between the group identifier of the equivalent next hop group and at least two next hop interfaces included in the equivalent next hop group; for each equivalent next hop group, a routing table entry is generated whose next hop information is the group identifier of the equivalent next hop group.

[0057] Specifically, after dividing the original next hop information into one or more equal-cost next hop groups, the next-hop group management layer assigns a group identifier (e.g., NGID) to each equal-cost next hop group, which uniquely identifies the group. Furthermore, for each equal-cost next hop group's NGID, a mapping relationship is established between the NGID and the next-hop interfaces included in the group.

[0058] For example, assuming that the group identifier assigned to equal-cost next-hop group 1 is NGID_0x3A7B, and equal-cost next-hop group 1 includes eth1, eth2, and eth3, then a mapping relationship between the NGID and the physical port list can be constructed for equal-cost next-hop group 1: NGID_0x3A7B:[eth1,eth2,eth3].

[0059] Next, a routing table entry corresponding to the equal-cost next-hop group 1 is generated for the equal-cost next-hop group 1. The next-hop information of the routing table entry is the group identifier (NGID_0x3A7B) of the equal-cost next-hop group.

[0060] In other words, the format of traditional routing table entries is converted from <prefix, next-hop IP> to <prefix, NGID>, and equivalent next-hop IPs share one routing table entry.

[0061] In the embodiment of the present application, when the generated routing table entry is sent to the hardware forwarding table, a preferred implementation method is:

[0062] For each equal-cost next hop group, a mapping relationship between the group identifier of the equal-cost next hop group and at least two next hop interfaces included in the equal-cost next hop group and a routing table entry whose next hop information is the group identifier of the equal-cost next hop group are delivered to the hardware forwarding table.

[0063] For example, for equal-cost next-hop group 1, the mapping relationship between its corresponding group identifier and next-hop interface (NGID_0x3A7B:[eth1,eth2,eth3]) is sent to the hardware forwarding table of the forwarding chip, and the routing table entry of <prefix, NGID_0x3A7B> is sent to the hardware forwarding table of the forwarding chip.

[0064] In this way, after receiving the routing table entry of <prefix, NGID_0x3A7B>, the forwarding chip maintains the routing table entry of <prefix, NGID_0x3A7B> in the hardware forwarding table, and combines it with the maintained (NGID_0x3A7B: [eth1, eth2, eth3]) to establish the association relationship of <prefix, [eth1, eth2, eth3]>.

[0065] When forwarding a packet, if the forwarding chip matches the prefix, it determines the group ID corresponding to the prefix and then, based on the determined group ID, determines the corresponding next-hop interface. The packet is then forwarded using the determined next-hop interface.

[0066] In the embodiment of the present application, the prefix may be characteristic information of the message (such as quintuple information, etc.), and no specific limitation is made here in the embodiment of the present application.

[0067] Based on the same inventive concept as the above-mentioned embodiment, for example, refer to Figure 2 FIG. 1 is a schematic diagram of a structure of a route delivery device provided in an embodiment of the present application, which is applied to a network device and includes:

[0068] A generating unit 20, configured to generate original next hop information based on a standard routing protocol;

[0069] A dividing unit 21 is configured to divide the generated original next hop information into at least one equal-cost next hop group based on a predefined rule, wherein an equal-cost next hop group includes at least two next hop interfaces;

[0070] The generating unit 20 is further configured to generate a corresponding routing table entry for each equal-cost next-hop group;

[0071] The sending unit 22 is used to send the generated routing table entry to the hardware forwarding table.

[0072] Optionally, when generating a corresponding routing table entry for each equal-cost next-hop group, the generating unit 20 is specifically configured to:

[0073] Allocate a group identifier for uniquely identifying each group of equal-cost next hops, and establish a mapping relationship between the group identifier of the equal-cost next hop group and at least two next-hop interfaces included in the equal-cost next hop group;

[0074] For each equal-cost next-hop group, a routing table entry is generated, whose next-hop information is the group identifier of the equal-cost next-hop group.

[0075] Optionally, when sending the generated routing table entry to the hardware forwarding table, the sending unit 22 is specifically configured to:

[0076] For each equal-cost next hop group, a mapping relationship between the group identifier of the equal-cost next hop group and at least two next hop interfaces included in the equal-cost next hop group and a routing table entry whose next hop information is the group identifier of the equal-cost next hop group are delivered to the hardware forwarding table.

[0077] Optionally,

[0078] If a failure of the first next hop interface included in the target equivalent next hop group is detected, the issuing unit 22 is further used to delete the first next hop interface from the mapping relationship between the group identifier of the target equivalent next hop group and the next hop interface, and issue the updated mapping relationship between the group identifier of the target equivalent next hop group and the next hop interface to the hardware forwarding table;

[0079] If it is detected that a second next hop interface is newly added in the target equivalent next hop group, the sending unit 22 is further used to add the second next hop interface to the mapping relationship between the group identifier of the target equivalent next hop group and the next hop interface, and send the updated mapping relationship between the group identifier of the target equivalent next hop group and the next hop interface to the hardware forwarding table.

[0080] The above units may be one or more integrated circuits configured to implement the above methods, such as one or more application-specific integrated circuits (ASICs), one or more digital signal processors (DSPs), or one or more field programmable gate arrays (FPGAs). For another example, when a unit is implemented by scheduling program code through a processing element, the processing element may be a general-purpose processor, such as a central processing unit (CPU) or other processor that can call program code. For another example, these units may be integrated together and implemented in the form of a system-on-a-chip (SOC).

[0081] Furthermore, the routing device provided in the embodiment of the present application, from the hardware level, the hardware architecture diagram of the routing device can be found in Figure 3 As shown, the routing sending device may include: a memory 30 and a processor 31,

[0082] The memory 30 is used to store program instructions. The processor 31 calls the program instructions stored in the memory 30 and executes the above method embodiment according to the obtained program instructions. The specific implementation method and technical effect are similar and will not be repeated here.

[0083] Optionally, the present application also provides a network device comprising at least one processing element (or chip) for executing the above method embodiment.

[0084] Optionally, the present application also provides a program product, such as a computer-readable storage medium, which stores computer-executable instructions, and the computer-executable instructions are used to enable the computer to execute the above method embodiments.

[0085] Here, the machine-readable storage medium can be any electronic, magnetic, optical or other physical storage device that can contain or store information, such as executable instructions, data, etc. For example, the machine-readable storage medium can be: RAM (Random Access Memory), volatile memory, non-volatile memory, flash memory, storage drive (such as hard disk drive), solid state drive, any type of storage disk (such as CD, DVD, etc.), or similar storage media, or a combination thereof.

[0086] The systems, devices, modules, or units described in the above embodiments may be implemented by computer chips or entities, or by products having certain functions. A typical implementation device is a computer, which may be in the form of a personal computer, laptop computer, cellular phone, camera phone, smartphone, personal digital assistant, media player, navigation device, email transceiver, game console, tablet computer, wearable device, or any combination of these devices.

[0087] For the convenience of description, the above devices are described as being divided into various units according to their functions. Of course, when implementing this application, the functions of each unit can be implemented in the same or multiple software and / or hardware.

[0088] Those skilled in the art will appreciate that the embodiments of the present application can be provided as methods, systems, or computer program products. Therefore, the present application can adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the embodiments of the present application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0089] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the steps in the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0090] Furthermore, these computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0091] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for executing on the computer or other programmable device to implement the process. Figure 1 a process or multiple processes and / or boxes Figure 1 The steps for the function specified in one or more boxes.

[0092] The above description is only a preferred embodiment of the present application and is not intended to limit the present application. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present application shall be included in the scope of protection of the present application.

Claims

1. A method for issuing a route, characterized in that: Applied to a network device, the method includes: Generate original next-hop information based on standard routing protocols; Based on a predefined rule, the generated original next hop information is divided into at least one equal-cost next hop group, wherein an equal-cost next hop group includes at least two next hop interfaces; For each equal-cost next-hop group, a corresponding routing table entry is generated and sent to the hardware forwarding table.

2. The method according to claim 1, wherein For each equal-cost next-hop group, the steps for generating a corresponding routing table entry include: Allocate a group identifier for uniquely identifying each group of equal-cost next hops, and establish a mapping relationship between the group identifier of the equal-cost next hop group and at least two next-hop interfaces included in the equal-cost next hop group; For each equal-cost next-hop group, a routing table entry is generated, whose next-hop information is the group identifier of the equal-cost next-hop group.

3. The method according to claim 2, wherein The steps for sending the generated routing table entries to the hardware forwarding table include: For each equal-cost next hop group, a mapping relationship between the group identifier of the equal-cost next hop group and at least two next hop interfaces included in the equal-cost next hop group and a routing table entry whose next hop information is the group identifier of the equal-cost next hop group are delivered to the hardware forwarding table.

4. The method according to claim 2 or 3, wherein: The method further comprises: If a failure of the first next-hop interface included in the target equal-cost next-hop group is detected, the first next-hop interface is deleted from the mapping relationship between the group identifier of the target equal-cost next-hop group and the next-hop interface, and the updated mapping relationship between the group identifier of the target equal-cost next-hop group and the next-hop interface is sent to the hardware forwarding table; If a new second next-hop interface is detected in the target equal-cost next-hop group, the second next-hop interface is added to the mapping relationship between the group identifier of the target equal-cost next-hop group and the next-hop interface, and the updated mapping relationship between the group identifier of the target equal-cost next-hop group and the next-hop interface is sent to the hardware forwarding table.

5. A routing issuing device, characterized in that: Applied to network equipment, the device includes: A generation unit, configured to generate original next hop information based on a standard routing protocol; a dividing unit, configured to divide the generated original next hop information into at least one equal-cost next hop group based on a predefined rule, wherein an equal-cost next hop group includes at least two next hop interfaces; The generating unit is further configured to generate a corresponding routing table entry for each equal-cost next-hop group; The sending unit is used to send the generated routing table entries to the hardware forwarding table.

6. The device according to claim 5, characterized in that When generating a corresponding routing table entry for each equal-cost next-hop group, the generating unit is specifically configured to: Allocate a group identifier for uniquely identifying each group of equal-cost next hops, and establish a mapping relationship between the group identifier of the equal-cost next hop group and at least two next-hop interfaces included in the equal-cost next hop group; For each equal-cost next-hop group, a routing table entry is generated, whose next-hop information is the group identifier of the equal-cost next-hop group.

7. The device according to claim 6, characterized in that When sending the generated routing table entry to the hardware forwarding table, the sending unit is specifically used to: For each equal-cost next hop group, a mapping relationship between the group identifier of the equal-cost next hop group and at least two next hop interfaces included in the equal-cost next hop group and a routing table entry whose next hop information is the group identifier of the equal-cost next hop group are delivered to the hardware forwarding table.

8. The device according to claim 6 or 7, characterized in that If a failure of the first next hop interface included in the target equivalent next hop group is detected, the sending unit is further used to delete the first next hop interface from the mapping relationship between the group identifier of the target equivalent next hop group and the next hop interface, and send the updated mapping relationship between the group identifier of the target equivalent next hop group and the next hop interface to the hardware forwarding table; If it is detected that a new second next hop interface is added in the target equivalent next hop group, the sending unit is also used to add the second next hop interface to the mapping relationship between the group identifier of the target equivalent next hop group and the next hop interface, and send the updated mapping relationship between the group identifier of the target equivalent next hop group and the next hop interface to the hardware forwarding table.

9. A routing issuing device, characterized in that: The routing issuing device includes: a memory for storing program instructions; The processor is configured to call the program instructions stored in the memory, and execute the steps of the method according to any one of claims 1 to 4 according to the obtained program instructions.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to enable the computer to execute the steps of the method according to any one of claims 1 to 4.

Images