WO2020103727A1

WO2020103727A1 - Flowlet load sharing method and device

Info

Publication number: WO2020103727A1
Application number: PCT/CN2019/117627
Authority: WO
Inventors: 路小刚; 高红亮; 佟兴
Original assignee: 华为技术有限公司
Priority date: 2018-11-19
Filing date: 2019-11-12
Publication date: 2020-05-28
Also published as: CN111200558A; CN111200558B

Abstract

The embodiments of the present application relate to the technical field of traffic forwarding. Disclosed are a flowlet load sharing method and device, for use in solving the problems in the prior art of high consumption of flowlet transmission resources and adjustment untimeliness. The specific solution is that: a load sharing device performs first hash on the basis of an original flow to hash said flow into an aggregate flow comprising a plurality of flowlets, hashes the flowlets in the aggregate flow to specific link pointers in a link pointer sequence on the basis of a timestamp or a random number, determines load routes for transmitting the flowlets, and finally transmits the flowlets by the determined load routes; in addition, real-time load sharing adjustment is implemented by actively generating flowlets on the basis of real-time statistics on the data quantity of the flowlets having been transmitted by the load routes and the data quantity of the flowlets carried by the link pointers, in combination with the preset value of the load proportion of each load route. The embodiments of the present application are used in a data transmission process.

Description

Flowlet load sharing method and device

This application requires the priority of the Chinese patent application submitted to the State Intellectual Property Office on November 19, 2018, with the application number 201811375795.9 and the invention titled "a flowlet load sharing method and device", the entire contents of which are incorporated herein by reference Applying.

Technical field

The embodiments of the present application relate to the technical field of traffic forwarding, and in particular, to a flowlet load sharing method and device.

Background technique

At present, with the high speed and real-time requirements of data transmission services, data transmission equipment needs to be able to quickly and accurately adjust the load sharing of traffic to improve its forwarding performance and enhance the reliability of the network, so as to better serve users .

The existing load sharing method mainly uses flow-by-flow load sharing, that is, the device passes the quintuple, including: source IP address, destination IP address, protocol number, source port and destination port, to divide the original packet into different flows, according to the binding Determine the sending interface and path in the same way. The packets of the same flow will be sent on the same interface and route; or use the flow table load sharing method based on the flow table to send the flowlet through the specified sending interface in the flow table. However, the above flow-by-flow load sharing method, when faced with the coexistence of elephant flow and mouse flow, is likely to cause uneven traffic load and low network utilization, and often leads to unnecessary single link expansion; The flowlet load sharing method based on the flow table, each time a new flowlet appears, it is necessary to re-generate the flow table according to the link bandwidth ratio, and determine the sending interface according to the updated amount table, which may easily lead to insufficient flow table resources and reduce Send efficiency.

Summary of the invention

Embodiments of the present application provide a flowlet load sharing method and device, which can provide high-efficiency flowlet data transmission and load balancing while realizing real-time link load sharing adjustment.

To achieve the above purpose, the embodiments of the present application adopt the following technical solutions:

In a first aspect, a flowlet load sharing method is provided. The method is applied to a flowlet load sharing device. The method may include: the flowlet load sharing device transforms an original stream into an aggregated stream according to a hash hash algorithm, and the aggregated stream includes N Flow clusters, N is an integer, N ≥ 2; query the FIB table of the forwarding information database to obtain the equivalent load routing information of the current flowlet to be transmitted, where the equivalent load routing information includes M that can transmit the current flowlet to be transmitted Equivalent load routing, the current flowlet to be transmitted belongs to N flow cluster flowlets; link pointer configuration information is determined according to the equivalent load routing information, where the link pointer configuration information includes the link corresponding to each equivalent load route The number of pointers; determine the link pointer corresponding to the current flowlet to be transmitted, and the link pointer is used to indicate the load route for transmitting the current flowlet to be transmitted; the load route corresponding to the determined link pointer transmits the current flowlet to be transmitted .

The technical solution provided in the first aspect above determines the link pointer configuration information by two-level hashing based on the original flow and time stamp or random number, and through the equivalent load routing information of the current flowlet to be transmitted, and uniformly hash the flowlet in one Each link pointer in the link pointer sequence is used to transmit each flowlet by the load route corresponding to the link pointer, which can ensure the transmission efficiency while achieving an even distribution of each load route.

In a possible implementation, determining the link pointer corresponding to the current flowlet to be transmitted may include: when the current flowlet to be transmitted is the first flowlet, acquiring a time stamp t ₁ ; determining the first time stamp according to the time stamp t ₁ Link pointer corresponding to 1 flowlet; when the current flowlet to be transmitted is the i-th flowlet, the time stamp t _{i is obtained} ; if t _i -t _i-1 -t _i-1 '≥Δt, according to the time stamp t _i determined corresponding to the i-th link pointer flowlet; wherein, t _i is the time stamp for the i-th flowlet appears, t _i-1 is the time stamp when the first i-1 th flowlet appears, t _i-1 'is The transmission time of the i-1th flowlet, Δt is a preset value; the link pointer corresponding to the ith flowlet is different from the link pointer corresponding to the i-1 flowlet. By hashing the flowlet to the corresponding pointer by the timestamp, the distribution of each load route can be evenly distributed while ensuring the transmission timing.

In a possible implementation manner, determining the link pointer corresponding to the current flowlet to be transmitted may further include: when the current flowlet to be transmitted is the first flowlet, generating a random number l ₁ ; determining the random number according to the random number l ₁ Link pointer corresponding to the first flowlet; when the current flowlet to be transmitted is the i-th flowlet, a random number l _{i is} generated; if t _i -t _i-1 -t _i-1 '≥Δt, according to the random number l _i determine the i th flowlet corresponding link pointer; wherein, t _i for the i-th time-stamp when flowlet occurs, t _i-1 to i-1 th timestamp occurs when flowlet, t _i-1 'Is the transmission time of the i-1th flowlet, and Δt is a preset value; the link pointer corresponding to the ith flowlet is different from the link pointer corresponding to the i-1 flowlet. By hashing the flowlet to the corresponding pointer by a random number, it is possible to achieve uniform distribution of each load route while ensuring transmission timing.

