CN115987763A

CN115987763A - Stream moving method and network equipment

Info

Publication number: CN115987763A
Application number: CN202111198889.5A
Authority: CN
Inventors: 陈义攀; 易鹏; 肖建桥; 张畅
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2021-10-14
Filing date: 2021-10-14
Publication date: 2023-04-18
Also published as: WO2023061119A1

Abstract

The application provides a stream moving method and network equipment. The method can be applied to equipment supporting multiple network cards, and comprises the following steps: when detecting load imbalance of multiple links, the network device may delete at least one flow from the link with higher bandwidth occupancy rate, then redistribute the forwarding link to the deleted flow, and make the load on the multiple links in a balanced state as much as possible through at least one flow shifting. In addition, only part of the streams need to be moved in the application, and all the streams on the link with the high bandwidth occupancy rate do not need to be moved, so that the situation of network blockage can be avoided, and the user experience is improved.

Description

Stream moving method and network equipment

Technical Field

The present application relates to the field of terminal technologies, and in particular, to a stream moving method and a network device.

Background

The network card binding technology is to bind a plurality of physical network cards into a logical network card. For example, when one physical network card is damaged or disconnected, the data packet may be switched to another physical network card in the logical network card to ensure normal transmission of the data packet. Or, a plurality of physical network cards can be used simultaneously for data transmission to realize bandwidth expansion. It should be understood that quintuple information may be included in the packet, and the packet may be divided into at least one stream according to whether the quintuple information is identical.

At present, a stream is generally moved based on a physical network card (or referred to as an interface), for example, when an Ethernet (ETH) interface is disconnected, the stream on the ETH interface may be moved to a wireless fidelity (Wi-Fi) interface, which may ensure normal transmission of a service, but if the data volume is large, the moving time may be long, and a network is stuck.

Disclosure of Invention

The application provides a stream moving method and network equipment, which are used for avoiding the situation that the network is blocked due to the fact that the moving data volume is too large, and improving user experience.

In a first aspect, the present application provides a method for moving a stream. The method can be applied to network equipment supporting multiple network cards. Specifically, the method comprises the following steps: first, the network device determines that the load on the first link and the second link is in a load imbalance state. The first link and the second link are links included in an uplink transmission direction of the network equipment, and the bandwidth occupancy rate of the first link is greater than that of the second link; then, the network device moves N streams from the first link with the higher bandwidth occupancy rate, the total number of the streams currently being transmitted on the first link is M, M, N is a positive integer, and M > N.

Through the technical scheme, the network equipment can move part of the stream from the link with high bandwidth occupancy rate when detecting that the load of the plurality of links is unbalanced, so that the load of the link with high bandwidth occupancy rate can be reduced, and the user experience can be improved while the plurality of links are fully utilized.

In one possible design, the network device determining that the load on the first link and the second link is in a load imbalance state includes:

the network equipment acquires the bandwidth occupancy rate of a first link and the bandwidth occupancy rate of a second link; and if the bandwidth occupancy rate of the first link is determined to be greater than a first set threshold value and the bandwidth occupancy rate of the second link is determined to be less than a second set threshold value, determining that the loads on the first link and the second link are in a load imbalance state.

Through the technical scheme, the network equipment can determine whether the link is in a load unbalance state according to the bandwidth occupancy rate of the link so as to judge whether a flow moving step needs to be carried out.

In one possible design, before the network device moves the N streams from the first link, the method further includes:

the network device determines that a link included in an uplink transmission direction of the own device satisfies a flow moving condition. Wherein the stream migration condition includes at least one of the following conditions: the uplink transmission direction comprises at least two links; the bandwidth occupancy rate of at least one link is greater than a first set threshold value, and the bandwidth occupancy rates of other links are less than a second set threshold value; the link weight of the moved destination link of the flow is greater than the link weight of the moved source link of the flow; the link bandwidth of the link whose bandwidth occupancy rate is the smallest > the total link bandwidth W of the links included in the uplink direction, 0-woven (W) woven fabric (1); the moving time interval of the two adjacent flows is less than or equal to a set value.

Through the technical scheme, the stream moving can be carried out only after the network equipment determines that the link meets the stream moving condition. If the link is in a load imbalance state but the flow migration condition is not satisfied, the flow migration step cannot be executed. This improves the success rate of the flow migration.

In one possible design, before the network device moves the N streams from the first link, the method further includes: the network device determines the number N of flows that need to be moved on the first link.

Through the technical scheme, before the network equipment carries out stream movement, the quantity of the streams moved from the link with the high bandwidth occupancy rate needs to be determined, and then the streams with the corresponding quantity can be moved.

In the embodiment of the present application, the number of streams that need to be moved may be determined in the following two ways:

mode 1: the network equipment acquires the total number M of the current transmitted flows on a first link; then determining the number of the flows with a set proportion, wherein the set proportion is the set proportion of the total number M of the flows currently transmitted on the first link; and finally, the network equipment takes the number of the flows with the set proportion as the number N of the flows needing to be moved on the first link.

That is to say, the number of streams moved by the network device is a certain proportion of the number of streams being transmitted on the current link, for example, 20% of streams are moved, so that the data volume of the moved streams is not large as much as possible, the situation of network congestion is avoided, and the user experience is improved.

Mode 2: the network device determines a number of flows of a set proportion of a total number of flows currently being transmitted on the first link. If the number of the flows with the set proportion is larger than the set threshold value, taking the set threshold value as the number N of the moved flows; and if the number of the flows with the set proportion is smaller than the set threshold value, taking the number of the flows with the set proportion as the number N of the moved flows.

