CN115022229A - A Load Sharing Calculation Method Based on Policy Routing - Google Patents

Abstract

The invention relates to the technical field of network communication, and discloses a method for calculating load sharing based on policy routing, comprising the following steps: configuring a plurality of next hop information according to the content of a six-tuple in the policy routing, where the content of the six-tuple includes an inbound interface , source address, destination address, user, service, and application; calculate the load sharing result according to the weight information corresponding to the next hop information and the configured load sharing algorithm. The present invention is used to solve the related problem of policy routing weight sharing. The present invention provides a specific load sharing calculation method for service forwarding when a policy route has multiple exits at the same time, increases the application scenario of the policy route to a certain extent, and can calculate the traffic according to the weights of multiple gateways of the policy route. share the situation.

Description

A Load Sharing Calculation Method Based on Policy Routing

technical field

The present invention relates to the technical field of network communication, in particular, to a method for calculating load sharing based on policy routing, which is used to solve the related problems of policy routing weight sharing.

Background technique

Policy routing is a more flexible packet routing and forwarding mechanism than routing based on the target network. The router will decide how to process the data packet that needs to be routed through the routing map, and the routing map determines the next forwarding router of a data packet. Policy-based routing is a technology that modifies routing information in order to change the path of network traffic, mainly by changing routing attributes (including reachability).

In addition, policy routing is an intelligent balanced policy method. When there are multiple next-hop gateways or outgoing interfaces in policy-based routing, it is necessary to perform load sharing calculation based on the configuration of different next hops, and guide service forwarding according to the calculation results.

So far, policy routing has become more and more widely used, and the application scenarios have also increased. Most of the existing PBR related patents describe the specific implementation of PBR or a single route selection situation. Aiming at this problem, the present invention mainly solves the problem that when there are multiple next-hop gateways in a policy route, the service can be evenly distributed to each gateway according to the relevant configuration, and the traffic sharing is calculated according to the weights of the multiple gateways in the policy route. Happening.

SUMMARY OF THE INVENTION

The purpose of the present invention is to provide a load sharing calculation method based on policy routing, which realizes the function of calculating traffic sharing according to the weights of multiple gateways in policy routing, and has the effect of solving the related problems of policy routing weight sharing.

The present invention is achieved through the following technical solutions: a method for calculating load sharing based on policy routing, comprising the following steps:

Configure multiple next-hop information according to the content of the six-tuple in the policy routing, where the content of the six-tuple includes the inbound interface, the source address, the destination address, the user, the service and the application;

The load sharing result is calculated according to the weight information corresponding to the next hop information and the configured load sharing algorithm.

In order to better implement the present invention, further, the process of configuring multiple next hop information according to the content of the six-tuple in the policy routing includes:

The ingress interface performs the next step of policy routing on the packets coming from the specified network card, and the packets entering from other network cards are forwarded according to the guidance of the destination address;

On the basis that the corresponding ingress interface comes in, the source address and the destination address match the source address and destination address of the packet. If the match is successful, the remaining five-tuple of the policy route will be matched. If the match is unsuccessful, the destination static route or other routes will be used. forward;

After the message is sent from the specified user, the service and application will be matched;

When all the contents of the six-tuple match, it will be forwarded according to the corresponding configured next-hop information.

In order to better implement the present invention, further, the configured load sharing algorithm includes:

Configure multiple next-hop gateways, configure weight values, and multiply the ratio of each configuration weight value to the nth power of 2 to the nth power of 2. Finally, round off the multiplied value shown to complete the load sharing algorithm. .

In order to better realize the present invention, further, the process of calculating the load sharing result includes:

The process of calculating load sharing results includes:

Calculate the weight ratio of gateway configuration items in each next hop information;

Multiply the respective weight ratios with the nth power of 2 in turn, where n=0, n=1, round off the value P obtained by the product; when the rounded value is less than 1, n +1 to start the product again; the rounded value is greater than 1, and the rounded value is recorded as the load sharing ratio W;

