WO2022121079A1 - Link aggregation method for traffic forwarding device and traffic forwarding device - Google Patents

Abstract

Disclosed in the present application are a link aggregation method for a traffic forwarding device and the traffic forwarding device. The traffic forwarding device has at least two links to be selected, and each link has a respective priority. The method comprises: calculating a historical packet flow rate at which the traffic forwarding device forwards packets to the at least two links within a current cycle, and on the basis of the packet flow rate, predicting a packet flow rate corresponding to the next cycle; comparing the packet flow rate with restricted bandwidths of the links in sequence according to the priorities, and according to the comparison result, determining a traffic distribution ratio of the links in the next cycle; and forwarding the packets to the links according to the traffic distribution ratio within the next cycle.

Description

A link aggregation method of a traffic forwarding device and a traffic forwarding device

cross reference

This application claims the priority of the Chinese patent application entitled "A Link Aggregation Method for Traffic Forwarding Device and Traffic Forwarding Device", filed on December 11, 2020, with application number 202011459626.0, which is incorporated by reference in its entirety this application.

technical field

The present application relates to the field of Internet technologies, and in particular, to a link aggregation method of a traffic forwarding device and a traffic forwarding device.

Background technique

In the current link aggregation technology, packets can usually be distributed among multiple links according to the load balancing strategy, so that the load of each link can be effectively utilized and the waste of idle resources can be avoided.

When link aggregation is implemented by using the load balancing strategy, the packets to be forwarded can be distributed to each link in turn by means of packet polling; the packets with the same hash characteristics can also be distributed according to the hash characteristics. The message is forwarded to the same link.

However, this link aggregation technology based on load balancing usually has a premise that the communication quality of each link is equivalent. However, in practical applications, this precondition is difficult to guarantee, resulting in poor link aggregation effect.

SUMMARY OF THE INVENTION

The purpose of the present application is to provide a link aggregation method of a traffic forwarding device and a traffic forwarding device, which can improve the effect of link aggregation.

In order to achieve the above purpose, an embodiment of the present application provides a link aggregation method for a traffic forwarding device, where the traffic forwarding device has at least two links to be selected, each of the links has its own priority, and the The method includes: calculating the historical packet flow rate of the packets forwarded by the traffic forwarding device to the at least two links in the current period, and predicting the packet flow rate corresponding to the next period based on the packet flow rate; The priority compares the packet flow rate with the limited bandwidth of each link in turn, and determines the traffic distribution ratio of each link in the next cycle according to the comparison result; in the next cycle, according to The traffic distribution ratio forwards packets to each of the links.

In order to achieve the above object, an embodiment of the present application further provides a traffic forwarding device, the traffic forwarding device includes a processor and a memory, and the memory is used to store a computer program, and when the computer program is executed by the processor, the The above link aggregation method.

It can be seen from the above that, in the technical solutions provided by one or more embodiments of the present application, multiple links to be selected may have respective priorities, and the priorities may represent the quality of link communication. During link aggregation, you can first calculate the packet flow rate of the packets forwarded by these links in the current period. Then, according to the packet flow rate in the current period, the packet forwarding in the next period can be dynamically adjusted. Specifically, the calculated packet flow rate may be compared with the limited bandwidth of each link in sequence according to the priority order. Among them, the limited bandwidth can represent the maximum packet flow rate when the link transmits packets. The comparison results can indicate whether each link can sufficiently handle the packet flow rate in the current period. By comparing the results, the traffic distribution ratio of each link in the next cycle can be determined. Since the comparison is performed according to the priority, packets with higher communication quality can be preferentially transmitted in the next cycle. In this way, when the packets of the next cycle are forwarded according to the traffic distribution ratio, the link with higher priority can provide sufficient data transmission resources, so that when dealing with the link with uneven communication quality, it can make full use of the High-quality resources for links with better communication quality, thereby improving the effect of link aggregation.

In an embodiment, the packet flow rate is calculated in the following manner: identifying the duration of the current period, and counting the total amount of packets forwarded by the traffic forwarding device to the at least two links in the current period. ; Use the ratio of the total amount of the packets to the duration as the packet flow rate.

In an embodiment, sequentially comparing the statistics of the packet flow rate with the limited bandwidth of each link according to the priority includes: sorting the links according to the priority, and sorting all the links according to the priority. The packet flow rate is sequentially compared with the limited bandwidth of each of the links; for the current link in the comparison process, determine the redundant flow rate of the packet flow rate and the limit bandwidth of the current link. relationship, and according to the size relationship, it is judged whether it is necessary to compare with the limited bandwidth of the next link.