That is to say, after calculating the streams to be moved by a certain proportion, the network device may continue to determine the number of streams that need to be moved finally based on the set threshold, further ensure that the number of streams to be moved does not have a situation of an excessively large data amount, and improve user experience.

In one possible design, before the network device determines that the load on the first link and the second link is in a load imbalance state, the method further includes:

the network device receives a first message sent by the user device, and records a flow corresponding to the first message in a first flow table, wherein the first flow table comprises flow record information forwarded by the network device, the record information comprises quintuple information, a flow receiving port and a flow forwarding port, the first message comprises Q flows, Q is a positive integer, and Q is greater than M.

Through the technical scheme, the network equipment can receive the message sent by the user equipment and then distribute a plurality of streams corresponding to the message to different links, so that the condition of uneven bandwidth occupancy rate on the links, namely the condition of unbalanced load, can occur.

In one possible design, a network device moves N streams from a first link, including:

the network equipment deletes N flows in the first flow table; the network equipment receives a second message sent by the user equipment, and distributes forwarding links to N flows included in the flow corresponding to the second message; the network device moves the N flows according to the distributed forwarding links.

Through the technical scheme, after the network equipment deletes part of the flow from the link with high bandwidth occupancy rate, the bandwidth weight of the link can be changed, and then the network equipment reallocates the link to the flow needing to be moved, so that the flow can be allocated to the link with low bandwidth occupancy rate, and the link load is balanced as much as possible.

In one possible design, the allocating, by the network device, forwarding links to N flows included in the flow corresponding to the second packet includes:

the network device allocates the N flows to the at least two links included in the uplink transmission direction according to the quintuple information of the N flows and the residual bandwidths of the at least two links included in the uplink transmission direction of the network device.

Through the technical scheme, the network equipment can distribute the forwarding links of the flow according to the quintuple information of the flow and the link residual bandwidth, so that the flow is distributed to a plurality of different links as far as possible, and the load balance of the links is ensured as far as possible.

In one possible design, after the network device moves the N streams, the method further includes:

the network equipment determines to move P flows on a first link; the network device moves the total number of the streams currently transmitted on the first link to P streams, wherein L is an integer greater than 0, P is an integer greater than or equal to 0, and L > P, and L < M.

Through the technical scheme, if the network equipment still detects link load imbalance in the next period after shifting the stream once, the stream shifting step is continued. That is, in the present application, the load of the link can be adjusted by at least one flow move. Of course, the fewer the number of transfers of the stream, the better. The number of streams to be transferred may be one or more.

In a second aspect, the present application provides a network device. The network device includes one or more processors; one or more memories; and one or more computer programs; wherein one or more computer programs are stored in the one or more memories, the one or more computer programs comprising instructions which, when executed by the one or more processors, cause the network device to perform the method of any of the first aspects described above and any of the possible designs of the first aspects thereof.

Illustratively, the instructions, when executed by the one or more processors, cause the network device to perform the steps of: determining that loads on a first link and a second link are in a load imbalance state, wherein the first link and the second link are links included in an uplink transmission direction of network equipment, and the bandwidth occupancy rate of the first link is greater than that of the second link; and moving N streams from the first link, wherein the total number of the streams currently transmitted on the first link is M, M, N are positive integers, and M is greater than N.

In a third aspect, the present application further provides a computer-readable storage medium. The computer readable storage medium has stored therein instructions that, when run on a network device, cause the network device to perform the method of the first aspect and any possible design of the first aspect thereof.

In a fourth aspect, embodiments of the present application provide a computer program product. The computer program product, when run on a network device, causes the network device to perform the method of the first aspect of the embodiments of the present application and any one of its possible designs.

For various possible solutions in the second aspect to the fourth aspect and possible technical effects achieved by the various possible solutions, please refer to the technical effect description that can be achieved by the various possible solutions in the first aspect, and details are not described here.

Drawings

Fig. 1 is a schematic view of an application scenario provided in an embodiment of the present application;

fig. 2 is a schematic diagram of data transmission between routers according to an embodiment of the present application;

fig. 3 is a flowchart of a flow moving method according to an embodiment of the present application;

fig. 4 is a flowchart of a stream moving method according to an embodiment of the present application;

fig. 5 is a flowchart of a method for five tuple learning according to an embodiment of the present disclosure;

fig. 6 is a flowchart of a link allocation method according to an embodiment of the present application;

fig. 7 is a schematic diagram of link weights provided in an embodiment of the present application;

fig. 8 is a schematic diagram of a stream moving device according to an embodiment of the present disclosure.

Detailed Description

The terminology used in the following examples is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the specification of this application and the appended claims, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, such as "one or more", unless the context clearly indicates otherwise. It should also be understood that in the following embodiments of the present application, "at least one", "one or more" means one or more than two (including two). The term "and/or" is used to describe an association relationship that associates objects, meaning that three relationships may exist; for example, a and/or B, may represent: a alone, both A and B, and B alone, where A, B may be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.

Reference throughout this specification to "one embodiment" or "some embodiments," or the like, means that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the present application. Thus, appearances of the phrases "in one embodiment," "in some embodiments," "in other embodiments," or the like, in various places throughout this specification are not necessarily all referring to the same embodiment, but rather "one or more but not all embodiments" unless specifically stated otherwise. The terms "comprising," "including," "having," and variations thereof mean "including, but not limited to," unless otherwise specifically stated. The term "coupled" includes both direct and indirect connections, unless otherwise noted.

