CN113595902A

CN113595902A - Routing method and network equipment based on border gateway protocol

Info

Publication number: CN113595902A
Application number: CN202010365690.6A
Authority: CN
Inventors: 姚春燕
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Cloud Computing Technologies Co Ltd
Priority date: 2020-04-30
Filing date: 2020-04-30
Publication date: 2021-11-02
Also published as: WO2021218766A1

Abstract

A routing method and network device based on border gateway protocol, the method includes: acquiring N routes in L routes received based on BGP, and acquiring a first-level rule and a second-level rule selected by a user; the first level of rules comprises at least one rule; l, N is a positive integer; the second-level rule comprises at least one rule, and the second-level rule is different from the first-level rule; selecting the N routes according to the first-level rule to obtain M routes; m is a positive integer greater than 1, and M < N; and selecting the M routes according to a second-level rule until one route is selected. By the method, when the route is optimized, judgment can be carried out through a plurality of rules at the same time, the accuracy rate of route optimization is improved, and the flexibility is improved.

Description

Routing method and network equipment based on border gateway protocol

Technical Field

The present application relates to the field of network technologies, and in particular, to a routing method and a network device based on a border gateway protocol.

Background

With the increasing requirements of public clouds on time delay and the like, how to select an optimal route becomes more and more important when a Border Gateway Protocol (BGP) performs route selection.

Currently, Border Gateway Protocol (BGP) generally selects a route as follows: in the existing scheme, it is assumed that there are 20 routes to be selected, and the routing rules include 12 rules, for example, rule 1, rule 2 … rule 12, and each rule includes a parameter, when a BGP selects a route, first, 20 routes are selected through rule 1, and if 1 route can be selected through rule 1, it is not necessary to continue selecting a route according to other rules. And if the parameters in the rule 1 do not exist in the 20 routes, continuing to perform route selection on the 20 routes through the rule 2, and if the routes cannot be selected through the rule 2, continuing to perform route selection according to the rule 3, and so on until the routes are selected.

According to the routing mode, only one rule can be compared each time in the existing routing method, and only the rule in a fixed sequence can be selected from a plurality of routes, so that the flexibility is poor, and the application scenes are few.

Disclosure of Invention

The application provides a routing method and network equipment based on a border gateway protocol, which are used for improving the flexibility of routing.

In a first aspect, the present application provides a routing method based on a border gateway protocol, including: acquiring N routes in L routes received based on a Border Gateway Protocol (BGP), and acquiring a first-level rule and a second-level rule selected by a user; the first level of rules comprises at least one rule; l, N is a positive integer; the second-level rule comprises at least one rule, and the second-level rule is different from the first-level rule; selecting the N routes according to the first-level rule to obtain M routes; m is a positive integer greater than 1, and M < N; and selecting the M routes according to a second-level rule until one route is selected.

In the above technical solution, for the route to be subjected to route selection, the route is optimized according to the first-level rule first, and then the route is further optimized according to the second-level rule, so that the route can be optimized according to a plurality of rules at the same time, and the flexibility of route selection can be improved. And preferentially carrying out route optimization according to the first-level rule, so that the selected route can better accord with the current network scene, and the accuracy of route selection is improved.

In one possible design, the N routes have the same route prefix.

In the application, for the routes having the same route prefix, a route needs to be selected to ensure that the selected route is the optimal route in the current scenario, so that the route preference rate can be improved.

In one possible design, when the first-level rule includes a plurality of rules, selecting the N routes according to the first-level rule includes: acquiring a logic relationship among a plurality of rules included in the first-level rule; selecting the N routes based on the logical relationship.

In the above technical solution, the first-level rule is a priority rule, and when the first-level rule includes a plurality of rules, a logical relationship may be set between the plurality of rules, so that the route to be selected can be further optimized according to the logical relationship between the rules.

In the present application, the first level rule may be obtained through several possible implementations as follows:

the first mode is as follows:

before the first-level rule selected by the user is obtained, the method further comprises the following steps: and acquiring a plurality of rules stored in advance, and displaying the plurality of rules by a graphical interface.

The obtaining of the first-level rule selected by the user comprises: and determining the first-level rule selected by the user according to a selection instruction input by the user on the graphical interface.

That is, in the first way, a plurality of rules may be displayed in the form of a graphical interface, and then the user selects a first level rule by clicking on the graphical interface. Through the mode of graphical interface display, can make things convenient for user's operation, can promote user experience.

The second mode is as follows:

the user can input a plurality of rules through the command line interface, and then the network equipment can acquire the first-level rules through the plurality of rules input on the command line interface by the user. Of course, it should be noted that the first-level rule may also be obtained by other methods such as voice and file, and the application is not limited to this.

In one possible design, obtaining the logical relationship between the plurality of rules included in the first level rule includes: and acquiring the logical relationship among a plurality of rules included in the first-level rule input by a user through a command line interface.

That is, when the first-level rule includes a plurality of rules, the logical relationship between the plurality of rules may also be obtained through a graphical interface or a command line interface.

In one possible design, the selecting the M routes according to a second level rule includes: and selecting the M routes according to the logic relationship among the plurality of rules included in the second-level rule.