In one embodiment, judging whether it is necessary to compare with the limited bandwidth of the next link according to the magnitude relationship includes: if the redundant flow rate of the packet flow rate is less than or equal to the limited bandwidth of the current link, stopping the comparison. process; if the redundant flow rate of the message flow rate is greater than the limited bandwidth of the current link, update the redundant flow rate of the message flow rate, and compare the updated redundant flow rate with the limited bandwidth of the next link. Compared.

In one embodiment, the method further includes: if the updated redundant flow rate is less than or equal to the limited bandwidth of the next link, stopping the comparison process; if the updated redundant flow rate is greater than the next link The limited bandwidth of the link, the redundant flow rate of the packet flow rate is updated again, and the redundant flow rate updated again is compared with the limited bandwidth of the next link.

In an embodiment, the comparison result is used to represent the deployment flow rate that each link undertakes from the packet flow rate; determining the traffic distribution ratio of each link in the next cycle according to the comparison result includes: The proportion of the provisioning flow rate corresponding to each link is used as the traffic distribution proportion of each link in the next cycle.

In one embodiment, the deployment flow rate is determined in the following manner: for the current link in the comparison process, if the current redundant flow rate of the packet flow rate is less than or equal to the limited bandwidth of the current link, the current The redundant flow rate of the packet flow rate is used as the deployment flow rate of the current link; if the current redundant flow rate of the packet flow rate is greater than the limited bandwidth of the current link, the limited bandwidth of the current link is used as the current link. Describes the provisioning flow rate of the current link.

In an embodiment, each of the links has its own token bucket; when forwarding packets to each of the links according to the traffic distribution ratio, the method further includes: when preparing to send the current packet When forwarding to the target link, determine whether the current number of tokens remaining in the token bucket of the target link is greater than or equal to the data volume of the current packet; if so, forward the current packet to the target link; if not, select a link from other links whose priority is lower than the target link, and forward the current packet to the selected link.

In one embodiment, selecting a link among other links with a priority lower than the target link includes: searching for tokens in order of priority for other links with a priority lower than the target link The number of tokens currently remaining in the bucket is greater than or equal to the link of the data volume of the current packet, and the first link found is used as the selected link.

In an embodiment, the method further includes: if a link that meets the requirements cannot be found after traversing each of the other links, forwarding the current packet to the link with the lowest priority.

In an embodiment, the packets forwarded by the traffic forwarding device in the current period are classified according to the packet type, and each type of packet has its own priority; the method further includes: according to the priority of the packet Sort various types of packets, and after determining the traffic distribution ratio of the current type of packets in each of the links in the sorting result, then determine the next type of packets in the sorting result in each link. The proportion of traffic distribution in the link.

In one embodiment, when calculating the packet flow rate, according to the packet type, separately calculate the packet flow rate of the packets forwarded to the at least two links for various types of packets in the current cycle, so as to calculate the packet flow rate according to the separately calculated packet flow rate. The packet flow rate of the forwarded packets determines the traffic distribution ratio of various types of packets in each of the links in the next period.

In an embodiment, determining the traffic distribution ratio of various types of packets in each of the links in the next cycle includes: for the current type of packets, identifying the existence of the next cycle in each of the links. A link with redundant bandwidth, and by comparing the packet flow rate of the current type of packet with the identified redundant bandwidth of each link, to determine the next packet of the current type according to the comparison result. The proportion of traffic distribution in each of the links in the period.

Description of drawings

In order to illustrate the technical solutions in the embodiments of the present application more clearly, the following briefly introduces the drawings that are used in the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present application. For those of ordinary skill in the art, other drawings can also be obtained from these drawings without creative effort.

1 is a schematic diagram of a system for traffic forwarding in an embodiment of the present application;

FIG. 2 is a schematic diagram of steps of a link aggregation method in an embodiment of the present application;

FIG. 3 is a schematic structural diagram of a traffic forwarding device in an embodiment of the present application.

Detailed ways

In order to make the objectives, technical solutions and advantages of the present application clearer, the technical solutions of the present application will be clearly and completely described below with reference to the specific embodiments of the present application and the corresponding drawings. Obviously, the described embodiments are only a part of the embodiments of the present application, but not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present application.