In a possible implementation manner, the method may further include: separately counting the amount of flowlet data carried on the link pointer; and separately counting the amount of flowlet data carried on each equal-cost load route; calculating each equivalent separately The ratio of the amount of flowlet data carried on the load route to the total amount of flowlet data on the M equivalent load routes; according to the amount of flowlet data carried on each equivalent load route, the total load on the M equivalent load routes The proportion of flowlet data volume and the amount of flowlet data carried on the link pointer are adjusted for load sharing. Real-time load sharing adjustment can be achieved by real-time statistics of the amount of flowlet data transmitted by the load route and the flow pointer to be allocated to the link pointer.

In a possible implementation, the load sharing adjustment is performed according to the ratio of the amount of flowlet data carried on the M equivalent load routes to the total amount of flowlet data carried on the M equivalent load routes, which may include: When the flowlet is the i + 1th flowlet, if the proportion of the flowlet data carried on the current jth load route to the total loadlet data quantity carried on the current M equivalent load routes is greater than the preset value, and is equal to the preset load The absolute value of the sharing ratio difference is greater than the preset threshold, and the traffic pointer transmission identifier is placed in front of the link pointer corresponding to the jth load route; the jth load route stops transmitting the i + 1th flowlet and caches the i +1 flowlet; if the link pointer corresponding to the jth load route deferred forwarding time is greater than Δt, the link pointer corresponding to the i + 1th flowlet is determined according to the hash hash algorithm; the i + 1th flowlet determined by the The load route corresponding to the link pointer corresponding to each flowlet transmits the i + 1th flowlet; where the jth load route is any one of the M equivalent load routes. Real-time load sharing adjustment can be achieved by real-time statistics on the amount of flowlet data transmitted by the load route and the flow pointers to be distributed according to the link pointer, and the preset value of the load ratio of each load route.

In a possible implementation manner, load sharing adjustment is performed according to the ratio of the amount of flowlet data carried on the M equivalent load routes to the total amount of flowlet data carried on the M equivalent load routes, and may further include: When the flowlet is the i + 1th flowlet, if the proportion of the current flowlet data carried on the jth load route to the current total loadlet data quantity carried on the M equivalent load routes is greater than the preset value, and the Set the absolute value of the load sharing ratio difference to be greater than the preset threshold, and adjust the link pointer corresponding to the i + 1th flowlet; the load corresponding to the link pointer corresponding to the i + 1th flowlet after adjustment is transmitted by the load The i + 1th flowlet; where the jth load route is any of the M equivalent load routes. Real-time load sharing adjustment can be achieved by real-time statistics on the amount of flowlet data transmitted by the load route and the flow pointers to be distributed according to the link pointer, and the preset value of the load ratio of each load route.

In a second aspect, a flowlet load sharing device is provided. The device may include: a hash module for transforming an original stream into an aggregated stream according to a hash algorithm, the aggregated stream including N flow cluster flowlets, where N is an integer, N≥2; query module, used to query the FIB table of the forwarding information database to obtain the equivalent load routing information of the current flowlet to be transmitted, where the equivalent load routing information includes M equivalent loads that can transmit the current flowlet to be transmitted Routing, the current flowlet to be transmitted belongs to the N flow cluster flowlets; the analysis module is used to determine the link pointer configuration information according to the equivalent load routing information, wherein the link pointer configuration information includes each corresponding load routing The number of link pointers; and determine the link pointer corresponding to the current flowlet to be transmitted, the link pointer is used to indicate the load route for transmitting the current flowlet to be transmitted; the transmission device is used to correspond to the determined link pointer The load route transmits the current flowlet to be transmitted.

In the technical solution provided in the second aspect above, the flowlet load sharing device determines the link pointer configuration information by two-level hashing based on the original flow and timestamp or random number, and through the equivalent load routing information of the current flowlet to be transmitted, to uniformize the flowlet It is hashed on each link pointer in a link pointer sequence, so that each flowlet is transmitted by the load route corresponding to the link pointer, and the transmission efficiency can be ensured, and the uniform distribution of each load route can be achieved.

In a possible implementation, determining the link pointer corresponding to the current flowlet to be transmitted may include: when the current flowlet to be transmitted is the first flowlet, acquiring a time stamp t ₁ ; determining the first time stamp according to the time stamp t ₁ Link pointer corresponding to 1 flowlet; when the current flowlet to be transmitted is the i-th flowlet, the time stamp t _{i is obtained} ; if t _i -t _i-1 -t _i-1 '≥Δt, according to the time stamp t _i determining that the corresponding i-th flowlet link pointer; wherein, t _i is the i-th time stamp appears flowlet, t _i-1 is the time stamp when the first i-1 th flowlet appears, t _i-1 'is The transmission time of the i-1th flowlet, Δt is a preset value; the link pointer corresponding to the ith flowlet is different from the link pointer corresponding to the i-1 flowlet. By hashing the flowlet to the corresponding pointer by the timestamp, the distribution of each load route can be evenly distributed while ensuring the transmission timing.

In a possible implementation manner, determining the link pointer corresponding to the current flowlet to be transmitted may include: when the current flowlet to be transmitted is the first flowlet, generating a random number l ₁ ; determining the first number according to the random number l ₁ Link pointer corresponding to 1 flowlet; when the current flowlet to be transmitted is the i-th flowlet, a random number l _{i is} generated; if t _i -t _i-1 -t _i-1 '≥Δt, according to the random number l _i determining that the corresponding i-th flowlet link pointer; wherein, t _i is the i-th time stamp appears flowlet, t _i-1 is the time stamp when the first i-1 th flowlet appears, t _i-1 'is The transmission time of the i-1th flowlet, Δt is a preset value; the link pointer corresponding to the ith flowlet is different from the link pointer corresponding to the i-1 flowlet. By hashing the flowlet to the corresponding pointer by a random number, it is possible to achieve uniform distribution of each load route while ensuring transmission timing.