In the above technical solution, the second-level rule may also include a plurality of rules, and a logical relationship may exist between the plurality of rules. In the application, according to the logical relationship of the second-level rule, the optimization of the M routes obtained after the optimization of the first-level rule is further performed, so that the optimization rate of the routes can be improved, and the flexibility of route selection can be improved.

In one possible design, the method further includes: and when the parameter information included in the rule is the path length, determining to start an AS number duplicate removal function of the autonomous system.

In the technical scheme, the situation that the route is rejected due to misjudgment caused by too long AS-Path length due to the repeated AS numbers can be avoided by starting the AS number duplicate removal function.

In one possible design, the first level rules include: selecting a route with the minimum time delay; selecting a route with the least packet loss; selecting a route with the lowest route cost; the route with the lowest line utilization is selected.

In the above technical solution, the first-level rule is a priority rule, and the first-level rule may be adaptively adjusted according to different scenes. The first-level rules and the logical relations among the rules are configured by the user, that is, the first-level rules have strong flexibility, and the number, the logical relations and the like of the first-level rules are not specifically limited in the application.

In one possible design, the second level rule includes: selecting a route with the maximum Preferred-value of the protocol; selecting a route with the highest local priority; selecting an aggregation route; selecting the shortest AS path of the autonomous system; selecting ORIGIN attribute as interior gateway protocol IGP, exterior gateway protocol EGP, Incomplite; selecting a multi-outlet difference MED value to be the lowest; selecting the sources of EBGP, alliance and IBGP; selecting the Next HOP with the lowest Next _ HOP metric value; selecting the CLUSTER LIST CLUSTER _ LIST with the shortest length; selecting origin number ORIGINATOR _ ID minimum; selecting the Router with the smallest Router number Router ID; and selecting the route issued by the peer with the minimum Internet protocol IP address.

In the above technical solution, the second-level rule is a further judgment rule based on the first-level rule, and the second-level rule and the logical relationship between the rules are configured by the user, so the second-level rule is also relatively flexible, and the number, logical relationship, and the like of the second-level rule are not limited in this application.

In a second aspect, the present application provides a network device, which may include: the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring N routes in L routes received based on a Border Gateway Protocol (BGP) and acquiring a first-level rule and a second-level rule selected by a user; the first level of rules comprises at least one rule; l, N is a positive integer; the second-level rule comprises at least one rule, and the second-level rule is different from the first-level rule; the first selection unit is used for selecting the N routes acquired by the acquisition unit according to the first-level rule to obtain M routes; m is a positive integer greater than 1, and M < N; and the second selection unit is used for selecting the M routes obtained by the first selection unit according to a second-level rule until one route is selected.

In one possible design, the N routes have the same route prefix.

In one possible design, the obtaining unit is further configured to:

when the first-level rule comprises a plurality of rules, acquiring a logical relationship among the plurality of rules included in the first-level rule;

the first selecting unit is specifically configured to select the N routes according to the first-level rule as follows:

and selecting the N routes based on the logic relationship acquired by the acquisition unit.

In one possible design, the obtaining unit is further configured to: acquiring a plurality of rules stored in advance, and displaying the plurality of rules by a graphical interface;

the obtaining unit is specifically configured to obtain a first-level rule selected by a user as follows:

and determining the first-level rule selected by the user according to a selection instruction input by the user on the graphical interface.

In a possible design, the obtaining unit is specifically configured to obtain the logical relationship between the plurality of rules included in the first-level rule as follows:

and acquiring the logical relationship among a plurality of rules included in the first-level rule input by a user through a command line interface.

In a possible design, the second selecting unit is specifically configured to select the M routes according to a second-level rule as follows: and selecting the M routes according to the logic relationship among the plurality of rules included in the second-level rule.

With regard to the technical effects brought by the second aspect or the various embodiments of the second aspect, reference may be made to the description of the technical effects of the first aspect or the various embodiments of the first aspect, and redundant description is not repeated here.

In a third aspect, the present application provides a border gateway protocol-based routing apparatus, where the apparatus has a function of implementing a border gateway protocol-based routing method in the first aspect or any one of possible implementation manners of the first aspect. The functions can be realized by hardware, and the functions can also be realized by executing corresponding software by hardware.

The apparatus comprises a communication interface for receiving and transmitting data, a processor configured to enable the apparatus to perform corresponding functions in any one of the possible implementations of the first aspect or the first aspect as described above, and a memory. The memory is coupled to the processor and retains program instructions necessary for the device.

In a fourth aspect, a computer-readable storage medium is provided, which has instructions stored therein, and when the instructions are executed on a computer, the instructions cause the computer to execute the method in the first aspect and the embodiments.

In a fifth aspect, a computer program product comprising instructions is provided, which when run on a computer, causes the computer to perform the method of the first aspect and embodiments described above.

A sixth aspect provides a chip, wherein logic in the chip is configured to perform the method in the first aspect and the embodiments.

Drawings

Fig. 1A is a diagram of a network architecture according to an embodiment of the present application;

fig. 1B is a block diagram of a routing provided in an embodiment of the present application;

fig. 2 is a flowchart of a BGP-based routing method according to an embodiment of the present application;

fig. 3 is a functional block diagram of a network device according to an embodiment of the present application;

fig. 4 is a schematic diagram of a BGP-based routing device according to an embodiment of the present application.