In the following, the terms "first", "second" are used for descriptive purposes only and are not to be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature.

In the embodiments of the present application, words such as "exemplary" or "for example" are used to mean serving as examples, illustrations or descriptions. Any embodiment or design described herein as "exemplary" or "e.g.," is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present concepts related in a concrete fashion.

The network card binding technology is to bind a plurality of physical network cards (or called as aggregation) into one logical network card so as to realize network card redundancy, bandwidth expansion and load balancing. The network card redundancy means that only one network card works under normal conditions, and other network cards are used as backup network cards. When the working network card fails, other network cards can be used for continuing working. When multiple network cards are used in parallel, the bandwidth may be increased. And in the process of concurrent use of a plurality of network cards, if one network card is disconnected, the data on the disconnected network card can be transferred to other network cards to realize seamless connection of services and ensure normal transmission of the services. In the process of concurrent use of a plurality of network cards, if the bandwidth occupancy rate of one network card is higher and the bandwidth occupancy rate of the other network card is lower, the data part on the network card with the high bandwidth occupancy rate can be transferred to the network card with the low bandwidth occupancy rate, so as to realize load balancing.

At present, the stream moving technology is implemented based on the binding technology, and streams are uniformly distributed to each interface according to a plurality of aggregated network cards (or referred to as interfaces/links) in the binding, so as to maximally utilize the aggregated network card bandwidth. When the interface is disconnected, the stream on the whole interface can be moved to another interface, that is, the current stream movement can only realize the flow movement of the interface.

In view of this, an embodiment of the present application provides a stream moving method, where when a network device supports multiple network cards to be concurrent, a part of streams may be moved from one network card to another network card instead of directly moving all streams on one network card to another network card, so as to improve data transmission efficiency, avoid the problem of network card pause due to an excessively large amount of moved data, and improve user experience.

Exemplarily, fig. 1 illustrates an application scenario of the stream migration method provided in the embodiment of the present application. As shown in fig. 1, the scenario may include a server 11, a master router device (hereinafter, master router) 12, a slave router device (hereinafter, slave router) 13, and a User Device (UD) 14. The slave router 13 and the user equipment 14 may be interconnected through a communication network. Illustratively, the communication network may be a local area network, such as a Wi-Fi hotspot network. The user equipment 14 may include at least one, and at least one user equipment 14 may be connected to the same slave router 13 through a communication network. Of course, at least one user equipment 14 may also be connected to different slave routers 13 via a communication network. The server 11 is an internet server to which the main router can establish a connection. Illustratively, the handset 14 sends a message to the slave router 13, the slave router 13 may forward the message to the master router 12, and then the master router 12 sends the message to the internet server 11.

It should be understood that fig. 1 is only a schematic illustration, and the number of the user equipments 14 and the number of the slave routers 13 in the embodiment of the present application are not particularly limited.

It should be noted that, in the embodiment of the present application, the router supports multiple network cards, that is, when forwarding a message between different routers, the message may be forwarded through multiple links. And the router can aggregate the ports of multiple links on the device of the router, which can reach the next router, into a virtual Bonding port. Namely, the Bonding port is obtained by aggregating forwarding ports of the router in the uplink direction.

In some embodiments, it is assumed that the mobile phone sends a message to the slave router, and the slave router forwards the message to the master router after receiving the message sent by the mobile phone. And in the process of forwarding the message to the main router by the slave router, if the load imbalance of the link is detected, calculating the number of the streams needing to be moved, and performing the process of moving the streams.

The flow moving method provided by the present application is described by taking two slave routers as an example. Illustratively, as shown in fig. 2, the direction of data transfer is from slave router 2 to slave router 1. It is assumed that a message sent by a handset is received from the router 2 through an ETH interface or a Wi-Fi interface, and the message is transmitted between the slave router 2 and the slave router 1 through a Wi-Fi link or a Power Line Communication (PLC) link. After receiving the packet from the router 2, if the packet is received for the first time, the packet may enter the core binding of the router 2 to be distributed, that is, the flows corresponding to the packet are distributed to different links. If the packet is not received for the first time, the core binding of the router 2 may query the core flow table, and forward the packet according to the forwarding link (forwarding exit) recorded in the flow table. When the load on the Wi-Fi link and the PLC link is unbalanced, the core flow table may randomly delete a set number of flows on one link with a high bandwidth occupancy rate, and then the flows may reenter the core Bonding and the core Bonding redistributes the links. According to the mode, the loads on the Wi-Fi link and the PLC link are in a load balancing state as much as possible through at least one flow moving.

Alternatively, the link metric module may synchronize the link metric values to the various routers in the network periodically (e.g., every 15 seconds). It should be noted that, in the embodiment of the present application, the method for moving a stream may be applied between two different routers, for example, between two different slave routers, or may also be applied between a slave router and a master router, which is not limited in the present application.

The following describes a flow migration method according to an embodiment of the present application by taking a router as an example. Exemplarily, fig. 3 is a flowchart of a stream moving method provided in an embodiment of the present application. As shown in fig. 3, the method may include the steps of:

s301, the router acquires a link metric value.

As a possible implementation, the router may synchronize the link metric value of the link every X seconds (e.g., 15 seconds), and then determine whether the link satisfies the concurrent activation condition according to the link metric value.

Optionally, before S301 is executed, the router may receive a message sent by a user equipment, such as a mobile phone.