Take the absolute value of the difference between the calculated value P and the rounded W;

After completing the calculation of the absolute value of the ratio and difference of all configuration weights, add the values of the difference between P and W obtained by each product. If the sum of the difference is greater than 0.1*n, then recalculate n+1; if the difference is If the sum is less than or equal to 0.1*n, proceed to the next calculation;

The final ratio is the rounded load sharing ratio W.

Compared with the prior art, the present invention has the following advantages and beneficial effects:

(1) The present invention provides a specific load sharing calculation method for service forwarding when a policy route has multiple exits at the same time, and increases the application scenario of policy route to a certain extent;

(2) In the present invention, policy routing has multiple exits. The policy routing can be configured with multiple next-hop exits, and different exits have corresponding weights, and the present invention can calculate the process of load sharing results according to the weight information of multiple gateways.

Description of drawings

The present invention will be further described with reference to the following drawings and embodiments, and all conceptual innovations of the present invention should be regarded as the disclosed content and the protection scope of the present invention.

FIG. 1 is a flowchart of a method for calculating load sharing based on policy routing provided by the present invention.

FIG. 2 is a load sharing algorithm calculation flow of a load sharing calculation method based on policy routing provided by the present invention.

FIG. 3 is a schematic diagram of the specific composition of a six-tuple of a method for calculating load sharing based on policy routing provided by the present invention.

Detailed ways

In order to illustrate the technical solutions of the embodiments of the present invention more clearly, the following will clearly and completely describe the technical solutions of the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. It should be understood that the described embodiments are only Some, but not all, embodiments of the present invention should therefore not be construed as limiting the scope of protection. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative work fall within the protection scope of the present invention.

In the description of the present invention, it should be noted that, unless otherwise expressly specified and limited, the terms "arranged", "connected" and "connected" should be understood in a broad sense, for example, it may be a fixed connection or a detachable connection Connection, or integral connection; it can be mechanical connection or electrical connection; it can also be directly connected, or it can be indirectly connected through an intermediate medium, and it can be internal communication between two components. For those of ordinary skill in the art, the specific meanings of the above terms in the present invention can be understood in specific situations.

Example 1:

A method for calculating load sharing based on policy routing in this embodiment, as shown in Figures 1 to 3, includes the following steps:

Configure multiple next-hop information according to the content of the six-tuple in the policy routing, where the content of the six-tuple includes the inbound interface, the source address, the destination address, the user, the service and the application;

The load sharing result is calculated according to the weight information corresponding to the next hop information and the configured load sharing algorithm.

In this embodiment, in order to solve the problem of service sharing in the case of multiple gateways in the existing policy routing, the present application provides a calculation method of service load sharing under multiple gateways based on the actual application scenario and through the implementation principle of policy routing, In order to solve the problem related to the weight sharing of policy routing. This application proposes a weight sharing calculation method based on policy routing, which is mainly composed of three parts, one is the policy routing component, the other is the calculation process of load sharing, and finally is the specific calculation process of load sharing. According to the weight configuration of different gateways, the final traffic sharing ratio under different gateways is calculated. Policy routing mainly consists of inbound interface, matching item, address, service, application, and next hop information. The specific composition is shown in Figure 3. The selection of 6-tuple can accurately match the incoming packets of the specified ingress interface (NIC), and the load sharing of policy routing can be performed after each matching item is matched.

It should be noted that the six-tuple information given in this application is set according to the information required by the load in the current field, and the six-tuple information can be optimized into other information with the advancement of technology in the field.

Example 2:

This embodiment is further optimized on the basis of Embodiment 1, and the process of configuring multiple next-hop information according to the content of the six-tuple in the policy routing includes:

The ingress interface performs the next step of policy routing on the packets coming from the designated interface, and the packets entering from other interfaces are forwarded according to the guidance of the destination address;

Two NICs on the NE receive incoming packets at the same time, and the incoming packets that do not match the policy route are forwarded directly according to the destination route.