Detailed Description

Embodiments of the present application will be described in further detail below with reference to the accompanying drawings.

At present, two Autonomous Systems (AS) may interact routing information through BGP, and after a router in the AS receives multiple routes sent from other routers, if a route with the same destination internet protocol address (IP) exists in the multiple routes, a route with the same destination IP prefix needs to be optimized, and a route is selected. In the prior art, the rules according to which routes with the same destination IP prefix are routed are as follows:

r1, the route with the largest preferred-value of the preference protocol (preferred-value) is selected preferentially;

r2, selecting the route with the highest LOCAL priority (LOCAL _ PREF) preferentially;

r3, preferred aggregated (AGGREGATE) route;

r4, preferentially selecting the route with the shortest AS PATH (AS _ PATH);

r5, routing of Interior Gateway Protocol (IGP), Exterior Gateway Protocol (EGP), Incomplete with preferred ORIGIN (ORIGIN) attribute;

r6, selecting the route with the lowest multi-exit classifier (MED) value preferentially;

r7, sequentially selecting routes from EBGP (External/External BGP), alliance and IBGP (Internal/Internal BGP);

r8, selecting the route with the lowest Next HOP (Next _ HOP) metric value preferentially;

r9, the route with the shortest length of the priority CLUSTER LIST (CLUSTER _ LIST);

r10, route with the smallest priority origin number (origin _ ID);

r11, the route issued by the Router with the smallest priority selection Router number (Router ID);

r12, and preferentially selecting the route issued by the peer with the smallest Internet Protocol (IP) address.

It should be noted that, each parameter information (e.g., local priority, AS path, etc.) related in the above rule may refer to explanations in the prior art, and will not be described in detail herein.

Based on the 12 rules, in the existing routing method, BGP first determines multiple received routes according to rule 1, and then selects the route with the largest preferred value. If the route can not be judged according to the rule 1, judging the received routes according to the rule 2, selecting the route with the highest local priority, and so on, and when the previous rule can not select the route, selecting the route by using the next rule.

As can be seen from the existing routing method: the routing mode is relatively fixed, and routing can be performed only according to the fixed sequence of the 12 rules, which makes the routing flexibility low.

With the continuous rise of public clouds, BGP is widely used as a boundary point between the public clouds and the Internet (Internet). In order to optimally cover users covered by the Internet (for example, shortest time delay or minimum packet loss), the public cloud needs to make complex routing policy settings for BGP routes received by its own border router, so AS to ensure that the BGP routes are sent from the public cloud to user terminals connected to each AS in the Internet, and the best route is taken. However, according to the current routing method, when routes having the same routing prefix are selected, the selected route is not necessarily a route that is desired to be selected in a public cloud scenario. In other words, the selected route may be different for different scenarios.

For example, border router 1 receives route a to border router 2 from line 1 and line 2, respectively. Where the local priority of the route from line 1 is higher than the local priority of the route from line 2, the path from the route of line 1 is longer than the path from the route of line 2 to the border router 2. According to the current routing method, a route from the line 1 is selected, but in a public cloud scenario, a route is generally selected to be shorter and have smaller time delay, that is, a route from the line 2. It will be appreciated that route a is a route having the same routing prefix.

It should be noted that, in the present application, routes having the same routing prefix are routes having the same destination IP prefix, and may sometimes be mixed, and it should be understood that the two meanings are the same.

In view of this, embodiments of the present application provide a new BGP-based routing method, where a route is first selected according to a first-level rule. When the first-level rule is used to select a route, the route selection is carried out according to the second-level rule until a route is selected.

The embodiments of the present application relate to at least one, including one or more; wherein a plurality means greater than or equal to two. In the description of the present application, the terms "first", "second", and the like are used for the purpose of distinguishing between objects to be described, and are not intended to indicate or imply relative importance nor order to be construed.

For ease of understanding, an explanation of concepts related to the present application is given by way of example for reference, as follows:

1) border gateway BGP protocol: a routing protocol for autonomous systems operating over Transmission Control Protocol (TCP). BGP is used to exchange routing information between different autonomous systems (ases). When two ases need to exchange routing information, each AS specifies a node running BGP to exchange routing information with other ases on behalf of the AS. This node may be a host. BGP is typically performed by a router. Routers in two ASs that exchange information using BGP are also called Border gateways (Border gateways) or Border routers (Border routers).

2) An autonomous system AS: all routers in an autonomous system are interconnected, run the same routing protocol, and assign the same autonomous system number.

3) Adj-RIBS-In: the route information learned from the update (update) messages of the neighbors is stored. Among them, the RIB refers to a Routing Information Base (RIB), or routing table.

4) Loc-RIB: and storing the routing information selected from the Adj-RIBS-In by the BGP speaker according to the local routing strategy.

5) Adj-RIBS-Out: routing information for advertising to peers is stored.

6) Peer: including external peers and internal peers. For a BGP speaker, another BGP speaker is referred to AS an external peer if it communicates with that BGP speaker and that BGP speaker is in a different AS, and an internal peer if it is within the same AS.

7) A BGP speaker: the router directly connected through BGP is the BGP speaker. The BGP speaker may be within the same AS or within a different AS. The BGP speakers of each AS communicate with each other, exchanging network reachability information in accordance with policies established by each AS. It should be noted that, in the present application, the BGP speaker is the border BGP router in the present application.