S302, the router judges whether the concurrent hybrid condition is met or not according to the link metric value.

Here, the link metric value may include information of bandwidth, delay, remaining bandwidth, and the like of the link. If the link metric value obtained by the router only comprises the bandwidth of one link, namely the transmission link only comprises one link, the concurrent hybrid condition is not met.

If the link metric value obtained by the router includes bandwidths of multiple links, the router may forward the packet through the multiple links. At this time, the router may determine whether the concurrent hybrid condition is satisfied according to the acquired bandwidths of the multiple links. For example, in the embodiment of the present application, whether the link satisfies the concurrent hybrid condition may be determined by:

condition 1: the concurrent hybrid condition is satisfied by the links when the maximum link bandwidth of the plurality of links is greater than 40M.

Condition 2: when the maximum link bandwidth of at least one of the links is smaller than 40M, it is necessary to determine whether the link bandwidth of the link smaller than 40M is greater than a preset ratio of the maximum link bandwidth value of the concurrent link (for example, the preset ratio may be one third). And if the link bandwidth is more than one third of the maximum bandwidth value of the link in the concurrent link, the link meets the concurrent hybrid condition. Otherwise, the link does not satisfy the concurrent hybrid condition. For example, if there are three links, that is, a PLC link, a 5G link, and a 2.4G link, the maximum bandwidth of the 5G link is less than the maximum bandwidth of the PLC link and less than the maximum bandwidth of the 2.4G link, and if the maximum bandwidth of the 5G link is less than 40m and the maximum bandwidth of the PLC link and the maximum bandwidth of the 2.4G link are both greater than 40M, it is necessary to determine whether the link bandwidth of the 5G link is greater than one third of the maximum bandwidth of the 2.4G link. And if the link bandwidth of the 5G link is less than one third of the maximum bandwidth of the 2.4G link, the 5G link does not meet the hybrid concurrency condition, namely the PLC link and the 2.4G link meet the hybrid concurrency condition.

When either of the above two conditions is satisfied, it may be determined that the link satisfies the concurrent mix condition. It should be noted that, in the embodiment of the present application, how to determine whether a link satisfies a hybrid-active concurrency condition is not limited, that is, the determination condition is not limited to the above two conditions, and the determination condition may be included in the protection scope of the present application as long as the determination condition can satisfy the condition that a message is transmitted through at least two links.

S303, the router judges whether the load of the link is unbalanced according to the link metric value. If the link is in a load imbalance state, the process continues to S304.

In some embodiments, the router may periodically (e.g., every 8 seconds) obtain the bandwidth occupancy on each link, for example, obtain the bandwidth occupancy on the Wi-Fi link and the PLC link respectively, and then determine whether the links are load balanced according to the bandwidth occupancy of the links. For example, when the bandwidth occupancy of the Wi-Fi link is greater than a first set threshold, such as 90%, and the bandwidth occupancy of the PLC link is less than the first set threshold, such as 30%, it may be determined that the link is in a load imbalance state. Of course, it may also be determined that the link is in the load imbalance state when the bandwidth occupancy rate of the PLC link is greater than 90% and the bandwidth occupancy rate of the Wi-Fi link is less than 30%. That is, in two links, if the bandwidth occupancy of one of the links is greater than a first set threshold and the bandwidth occupancy of the other link is less than a second set threshold, the link is determined to be in a load imbalance state.

Of course, the values of the first set threshold and the second set threshold are only illustrative, and the first set threshold may be 80%, the second set threshold may be 20%, and the like, which is not limited in the present application.

S304, the router carries out the flow transfer.

In some embodiments, when link load imbalance occurs, the flow may be moved, i.e., the flow on the link with the higher bandwidth occupancy is moved to the link with the lower bandwidth occupancy. It should be understood that bandwidth occupancy = actual used bandwidth/maximum bandwidth. For example, when the bandwidth occupancy rate of the Wi-Fi link is greater than 90% and the bandwidth occupancy rate of the PLC link is less than 30%, the moved part of the flow on the Wi-Fi link may be flowed onto the PLC link to reduce the load on the Wi-Fi link, fully utilize the bandwidth of each link, and improve the user experience.

As a possible implementation manner, when the router performs the flow movement, the router may perform the flow movement at least once, so as to enable the link to reach the load balancing state as much as possible. For example, the bandwidth occupancy rate of the Wi-Fi link is 95%, the bandwidth occupancy rate of the PLC link is 20%, and after the router performs one-time stream movement, for example, 20 streams are moved, it may be determined whether the link is in a load imbalance state according to the link metric value continuously in the next period. If the load imbalance state is still present, the flow migration continues.

The following describes in detail how the shifting of the flows is performed so that the links are in a process of load balancing as much as possible. Illustratively, as shown in fig. 4, a flow chart of a method for moving a stream provided in an embodiment of the present application is shown, and referring to fig. 4, the method may include the following steps:

s401, the router judges whether the moving condition of the flow is met. If the flow transfer condition is satisfied, the process proceeds to step S402, and if the flow transfer condition is not satisfied, the process ends.

In some embodiments, the router may determine whether the flow moving condition is satisfied by at least one of the following conditions:

condition 1: the links comprise at least two links;

condition 2: the bandwidth occupancy rate meets the requirement that the bandwidth occupancy rate of at least one link is greater than a first set threshold value, and the bandwidth occupancy rates of other links are less than a second set threshold value.