The present application provides a link aggregation method for a traffic forwarding device, where the traffic forwarding device may be a device responsible for packet forwarding under different network architectures. For example, the traffic forwarding device may be a switch in a layer-2 network architecture, or a routing device in a layer-3 network architecture.

In this application, the traffic forwarding device may have at least two links to be selected, and the at least two links may be responsible for transmitting data packets forwarded by the traffic forwarding device. For example, in Figure 1, the client needs to send a data packet to the server, which needs to be relayed through a router. The router may then be the above-mentioned traffic forwarding device. The router can communicate with the server through two links, and the router can flexibly forward the data packets sent by the client to the two links according to the link aggregation method provided in this application, so as to pass the two links. The link transmits data packets to the server.

In one embodiment, multiple links to be selected may have different priorities, and the priorities may be set according to different service requirements. For example, in a scenario requiring high communication quality, the priorities may be It is determined based on the communication quality. In scenarios where cost control is important, the priority can be determined based on cost calculation. Specifically, it can be determined by one or more of parameters such as packet loss rate, delay, cost, and bandwidth. A combination of each link is used to characterize, and the specific determination method is not limited in this application, as long as the priority of each link can be determined. In this way, each link can have its own priority, wherein a higher priority can indicate a better adaptation to the requirements of a service scenario, for example, better communication quality.

Referring to FIG. 2 , the link aggregation method provided by an embodiment of the present application may include the following steps.

S1: Calculate the historical packet flow rate of the packets forwarded by the traffic forwarding device to the at least two links in the current period, and predict the packet flow rate corresponding to the next period based on the historical packet flow rate.

In this embodiment, the link aggregation solution may be a dynamic process that is constantly adjusted. The adjustment period can be preset, for example, it can be adjusted every 500ms. The preset adjustment period can be stored in the traffic forwarding device, so that the traffic forwarding device can obtain the total amount of packets forwarded by the traffic forwarding device to these links in the current cycle according to the duration of the cycle, and based on the packets in the current cycle The total amount predicts the total amount of packets in the next cycle, and then determines the amount of packets that each link is responsible for in the next cycle according to the predicted total amount of packets.

Specifically, at the end of each period, the traffic forwarding device may count the total amount of packets forwarded to the at least two links in the current period. The total amount of the packets can be represented by the total length of the packets. For example, in the current period, the traffic forwarding device forwards a total of 10M packets to the above at least two links. Then, by identifying the duration of the current cycle, the traffic forwarding device can use the ratio of the total amount of packets to the duration as the packet flow rate of the current cycle. For example, if the current cycle is 500ms, and the traffic forwarding device forwards a total of 10M packets to the above at least two links, the packet flow rate in the current cycle can be 20Mbps.

Similarly, the traffic forwarding device can predict the packet flow rate of the next period according to the packet flow rate of the current period. In this embodiment, the predicted packet flow rate of the next period is the same as the packet flow rate of the current period. , while in other embodiments of the present application, the calculation may be performed based on the predicted parameters and the message flow rate of the current cycle, so as to obtain the predicted value of the message flow of the next cycle. In one implementation, the prediction parameter may be obtained based on the change trend of the flow rate of multiple historical periods, specifically, the change amount of the packet flow rate of the current period and the previous period (or multiple consecutive periods) of the current period may be calculated. , based on the amount of change to predict the amount of change in the next cycle, and then calculate according to the predicted amount of change and the packet flow rate of the current cycle to obtain the packet flow rate of the next cycle. For example, the packet flow rate of the current cycle is 20Mbps, Compared with the flow rate of the previous cycle, the flow rate has increased by 10%. Based on this, the value of the prediction parameter can be set to 1.1, multiplied by the packet flow rate of the current period, and the packet flow rate of the next period is 20*1.1=22Mbps, which can be It is understood that in the calculation process, the weight value and the change constant can also be set to optimize the prediction result; in another implementation, the prediction parameter can be the historical flow rate change trend corresponding to the time of the next cycle. Specifically, it can be based on The rate of change of the packet flow rate in each time period can be obtained by analyzing the historical traffic data, so that the predicted packet rate of the next period can be obtained based on the rate of change corresponding to the time period of the next period and the packet flow rate of the current period.

S3: Compare the packet flow rate with the limited bandwidth of each of the links in turn according to the priority, and determine the traffic distribution ratio of each of the links in the next cycle according to the comparison result.