8) IBGP: BGP, running between two or more peer entities within the same autonomous system AS.

9) EBGP: BGP running between peer entities belonging to different ASs.

It should be noted that, for convenience of description, the "Adj-RIB-In" may be denoted as "a first storage module", the "Loc-RIB" may be denoted as "a second storage module", and the "Adj-RIB-Out" may be denoted as "a third storage module".

First, please refer to fig. 1A, which is a diagram of a network architecture to which the embodiments of the present application can be applied, and as shown in fig. 1A, the network architecture may include: end USer (USER), router under operator network, router under public cloud scene. Under the network architecture shown in fig. 1A, an end user may connect to an Internet Service Provider (ISP), that is, an operator network, through the Internet (Internet), and then routing information may be exchanged between a border BGP router under the operator network and a public cloud border BGP router, so as to implement that the end user accesses a cloud service. Wherein a point-of-presence (POP) of the public cloud is connected to a backbone network between Data Centers (DCs) or areas (regions) of the public cloud.

In fig. 1A, routing information may be exchanged between an operator border BGP router and a public cloud border BGP router, and each border BGP router may also receive routes sent by other routers while sending routes to other routers. In the following, three border BGP routers are taken as an example to briefly introduce a route interaction process and a route selection process in a public cloud scenario. The specific routing process will be described in detail below.

Referring to fig. 1B, assume that border BGP routers include border BGP router 1, border BGP router 2, and border BGP router 3. The border BGP router 1 is a public cloud border BGP router, and the border BGP router 2 and the border BGP router 3 are operator border BGP routers.

Illustratively, the border BGP router 1 receives 5 routes sent by the border BGP router 2 and 10 routes sent by the border BGP router 3 within 5 minutes, respectively. For border BGP router 1, the received routes may be stored In a first storage module (Adj-RIBS-In). Assuming that the destination IP prefixes of 8 routes in the 15 routes received by the border BGP router 1 are the same, at this time, 8 routes need to be selected, and an optimal route is selected and sent to the router corresponding to the destination IP prefix. After BGP has routed 8 routes, the preferred route may be placed in the second storage module (Loc-RIB), and then the third storage module (Adj-RIB-Out) may forward the selected route to advertise the selected route information to other peers (routers).

It should be noted that, in the embodiment of the present application, a route received by a router within a preset time period may be periodically determined, so as to determine whether the route received within the preset time period needs to be routed. For example, 5 minutes in the above example may be selected, and of course, the received route may be determined every 1 minute, which is not limited in the present application.

It is understood that the border BGP router 1 may send routes while receiving routes, and fig. 1B only illustrates the border BGP router 1 receiving routes as an example.

It should be understood that the first storage module, the second storage module, and the third storage module in fig. 1B may be part of the border BGP router 1, and fig. 1B is only for illustrating the entire flow of route receiving, selecting, and forwarding, and therefore the three storage modules are illustrated separately from the border BGP router 1.

The following describes in detail a routing method provided in an embodiment of the present application, and referring to fig. 2, is a flowchart of a routing method provided in an embodiment of the present application, where the method includes the following steps:

s201: and the first network equipment receives the L routes sent by the second network equipment.

It is understood that the L routes are the total number of routes received by the first network device within the preset time period. For example, the first network device may receive 100 routes sent by the second network device within 5 minutes, and the application is not limited to the preset time duration.

For convenience of description, the following description will be given taking the router a as the first network device and the routers B and C as the second network device as examples. For example, router a may receive L routes sent by other routers, e.g., router B and router C. Referring to table 1, an example of a route in a routing table provided in the embodiment of the present application is shown.

Table 1 routing example

Network	Nextop	MED	LocPrf	PreVal	Path/Ogn
						1.0.0.0/24	201.125.254.8	0	1500	0	8151 13335i
1.0.4.0/22	201.125.254.8	0	1500	0	8151 1299 4826 38803 56203i
						1.0.4.0/24	201.125.254.8	0	1500	0	8151 1299 4826 38803 56203i
1.0.5.0/24	201.125.254.8	0	1500	0	8151 1299 4826 38803 56203i
						1.0.6.0/24	201.125.254.8	0	1500	0	8151 1299 4826 38803 56203i
1.0.7.0/24	201.125.254.8	0	1500	0	8151 1299 4826 38803 56203i

It should be noted that Network in table 1 represents a Network segment, Nextop represents a next hop IP address, MED represents a multi-egress differentiation value, LocPrf represents a local priority, PreVal represents a protocol preference value, Path represents a Path, and Ogn represents an origin.

It is to be understood that the routing in table 1 is merely an illustrative example, and the present application is not limited thereto.

In some embodiments, the route may be stored in a routing table of the router, and the routing table may be displayed by a user entering a command to display the route. Examples are as follows:

it is to be understood that the above-described routing table is only an illustrative example, and the present application is not limited thereto.

S202: the first network device obtains N routes of the L routes. Wherein L, N is a positive integer.

In this embodiment, the L routes received by the first network device may be divided into two parts. Some of the routes are routes that do not require routing, and some of the routes are routes that require routing. The first network device may obtain a route that needs to be routed from the L routes, for example, obtain N routes. Of course, it is understood that N routes are routes having the same routing prefix.