In a possible implementation, the device may further include: a statistics module for separately counting the amount of flowlet data carried on the link pointer; and separately counting the amount of flowlet data carried on each equivalent load route; respectively Calculate the proportion of the amount of flowlet data carried on each equivalent load route to the total amount of flowlet data carried on the M equivalent load routes; according to the amount of flowlet data carried on each equivalent load route accounted for the M pieces, etc. The proportion of the total amount of flowlet data carried on the cost load route and the amount of flowlet data carried on the link pointer are adjusted for load sharing. Real-time load sharing adjustment can be achieved by real-time statistics of the amount of flowlet data transmitted by the load route and the flow pointer to be allocated to the link pointer.

In a possible implementation, the load sharing adjustment is performed according to the ratio of the amount of flowlet data carried on the M equivalent load routes to the total amount of flowlet data carried on the M equivalent load routes, which may include: When the flowlet is the i + 1th flowlet, if the proportion of the current flowlet data carried on the jth load route to the current total amount of flowlet data carried on the M equivalent load routes is greater than the preset value, and the preset The absolute value of the difference in load sharing ratio is greater than the preset threshold, and the link pointer corresponding to the jth load route is in front of the traffic suspension transmission identifier; the jth load route stops transmitting the i + 1th flowlet, and caches the first i + 1 flowlets; if the link pointer corresponding to the jth load route is temporarily forwarded longer than Δt, the link pointer corresponding to the i + 1th flowlet is determined according to the hash hash algorithm; the i + th flowlet determined by the The load route corresponding to the link pointer corresponding to one flowlet transmits the i + 1th flowlet; where the jth load route is any one of the M equivalent load routes. Real-time load sharing adjustment can be achieved by real-time statistics on the amount of flowlet data transmitted by the load route and the flow pointers to be distributed according to the link pointer, and the preset value of the load ratio of each load route.

In a third aspect, a flowlet load sharing device is provided. The device may include: a memory for storing computer-executed instructions; and a processor for executing the computer-executed instructions to implement the method as in any possible implementation manner of the first aspect Flowlet load sharing method.

According to a fourth aspect, a computer-readable storage medium is provided, characterized in that computer-executable instructions are stored on the computer-readable storage medium, and when the computer-executed instructions are executed by a processor, they are implemented as any possible implementation of the first aspect Flowlet load sharing method in the method.

BRIEF DESCRIPTION

1 is a schematic diagram of functional modules and function implementation of a flowlet load sharing device provided by an embodiment of the present application;

2 is a schematic diagram of a hardware structure of a flowlet load sharing device provided by an embodiment of the present application;

3 is a flowchart of a flowlet load sharing method provided by an embodiment of this application;

4 is a diagram of an example of hashing provided by an embodiment of the present application;

5 is a flowchart of a method for determining a link pointer corresponding to a flowlet to be transmitted according to an embodiment of this application;

6 is a schematic diagram of a flowlet transmission provided by an embodiment of the present application;

7 is a diagram illustrating an example of determining a link pointer provided by an embodiment of this application;

8 is a flowchart of another method for determining a link pointer corresponding to a flowlet to be transmitted according to an embodiment of the present application;

9 is a schematic diagram of a load sharing adjustment process provided by an embodiment of the present application;

10A and 10B are diagrams illustrating an example of load sharing adjustment provided by an embodiment of the present invention;

11A is a diagram of an example of load routing switching according to an embodiment of the present invention;

11B is another exemplary diagram of load route switching according to an embodiment of the present invention;

12 is another exemplary diagram of load sharing adjustment provided by an embodiment of the present invention;

13 is a schematic diagram of a functional module of a flowlet load sharing device according to an embodiment of the present invention.

detailed description

An embodiment of the present application provides a flowlet load sharing method. The basic principle is that the original flow is hashed into several flowlets, and the flowlet is further hashed to the corresponding link pointer based on a time stamp or a random number. The flowlet to be transmitted is hashed to the load route corresponding to the corresponding link pointer for transmission.

As shown in FIG. 1, it is a schematic diagram of functional modules and function implementation of a flowlet load sharing device according to an embodiment of the present invention. The load sharing device 1 may include an interface board 10 and a main control board 20. The interface board 10 may be divided into two Function modules: control plane 11 and forwarding plane 12, where forwarding plane 12 can be used to make the original flow enter the device through the forwarding plane 12, complete FIB table query and load sharing on the equivalent load route, and the forwarding The plane 12 flows out and is transmitted to the destination; the control plane 11 may include several CPUs, and the control plane 11 may be used to allocate the amount of flowlet data on the link pointer according to the statistics reported by the forwarding plane 12 and each equal-cost load route. The proportion of flowlet data carried to the total amount of flowlet data carried on all equivalent load routes makes an instruction to control load sharing adjustment, and instructs the forwarding plane 12 to make adaptive adjustments in time to perform load sharing to meet the preset load Sharing ratio.

The flowlet load sharing device may be a router, or may be another device having the above functions, which is not limited in this embodiment of the present invention. Those of ordinary skill in the art may understand that FIG. 1 is only a schematic diagram, and does not limit the specific structure of each unit in the device, nor does it limit the specific connection method and connection form of each unit in the device.

As shown in FIG. 2, it is a schematic diagram of the hardware structure of a flowlet load sharing device according to an embodiment of the present invention. The flowlet load sharing device 1 includes a processor 201, a communication line 202, a memory 203, and at least one communication interface (in FIG. 2 only Exemplarily taking the communication interface 204 as an example).