In this embodiment, each link may have a limited bandwidth, and the limited bandwidth may represent the highest packet flow rate when the link transmits packets. Generally speaking, the unit of the limited bandwidth may be the same as the unit of the packet flow rate calculated in step S1. For example, there are currently two links, the limited bandwidth of the first link may be 15 Mbps, and the limited bandwidth of the second link may be 10 Mbps.

In this embodiment, when determining the packet forwarding policy for the next period, the calculated packet flow rate may be sequentially compared with the limited bandwidth of each link according to the priority of the link. Specifically, in order to allow links with higher communication quality to allocate more traffic in the next cycle, the links can be sorted in order of priority from high to low, and then the packet flow rates can be sorted in order. Compare with the limited bandwidth of each link in turn.

First, the packet flow rate can be compared with the limited bandwidth of the link with the highest priority. For example, the packet flow rate is 20 Mbps, and the limited bandwidth of link 1 with the highest priority is 15 Mbps. At this time, since the packet flow rate is not allocated, the redundant flow rate of the packet flow rate may be 20 Mbps, wherein the redundant flow rate may represent the flow rate that is not allocated in the packet flow rate. It can be seen that the current redundant flow rate of the packet flow rate of 20 Mbps is greater than the limited bandwidth of link 1, which is 15 Mbps, which means that in the next cycle, the limited bandwidth of link 1 can be full, and the provisioning flow rate allocated to link 1 can be 15 Mbps. . At this time, since 15 Mbps of the redundant flow rate has been allocated to link 1, the redundant flow rate of the packet flow rate needs to be updated, and the updated redundant flow rate is only 5 Mbps. Next, the updated redundant flow rate can be compared with the limited bandwidth of link 2 with lower priority. It can be seen that the updated redundant flow rate is less than the limited bandwidth of link 2. At this time, all the remaining redundant flow rates can be allocated to link 2 as the deployment flow rate, and the flow rate allocation can be completed, thereby stopping the comparison process.

As can be seen from the above description, for the current link in the comparison process (the current link is the link currently undergoing flow rate comparison), the redundant flow rate of the current packet flow rate and the limited bandwidth of the current link can be determined. relationship, and according to the magnitude relationship, it can be judged whether it is necessary to compare with the limited bandwidth of the next link. For example, if the redundant flow rate of the packet flow rate is less than or equal to the limited bandwidth of the current link, all the redundant flow rates of the packet flow rate can be allocated to the current link, and the comparison process is stopped. However, if the redundant flow rate of the packet flow rate is greater than the limited bandwidth of the current link, after the corresponding provisioned flow rate is allocated to the current link, the redundant flow rate of the packet flow rate needs to be updated, and the updated redundant flow rate needs to be updated. Compare with the limited bandwidth of the next slightly lower priority link.

Similarly, when comparing the updated redundant flow rate with the limit bandwidth of the next link, if the updated redundant flow rate is less than or equal to the limit bandwidth of the next link, then the updated redundant flow rate can be compared to the limit bandwidth of the next link. All are assigned to the next link and the comparison process is stopped. However, if the updated redundant flow rate is still greater than the limited bandwidth of the next link, after the provisioned flow rate is allocated to the next link, the redundant flow rate of the packet flow rate can be updated again, and the updated redundant flow rate can be updated again. The remaining flow rate is compared with the limited bandwidth of the next link. By analogy, until the redundant flow rate of the packet flow rate is allocated or all links are traversed. It is worth noting that if there are still redundant flow rates after traversing all the links, the traffic forwarding device can send a request for a new link to the management device, so that the management device can add a new link to the traffic forwarding device in time. road.

It can be seen from the above description that when determining the allocation flow rate of each link, for the current link in the comparison process, if the redundant flow rate of the current packet flow rate is less than or equal to the limited bandwidth of the current link, the current packet flow rate can be The redundant flow rate of the flow rate is all used as the deployment flow rate of the current link. However, if the redundant flow rate of the current packet flow rate is greater than the limited bandwidth of the current link, the limited bandwidth of the current link can be used as the provisioned flow rate of the current link, and the redundant flow rate of the packet flow rate can be updated for the following steps. a comparison.