On the basis of the corresponding incoming interface, the source address and the destination address match the source address and destination address of the packet. If the match is successful, the next step of policy routing will be matched. If the match is unsuccessful, the packet will be forwarded according to the destination route.

After the message is sent from the specified user, the service and application will be matched;

When all the contents of the six-tuple match, it will be forwarded according to the corresponding configured next-hop information.

In this embodiment, the inbound interface refers to the next step of policy routing matching on the incoming packets from the designated interface, and the packets incoming from other interfaces are forwarded according to the destination address guidance; the source address and destination address are based on the incoming packets corresponding to the ingress interface. , match the source address and destination address of the packet. If the match is successful, the next step of policy routing will be matched. If the match is unsuccessful, the packet will be forwarded according to the destination route. User means that the packet is sent from a specified user and then serviced. match with the application. Only when all six conditions are matched, forwarding will be performed according to the corresponding configured next hop. The next hop information includes the gateway or outgoing interface for traffic forwarding and the corresponding weight.

The other parts of this embodiment are the same as those of Embodiment 1, and thus are not repeated here.

Example 3:

This embodiment is further optimized on the basis of the foregoing embodiment 1 or 2. When there are multiple next hop information in policy routing, the load of multiple next hops is calculated according to the weight value configured for each next hop. Equilibrium ratio. The specific implementation process is shown in Figure 2. The load sharing algorithm includes configuring multiple next-hop gateways, configuring the weight value ci, and configuring the weight values as c1, c2, and c3 in sequence; the ratio of each configuration weight value to all weight values is multiplied by the nth power of 2. The value is Pi, and Wi is the value obtained by rounding Pi.

The other parts of this embodiment are the same as the above-mentioned Embodiment 1 or 2, and thus are not repeated here.

Example 4:

This embodiment is further optimized on the basis of any of the foregoing Embodiments 1-3, and the process of calculating the load sharing result includes:

Calculate the weight ratio of gateway configuration items in each next hop information;

An example is as follows:

①Three different next hops are configured in the same policy route, the weights are 50, 100, and 150, the ratio is 1:2:3 (c1:c2:c3), and the proportion of each item is 1/6 , 2/6, 3/6;

② Take 2 to the 0th power and multiply it by 1/6 to get 1/6, which is less than 1 after rounding, n+1;

③ Take 2 to the power of 1 and multiply it by 1/6 to get 2/6, which is less than 1 after rounding, n+1;

④ Take 2 to the power of 2 and multiply it by 1/6 to get 2/3 (P1), which is equal to 1 (W1) after rounding, and continue to the next step;

⑤ Use the value 1 obtained by rounding 2/3 in ④, make a difference with 2/3, and take the absolute value to get 1/3 (|P1-W1|);

⑥ Multiply by 2 to the power of 2 with 2/6 and 3/6 respectively, and repeat steps ④⑤, with 1/3 and 0 respectively;

⑦ Add the three calculated values (|Pi-Wi|) to get 2/3;

⑧2/3 is compared with 0.1*4 (2 to the power of 2), 2/3=0.67>0.4, does not meet the requirements, continue to calculate, n+1;

⑨ Multiply 1/6, 2/6, 3/6 by the 3rd power of 2 in turn, and take the difference with the rounded value (1, 3, 4) to get 1/3, 1/3, 0 ;

⑩Use 2/3 of the sum of the differences obtained in ⑨, compared with 0.1*8 (2 to the third power), 2/3<0.8, which meets the requirements;

The final load sharing Wi ratio is: 8*(each ratio Pi) after rounding, namely: 1:3:4;

Multiply the weight ratios with the nth power of 2 in turn, where n=0, n=1, round off the value P obtained by the product; when the rounded value is less than 1, n+1 Start the product again; the rounded value is greater than 1, and the rounded value is recorded as W. No matter what ratio the weight is configured to, the final load sharing ratio is always 2 to the nth power, and the calculation method is rigorous and reliable;

Take the absolute value of the difference between the calculated value P and the rounded W;