Condition 3: link weight requirement: the link weight of the moved destination link of the flow is greater than the link weight of the moved source link of the flow. For example, to stream the mobile part of the stream on the Wi-Fi link onto the PLC link, the link weight on the PLC link is significantly greater than the link weight on the Wi-Fi link.

Condition 4: link bandwidth requirements: the link bandwidth of the link with the minimum bandwidth occupancy rate > total link bandwidth W,0 and < -W is less than or equal to 1. Illustratively, when W =0.1, the link bandwidth of the link with the smallest bandwidth occupancy is greater than 10% of the total link bandwidth. For example, the links include 2.4G and 5G, PLC, and the link with the minimum bandwidth occupancy rate is 5G, then the link bandwidth of the 5G link is greater than the link bandwidth of the three links (2.4g +5g + plc) } 10%.

Condition 5: stream movement interval requirements: the time interval between the two streams is less than or equal to a set value (e.g., 1 minute). It should be understood that each stream move may move at least one stream.

S402, the router determines the number of the flows needing to be moved.

As a possible implementation, the router may calculate the number of streams that need to be moved based on the number of streams transmitted on the link. For example, if the bandwidth occupancy rate of the Wi-Fi link is greater than 90% and the bandwidth occupancy rate of the PLC link is less than 30%, the mobile part of the stream on the Wi-Fi link needs to be streamed onto the PLC link. If the total number of streams transmitted on the Wi-Fi link is X, a set proportion of streams, such as (X × 20%) streamers, may be moved. For example, if the total number of streams transmitted on the Wi-Fi link is 100, 20 streams may be moved from the Wi-Fi link first, and if the streams need to be moved for multiple times, after one stream movement is performed, the total number of streams on the link to be moved may be calculated, for example, the total number of streams transmitted on the Wi-Fi link after one movement is Y (for example, 80 streams), and then the movement is continued (Y20%) on the basis of 80 streams, for example, 16 streams are continuously moved. It should be understood that the number of stream shifts may also be (X30%) of the strip stream, etc., and this application is not limited thereto.

For another example, suppose that the router calculates the total number of flows on the link to be moved after performing one flow move, for example, the total number of flows transmitted on the Wi-Fi link after one move is Y (for example, 86 pieces), and then continues to move (Y × 20% =86 × 20% = 17.2) pieces of flows on the basis of 84 pieces of flows. Since the number of streams is an integer, the value 17 can be obtained at this time, that is, the 17 streams are continuously moved. Of course, the value 18 may be also taken, that is, 18 streams are continuously moved, which is not limited in the present application.

As another possible implementation manner, the router continues to determine the number of flows that need to be moved according to the magnitude relationship between the number of flows of the set proportion and the set threshold value on the basis of calculating the set proportion, for example, (X × 20%) of the flows. Specifically, when X × 20% > sets a threshold (for example, 200), the number of flows that the router can move is 200 at maximum; when X20% < a set threshold (e.g., 200), the number of flows that the router can move is X20% bars. For example, if the total number X of flows on the Wi-Fi link is 2000, then X × 20% =400, that is, X × 20% > sets a threshold, then the number of flows that the router can move is 200; if the total number of flows on the Wi-Fi link is 800, X × 20% =160, that is, X × 20% < the set threshold, the number of flows that the router can move is 160.

S403, the router deletes the information of the flow needing to be moved in the flow table.

In some embodiments, after the router receives the packet, the packet may be divided into at least one Flow (Flow) according to the five-tuple information in the packet, and then an ingress and an egress of each Flow may be learned and recorded in the Flow table. And each flow recorded in the flow table on the router can be provided with a timer, and after the router receives the message and learns the message, the table entry of the five-tuple information can be recorded in the flow table, and the timer of the flow corresponding to the five-tuple information is started. When the time of the timer reaches the update time (or aging time) of each record, the record can be deleted, namely the stream record is deleted. The flow table may be referred to as shown in table 1 below, for example.

TABLE 1

Quintuple	Inlet port	An outlet	Update time (seconds)
				Flow1	eth	2.4G	120
Flow2	eth		5G					5
				Flow3	5G	PLC	15
Flow4	2.4G	5G_2	100

It should be understood that table 1 is only an illustrative illustration, and the exit, the entry, the update time, and the like in the embodiment of the present application are not particularly limited. It should be noted that the quintuple information of the same flow is completely the same, and the quintuple information of different flows is different. The quintuple information may include a source Internet Protocol (IP) address, a source port number, a destination IP address, a destination port number, and a Protocol number.

The message may include quintuple information, a source Media Access Control (MAC) address, and a destination MAC address. After receiving the message, the router may forward the message to a device corresponding to a destination MAC address of the message, and in this process, if load imbalance is detected, a flow needs to be moved, and at this time, the router may delete at least one flow on a link with the highest bandwidth occupancy rate within the aging time of the flow. It should be understood that, when deleting at least one flow in the flow table, the router may delete at least one flow on the link with the highest bandwidth occupancy at will, or delete at least one flow on the link with the highest bandwidth occupancy according to the receiving time of the flow, and the like, which is not limited in this application.

S404, the router reallocates the link to the flow needing to be moved.

Because the link weight may change when the link load is unbalanced, after the router deletes at least one flow in the flow table, when the mobile phone sends a message to the router again, the router may reallocate a link for the deleted flow according to the flow corresponding to the message. It should be understood that the link load imbalance in this application occurs during the service transmission process, that is, the mobile phone will continuously send the message to the router, and therefore, after the router deletes part of the flow in the flow table, the mobile phone will still send the message to the router again.