In this embodiment, after the comparison process is completed, the comparison result can be used to characterize the deployment flow rate assumed by each link from the packet flow rate. In this way, the proportion of the allocated flow rate corresponding to each link can be used as the traffic distribution proportion of each link in the next cycle. For example, the above-mentioned deployment flow rate of link 1 is 15Mbps (that is, the limited bandwidth of link 1), and the deployment flow rate of link 2 is 5Mbps, then the traffic distribution ratio of these two links in the next cycle can be 3:1.

S5: In the next period, forward packets to each of the links according to the traffic distribution ratio.

In this embodiment, after determining the traffic distribution ratio of each link, the traffic forwarding device can forward packets according to the traffic distribution ratio in the next cycle. For example, if the traffic distribution ratio of link 1 and link 2 is 3:1, in every 4 packets, 3 packets can be forwarded to link 1, and the remaining 1 packet can be forwarded to link 1. The message is forwarded to link 2. It can be seen that during the process of forwarding packets, the traffic forwarding device can forward packets according to the proportion of traffic distribution, so as to ensure that all corresponding links can transmit packets, instead of concentrating packets on a certain link first. To a certain extent, the link with high priority can be prevented from being overloaded or congested.

In practical applications, in order to distinguish the packets of different links, the traffic forwarding device can mark the link ID of the corresponding link in the packet, so that the packets with the same link ID are all forwarded to the same corresponding link . For example, the traffic forwarding device may use the iptables technology to add the preset link identifier of the link in the packet, so as to forward the packet to the corresponding link according to the added preset link identifier.

Through the above method, the flow rate is allocated to each link in the order of priority, so that the link with better communication quality can be preferentially allocated to a sufficient flow rate, so that when packets are forwarded in the next cycle , the transmission resources of the link with better communication quality can be used preferentially to ensure the best link aggregation effect. At the same time, the traffic forwarding device forwards the received packets by referring to the traffic distribution ratio, so that the whole process of the forwarding cycle can be achieved. In each forwarding link, a corresponding proportion of the number of packets will be transmitted, which can avoid the phenomenon that some lines are overloaded while other lines are idle, thus ensuring the transmission rate of the packets.

In one embodiment, considering that the number of packets in different periods may change abruptly, when the number of packets increases suddenly, if the packet forwarding is still performed according to the traffic distribution ratio set in the current period, it may lead to certain problems in the next period. The provisioning flow rate actually undertaken by some links will exceed their own limited bandwidth. In order to avoid this situation, a token bucket can be set for each link in advance based on the token bucket algorithm, and the token bucket can replenish tokens at a certain speed. Whenever a link needs to receive a packet, it can first try to obtain the number of tokens from the corresponding token bucket that matches the data volume of the packet. If the corresponding number of tokens can be obtained, it means that the link can Receive messages. If the token bucket is not enough to provide the corresponding number of tokens, it means that the link cannot receive packets. Generally speaking, the token bucket can replenish tokens at the same rate as the link's limited bandwidth. That is to say, if the limited bandwidth of a link is 10 Mbps, the speed at which the token bucket of the link replenishes tokens can also be 10 Mbps.

In this embodiment, when the current packet is to be forwarded to the target link, it can be determined whether the number of tokens currently remaining in the token bucket of the target link is greater than or equal to the data volume of the current packet. If so, the current packet can be forwarded to the target link. If not, a link may be selected from other links with a lower priority than the target link, and the current packet may be forwarded to the selected link.

Specifically, when a link is reselected, it is still possible to search for a link that meets the requirements in other links in the order of priority from high to low. For other links with a priority lower than the target link, you can search for the link with the number of tokens remaining in the token bucket that is greater than or equal to the data volume of the current packet in the order of priority, and use the first link found. link as the selected link. For example, there are currently 5 links. When the second link is about to receive a packet, it finds that the data volume of the packet is greater than the number of tokens remaining in the token bucket of the second link. In this case, you can Find the link that meets the requirements from the third to fifth links with lower priority than the second link. When comparing according to the priority, it is found that the number of tokens remaining in the token bucket of the fourth link is greater than the data volume of the packet. At this time, the link identifier of the packet can be changed to the fourth link. The link identifier of the link, so that the packet can be forwarded to the fourth link.

In one embodiment, when querying the number of tokens remaining in the token buckets of each link in turn, if the remaining links are traversed and still unable to find a link that meets the requirements, you can directly The current packet is forwarded to the link with the lowest priority, so as to avoid affecting the link with a higher priority. In other embodiments, the link that meets the requirements can be re-searched according to the priority order of the links.