It should be understood that the same routing prefix in this application can be understood as the same IP prefix, in other words, as a collection of the same set of IPs. For example, 192.168.0.1 through 192.168.0.25 all belong to the same routing prefix.

S203: the first network device obtains a first level rule selected by a user.

In this embodiment, the first-level rule may include at least one rule, and the first-level rule includes, but is not limited to, R1-R12 described above, and may also include rules corresponding to other parameters, such as performance, delay, packet loss, line capacity, and the like, which are not limited in this application.

For example, it is assumed that in addition to the 12 rules introduced above, the following rules are included in the present application:

r13: preferentially selecting the route with the lowest time delay; r14: preferentially selecting the route with the least packet loss; r15: preferentially selecting a route with the lowest cost of a line carrying cloud inlet traffic; r16: the route with the lowest line utilization rate is preferentially selected.

It should be noted that R13-R16 are only schematic illustrations, Rn (n is a positive integer) referred to in this application, that is, the numbers 1, 2, 3, etc. in the rules do not represent the execution order of the rules, and the rules are not limited to the rules listed in this application.

Since the network focus may be different in different scenarios. For example, in a public cloud scenario, the public cloud is very concerned about experience of accessing various cloud services in the public cloud by Applications (APPs) on user terminals in each AS distributed in a target coverage area, such AS time delay, packet loss, and the like. In other words, the public cloud is very sensitive to the experience of the terminal user accessing the cloud service through the Internet, and as the user access experience is not good, the mobile phone APP may be uninstalled, which results in the reduction of users of the cloud service corresponding to the APP on the mobile phone. Since the cloud service is very sensitive to the number of active accesses of the user, once the number of the users is reduced, the profitability and survival of the cloud service are affected, and therefore if the user experience is poor, the cloud service may be moved to another public cloud provider with better network performance.

For another example, the operator interconnection scenario mainly realizes the interworking between a large number of user terminals of different ASs, and the main concern lies in preferentially ensuring the high availability of the interworking between a large number of users occupying a relatively small area, and that a large number of general users can communicate normally without frequent major failures, and without great thought to optimize the interworking experience (delay, packet loss) fed back by the large number of general users at any time. That is, for the Internet network of the operator, Best-effort (Best-effort) connection services are mainly provided for a large number of end users, and specific special guarantees are rarely made for specific services therein, so that the Internet network is not sensitive to the fluctuation of time delay and packet loss as long as the services are not interrupted. Once a terminal user accesses the network, the telephone number is bound with various banks and electronic commerce services, and the network is difficult to switch, so that the pressure of the fluctuation of the service quality on operators is not as great as that of public cloud services. The operator pays attention to the network construction cost and the operation and maintenance cost, so the existing BGP routing optimization algorithm is easy to construct the network and maintain, and the cost in all aspects is relatively low.

Based on this, the rules that are prioritized may be different in different scenarios, i.e., the first level rules may be different. For example, in a public cloud scenario, the first level rules may include the following rules:

r13: preferentially selecting the route with the lowest time delay; r14: and preferentially selecting the route with the least packet loss.

It should be noted that the first-level rule is not limited to the two rules of R13 and R14 in the above example, and may include other rules, which are not limited in the present application.

As a possible implementation manner, the first network device may obtain a plurality of rules stored in advance, and display the plurality of rules in a graphical interface. The first level rule selected by the user can then be determined according to the selection instruction input by the user on the graphical interface. For example, R1-R16 may be displayed on the graphical interface, and the user may then select the first level rules directly on the graphical interface, e.g., selecting boxes for R13 and R14, such that the first network device may determine the first level rules based on the user's selection instructions.

Of course, it is understood that "R13", "R14", etc. may be displayed on the graphical interface, and specific content of R13, such as "select the route with the lowest delay", may also be displayed, and the display mode is not specifically limited in this application.

As another possible implementation, the user may input the first level rule with the command line interface, so that the first network device may obtain the first level rule according to the first level rule input with the command line interface by the user.

The method for acquiring the first-level rule is not limited to the above method, and for example, the first-level rule may be acquired by a voice command, or the first-level rule may be acquired by a script, and the like, which is not limited in the present application.

S204: and the first network equipment selects the N routes according to the first-level rule to obtain M routes. Wherein M is a positive integer.

In some embodiments, multiple rules may be included in the first level rules, and there may be logical relationships between the multiple rules. For example, assuming that the first-level rule includes two rules, for example, the two rules are denoted as rule 1 and rule 2, the user may set the logical relationship between the two rules, for example, the user may set the rule 1 to be judged preferentially, and if the rule 1 is not judged, the user may continue to judge according to the rule 2.

Of course, it is understood that the number of rules and the logical relationship between the rules in the above examples are only illustrative, and are not limited in this application.

Thus, when there is one and only one rule in the first-level rules, the first network device selects N routes according to the one rule. When the first-level rule includes a plurality of rules, the first network device may first obtain a logical relationship between the plurality of rules, and then select N routes based on the obtained logical relationship.