For example, assuming that the Flow table of the router includes 100 flows, such as Flow1-Flow100, if the router deletes Flow1-Flow20, when the router receives the message sent by the mobile phone again, the link may be newly allocated to the Flow corresponding to the quintuple information in Flow1-Flow20, and Flow21-Flow100 may continue to forward according to the link that continues in the Flow table.

The process of learning quintuple information at the kernel is described below. Illustratively, as shown in fig. 5, a flow chart of a method for five tuple learning provided in an embodiment of the present application, referring to fig. 5, the method may include the following steps:

s501, the router searches whether quintuple information exists in the flow table. And if the quintuple information exists in the flow table, forwarding the flow according to the outlet recorded in the flow table. If the five-tuple information does not exist in the flow table, S502 is continuously executed.

In some embodiments, after the router receives the packet, if the five-tuple information is found in the flow table, it indicates that the flow is not deleted, and the router may forward the packet according to the exit recorded in the flow table. If the router does not find the quintuple information in the flow table, the flow is deleted or the router receives the information for the first time, and at this time, the router can learn the quintuple information.

S502, the router records the quintuple information.

In some embodiments, after the router receives the message, the router may send a flow corresponding to the message (the flow sent to the kernel for learning refers to a flow that is not recorded in the flow table) to the kernel for learning, and then shunt on the concurrent link, so that the link may be newly allocated to the flow that needs to be moved.

Optionally, if the flow table of the router does not have the quintuple information, the flow table entry of the quintuple may be created, the quintuple information is set as an unlearned identifier, and then the core binding may learn, that is, learn the forwarding link corresponding to the quintuple information.

Since the link weight may change when the link load is unbalanced, when the router allocates a link to a deleted flow, the allocated link may be different from the link allocated before deletion. Of course, the link to be allocated again may be the same as the link allocated before the flow deletion, and this is not limited in this application.

S503, the router determines the forwarding link of the flow corresponding to the quintuple information according to the quintuple information.

Optionally, after the router determines a forwarding exit again for the flow that needs to be moved, the identifier of the quintuple identified as the unlearned identifier in the flow table may be updated to the learned identifier according to the learned identifier at the core exit, that is, the record in the flow table is updated.

S504, the router learns the forwarding exit of the flow corresponding to the quintuple information.

After the router determines the forwarding link of the flow, the forwarding exit of the flow may be recorded in the flow table, so that the flow table of the router may learn the five-tuple information and learn the forwarding link corresponding to the five-tuple information.

Through the mode, the router can reallocate the links for the deleted flows, and the load of the plurality of links can be balanced as much as possible through at least one time of link reallocation after at least one time of flow moving. Of course, the fewer the number of movements of the stream, the smaller the network jitter, and the better the user experience.

The specific implementation of S503 is described in detail below. Exemplarily, fig. 6 is a flowchart of a link allocation method provided in an embodiment of the present application. As shown in fig. 6, the method may include the steps of:

s601, the router acquires a link metric value.

The link metric value may include, among other things, a maximum bandwidth of the link, a remaining bandwidth (remaining bandwidth = maximum bandwidth of the link — actually used bandwidth), a time delay, a connection status, a channel occupancy, and so on.

S602, the router determines a forwarding link of the message according to the quintuple information of the message and the link metric value.

In some embodiments, the router may obtain a link metric value from the network, may then obtain a remaining bandwidth of the link according to the obtained link metric value, and then determine a forwarding link of the packet according to the remaining bandwidth and the five-tuple information.

Assume that there are three links between router B and router a, including, for example, a 5G link, a 2.4G link, and a PLC link. As a possible implementation manner, a hash value of the five-tuple information may be calculated by a hash (hash) algorithm, and then the forwarding link is determined based on the calculated hash value and the weight occupied by the remaining bandwidth on different links. Exemplarily, as shown in fig. 7, a schematic diagram of link weights provided for the embodiment of the present application is shown. Referring to fig. 7, it is assumed that the ratio of the remaining bandwidth of the 5G link, the remaining bandwidth of the 2.4G link, and the remaining bandwidth of the PLC link is: 1.

It should be noted that, if the frequency bands of the packet at the exit and the entrance of the router are the same, that is, the packet enters the router a from the 2.4G entrance and the exit of the router a is the 2.4G frequency band, or the packet enters the router a from the 5G entrance and the exit of the router a is the 5G frequency band, the weight value can be halved when the exit is calculated. For example, the frequency band from the mobile phone to the router 1 is 5G, the frequency bands of the router 1 and the main router 2 are 5g, and the weight value of the 5G link is 6, so that when the exit direction of the packet is calculated at the router 1, the weight value of the 5G link is 3.

In some embodiments, the forwarding link of the packet may be determined according to a remainder of a ratio of the hash value to the sum of the weights. For example, the conversion relationship between the remainder value and the link can be seen in table 2 below.

TABLE 2

Remainder value	Link circuit
		0≤n<1	5G
1≤n<4	2.4G
		4≤n<10	PLC

It should be understood that the above table 2 is only an illustrative example, and when the remaining weight ratio of the links is different, the corresponding relationship between the remainder value and the links may also be changed. That is, when the remainder value 0 is not less than n <1, the message is forwarded from the router to the outlet of the 5G link; when n is more than or equal to 1 and less than 4, the slave router forwards the message from the outlet of the 2.4G link; and when n is more than or equal to 4 and less than 10, the slave router forwards the message from the outlet of the PLC link.