In one embodiment, considering that the traffic forwarded by the traffic forwarding device may have multiple types, different types of traffic may have different priorities themselves. For example, traffic such as games and voice may have a higher priority, while traffic such as text and links may have a slightly lower priority. In this way, when the traffic is forwarded, the traffic with higher priority can be forwarded to the link with better communication quality first. Specifically, various types of packets may be sorted in descending order of priority of the packets, and then, the various types of packets in the sorting result may be processed in order one by one. For example, according to the method in steps S1 to S5, first determine the traffic distribution ratio of the traffic with the highest priority in each link in the next cycle, and then determine the traffic with a slightly lower priority in each link in the next cycle. The proportion of traffic distribution in the road. That is to say, when determining the traffic distribution ratio, it is not determined by mixing all types of traffic together, but after determining the traffic distribution ratio of the current type of packets in each of the links in the sorting result. , and then determine the traffic distribution ratio of the packets of the next type in each of the links in the sorting result.

At the same time, when calculating the packet flow rate, you can also separately calculate the packet flow rate of various types of packets in the current period according to the packet type. The traffic distribution ratio of each cycle in each of the links.

When determining the traffic distribution ratio of various types of packets, for the current type of packets, a link with redundant bandwidth in the next period can be identified in each link. The redundant bandwidth of the link may refer to the idle bandwidth that has not been allocated to traffic in the next cycle. For example, the limited bandwidth of link 1 is 15 Mbps, of which 10 Mbps has been allocated to the traffic with the highest priority. At this time, the redundant bandwidth of link 1 is only 5 Mbps. In this embodiment, by comparing the packet flow rate of the current type of packet with the identified redundant bandwidth of each link, it can be determined according to the comparison result that the current type of packet will be sent to each link in the next cycle. The proportion of traffic distribution in the road. The specific comparison process can refer to the description in step S3.

For example, there are currently three different flows A, B, C, and two different links 1 and 2. The priority of the traffic is sorted according to ABC from high to low, and the priority of the links is from high to low. Low is sorted according to link 1 and link 2. The packet flow rate of traffic A is 5 Mbps, the packet flow rate of traffic B is 8 Mbps, the packet flow rate of traffic C is 3 Mbps, and the limited bandwidth of link 1 and link 2 is 10 Mbps. Periodic flow distribution.

First of all, the traffic A with the highest priority is compared first: since both links 1 and 2 have not yet allocated traffic, all 5Mbps of traffic A can be allocated to link 1, then link 1 has 5Mbps left unallocated, and link 2 10Mbps left unallocated. Secondly, compare the traffic B with the second priority: since there is only 5 Mbps left on link 1, 5 Mbps of traffic B is allocated to link 1, and 3 Mbps is allocated to link 2, that is to say, traffic B should be based on 5:3 traffic The distribution ratio is forwarded to link 1 and link 2. At this time, link 1 still has 0 Mbps unassigned, and link 2 has 7 Mbps unassigned. Then, the traffic C with the lowest priority is compared: Since only link 2 has 7 Mbps left unallocated, all 3 Mbps of traffic C should be sent to link 2.

Finally, when the packet is forwarded in the next cycle, it is still necessary to determine which link to send the packet to based on the number of tokens remaining in the token bucket of each link. This process is consistent with the previous description, and will not be repeated here.

Through the above solution, it can be ensured that a link with a high priority can be preferentially allocated to a packet with a high priority, thereby making full use of better transmission resources. In addition, links with a slightly lower priority can also be used effectively, thereby improving the effect of link aggregation. Combined with the token bucket policy, it can cope with the problem of link overload when traffic bursts, and further improve the stability of link aggregation. In addition, for traffic of different priorities, traffic distribution can be performed independently in sequence, thereby ensuring that high-priority traffic can be preferentially transmitted over links with high-priority.

Referring to FIG. 3 , the present application further provides a traffic forwarding device, the traffic forwarding device includes a processor and a memory, and the memory is used for storing a computer program, and when the computer program is executed by the processor, the above chain is implemented Road aggregation method.

In this application, the memory may include a physical device for storing information, usually after digitizing the information and storing it in a medium using electrical, magnetic or optical methods. The memory can also include: a device that uses electrical energy to store information, such as a random access memory (Random Access Memory, RAM) or a read-only memory (Read-Only Memory, ROM), etc.; a device that uses magnetic energy to store information, such as Hard disk, floppy disk, magnetic tape, magnetic core memory, magnetic bubble memory or U disk; a device that uses optical means to store information, such as compact disc (CD) or digital versatile disc (Digital Versatile Disc, DVD). Of course, there are other ways of memory, such as quantum memory or graphene memory and so on.