For example, assume that router a receives routes with the same route prefix for 4 of the routes, and the first level rules may include the following two rules: r2 selects the route with the highest local priority; r4: and selecting the route with the shortest AS path. And the logical relationship between the two rules is: the priority is judged according to R2, and the priority is judged according to R4.

Examples are as follows: for example, the partial parameters of the four routes are as follows:

route 1: local Preference 2000 and length of (AS _ PATH) 4.

Route 2: local Preference 1000 and length of (AS _ PATH) 2.

Route 3: local Preference 1000 and length of (AS _ PATH) 2.

Route 4: local Preference 1000 and length of (AS _ PATH) 2.

Firstly, judging according to the Local priority, comparing the Local preferences of the four routes to know that the route 2, the route 3 and the route 4 can be selected according to R2, and then judging the route 2, the route 3 and the route 4 according to R4, wherein the route 2 is the same as the route 3, that is, after judging according to the first-level rule, M is equal to 3 routes.

It is understood that Local Preference is Local _ PREF (sometimes abbreviated as LP) as described above, and should be understood to have the same meaning.

S205: and the first network equipment selects the M routes according to the second-level rule until one route is selected.

In the embodiment of the present application, the second-level rule may also be selected by the user, in a similar manner to the first-level rule, and reference may be made to the description of obtaining the first-level rule.

The second-level rule comprises at least one rule, and the second-level rule is different from the first-level rule. For example, it is assumed that the first-level rules include rules R1 and R2, and the second-level rules may include rules R2 and R4, but it is understood that the second-level rules may also include rules R3 and R4, which is not limited in this application.

In the above examples, R1, R2, R3, and R4 are the rules of R1, R2, R3, and R4 described above.

In the embodiment of the present application, when there is one and only one rule in the second-level rules, the determination is continued on the M routes according to the unique rule. When the second-level rule includes a plurality of rules, the M routes may be selected according to a logical relationship between the plurality of rules included in the second-level rule.

Also taking the example in step S204, three routes, route 2, route 3, and route 4, are obtained after the determination according to the first-level rule in step S204.

First, taking an example that the second-level rule includes one rule, assume that the second-level rule is: r13: the route with the lowest delay is selected. Assume the delay of route 2 is: 2s, if the delay of the route 3 is 1s and the delay of the route 4 is 2s, then the delay of the route 3 is lower, so that the finally selected route is the route 3.

Then, for example, the second-level rule includes a plurality of rules, it is assumed that the second-level rule includes: r5: sequentially selecting routes with ORIGIN attributes of IGP, EGP and Incomplte; r13: the route with the lowest delay is selected. And the logical relationship among the plurality of rules included in the second level rule is: the judgment is preferably made according to R5, and then according to R13.

For example, suppose the ORIGIN attribute of route 2 is IGP, the delay is 1s, the ORIGIN attribute of route 3 is EGP, the delay is 2s, the ORIGIN attribute of route 4 is IGP, and the delay is 2 s. By comparison, the selected routes are route 2 and route 4 after being judged according to R5, and then route 2 and route 4 are selected according to R13, and the time delay of route 2 is lower, so that the finally selected route is route 2.

In some embodiments of the present application, assuming that the first-level rules include some of the rules in R13 to R16 and R1 to R12 described above, when the first network device determines M routes according to the first-level rules and then selects the M routes according to the second-level rules, the M routes may be selected according to the remaining rules of R1 to R12 excluding the first-level rules. For example, assuming that the first level rules include R2, R4, and R13 through R16, the second level rules may include R1, R3, R5 through R12.

Of course, it is understood that the same rule in this application may occur in both the first level rule and the second level rule, provided that at least one of the two levels of rules includes multiple rules. For example, the first level rule is R2, and the second level rule is: r2, R4; or the first-level rules are R1 and R2, and the second-level rules are: r1, R2, R4; or the first-level rules are R1, R2, R3, and the second-level rules are: r3, R4, R5 and the like.

It should be noted that, in the embodiment of the present application, the first-level rule, the second-level rule, and the logical relationship among the plurality of rules are configured by a user, so that when the first-level rule or the second rule includes the plurality of rules, the logical relationship among the rules may exist in a plurality of different combinations, which is not illustrated herein.

Further, in this embodiment of the application, when the parameter information included in the rule is AS-Path, the user may configure to open an AS number deduplication function.

In a possible implementation manner, a user may add a radio box to the graphical interface, for example, the content in the radio box may be "open AS number deduplication" or "AS number deduplication," and the user may open the function by clicking the radio box, so that when the network device selects a route according to the first-level rule or the second-level rule, if a parameter included in the rule is AS-Path, it may be determined that the user opens the autonomous system AS number deduplication function. Of course, it is understood that if the parameter AS-Path is not included in the rule, the AS number deduplication function may not be turned on.

In yet another possible implementation, the user may add a configuration command to the command line interface, where the configuration command is used to select whether to turn on the function. Illustratively, this function may be implemented in the form of a switch.

It should be noted that, in the embodiment of the present application, the manner of opening the AS number deduplication function is not limited to the above manner, and for example, the AS number deduplication function may also be opened by other manners such AS a voice command, which is not limited in this application.

In the embodiment of the application, the AS number duplication elimination function is started, so that the situation that the AS-Path is too long due to the repeated AS numbers, the misjudgment is caused, and the routing is rejected can be avoided.