S603, the slave router forwards the message to the master router according to the determined forwarding link.

Taking table 1 as an example, assuming that the hash value after the quintuple information of Flow1 is hashed is compared with the sum of the link weights, and the remainder is 5, the slave router may forward Flow1 to the master router according to the PLC link. I.e., different streams, may be forwarded to the master router over the same or different links.

Through the embodiment, each stream can be distinguished based on the dimension of the quintuple, and then the quintuple information is used for shunting, so that fine control of the stream can be realized. And when the stream is moved, one or more streams can be moved to other network cards to realize load balancing on the concurrent link.

All or part of the above embodiments provided in the present application may be freely and arbitrarily combined with each other. The combined technical solution is also within the scope of the present application.

In order to implement the functions in the method provided by the embodiments of the present application, the network device may include a hardware structure and/or a software module, and implement the functions in the form of a hardware structure, a software module, or a hardware structure and a software module. Whether any of the above-described functions is implemented as a hardware structure, a software module, or a hardware structure plus a software module depends upon the particular application and design constraints imposed on the technical solution.

Based on the above embodiments, the embodiments of the present application further provide a stream moving device, which may be a network device or a router device in the foregoing embodiments. Referring to fig. 8, the stream moving apparatus 800 includes: a transceiver 801, a processor 802, and a memory 803. The transceiver 801, the processor 802 and the memory 803 are connected to each other.

Optionally, the transceiver 801, the processor 802 and the memory 803 are connected to each other through a bus 804. The bus 804 may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. 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. 8, but this is not intended to represent only one bus or type of bus.

A memory 803 for storing program instructions, data, and the like. In particular, the program instructions may include program code comprising computer operational instructions. The memory 803 may include a Random Access Memory (RAM) and may also include a non-volatile memory (non-volatile memory), such as at least one disk memory. The processor 802 calls program instructions and data stored in the memory 803 to cause the stream mover device 800 to perform the following steps:

determining that the loads on the first link and the second link are in a load imbalance state, wherein the first link and the second link are links included in an uplink transmission direction of the device, and the bandwidth occupancy rate of the first link is greater than that of the second link; and moving N streams from the first link, wherein the total number of the streams currently transmitted on the first link is M, M, N is a positive integer, and M > N.

In one possible implementation, the processor 802 calls the instructions stored in the memory 803, so that the stream moving apparatus 800 performs the following steps:

acquiring the bandwidth occupancy rate of a first link and the bandwidth occupancy rate of a second link; and if the bandwidth occupancy rate of the first link is determined to be greater than a first set threshold value and the bandwidth occupancy rate of the second link is determined to be less than a second set threshold value, determining that the loads on the first link and the second link are in a load imbalance state.

In one possible implementation, the processor 802 calls the instruction stored in the memory 803, so that before the stream moving device 800 moves N streams from the first link, the following steps are further performed:

determining that a link included in an uplink transmission direction of the own device satisfies a flow transfer condition, where the flow transfer condition includes at least one of the following conditions: the uplink transmission direction comprises at least two links; the bandwidth occupancy rate of at least one link is greater than a first set threshold value, and the bandwidth occupancy rates of other links are less than a second set threshold value; the link weight of the moved destination link of the flow is greater than the link weight of the moved source link of the flow; the link bandwidth of the link whose bandwidth occupancy rate is the smallest > the total link bandwidth W of the links included in the uplink direction, 0-woven (W) woven fabric (1); the moving time interval of the two adjacent flows is less than or equal to a set value.

and determining the number N of the flows needing to be moved on the first link.

acquiring the total number M of the current transmitted streams on a first link; determining the number of flows with a set proportion, wherein the set proportion is the set proportion of the total number M of the flows currently transmitted on the first link; and taking the number of the flows with the set proportion as the number N of the flows needing to be moved on the first link.

determining the number of flows with a set proportion, wherein the set proportion is the set proportion of the total number of the flows currently transmitted on the first link; if the number of the flows with the set proportion is larger than the set threshold value, taking the set threshold value as the number N of the moved flows; and if the number of the flows with the set proportion is smaller than the set threshold value, taking the number of the flows with the set proportion as the number N of the moved flows.

In one possible implementation, the processor 802 calls the instructions stored in the memory 803, so that before the moving device 800 of the flow determines that the load on the first link and the second link is in the load imbalance state, the following steps are further performed:

receiving a first message sent by user equipment, and recording a flow corresponding to the first message in a first flow table, where the first flow table includes recording information of a flow forwarded by the network equipment, the recording information includes quintuple information, a receiving port of the flow, and a forwarding port of the flow, and the first message includes Q flows, where Q is a positive integer and Q > M.

deleting N flows in the first flow table; receiving a second message sent by the user equipment, and distributing forwarding links to N flows included in the flow corresponding to the second message; and moving the N flows according to the distributed forwarding links.

and distributing the N flows to at least two links included in the uplink transmission direction of the network equipment according to the five-tuple information of the N flows and the residual bandwidths of the at least two links included in the uplink transmission direction of the network equipment.

In a possible implementation manner, the processor 802 calls the instruction stored in the memory 803, so that after the moving device 800 of the stream moves the N streams, the following steps are further performed:

determining to move P flows on a first link; and moving P streams, wherein the total number of the streams currently transmitted on the first link is L, L is an integer greater than 0, P is an integer greater than or equal to 0, and L > P, and L < M.