In this application, the processor may be implemented in any suitable manner. For example, the processor may take the form of, for example, a microprocessor or a processor and a computer readable medium storing computer readable program code (eg software or firmware) executable by the (micro)processor, logic gates, switches, application specific integrated Circuit (Application Specific Integrated Circuit, ASIC), programmable logic controller and embedded microcontroller form, etc.

It can be seen from the above that, in the technical solutions provided by one or more embodiments of the present application, multiple links to be selected may have respective priorities, and the priorities may represent the quality of link communication. During link aggregation, you can first calculate the packet flow rate of the packets forwarded by these links in the current period. Then, according to the packet flow rate in the current period, the packet forwarding in the next period can be dynamically adjusted. Specifically, the calculated packet flow rate may be compared with the limited bandwidth of each link in sequence according to the priority order. Among them, the limited bandwidth can represent the maximum packet flow rate when the link transmits packets. The comparison results can indicate whether each link can sufficiently handle the packet flow rate in the current period. By comparing the results, the traffic distribution ratio of each link in the next cycle can be determined. Since the comparison is performed according to the priority, packets with higher communication quality can be preferentially transmitted in the next cycle. In this way, when the packets of the next cycle are forwarded according to the traffic distribution ratio, the link with a higher priority can provide sufficient data transmission resources. High-quality resources for links with better communication quality, thereby improving the effect of link aggregation.

Each embodiment in this specification is described in a progressive manner, and the same and similar parts between the various embodiments may be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the embodiments of the traffic forwarding device, reference may be made to the description of the foregoing method embodiments for comparison and explanation.

As will be appreciated by those skilled in the art, the embodiments of the present application may be provided as a method, a system, or a computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may employ one or more computer-usable storage media (including but not limited to magnetic disk storage, Compact Disc Read-Only Memory (CD-ROM), optical storage medium) having computer-usable program code embodied therein etc.) in the form of a computer program product implemented thereon.

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

These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions The apparatus implements the functions specified in the flow or flow of the flowcharts and/or the block or blocks of the block diagrams.

These computer program instructions can also be loaded on a computer or other programmable data processing device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process such that The instructions provide steps for implementing the functions specified in the flow or blocks of the flowcharts and/or the block or blocks of the block diagrams.

In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

Memory may include forms of non-persistent memory, random access memory (RAM) and/or non-volatile memory in computer readable media, such as read only memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.

Computer-readable media includes both persistent and non-permanent, removable and non-removable media, and storage of information may be implemented by any method or technology. Information may be computer readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (Parallel Random Access Memory, PRAM), static random access memory (Static Random Access Memory, SRAM), dynamic random access memory (Dynamic Random Access Memory, DRAM) , other types of random access memory (RAM), read only memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), flash memory or other memory technology, only CD-ROM, Digital Versatile Disc (DVD) or other optical storage, magnetic cassette, magnetic tape-disk storage or other magnetic storage device or any other non-transmission medium that can be used to store data that can be accessed by a computing device information. As defined herein, computer-readable media does not include transitory computer-readable media, such as modulated data signals and carrier waves.

It should also be noted that the terms "comprising", "comprising" or any other variation thereof are intended to encompass a non-exclusive inclusion such that a process, method, article or device comprising a series of elements includes not only those elements, but also Other elements not expressly listed, or inherent to such a process, method, article of manufacture or apparatus are also included. Without further limitation, an element qualified by the phrase "comprising a..." does not preclude the presence of additional identical elements in the process, method, article of manufacture, or device that includes the element.

The above descriptions are merely examples of the present application, and are not intended to limit the present application. Various modifications and variations of this application are possible for those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of this application shall be included within the scope of the claims of this application.

Claims (14)