The processor 201 may be a general-purpose central processing unit (central processing unit, CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more of which are used to control the execution of the program program of this application The integrated circuit, the processor 201 may include one or more CPUs, such as CPU0 and CPU1 in FIG. 2.

The communication line 202 may include a path for transferring information between the above components.

Communication interface 204, using any device such as a transceiver, for communicating with other devices or communication networks, such as Ethernet, wireless access network (RAN), wireless local area networks (WLAN), etc. .

The memory 203 may be read-only memory (ROM) or other types of static storage devices that can store static information and instructions, random access memory (random access memory, RAM), or other types of information and instructions that can be stored The dynamic storage device can also be electrically erasable programmable read-only memory (electrically erasable programmable-read-only memory (EEPROM), read-only compact disc (compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (Including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or can be used to carry or store desired program code in the form of instructions or data structures and can be used by a computer Access to any other media, but not limited to this. The memory may exist independently, and is connected to the processor through the communication line 202. The memory can also be integrated with the processor.

Among them, the memory 203 is used to store computer-executable instructions for implementing the solution of the present application, wherein the memory 203 can store instructions for implementing three modular functions: hash instruction, query instruction, analysis instruction, transmission instruction and statistical instruction, and The processor 201 controls execution. The processor 201 is used to execute computer-executed instructions stored in the memory 203, thereby implementing the trajectory tracking and three-dimensional reconstruction method provided by the following embodiments of the present application. The memory 203 shown in FIG. 2 is only a schematic diagram, and the memory may further include other functionalized instructions, which is not limited by the present invention.

The flowlet load sharing method provided by the embodiment of the present application will be specifically described below with reference to FIGS. 1 and 2.

An embodiment of the present invention provides a flowlet load sharing method. FIG. 3 shows a flowchart of a flowlet load sharing method according to an embodiment of the present invention. The method is applied to a flowlet load sharing device 1. The method may include:

301. The processor 201 executes a hash instruction in the memory 203, and transforms the original stream into an aggregate stream according to a hash hash algorithm. The aggregate stream includes N flow cluster flowlets, N is an integer, and N ≥ 2.

Among them, the hash hash algorithm refers to the conversion of any length of input through the hash algorithm into a fixed-length output, the output is the hash value. This conversion is a kind of compression mapping. The space of the hash value is usually much smaller than the space of the input. Different inputs may be hashed into the same output. The algorithm is a function of compressing any length of message to a certain length of message digest. Specifically, in step 301, the input is an original flow, and the output is an aggregate flow including several flow cluster flowlets. As shown in FIG. 4, it is an example of hashing provided by an embodiment of the present invention.

302. The processor 201 executes the query instruction in the memory 203. When a flowlet needs to be transmitted, it queries the forwarding information base FIB table to obtain the equivalent load routing information of the current flowlet to be transmitted. Among them, the equivalent load routing information includes M equal-cost load routes of flowlets. The current flowlet to be transmitted is any one of N flowlet flowlets.

Among them, the Forwarding Information Base (FIB) table is a forwarding information copied from the routing table. It does not include any routing protocol information. If there is any addition or deletion of the routing table, the FIB table will change accordingly. The FIB table can be composed of a four-layer tree, which is layered according to the dotted decimal system used by IPv4 of the Internet Protocol version 4.

303. The processor 201 executes the analysis instruction in the memory 203, and determines link pointer configuration information according to the equivalent load routing information, where the link pointer configuration information includes the number of link pointers corresponding to each equivalent load route;

Specifically, the link pointer configuration information of each equivalent load route may be determined according to the percentage of the bandwidth of each equivalent load route to the total bandwidth of the equivalent load route, that is, the number of link pointers corresponding to each equivalent load route. The link pointers corresponding to all equal-cost load routes will form a link pointer sequence. It can also be determined according to other methods, which is not limited in this embodiment of the present invention.

304. The processor 201 executes an analysis instruction in the memory 203 to determine a link pointer corresponding to the flowlet to be transmitted; the link pointer is used to indicate a load route for transmitting the flowlet to be transmitted.

After obtaining the M equivalent load routes of the flowlet to be transmitted and the link pointer configuration of each equivalent load route, a load route needs to be selected to transmit the flowlet to be transmitted. Specifically, the link pointer can be used to determine the pending The transmitted load route.

305. The processor 201 executes the transmission instruction in the memory 203, and the loadlet corresponding to the determined link pointer is routed to transmit the flowlet to be transmitted.

Specifically, the data in the same flowlet is transmitted by the load corresponding to the same link pointer.

Further, FIG. 5 shows a flowchart of a method for determining a link pointer corresponding to a flowlet to be transmitted according to an embodiment of the present invention, that is, step 304 may include:

501. When the first flowlet needs to be transmitted, a time stamp t _{1 is obtained} .

Among them, timestamp (timestamp), usually a sequence of characters, uniquely identifies the time of a certain moment. The process of generating timestamps can be: the user first encrypts the file that needs to be timestamped with Hash encoding to form an abstract, and then sends the abstract to the digital timestamp service (digita1time stamp service, DTS). After the date and time information is encrypted (digital signature), the file is sent back to the user.

502, a link pointer to the first timestamp t ₁ corresponding to flowlet determine.

Specifically, the method for determining the link pointer may be: taking the timestamp t ₁ as a value, assuming x; assuming that the number of link pointers is n, and determining the link pointer corresponding to the first flowlet as the link pointer sequence The y item of y; then y = x% n, that is, take the remainder of x to determine the corresponding link pointer.

503. When the second flowlet needs to be transmitted, obtain the time stamp t ₂ ;

504. Determine whether t ₂ -t ₁ -t ₁ '≥Δt holds.

505, if

T ₂ is determined corresponding to the second link pointer in accordance flowlet stamp. If not, the link pointer corresponding to the second flowlet is the same as the link pointer assigned by the first flowlet. Where, t ₁ ′ is the transmission time of the first flowlet, and Δt is a preset value, which can be set according to the delay difference of the link or according to other rules. Be limited.

If the time interval between the completion of the transmission of the first flowlet and the transmission of the second flowlet is greater than the preset value, in order to ensure uniform distribution and to ensure the orderly transmission of each flowlet, the second flowlet is assigned to the first The load route corresponding to the link pointer other than the link pointer corresponding to the load routing of the flowlet.

Specifically, how to determine the link pointer corresponding to the second flowlet is the same as the method for determining the link pointer corresponding to the first flowlet, that is, y = x% n.

In the same way, complete the transfer from the third flowlet to the i-1th flowlet.

506. When the i-th flowlet needs to be transmitted, a time stamp t _{i is obtained} ;

507. Determine whether t _i -t _i-1 -t _i-1 '≥Δt holds.

As shown in FIG 6, the present embodiment schematic diagram of an embodiment of the present invention flowlet transmitted in time T _i-1, i-1 starts to transmit the first flowlet th, the i-th transmission flowlet Total time t _i-1 ', the At time t _i , the i-th flowlet needs to be transmitted, and the time interval between the two flowlets can be calculated as t _i -t _i-1 -t _i-1 '.

508. If t _i -t _i-1 -t _i-1 '≥Δt, determine the link pointer corresponding to the i-th flowlet according to the time stamp t _i . The link pointer corresponding to the i-th flowlet is different from the link pointer corresponding to the i-1th flowlet. If not, the link pointer corresponding to the i-th flowlet is the same as the link pointer allocated to the i-1th flowlet. Among them, t ₁ 'is the transmission time of the first flowlet, and Δt is a preset value.

The aggregation flow is hashed to the corresponding link pointer by time stamp, as shown in FIG. 7, which is an example diagram of determining a link pointer according to an embodiment of the present invention.

In the same way, complete the transmission of all the flowlet to be transmitted.

Further, FIG. 8 shows another method for determining a link pointer corresponding to a flowlet to be transmitted according to an embodiment of the present invention. That is, step 304 may further include:

801. When the first flowlet needs to be transmitted, a random number l _{1 is} generated.

Specifically, the random number l ₁ can be generated by the random number generator.

802, _a determination of a corresponding link pointer flowlet random number l.

Specifically, the method for determining the link pointer may be: the number of link pointers is assumed to be n items, and the link pointer corresponding to the first flowlet is determined to be the y item of the link pointer sequence; then y = l ₁ % n Take the remainder of l ₁ to determine the corresponding link pointer.

803. When the second flowlet needs to be transmitted, a random number l _{2 is} generated;

804. Determine whether t ₂ -t ₁ -t ₁ '≥Δt holds.

805, if

Determine the link pointer corresponding to the second flowlet according to the random number l ₂ . If not, the link pointer corresponding to the i-th flowlet is the same as the link pointer allocated to the i-1th flowlet. Where, t ₁ ′ is the transmission time of the first flowlet, and Δt is a preset value, which can be set according to the delay difference of the link or according to other rules. Be limited.

Specifically, how to determine the link pointer corresponding to the second flowlet is the same as the method to determine the link pointer corresponding to the first flowlet, that is: y = l ₂ % n.

806. When the i-th flowlet needs to be transmitted, a random number l _{i is} generated;

807. Determine whether t _i -t _i-1 -t _i-1 '≥Δt holds.

808. If t _i -t _i-1 -t _i-1 '≥Δt, determine the link pointer corresponding to the i-th flowlet according to the random number l _i . Wherein, T _i is the i-th time-stamp when flowlet occurs, the _i-1 T i-1 timestamp occurs when flowlet, t _i-1 'is the first time the i-1 th transmission flowlet , Δt is a preset value; the link pointer corresponding to the i-th flowlet is different from the link pointer corresponding to the i-1th flowlet. If not, the link pointer corresponding to the i-th flowlet is the same as the link pointer allocated to the i-1th flowlet.

Further, as shown in FIG. 9, it is a schematic diagram of a load sharing adjustment process according to an embodiment of the present invention, that is, while step 305 is performed, the method may further include:

901. Count the amount of flowlet data carried on each link pointer.

Specifically, a statistics module can be set at each link pointer. The data on the statistics module can be cleared every fixed time T.

902. Count the amount of flowlet data carried on each equal-cost load route.

Specifically, a statistics module can be set at each equal-cost load route.

903. Calculate the ratio of the amount of flowlet data carried on each equal-cost load route to the total amount of flowlet data carried on all the equal-cost load routes.

904. Perform load sharing adjustment according to the proportion of the amount of flowlet data carried on each equal-cost load route to the total amount of flowlet data carried on all equal-cost load routes, and the amount of flowlet data carried on each link pointer.

By constantly counting the results of load sharing and adjusting the load routing of flowlet traffic, it is ensured that under the changing flow model, the load sharing ratio specified by the system is always maintained, which can ensure that the adjustment is completed in a short time. Specifically, the load sharing adjustment may be implemented by adjusting the link pointer, or the load sharing adjustment may also be implemented by other methods such as delayed transmission. For this, the embodiment of the present invention does not perform adjustment.

Further, step 904 may include:

When a flowlet needs to be transmitted, if the proportion of the current flowlet data carried by a current load route to the total loadlet data volume of all current equivalent load routes is greater than the preset value, and the difference between the preset load sharing ratio The absolute value of is greater than the preset threshold, and the traffic pointer transmission identifier is placed in front of the link pointer corresponding to the load route; the load route stops transmitting the flowlet and caches the cache flowlet that needs to be transmitted; the timer counts if the load route corresponds The link forwarding time of the link pointer is greater than Δt, and the link pointer corresponding to the cached flowlet is determined according to the hash hash algorithm; the load flow corresponding to the link pointer corresponding to the determined cached flowlet is transmitted to the cached flowlet.

As shown in FIGS. 10A and 10B, it is a diagram of an example of load sharing adjustment according to an embodiment of the present invention. FIG. 10A shows three load routes and the amount of data carried by each, and the corresponding amount of data allocated on each link pointer. It can be seen from this example figure that the amount of flowlet data carried on the current preset load path 3 accounts for all equivalent loads The ratio of the total amount of flowlet data on the route is 450 / (350 + 400 + 450) = 0.375, the default value is 1 / (1 + 1 + 1) = 0.333, 0.375-0.333 = 0.042 is greater than 0.02, then you need to The overloaded link pointer corresponding to load route 3 is temporarily suspended. Specifically, as shown in FIG. 10B, the traffic suspend transmission indicator is placed in front of the link pointer, and a timer is started. After the Δt time, the traffic suspend transmission indicator is automatically erased. During this period, the flowlet to be transmitted will be cached. Re-determine the link pointer after Δt time.

As shown in FIG. 11A, it is a diagram of an example of load route switching according to an embodiment of the present invention. The delay T1 of load route 1 is 500 μs, and the delay T2 of load route 2 is 400 μs, assuming that Δt is set according to the delay difference between load route 1 and load route 2, that is, Δt = | T1-T2 | = 100, in the delay After 100 μs, the flowlet to be transmitted switches from load route 1 to load route 2 during transmission, and the transmission arrives at the same time as the load route 1 completely.

When switching from a load route with a faster transmission to a slower one to obtain a load route, it is also possible to adjust the load sharing by using the delay naturally formed by the two link transmissions without delay. As shown in FIG. 11B, it is another exemplary diagram of load route switching according to an embodiment of the present invention. The delay T1 of load route 1 is 400 μs, and the delay T2 of load route 2 is 500 μs. Assume that Δt is set according to the delay difference between load route 1 and load route 2, ie Δt = | T1-T2 | = 100, flowlet to be transmitted During the transmission process, the time interval between the switch from load route 1 to load route 2 and the complete arrival on load route 1 is within an acceptable range.

Further, step 904 may also include:

When a certain flowlet needs to be transmitted, if the proportion of the flowlet data carried by a current load route to the total amount of flowlet data carried by all equivalent load routes is greater than the preset value, and the difference between the load sharing ratio and the preset load If the absolute value is greater than the preset threshold, adjust the link pointer corresponding to the next flowlet to be transmitted; the load corresponding to the adjusted link pointer will be routed to transmit the flowlet to be transmitted.

As shown in FIG. 12, it is another exemplary diagram of load sharing adjustment according to an embodiment of the present invention. The same situation as in FIG. 10A can be achieved by modifying the link pointer, that is, the flowlet that needs to be transmitted on the original link pointer 1 is allocated to the link pointer 3, and the flowlet that needs to be transmitted on the original link pointer 3 is allocated to the link Pointer 1.

The above mainly introduces the solutions provided by the embodiments of the present application from the perspective of interaction between various network elements. It can be understood that, in order to realize the above-mentioned functions, the flowlet load sharing device 1 includes a hardware structure and / or a software module corresponding to each function. Those skilled in the art should easily realize that, in combination with the exemplary units and algorithm steps described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed by hardware or computer software driven hardware depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

The embodiments of the present application may divide the function modules of the flowlet load sharing device according to the above method example. For example, each function module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The above integrated modules may be implemented in the form of hardware or software function modules. It should be noted that the division of the modules in the embodiments of the present application is schematic, and is only a division of logical functions. In actual implementation, there may be another division manner.

For example, in the case of dividing each functional module in an integrated manner, FIG. 13 shows a schematic diagram of a functional module of a flowlet load sharing device 1. The flowlet load sharing device 1 may include a hash module 1301, a query module 1302, an analysis module 1303, and a transmission module 1304. The hash module 1301 is used to transform the original stream into an aggregate stream according to the hash hash algorithm; the query module 1302 is used to query the forwarding information base FIB table to obtain the equivalent load routing information of the current flowlet to be transmitted; the analysis module 1303 is used to To determine the link pointer configuration information according to the equivalent load routing information and determine the link pointer corresponding to the current to-be-transmitted flowlet; the transmission device 1304 is used to transmit the current to-be-transmitted by the determined load routing corresponding to the link pointer flowlet.

Optionally, determining the link pointer corresponding to the current flowlet to be transmitted may include: when the current flowlet to be transmitted is the first flowlet, acquiring a time stamp t ₁ ; determining the chain corresponding to the first flowlet according to the time stamp t ₁ Road pointer; when the current flowlet to be transmitted is the i-th flowlet, the time stamp t _{i is obtained} ; if t _i -t _i-1 -t _i-1 '≥Δt, the corresponding i-th flowlet is determined according to the time stamp t _i link pointer; wherein, t _i is the i th time-stamp when flowlet occurs, t _i-1 to i-1 th timestamp occurs when flowlet, t _i-1 'i-1 for the first transmission of a flowlet Time, Δt is a preset value; the determined link pointer corresponding to the i-th flowlet is different from the link pointer corresponding to the i-1th flowlet.

Optionally, determining the link pointer corresponding to the current flowlet to be transmitted may further include: when the current flowlet to be transmitted is the first flowlet, generating a random number l ₁ ; determining the link corresponding to the first flowlet according to the random number l ₁ Pointer; when the current flowlet to be transmitted is the i-th flowlet, a random number l _{i is} generated; if t _i -t _i-1 -t _i-1 '≥Δt, the chain corresponding to the i-th flowlet is determined according to the random number l _i Road pointer; wherein, T _i is the i th time-stamp when flowlet occurs, the _i-1 T i-1 timestamp occurs when flowlet, t _i-1 'i-1 is the first time a transmission flowlet, Δt is a preset value; the determined link pointer corresponding to the i-th flowlet is different from the link pointer corresponding to the i-1th flowlet.

Optionally, the device may further include a statistics module 1305 for separately counting the amount of flowlet data carried on each link pointer; and separately counting the amount of flowlet data carried on each equivalent load route; calculating each, etc. separately The proportion of the amount of flowlet data carried on the equal-cost load route to the total amount of flowlet data on all equal-cost load routes; according to the amount of flowlet data carried on each equal-cost load route, the total amount of flowlet data on all equal-cost load routes Adjust the load sharing based on the proportion of the amount and the amount of flowlet data carried on the link pointer.

Optionally, the load sharing adjustment is performed according to the proportion of the flowlet data carried on each equal-cost load route to the total amount of flowlet data carried on all equal-cost load routes, which may include: if the current load carried on the j-th load route The proportion of flowlet data volume to the total loadlet data volume of all current equal-cost load routes is greater than the preset value, and the absolute value of the difference from the preset load sharing ratio is greater than the preset threshold. In the jth load route, the corresponding The link pointer is in front of the traffic suspension transmission identifier; the jth load route stops transmitting the current flowlet to be transmitted, and the current flowlet is cached; if the link pointer suspension forwarding time corresponding to the jth load route is greater than Δt, the hash hash algorithm The link pointer corresponding to the current flowlet to be transmitted is determined; the current flowlet to be transmitted is transmitted by the load routing transmission corresponding to the determined link pointer.

Optionally, the load sharing adjustment is performed according to the ratio of the amount of flowlet data carried on each equal-cost load route to the total amount of flowlet data carried on all equal-cost load routes, and may also include: if the current j-th load route carries The proportion of the flowlet data volume in the total loadlet data volume of all current equal-cost load routes is greater than the preset value, and the absolute value of the difference from the preset load sharing ratio is greater than the preset threshold, adjust the current flowlet corresponding to the transmission chain Route pointer; the current loadlet to be transmitted is transmitted by the load route corresponding to the adjusted link pointer.

Through the description of the above embodiments, those skilled in the art can clearly understand that, for convenience and conciseness of description, only the above-mentioned division of each functional module is used as an example for illustration. In practical applications, the above-mentioned functions can be allocated as needed It is completed by different functional modules, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.

In the several embodiments provided in this application, it should be understood that the disclosed device and method may be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the modules or units is only a division of logical functions. In actual implementation, there may be other divisions, for example, multiple units or components may be The combination can either be integrated into another device, or some features can be ignored, or not implemented. In addition, the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and the components displayed as units may be one physical unit or multiple physical units, that is, may be located in one place, or may be distributed in multiple different places . Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit. The above integrated unit may be implemented in the form of hardware or software functional unit.

If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a readable storage medium. Based on such an understanding, the technical solutions of the embodiments of the present application may essentially be part of or contribute to the existing technology, or all or part of the technical solutions may be embodied in the form of software products, which are stored in a storage medium In it, several instructions are included to enable a device (which may be a single-chip microcomputer, chip, etc.) or processor to execute all or part of the steps of the methods described in the embodiments of the present application. The foregoing storage media include: U disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk and other media that can store program code .

The above is only the specific implementation of this application, but the scope of protection of this application is not limited to this, any changes or replacements within the technical scope disclosed in this application should be covered within the scope of protection of this application . Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

A flowlet load sharing method, characterized in that the method includes:

Transform the original stream into an aggregated stream according to a hash hash algorithm, the aggregated stream includes N flow cluster flowlets, N is an integer, and N ≥ 2;

Query the FIB table of the forwarding information library to obtain the equivalent load routing information of the current flowlet to be transmitted, wherein the equivalent load routing information includes M equivalent load routes that can transmit the current flowlet to be transmitted, and the current to-be-transmitted flowlet belongs to the N flow cluster flowlets;

Determining link pointer configuration information according to the equivalent load routing information, wherein the link pointer configuration information includes the number of link pointers corresponding to each of the equivalent load routes;

Determining a link pointer corresponding to the current flowlet to be transmitted, where the link pointer is used to indicate a load route for transmitting the current flowlet to be transmitted;

The current loadlet to be transmitted is routed and transmitted by the determined load corresponding to the link pointer.
The flowlet load sharing method according to claim 1, wherein the determining a link pointer corresponding to the current flowlet to be transmitted includes:

When the current flowlet to be transmitted is the first flowlet, a time stamp t 1 is obtained ;

Determine the link pointer corresponding to the first flowlet according to the time stamp t 1 ;

When the current flowlet to be transmitted is the i-th flowlet, a time stamp t i is obtained ;

If t i -t i-1 -t i-1 '≥Δt, determine the link pointer corresponding to the i-th flowlet according to the time stamp t i ;

Wherein, t i is the i-th time-stamp when flowlet occurs, t i-1 to i-1 th timestamp occurs when flowlet, t i-1 'i-1 is the first one transmitted flowlet Time, Δt is a preset value; the link pointer corresponding to the i-th flowlet is different from the link pointer corresponding to the i-1th flowlet.
The flowlet load sharing method according to claim 2, wherein the determining the link pointer corresponding to the current flowlet to be transmitted includes:

When the current flowlet to be transmitted is the first flowlet, a random number l 1 is generated;

Determine the link pointer corresponding to the first flowlet according to the random number l 1 ;

When the current flowlet to be transmitted is the i-th flowlet, a random number l i is generated;

If t i -t i-1 -t i-1 '≥Δt, determine the link pointer corresponding to the i-th flowlet according to the random number l i ;

Wherein, t i is the i-th time-stamp when flowlet occurs, t i-1 to i-1 th timestamp occurs when flowlet, t i-1 'i-1 is the first one transmitted flowlet Time, Δt is a preset value; the link pointer corresponding to the i-th flowlet is different from the link pointer corresponding to the i-1th flowlet.
The flowlet load sharing method according to claim 2 or 3, wherein the method further comprises:

Separately count the amount of flowlet data carried on the link pointer; and

Count the amount of flowlet data carried on each equal-cost load route separately;

Separately calculating the proportion of the amount of flowlet data carried on each equal-cost load route to the total amount of flowlet data carried on the M equal-cost load routes;

Adjust load sharing according to the proportion of the amount of flowlet data carried on each of the equivalent load routes to the total amount of flowlet data carried on the M equivalent load routes, and the amount of flowlet data carried on the link pointer .
The flowlet load sharing method according to claim 4, wherein the amount of flowlet data carried on each equal-cost load route accounts for the total amount of flowlet data carried on the M equal-cost load routes Adjust the load sharing ratio, including:

When the to-be-transmitted flowlet is the i + 1th flowlet, if the proportion of the current flowlet data carried on the jth load route to the current total amount of flowlet data carried on the M equivalent load routes is greater than the preset value, And the absolute value of the difference from the preset load sharing ratio is greater than the preset threshold, and the traffic pointer transmission identifier is placed in front of the link pointer corresponding to the jth load route;

The jth load route stops transmitting the i + 1th flowlet, and caches the i + 1th flowlet;

If the link pointer corresponding to the jth load route is temporarily forwarded for more than Δt, the link pointer corresponding to the i + 1th flowlet is determined according to the hash hash algorithm;

Transmitting the i + 1th flowlet by the load corresponding to the determined link pointer corresponding to the i + 1th flowlet;

Wherein, the jth load route is any one of the M equal-cost load routes.
The flowlet load sharing method according to claim 4, wherein the amount of flowlet data carried on each equal-cost load route accounts for the total amount of flowlet data carried on the M equal-cost load routes Adjust the load sharing ratio, including:

When the to-be-transmitted flowlet is the i + 1th flowlet, if the proportion of the current flowlet data carried on the jth load route to the current total amount of flowlet data carried on the M equivalent load routes is greater than the preset value, And the absolute value of the difference from the preset load sharing ratio is greater than the preset threshold, adjusting the link pointer corresponding to the i + 1th flowlet;

Transmitting the i + 1th flowlet by the load route corresponding to the link pointer corresponding to the i + 1th flowlet after adjustment;

Wherein, the jth load route is any one of the M equal-cost load routes.
A flowlet load sharing device, characterized in that the device includes:

A hashing module, used to transform the original stream into an aggregated stream according to a hash hashing algorithm, the aggregated stream including N flow cluster flowlets, N is an integer, and N≥2;

The query module is used to query the FIB table of the forwarding information library to obtain the equivalent load routing information of the current flowlet to be transmitted, wherein the equivalent load routing information includes M equivalent load routes that can transmit the current flowlet to be transmitted, The current flowlet to be transmitted belongs to the N flow cluster flowlets;

An analysis module, configured to determine link pointer configuration information according to the equivalent load routing information, wherein the link pointer configuration information includes the number of link pointers corresponding to each of the equivalent load routes; and

Determining a link pointer corresponding to the current flowlet to be transmitted, where the link pointer is used to indicate a load route for transmitting the current flowlet to be transmitted;

A transmission device, configured to route the current flowlet to be transmitted by the determined load corresponding to the link pointer.
The flowlet load sharing device according to claim 7, wherein the determining a link pointer corresponding to the current flowlet to be transmitted includes:

When the current flowlet to be transmitted is the first flowlet, a time stamp t 1 is obtained ;

Determine the link pointer corresponding to the first flowlet according to the time stamp t 1 ;

When the current flowlet to be transmitted is the i-th flowlet, a time stamp t i is obtained ;

If t i -t i-1 -t i-1 '≥Δt, determine the link pointer corresponding to the i-th flowlet according to the time stamp t i ;

Wherein, t i is the i-th time-stamp when flowlet occurs, t i-1 to i-1 th timestamp occurs when flowlet, t i-1 'i-1 is the first one transmitted flowlet Time, Δt is a preset value; the link pointer corresponding to the i-th flowlet is different from the link pointer corresponding to the i-1th flowlet.
The flowlet load sharing device according to claim 8, wherein the determining the link pointer corresponding to the current flowlet to be transmitted includes:

When the current flowlet to be transmitted is the first flowlet, a random number l 1 is generated;

Determine the link pointer corresponding to the first flowlet according to the random number l 1 ;

When the current flowlet to be transmitted is the i-th flowlet, a random number l i is generated;

If t i -t i-1 -t i-1 '≥Δt, determine the link pointer corresponding to the i-th flowlet according to the random number l i ;

Wherein, t i is the i-th time-stamp when flowlet occurs, t i-1 to i-1 th timestamp occurs when flowlet, t i-1 'i-1 is the first one transmitted flowlet Time, Δt is a preset value; the link pointer corresponding to the i-th flowlet is different from the link pointer corresponding to the i-1th flowlet.
The flowlet load sharing device according to claim 8 or 9, wherein the device further comprises:

A statistics module for separately counting the amount of flowlet data carried on the link pointer; and

Count the amount of flowlet data carried on each equal-cost load route separately;

Separately calculating the proportion of the amount of flowlet data carried on each equal-cost load route to the total amount of flowlet data carried on the M equal-cost load routes;

Adjust load sharing according to the proportion of the amount of flowlet data carried on each of the equivalent load routes to the total amount of flowlet data carried on the M equivalent load routes, and the amount of flowlet data carried on the link pointer .
The flowlet load sharing device according to claim 10, wherein the amount of flowlet data carried on each equal-cost load route accounts for the total amount of flowlet data carried on the M equal-cost load routes Adjust the load sharing ratio, including:

When the to-be-transmitted flowlet is the i + 1th flowlet, if the proportion of the current flowlet data carried on the jth load route to the current total amount of flowlet data carried on the M equivalent load routes is greater than the preset value, And the absolute value of the difference from the preset load sharing ratio is greater than the preset threshold, and the traffic pointer transmission identifier is placed in front of the link pointer corresponding to the jth load route;

The jth load route stops transmitting the i + 1th flowlet, and caches the i + 1th flowlet;

If the link pointer corresponding to the jth load route is temporarily forwarded for more than Δt, the link pointer corresponding to the i + 1th flowlet is determined according to the hash hash algorithm;

Transmitting the i + 1th flowlet by the load corresponding to the determined link pointer corresponding to the i + 1th flowlet;

Wherein, the jth load route is any one of the M equal-cost load routes.
The flowlet load sharing device according to claim 10, wherein the amount of flowlet data carried on each equal-cost load route accounts for the total amount of flowlet data carried on the M equal-cost load routes Adjust the load sharing ratio, including:

When the to-be-transmitted flowlet is the i + 1th flowlet, if the proportion of the current flowlet data carried on the jth load route to the current total amount of flowlet data carried on the M equivalent load routes is greater than the preset value, And the absolute value of the difference from the preset load sharing ratio is greater than the preset threshold, adjusting the link pointer corresponding to the i + 1th flowlet;

Transmitting the i + 1th flowlet by the load route corresponding to the link pointer corresponding to the i + 1th flowlet after adjustment;

Wherein, the jth load route is any one of the M equal-cost load routes.
A flowlet load sharing device, characterized in that the device includes:

Memory, used to store computer execution instructions;

A processor, configured to execute the computer-executed instructions to implement the flowlet load sharing method according to any one of claims 1-6.
A computer-readable storage medium, characterized in that computer-executable instructions are stored on the computer-readable storage medium, and when the computer-executed instructions are executed by a processor, the flowlet according to any one of claims 1-6 is implemented Load sharing method.