Fig. 3 shows a functional block diagram of a network device. The network device 300 may include: an acquisition unit 301, a first selection unit 302, and a second selection unit 303.

The acquiring unit 302 is configured to acquire N routes of L routes received based on a border gateway protocol BGP, and acquire a first-level rule and a second-level rule selected by a user; the first level of rules comprises at least one rule; l, N is a positive integer; the second level rule includes at least one rule, and the second level rule is different from the first level rule.

A first selecting unit 302, configured to select, according to the first-level rule, the N routes acquired by the acquiring unit 301, so as to obtain M routes; the M is a positive integer greater than 1, and the M < N.

And a second selecting unit, configured to select, according to a second-level rule, the M routes obtained by the first selecting unit 302 until a route is selected.

In one possible design, the N routes have the same route prefix.

In one possible design, the obtaining unit 301 is further configured to:

the first selecting unit 302 is specifically configured to select the N routes according to the first-level rule as follows:

the N routes are selected based on the logical relationship acquired by the acquisition unit 301.

In one possible design, the obtaining unit 301 is further configured to: acquiring a plurality of rules stored in advance, and displaying the plurality of rules by a graphical interface;

the obtaining unit 301 is specifically configured to obtain the first-level rule selected by the user as follows: and determining the first-level rule selected by the user according to a selection instruction input by the user on the graphical interface.

In one possible design, the obtaining unit 301 is specifically configured to obtain the logical relationship between the multiple rules included in the first-level rule as follows:

In a possible design, the second selecting unit 303 is specifically configured to select the M routes according to a second-level rule as follows:

and selecting the M routes according to the logic relationship among the plurality of rules included in the second-level rule.

In one possible design, the second level rule includes: selecting a route with the maximum Preferred-value of the protocol; selecting a route with the highest local priority; selecting an aggregation route; selecting the shortest AS path of the autonomous system; selecting ORIGIN attributes as IGP, EGP, Incomplete; selecting a multi-outlet difference MED value to be the lowest; selecting the sources of EBGP, alliance and IBGP; selecting the Next HOP with the lowest Next _ HOP metric value; selecting the CLUSTER LIST CLUSTER _ LIST with the shortest length; selecting origin number ORIGINATOR _ ID minimum; selecting the Router with the smallest Router number Router ID; and selecting the route issued by the peer with the minimum Internet protocol IP address.

All relevant contents of each step related to the above method embodiment may be referred to the functional description of the corresponding functional module, and are not described herein again.

The division of the modules in the embodiments of the present application is schematic, and only one logical function division is provided, and in actual implementation, there may be another division manner, and in addition, each functional module in each embodiment of the present application may be integrated in one processor, may also exist alone physically, or may also be integrated in one module by two or more modules. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode.

As shown in fig. 4, for a border gateway protocol-based routing apparatus 400 provided in this embodiment of the present application, the apparatus 400 includes at least one processor 402, configured to implement or support the apparatus 400 to implement the functions of the first selecting unit and the second selecting unit shown in fig. 3 provided in this embodiment of the present application. For example, the processor 402 may select N routes acquired by the acquiring unit according to the first-level rule to obtain M routes, and the like, which refer to the detailed description in the method example and are not described herein again.

The apparatus 400 may also include at least one memory 401 for storing program instructions. For example, the memory 401 may be configured to store a first-level rule, a second-level rule, a logical relationship between multiple rules, and the like, which is specifically described in the detailed description of the method example and is not described herein again. The memory 401 is coupled to the processor 402. The coupling in the embodiments of the present application is an indirect coupling or a communication connection between devices, units or modules, and may be an electrical, mechanical or other form for information interaction between the devices, units or modules. The processor 402 may cooperate with the memory 401. Processor 402 may execute program instructions and/or data stored in memory 401. At least one of the at least one memory may be included in the processor.

Apparatus 400 may also include a communication interface 403 for communicating with other devices over a transmission medium. The processor 402 may transceive data using the communication interface 403.

The present application does not limit the specific connection medium between the communication interface 403, the processor 402, and the memory 401. In fig. 4, the memory 401, the processor 402, and the communication interface 403 are connected by a bus 404, which is indicated by a thick line in fig. 4. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 4, but this does not indicate only one bus or one type of bus.

In the embodiments of the present application, the processor 402 may be a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof, and may implement or perform the methods, steps, and logic blocks disclosed in the embodiments of the present application. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be implemented directly by a hardware processor, or by a combination of hardware and software modules in a processor.

In the embodiment of the present application, the memory 401 may be a non-volatile memory, such as a Hard Disk Drive (HDD) or a solid-state drive (SSD), and may also be a volatile memory (RAM). The memory is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory in the embodiments of the present application may also be circuitry or any other device capable of performing the storage function to store the program instructions.

Optionally, the computer-executable instructions in the embodiments of the present application may also be referred to as application program codes, which are not specifically limited in the embodiments of the present application.

Also provided in embodiments herein is a computer-readable storage medium comprising instructions that, when executed on a computer, cause the computer to perform the method of the embodiment shown in fig. 2.

Also provided in an embodiment of the present application is a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method of the embodiment shown in fig. 2.

The embodiment of the present application further provides a chip, and logic in the chip is used for executing the method of the embodiment shown in fig. 2.