After completing the calculation of the absolute value of the ratio and difference of all configuration weights, add the values of the difference between P and W obtained by each product. If the sum of the difference is greater than 0.1*n, then recalculate n+1; if the difference is If the sum is less than or equal to 0.1*n, proceed to the next calculation;

The final ratio is the rounded W ratio.

The other parts of this embodiment are the same as any of the above-mentioned Embodiments 1-3, and thus are not repeated here.

Example 5:

This embodiment is further optimized on the basis of any of the above-mentioned Embodiments 1 to 4. Among the existing policy-routing related patents, mainly the specific implementation method or the specific routing method of policy-based routing, while the single policy-routing There is no corresponding invention for routing or traffic load sharing when there are multiple exits at the same time. The present invention provides a specific load sharing calculation method for service forwarding when a policy route has multiple exits at the same time, and increases the application scenario of the policy route to a certain extent. Different from patent CN201210303955.5 implementing method, device and switching device of policy routing, this patent mainly configures the forwarding traffic exit according to the size of policy priority. This patent mainly calculates traffic sharing according to the weights of multiple gateways in policy routing; different from the method and routing device for load sharing in patent CN201410709183.4, this patent negotiates and determines its own load sharing according to different routing devices in the network information. This patent mainly calculates the traffic sharing situation according to the weight of multiple gateways in policy routing; many other patents are related to the implementation method of policy routing or separate load sharing, while this patent is mainly aimed at the existence of multiple gateways in policy routing. The business load sharing in the case is different from other patent sharing calculations.

The other parts of this embodiment are the same as any of the above-mentioned Embodiments 1-4, and thus are not repeated here.

The above are only preferred embodiments of the present invention, and do not limit the present invention in any form. Any simple modifications and equivalent changes made to the above embodiments according to the technical essence of the present invention fall into the present invention. within the scope of protection.

Claims (4)

1. a load sharing calculation method based on policy routing, is characterized in that, comprises the following steps: Configure multiple next-hop information according to the content of the six-tuple in the policy routing, where the content of the six-tuple includes the inbound interface, the source address, the destination address, the user, the service and the application; The load sharing result is calculated according to the weight information corresponding to the next hop information and the configured load sharing algorithm. 2. The method for calculating load sharing based on policy routing according to claim 1, wherein the process of configuring multiple next hop information according to the content of the six-tuple in the policy routing comprises: The ingress interface performs the next step of policy routing on the packets coming from the specified network card, and the packets entering from other network cards are forwarded according to the guidance of the destination address; On the basis that the corresponding ingress interface comes in, the source address and the destination address match the source address and destination address of the packet. If the match is successful, the remaining five-tuple of the policy route will be matched. If the match is unsuccessful, the destination static route or other routes will be used. forward; After the message is sent from the specified user, the service and application will be matched; When all the contents of the six-tuple match, it will be forwarded according to the corresponding configured next-hop information. 3. The method for calculating load sharing based on policy routing according to claim 1, wherein the configured load sharing algorithm comprises: Configure multiple next-hop gateways, configure weight values, and multiply the ratio of each configuration weight value to the nth power of 2 to the nth power of 2. Finally, round off the multiplied value shown to complete the load sharing algorithm. . 4. The method for calculating load sharing based on policy routing according to any one of claims 1-3, wherein the process of calculating the load sharing result comprises: Calculate the weight ratio of gateway configuration items in each next hop information; Multiply the respective weight ratios with the nth power of 2 in turn, where n=0, n=1, round off the value P obtained by the product; when the rounded value is less than 1, n +1 to start the product again; the rounded value is greater than 1, and the rounded value is recorded as the load sharing ratio W; Take the absolute value of the difference between the calculated value P and the rounded W; After completing the calculation of the absolute value of the ratio and difference of all configuration weights, add the values of the difference between P and W obtained by each product. If the sum of the difference is greater than 0.1*n, then recalculate n+1; if the difference is If the sum is less than or equal to 0.1*n, proceed to the next calculation; The final ratio is the rounded load sharing ratio W.

Images