In the embodiments of the present application, the processor 801 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, and may implement or execute the methods, steps, and logic blocks disclosed in the embodiments of the present application. The 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 directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in a processor. Software modules may be located in the memory 802, and the processor 801 reads the program instructions in the memory 802, and in combination with its hardware, performs the steps of any of the above-described embodiment methods.

In the embodiment of the present application, the memory 802 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 can also be, but is not limited to, 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. The memory in the embodiments of the present application may also be a circuit or any other device capable of implementing a storage function for storing instructions and/or data.

It can be clearly understood by those skilled in the art that, for convenience and simplicity of description, the specific working processes of the above-described apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

Based on the above embodiments, the present application also provides a computer storage medium, in which a computer program is stored, and when the computer program is executed by a computer, the computer program causes the computer to execute the method provided by the above embodiments.

Also provided in an embodiment of the present application is a computer program product including instructions that, when executed on a computer, cause the computer to perform the method provided in the above embodiment.

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 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.

Claims

1. A stream moving method is applied to a network device, the network device supports multiple network cards, and the method is characterized by comprising the following steps:

the network equipment determines that loads on a first link and a second link are in a load imbalance state, the first link and the second link are links included in an uplink transmission direction of the network equipment, and the bandwidth occupancy rate of the first link is greater than that of the second link;

the network device moves N streams from the first link, the total number of the streams currently transmitted on the first link is M, the streams M, N are positive integers, and M > N.

2. The method of claim 1, wherein the network device determining that the load on the first link and the second link is in a load imbalance state comprises:

the network equipment acquires the bandwidth occupancy rate of the first link and the bandwidth occupancy rate of the second link;

and if the network equipment determines that the bandwidth occupancy rate of the first link is greater than a first set threshold value and the bandwidth occupancy rate of the second link is less than a second set threshold value, determining that the loads on the first link and the second link are in a load imbalance state.

3. The method of claim 1 or 2, wherein prior to the network device moving N streams from the first link, the method further comprises:

the network device determines that a link included in an uplink transmission direction of the network device satisfies a flow moving condition, where the flow moving condition includes at least one of the following conditions:

the uplink transmission direction comprises at least two links;

the bandwidth occupancy rate of at least one link is greater than a first set threshold value, and the bandwidth occupancy rates of other links are less than a second set threshold value;

the link weight of the moved destination link of the flow is greater than the link weight of the moved source link of the flow;

the link bandwidth of the link whose bandwidth occupancy rate is minimum > the total link bandwidth W of the links included in the uplink direction, 0-woven (W) woven fabric (1);

the moving time interval of the two adjacent flows is less than or equal to a set value.

4. The method of any of claims 1-3, wherein prior to the network device moving N flows from the first link, the method further comprises:

the network equipment determines the number N of the streams needing to be moved on the first link;

the network device determining the number N of the flows that need to be moved on the first link includes:

the network equipment acquires the total number M of the current transmitted flows on the first link;

the network equipment determines the number of flows with a set proportion, wherein the set proportion is the set proportion of the total number M of the flows currently transmitted on the first link;

and the network equipment takes the number of the flows with the set proportion as the number N of the flows needing to be moved on the first link.

5. The method of any of claims 1-3, wherein prior to the network device moving N flows from the first link, the method further comprises:

the network device determining the number N of streams that need to be moved on the first link includes:

the network equipment determines the number of flows with a set proportion, wherein the set proportion is the set proportion of the total number of the flows currently transmitted on the first link;

if the number of the flows with the set proportion is larger than a set threshold value, taking the set threshold value as the number N of the moved flows;

and if the number of the flows with the set proportion is smaller than a set threshold value, taking the number of the flows with the set proportion as the number N of the moved flows.

6. The method of any one of claims 1-5, wherein prior to the network device determining that the load on the first link and the second link is in a load imbalance state, the method further comprises:

the network device receives a first message sent by a user device, and records a flow corresponding to the first message in a first flow table, wherein the first flow table comprises recording information of the flow forwarded by the network device, the recording information comprises quintuple information, a receiving port of the flow and a forwarding port of the flow, the first message comprises Q flows, Q is a positive integer, and Q is greater than M.

7. The method of claim 6, wherein the network device moves N flows from the first link, comprising:

the network equipment deletes N flows in the first flow table;

the network equipment receives a second message sent by user equipment, and distributes forwarding links to N streams included in the stream corresponding to the second message;

and the network equipment moves the N flows according to the distributed forwarding links.

8. The method according to claim 7, wherein the allocating, by the network device, forwarding links to N flows included in the flow corresponding to the second packet includes:

and the network equipment distributes the N flows to the at least two links in the uplink transmission direction of the network equipment according to the quintuple information of the N flows and the residual bandwidths of the at least two links in the uplink transmission direction of the network equipment.

9. The method of any of claims 1-8, wherein after the network device moves the N flows, the method further comprises:

the network equipment determines to move the P flows on the first link;

the network device moves the P flows, the total number of the flows currently transmitted on the first link is L, the L is an integer greater than 0, the P is an integer greater than or equal to 0, and L > P, and L < M.

10. A network device, wherein the network device comprises one or more processors; one or more memories and one or more computer programs;

wherein the one or more computer programs are stored in the one or more memories, the one or more computer programs comprising instructions that, when executed by the one or more processors, cause the network device to perform the method of any of claims 1-9.

11. A computer-readable storage medium having instructions stored therein, which when executed on a network device, cause the first network device to perform the method of any one of claims 1-9.