Embodiments of the present application are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by instructions. These instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims

1. A routing method based on a border gateway protocol is characterized by comprising the following steps:

acquiring N routes in L routes received based on a Border Gateway Protocol (BGP), and acquiring a first-level rule and a second-level rule selected by a user; the first level of rules comprises at least one rule; l, N is a positive integer; the second-level rule comprises at least one rule, and the second-level rule is different from the first-level rule;

selecting the N routes according to the first-level rule to obtain M routes; m is a positive integer greater than 1, and M < N;

and selecting the M routes according to a second-level rule until one route is selected.

2. The method of claim 1, wherein the N routes have the same route prefix.

3. The method of claim 1 or 2, wherein when a plurality of rules are included in the first-level rule, selecting the N routes according to the first-level rule comprises:

acquiring a logic relationship among a plurality of rules included in the first-level rule;

selecting the N routes based on the logical relationship.

4. The method of any of claims 1 to 3, wherein prior to obtaining the user selected first level rule, the method further comprises:

acquiring a plurality of rules stored in advance, and displaying the plurality of rules by a graphical interface;

the obtaining of the first-level rule selected by the user comprises:

5. The method of claim 3, wherein obtaining logical relationships between a plurality of rules included in the first level rule comprises:

6. The method of claim 1, wherein selecting the M routes according to a second level rule comprises:

7. The method of any of claims 1 to 6, further comprising:

and when the parameter information included in the rule is the path length, determining to start an AS number duplicate removal function of the autonomous system.

8. The method of any of claims 1 to 5, wherein the first level rules comprise:

selecting a route with the minimum time delay;

selecting a route with the least packet loss;

selecting a route with the lowest route cost;

the route with the lowest line utilization is selected.

9. The method of claim 1 or 6, wherein the second level rule comprises:

selecting a route with the maximum Preferred-value of the protocol;

selecting a route with the highest local priority;

selecting an aggregation route;

selecting the shortest AS path of the autonomous system;

selecting ORIGIN attribute as interior gateway protocol IGP, exterior gateway protocol EGP, Incomplite;

selecting a multi-outlet difference MED value to be the lowest;

selecting the sources of EBGP, alliance and IBGP;

selecting the Next HOP with the lowest Next _ HOP metric value;

selecting the CLUSTER LIST CLUSTER _ LIST with the shortest length;

selecting origin number ORIGINATOR _ ID minimum;

selecting the Router with the smallest Router number Router ID;

and selecting the route issued by the peer with the minimum Internet protocol IP address.

10. A network device, comprising:

the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring N routes in L routes received based on a Border Gateway Protocol (BGP) and acquiring a first-level rule and a second-level rule selected by a user; the first level of rules comprises at least one rule; l, N is a positive integer; the second-level rule comprises at least one rule, and the second-level rule is different from the first-level rule;

the first selection unit is used for selecting the N routes acquired by the acquisition unit according to the first-level rule to obtain M routes; m is a positive integer greater than 1, and M < N;

and the second selection unit is used for selecting the M routes obtained by the first selection unit according to a second-level rule until one route is selected.

11. The network device of claim 10, wherein the N routes have the same route prefix.

12. The network device of claim 10 or 11, wherein the obtaining unit is further configured to:

13. The network device of claims 10 to 12, wherein the obtaining unit is further configured to: acquiring a plurality of rules stored in advance, and displaying the plurality of rules by a graphical interface;

14. The network device according to claim 12, wherein the obtaining unit is specifically configured to obtain the logical relationship between the plurality of rules included in the first-level rule as follows:

15. The network device according to claim 10, wherein the second selecting unit is specifically configured to select the M routes according to a second-level rule as follows:

16. The network device of any of claims 10 to 15, wherein the method further comprises:

17. The network device of any of claims 10 to 14, wherein the first level rules comprise:

selecting a route with the minimum time delay;

selecting a route with the least packet loss;

selecting a route with the lowest route cost;

the route with the lowest line utilization is selected.

18. The network device of claim 10 or 15, wherein the second level rule comprises:

selecting a route with the maximum Preferred-value of the protocol;

selecting a route with the highest local priority;

selecting an aggregation route;

selecting the shortest AS path of the autonomous system;

selecting ORIGIN attributes as IGP, EGP, Incomplete;

selecting a multi-outlet difference MED value to be the lowest;

selecting the sources of EBGP, alliance and IBGP;

selecting the Next HOP with the lowest Next _ HOP metric value;

selecting the CLUSTER LIST CLUSTER _ LIST with the shortest length;

selecting origin number ORIGINATOR _ ID minimum;

selecting the Router with the smallest Router number Router ID;

19. A border gateway protocol based routing apparatus, comprising: a memory, a communication interface, and a processor;

the memory stores computer instructions;

the communication interface is used for receiving and sending data;

the processor is configured to execute computer instructions stored by the memory to cause the apparatus to perform the method of any of claims 1-9.

20. A computer-readable storage medium storing computer instructions which, when executed by a computer, cause the computer to perform the method of any one of claims 1-9.

21. A computer program product, characterized in that the computer program product comprises computer instructions which, when executed by a computer, cause the computer to carry out the method according to any one of claims 1-9.