A link aggregation method for a traffic forwarding device, the traffic forwarding device has at least two links to be selected, each of the links has its own priority, and the method includes: Calculate the historical packet flow rate of the packets forwarded by the traffic forwarding device to the at least two links in the current period, and predict the packet flow rate corresponding to the next period based on the packet flow rate; Compare the packet flow rate with the limited bandwidth of each of the links in turn according to the priority, and determine the traffic distribution ratio of each of the links in the next cycle according to the comparison result; In the next period, packets are forwarded to each of the links according to the traffic distribution ratio. The method of claim 1, wherein the packet flow rate is calculated in the following manner: Identify the duration of the current period, and count the total amount of packets forwarded by the traffic forwarding device to the at least two links in the current period; The ratio of the total amount of packets to the duration is used as the packet flow rate. The method according to claim 1, wherein sequentially comparing the statistics of the packet flow rate with the limited bandwidth of each link according to the priority comprises: Sort each of the links according to priority, and compare the packet flow rate with the limited bandwidth of each of the links in order; For the current link in the comparison process, determine the size relationship between the redundant flow rate of the packet flow rate and the limited bandwidth of the current link, and determine whether it is necessary to perform a comparison with the limited bandwidth of the next link according to the size relationship. Compared. The method according to claim 3, wherein judging whether it is necessary to compare with the limited bandwidth of the next link according to the magnitude relationship comprises: If the redundant flow rate of the packet flow rate is less than or equal to the limited bandwidth of the current link, stop the comparison process; If the redundant flow rate of the packet flow rate is greater than the limited bandwidth of the current link, the redundant flow rate of the packet flow rate is updated, and the updated redundant flow rate is compared with the limited bandwidth of the next link. The method of claim 4, further comprising: If the updated redundant flow rate is less than or equal to the limited bandwidth of the next link, stop the comparison process; If the updated redundant flow rate is greater than the limited bandwidth of the next link, update the redundant flow rate of the packet flow rate again, and compare the updated redundant flow rate with the limited bandwidth of the next link. Compared. The method according to claim 1 or 3, wherein the comparison result is used to represent the deployment flow rate assumed by each link from the packet flow rate; and the comparison result is used to determine the flow rate of each link in the next cycle. The proportion of traffic distribution includes: The proportion of the provisioned flow rate corresponding to each link is taken as the traffic distribution proportion of each link in the next cycle. The method of claim 6, wherein the compounded flow rate is determined in the following manner: For the current link in the comparison process, if the current redundant flow rate of the packet flow rate is less than or equal to the limited bandwidth of the current link, the current redundant flow rate of the packet flow rate is used as the current link's redundant flow rate. adjust the flow rate; If the current redundant flow rate of the packet flow rate is greater than the limited bandwidth of the current link, the limited bandwidth of the current link is used as the provisioned flow rate of the current link. The method according to claim 1, wherein each of the links has its own token bucket; when forwarding packets to each of the links according to the traffic distribution ratio, the method further comprises: When preparing to forward the current message to the target link, determine whether the number of tokens currently remaining in the token bucket of the target link is greater than or equal to the data volume of the current message; If so, forward the current message to the target link; If not, select a link from other links whose priority is lower than the target link, and forward the current packet to the selected link. The method of claim 8, wherein selecting a link among other links having a lower priority than the target link comprises: For other links with a priority lower than the target link, search for links whose current number of tokens remaining in the token bucket is greater than or equal to the data volume of the current packet in the order of priority, and find the The first link of the selected link is selected. The method of claim 9, further comprising: If each of the other links is traversed, a link that meets the requirements cannot be found, and the current packet is forwarded to the link with the lowest priority. The method according to claim 1, wherein the packets forwarded by the traffic forwarding device in the current cycle are classified according to the packet type, and each type of packet has its own priority; the method further comprises: Sort various types of packets according to their priorities, and after determining the traffic distribution ratio of the current type of packets in each link in the sorting result, then determine the next type in the sorting result The traffic distribution ratio of the packets in each of the links. The method according to claim 11, wherein, when calculating the packet flow rate, according to the packet type, the packet flow rate of the packets forwarded to the at least two links for various types of packets in the current period is separately calculated, According to the separately calculated packet flow rate of the forwarded packets, the traffic distribution ratio of various types of packets in each of the links in the next period is determined. The method according to claim 12, wherein determining the traffic distribution ratio of various types of packets in each of the links in the next period comprises: For the current type of packet, identify the link with redundant bandwidth in the next period in each of the links, and compare the packet flow rate of the current type of packet with the identified link of each link. The redundant bandwidths are compared, so as to determine the traffic distribution ratio of the current type of packets in each of the links in the next period according to the comparison result. A traffic forwarding device includes a processor and a memory, wherein the memory is used for storing a computer program, and when the computer program is executed by the processor, the method according to any one of claims 1 to 13 is implemented.

Images