Data transmission method and system based on multi-link network

Abstract

The invention discloses a data transmission method and system based on a multi-link network, and belongs to the technical field of network transmission, and the method comprises the following steps: obtaining a state index of each link; selecting a transmission link according to the state index of each link; distributing a to-be-transmitted data packet for the transmission link based on a queuing theory model; transmitting the data packet to be transmitted on the transmission link; according to the method, the link with the poor current state is eliminated according to the real-time state of each link, so that the link selection process is optimized, the data packets needing to be transmitted are distributed to the remaining links based on the queuing theory model, the distribution strategy is further optimized in combination with the grade system and the correlation degree, and dynamic management and optimization of the data transmission process are achieved.

Description

Technical Field

[0001] The present invention relates to the field of network transmission technology, and more particularly to a data transmission method and system based on a multi-link network. Background Art

[0002] With the continuous emergence of various Internet terminal devices on the market, including mobile phones, computers, smart home appliances, etc., the popularization of Internet terminals has made it easier for people to access the Internet. In this context, the home network has upgraded the export link from 100M fiber to 1G or even 10G. However, a single operator fiber will always be limited by hardware and geographical factors. Therefore, more and more smart homes are connected to the Internet through multiple local operator links, forming a multi-link access network.

[0003] The Chinese invention patent with publication number CN115580379A provides a multi-link network transmission method and system. For the target data to be sent, k data packets are taken as the number of original data packets to be sent each time, and FEC error correction coding is performed on k data packets as units to obtain a certain number of redundant packets, and then the k data packets and redundant packets are divided into m data packets, where m is the number of links between the selected sending node and the receiving node. Each link sends a piece of data to the receiving node, and the receiving node receives a combination of m data packets to obtain the original data packet. If a link fails during the transmission process, resulting in the loss of a preset number of data packets, the lost data packets can be restored using error correction coding and decoding.

[0004] However, this solution assumes that the link state is relatively stable, while in actual applications, the network environment often changes dynamically, so the existing technology has shortcomings. Summary of the invention

[0005] In view of the shortcomings of the prior art, the purpose of the present invention is to provide a data transmission method and system based on a multi-link network, which updates the list of available links in real time through the state factor of the link, and combines the correlation between the data packet and the link and the data level on the basis of the queuing theory model to optimize the data transmission strategy and realize dynamic management of the data transmission process.

[0006] To achieve the above object, the present invention provides the following technical solutions:

[0007] In a first aspect, the present invention provides a data transmission method based on a multi-link network, wherein the multi-link network includes multiple links, and the data transmission method includes:

[0008] Obtaining a status indicator of each of the links;

[0009] selecting a transmission link according to a status indicator of each of the links;

[0010] Allocating data packets to be transmitted to the transmission link based on a queuing theory model;

[0011] The data packet to be transmitted is transmitted on the transmission link.

[0012] As a further improvement of the present invention, the transmission links include multiple links, the data packets to be transmitted include multiple links, and the method of allocating the data packets to be transmitted to the transmission links based on the queuing theory model includes:

[0013] Identifying a first data packet to be transmitted, and obtaining a data volume corresponding to the first data packet to be transmitted, wherein the first data packet to be transmitted is a data packet most recently uploaded to the multi-link network;

[0014] Determine whether there is a first transmission link in the transmission links, where the first transmission link is a transmission link whose remaining load value is greater than the data volume corresponding to the first data packet to be transmitted;

[0015] If not, the first data packet to be transmitted is placed in a buffer area, and all data packets in the buffer area are reordered to obtain a queue sequence;

[0016] Taking the data packet at the first position in the queue sequence as the second data packet to be transmitted, determining whether there is a second transmission link in the transmission link, the second transmission link being a transmission link whose remaining load value is greater than the data volume corresponding to the second data packet to be transmitted;

[0017] If so, the second data packet to be transmitted is allocated to the second transmission link for transmission.

[0018] As a further improvement of the present invention, the determining whether there is a first transmission link in the transmission links includes:

[0019] If there is one of the first transmission links in the transmission links, allocating the first data packet to be transmitted to the first transmission link for transmission;

[0020] If there are multiple first transmission links in the transmission link, the first data packet to be transmitted is allocated to the first transmission link with the highest correlation for transmission.

[0021] As a further improvement of the present invention, allocating the first data packet to be transmitted to the first transmission link with the highest correlation for transmission includes:

[0022] Obtaining a maximum load value and a relative load value of each of the first transmission links, wherein the relative load value is a load value occupied by data packets of the same level as the first data packet to be transmitted among the data packets being transmitted by the first transmission link;

[0023] Calculating the association degree between the first data packet to be transmitted and each of the first transmission links according to the maximum load value and the relative load value of each of the transmission links;

[0024] The first transmission link with the highest correlation is obtained according to the correlation between the first data packet to be transmitted and each of the first transmission links.

[0025] As a further improvement of the present invention, the step of reordering all data packets in the buffer area includes:

[0026] Obtaining the level and queuing time of each data packet in the buffer area;

[0027] Arrange the data packets in the buffer area in descending order according to the levels;

[0028] If there are multiple data packets with the same level, the multiple data packets are arranged in descending order according to the queuing time;

[0029] Acquire the data packets whose queuing time exceeds the fixed threshold as timed-out data packets;

[0030] The timed-out data packets are placed at the head of the queue in descending order of queuing time.

[0031] As a further improvement of the present invention, the level of the data packet is divided according to the type of the data packet, and the type of the data packet is divided into background data, audio and video data, trigger data and security data, corresponding to level 1 to level 4 respectively.

[0032] As a further improvement of the present invention, the calculation formula of the correlation degree is:

[0033]

[0034] Among them C a is the correlation between the first data packet to be transmitted and the ath first transmission link, a=1, ..., A, A is the total number of first transmission links, L a，max is the maximum load value of the first transmission link a, l a is the relative load value of the a-th first transmission link.

[0035] As a further improvement of the present invention, the selecting a transmission link according to the status indicator of each link includes:

[0036] Calculating a state factor of each link according to a state indicator of each link;

[0037] Arrange each of the links in ascending order according to the numerical value of the state factor, and select the first N links as transmission links, where N is a positive integer greater than 1.

[0038] As a further improvement of the present invention, obtaining the delayed response time and the packet loss rate of each link includes:

[0039] Sending a plurality of detection data packets to each of the links respectively, and collecting corresponding response data packets;

[0040] Calculating the delayed response time of each of the links according to the timestamp in the response data packet;

[0041] The packet loss rate of each link is calculated according to the number of the detection data packets and the response data packets.

[0042] As a further improvement of the present invention, it also includes:

[0043] Determine whether the length of the queue sequence reaches a set threshold. If so, obtain the identifier of the data packet at the end of the queue, discard the data packet at the end of the queue, and repeat the step of determining whether the length of the queue sequence exceeds the set threshold until the judgment result is no, and retransmit the discarded data packet according to the identifier.

[0044] In a second aspect, the present invention provides a data transmission system based on a multi-link network, characterized in that the multi-link network includes multiple links, and the data transmission system includes:

[0045] A collection module, used to obtain status indicators of each link, wherein the status indicators include delayed response time and packet loss rate;

[0046] A selection module, used for selecting a transmission link according to a status indicator of each link;

[0047] The transmission module is used to allocate data packets to be transmitted to the transmission link based on a queuing theory model and perform data transmission.

[0048] The present invention establishes a state factor through the delayed response time, load value and packet loss rate of each link, measures the performance of the link more accurately, and combines queuing theory with relevance and data level, so as to select the best transmission link for each data packet and improve transmission efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] Figure 1 A schematic diagram of the steps of a data transmission method based on a multi-link network of the present invention;

[0050] Figure 2 A schematic diagram of a process of allocating data packets to be transmitted to a transmission link based on a queuing theory model according to the present invention;

[0051] Figure 3 It is a structural diagram of the queuing theory model;

[0052] Figure 4It is a schematic diagram of a data transmission system module based on a multi-link network of the present invention;

[0053] Figure 5 The figure is a schematic diagram of a specific application scenario of the data transmission system based on a multi-link network of the present invention. DETAILED DESCRIPTION

[0054] The technical solution of the present invention is described in detail below through the accompanying drawings and specific embodiments. It should be understood that the embodiments of the present invention and the specific features in the embodiments are detailed descriptions of the technical solution of the present invention, rather than limitations of the technical solution of the present invention.

[0055] The term "and / or" in the following text is only a description of the association relationship between the associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " generally indicates that the associated objects before and after are in an "or" relationship.

[0056] In order to achieve efficient transmission in multi-link networks, such as Figure 1 As shown, the embodiment of the present application provides a data transmission method based on a multi-link network, including:

[0057] Get status indicators for each link;

[0058] Selecting a transmission link based on the status indicator of each link;

[0059] Allocate data packets to be transmitted to transmission links based on a queuing theory model;

[0060] The data packet to be transmitted is transmitted on the transmission link.

[0061] The multi-link network includes multiple links. The data transmission method of the multi-link network refers to the technology of using multiple independent communication links to send data simultaneously during the data transmission process. This method uses multiple links to transmit data in parallel, which can significantly improve the bandwidth and reliability of the network. In multi-link transmission, multiple data packets can be transmitted simultaneously through different paths. This method not only increases the transmission rate, but also improves the stability of data transmission, because even if some links fail, other links can continue to transmit data, thereby ensuring the continuity and integrity of data transmission.

[0062] This embodiment quantifies the performance of each link through the real-time status of the link, selects suitable links from all links for data transmission, and applies the queuing theory model to the data packet allocation process. By modeling the link, its ability to transmit data is quantified, thereby improving transmission efficiency.

[0063] Furthermore, this embodiment provides a method for screening links according to link status, including:

[0064] Calculate the state factor of each link according to the state indicator of each link;

[0065] Arrange each link in ascending order according to the value of the state factor, and select the first N links as transmission links, where N is a positive integer greater than 1.

[0066] Specifically, the state factor K i The calculation formula is:

[0067]

[0068] Where K i represents the state factor of the i-th link, i=1,...,G, G is the total number of links, R i is the delayed response time of the ith link, R i，max is the maximum delay response tolerance time of the ith link, R i ≤R i，max , L i is the load value of the ith link, L i，max is the maximum load value of the ith link, L i ≤L i，max , D i is the packet loss rate of the ith link, R i，max and L i，max They are all related to the physical characteristics of the link itself. Different links have different values ​​and are usually a constant.

[0069] According to the formula, K i The smaller the value is, the better the state of the i-th link is and the more suitable it is for transmitting data packets. Therefore, each link can be arranged in ascending order according to the value of the state factor, and the first N links can be selected as transmission links, where N is a positive integer greater than 1 and N≤G. The specific value of N can be set according to transmission needs.

[0070] The existing technology usually only considers a single factor (such as delay, bandwidth, etc.) for link selection. This embodiment considers three common indicators related to the link status, namely, delay response time, packet loss rate and load value, to construct a state factor. Since the state of the link changes in real time during data transmission, the state factor of each link also changes in real time over time, which can accurately detect the real-time changes in link performance.

[0071] Furthermore, this embodiment provides a method for calculating delayed response time and packet loss rate, including:

[0072] Send multiple probe packets to each link and collect the corresponding response packets;

[0073] Calculate the delayed response time of each link based on the timestamp in the reply data packet;

[0074] The packet loss rate of each link is calculated based on the number of probe packets and reply packets.

[0075] Specifically, assume that k probe packets {p1, ..., p k}, where p k is the kth detection packet, and m response packets {rtt1, ..., rtt m}, where rtt m is the mth response data packet, m≤k, and the packet loss rate of the ith link can be obtained as:

[0076]

[0077] And because the response packet will return the identifier, sequence number and optional data part of the detection packet, when the link receives the response packet, it takes out the timestamp from its optional data part and compares it with the current time to get the delayed response time of the th response packet:

[0078] t j =T now -T stamp

[0079] where t j represents the delayed response time of the jth response data packet, j=1,...,m,T now is the current time, T stamp is the time in the timestamp, and the delayed response time of the i-th link is:

[0080]

[0081] This embodiment can accurately calculate the delayed response time and packet loss rate of each link by sending multiple detection data packets and collecting response data packets. The method has clear steps and is relatively simple to implement. It does not require complex algorithms or additional hardware support and can also be applied to networks of different sizes and types and is suitable for a variety of network environments.

[0082] Furthermore, this embodiment provides a method for allocating data packets to be transmitted to a transmission link based on a queuing theory model, such as Figure 2 As shown, including:

[0083] Identify a first data packet to be transmitted, and obtain a data volume corresponding to the first data packet to be transmitted, wherein the first data packet to be transmitted is a data packet most recently uploaded to the multi-link network;

[0084] Determine whether there is a first transmission link in the transmission link, the first transmission link being a transmission link whose remaining load value is greater than the data volume corresponding to the first data packet to be transmitted;

[0085] If not, the first data packet to be transmitted is placed in the buffer area, and all data packets in the buffer area are reordered to obtain a queue sequence;

[0086] The data packet at the first position in the queue sequence is taken as the second data packet to be transmitted, and it is determined whether there is a second transmission link in the transmission link, and the second transmission link is a transmission link whose remaining load value is greater than the data volume corresponding to the second data packet to be transmitted:

[0087] If yes, the second data packet to be transmitted is allocated to the second transmission link for transmission.

[0088] If the second transmission link does not exist, the step of determining whether the second transmission link exists in the transmission link is repeated until the second transmission link exists, and then the second data packet to be transmitted is allocated to the second transmission link for transmission.

[0089] The transmission links include a first transmission link and a second transmission link. Since the transmission links are determined according to the state factor, when the state factor changes over time, the selected transmission links will also change accordingly, and thus the first transmission link and the second transmission link will also change over time.

[0090] Since the bandwidth, delay, etc. of each link in a multi-link transmission network are different, the transmission quality of different links is different. At this time, if a transmission method that evenly distributes data packets to each link is used, the utilization rate of link resources will be greatly reduced. Therefore, the transmission method based on the queuing theory model provided in this implementation reasonably distributes data packets according to the current load value of the link to improve transmission efficiency.

[0091] The queuing theory model can be divided into M / M / S queuing systems with multiple servers, such as Figure 3 As shown in case (a) of , and the M / M / 1 queueing system with a single server, as Figure 3 As shown in case (b), in this embodiment, the number of links is the number of service stations.

[0092] The M / M / 1 queuing system of a single server creates a buffer for each transmission link, and puts the first data packet to be transmitted in the buffer of the corresponding link for queuing, and the transmission link will not be changed later. This embodiment is based on the M / M / S queuing system of multiple servers, creates the same buffer for all transmission links, and arranges all data packets into a sequence waiting for transmission, which can effectively improve the transmission efficiency.

[0093] Exemplarily, it is assumed that three transmission paths are screened out through the state factor, that is, N=3, the average arrival rate of the first data packet to be transmitted arriving at the cache area obeys the Poisson distribution, λ=0.9 / s, and the average service time μ=0.4 / s, where the service time refers to the time it takes for the data packet to be transmitted and confirmed in the link. After the first data packet to be transmitted arrives at the cache area, a queue sequence is formed. At this time, the queue system is an M / M / 3 queue system. If a cache area is created for each transmission link, three queue sequences will be formed. At this time, the queue system is 3 M / M / 1 queue systems. After calculation, the transmission efficiency of different modes can be obtained as shown in Table 1.

[0094] Table 1

[0095] M / M / 3 Queuing System 3 M / M / 1 queuing systems The average length of the queue 3.95 9 Average waiting time per packet 1.89 7.5

[0096] According to the above examples, the average length and average waiting time of the queue sequence of the method provided in this embodiment are both short. Therefore, the method provided in this embodiment can effectively improve the data transmission efficiency and ensure that data packets can be reasonably allocated and transmitted.

[0097] Furthermore, if there are fewer data packets being transmitted at the current time, or if there are more transmission links screened out according to the state factor, it may result in multiple first transmission links being simultaneously available for transmitting the first data packet to be transmitted. Therefore, this embodiment provides a judgment step for selecting a suitable link from the multiple first transmission links, including:

[0098] If there is a first transmission link in the transmission link, allocating the first data packet to be transmitted to the first transmission link for transmission;

[0099] If there are multiple first transmission links in the transmission link, the first data packet to be transmitted is allocated to the first transmission link with the highest correlation for transmission according to the correlation between the first data packet to be transmitted and each first transmission link.

[0100] This embodiment selects a suitable first transmission link according to the correlation degree, and can effectively handle the situation where multiple first transmission links appear at the same time.

[0101] Furthermore, this embodiment provides a method for calculating the correlation degree, which is specifically:

[0102] Obtaining a maximum load value and a relative load value of each first transmission link, wherein the relative load value is the load value occupied by data packets having the same level as the first data packet to be transmitted among the data packets being transmitted on the first transmission link;

[0103] Calculating the association between the first data packet to be transmitted and each first transmission link according to the maximum load value and the relative load value of each transmission link;

[0104] Each first transmission link is sorted in descending order according to the numerical value of the correlation degree to obtain the first transmission link with the highest correlation degree.

[0105] Specifically, the calculation formula of correlation is:

[0106]

[0107] Among them C a is the correlation between the first data packet to be transmitted and the ath first transmission link, a=1, ..., A, A is the total number of first transmission links, L a，max is the maximum load value of the first transmission link a, l a is the relative load value of the a-th first transmission link.

[0108] In multi-link data transmission, data packets may be sent to any link. Different physical characteristics of the links result in different data delivery orders. For data packets with strong continuity, a data packet reordering algorithm needs to be adopted at the receiving end to reorder the data packets, which will cause huge delays. The method provided in this embodiment takes into account the correlation between data packets and links. It can not only be used to handle the situation where multiple first transmission links appear at the same time, but also can transmit data packets of the same level to the same link, reducing the number of disordered data packets and improving transmission efficiency.

[0109] In addition, in the step of determining whether there is a second transmission link in the transmission link, it is also possible that multiple second transmission links exist at the same time. In this case, the second transmission link can also be selected by calculating the correlation degree. The specific calculation steps are the same as the above steps and will not be described in detail here.

[0110] Furthermore, since there may be multiple data packets in the buffer area, this embodiment provides a step of reordering in the buffer area, including:

[0111] Get the level and queuing time of each data packet in the buffer;

[0112] Arrange the data packets in the buffer in descending order of level;

[0113] If there are multiple data packets with the same level, the multiple data packets are sorted in descending order according to the queuing time;

[0114] The data packets whose queuing time exceeds a fixed threshold are obtained as timed-out data packets;

[0115] Place the timed-out packets at the head of the queue in descending order of queuing time.

[0116] In a multi-link network, the types of data packets often show a certain diversity. Different data types correspond to different transmission requirements. Therefore, this embodiment divides the data packets into multiple levels according to the types of data packets. The data packets include four types: background data, audio and video data, trigger data, and security data, which correspond to levels 1 to 4 respectively. The higher the level of the data packet, the lower the delay tolerance of the data packet, and the faster it needs to be transmitted. Therefore, sorting the data packets in the cache area by level can ensure that high-level data packets can be transmitted in a shorter time.

[0117] If there are multiple data packets of the same level in the buffer at the same time, the multiple data packets are arranged in descending order according to the queuing time, so that the data packets with longer queuing time are transmitted first to ensure transmission efficiency.

[0118] However, in the above scheme, higher-level data packets have unlimited priority, that is, lower-level data packets can only be transmitted after all higher-level data packets in the queue sequence are transmitted, resulting in a long waiting time for lower-level data packets, which affects the fairness of data transmission to a certain extent.

[0119] Therefore, the queuing rules can be further improved, that is, a fixed threshold is set. If the queuing time of a data packet exceeds the fixed threshold, it will be placed at the head of the queue as a timed-out data packet. If multiple timed-out data packets appear at the same time, they will be placed at the head of the queue in descending order of queuing time, and data packets with longer queuing time will be transmitted first.

[0120] Or at fixed intervals, a low-level data packet is forced to be placed at the head of the queue. At this time, the high-level data packet previously at the head of the queue needs to wait until the low-level data packet that cuts in line is transmitted before it can be transmitted, thereby providing relatively fair transmission services for each data packet.

[0121] Furthermore, if a large number of data packets to be transmitted are stored in the buffer area, the transmission efficiency will be affected. Therefore, this embodiment provides a packet loss method, which is specifically:

[0122] Determine whether the length of the queue sequence reaches a set threshold. If so, obtain the identifier of the data packet at the end of the queue, discard the data packet at the end of the queue, and repeat the step of determining whether the length of the queue sequence exceeds the set threshold until the judgment result is no, and retransmit the discarded data packet according to the identifier.

[0123] The packet loss method provided in this embodiment is to give priority to discarding the data packets at the end of the queue. Since the data packets at the end of the queue have a lower level, the impact of discarding the data packets is also smaller. At the same time, the length of the queue sequence is monitored in real time. If there is a vacant position, the data can be retransmitted according to the data packet identifier.

[0124] It can be seen from the above embodiments that a data transmission method based on a multi-link network provided by the present application establishes a state factor through multiple state indicators, comprehensively measures the state of the link, and allocates data packets based on a queuing theory model. At the same time, it combines the correlation between the data packet and the link, and the level of the data packet, to further improve the accuracy of the transmission decision plan.

[0125] The following is a further description of the system constructed by the present application using the method in the above embodiment.

[0126] like Figure 4 As shown, the embodiment of the present application further provides a data transmission system based on a multi-link network, including:

[0127] A collection module is used to obtain the status indicators of each link, including delayed response time and packet loss rate;

[0128] A selection module, used for selecting a transmission link according to a status indicator of each link;

[0129] The transmission module is used to allocate data packets to be transmitted to the transmission link based on the queuing theory model and perform data transmission.

[0130] The system provided in this embodiment adopts a modular design, and the collection module, selection module and transmission module work together to more effectively obtain link status indicators and make rapid responses. At the same time, based on the queuing theory model, data packets to be transmitted are allocated for data transmission, which can optimize the utilization of link network resources and improve the overall transmission performance.

[0131] For example, Figure 5 As shown, this embodiment provides a specific scenario for applying the system.

[0132] With the continuous emergence of various Internet terminal devices on the market, including mobile phones, computers, smart home appliances, etc., the popularization of Internet terminals has made it easier for people to access the Internet. In this context, the home network has upgraded the export link from 100M fiber to 1G or even 10G. However, a single operator fiber will always be limited by hardware and geographical factors. Therefore, more and more smart homes are connected to the Internet through multiple local operator links, forming a multi-link access network.

[0133] The data transmission system based on a multi-link network provided in this embodiment will be applied in a multi-link access network in a new smart home scenario. The egress gateway of the smart home will be connected to multiple network links, including Ethernet links and wireless links from multiple operators such as China Telecom, China Unicom, and China Mobile, to form a multi-link access gateway.

[0134] In such a network with multiple links, it is easy for new links to be connected and faulty links to be disconnected. In view of this situation, the embodiments of the present application can dynamically obtain the information of each link more accurately, quickly and in real time, instead of manually configuring fixed link information when a link changes, and can effectively evaluate the link quality through link status information. At the same time, based on the quality of the link, the queuing theory method is used to reasonably allocate the transmission path to achieve efficient data transmission.

[0135] The embodiments of the present application provide a data transmission method and system based on a multi-link network. A dynamic link elimination mechanism is formed through the real-time status of the link, and the list of available links can be updated in real time to ensure that data transmission always selects the link with the best performance. Data packets that need to be transmitted are allocated to the link based on queuing theory, relevance and hierarchy, thereby realizing dynamic management and optimization of the data transmission process.

[0136] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0137] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0138] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0139] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0140] The above are only preferred embodiments of the present invention. The protection scope of the present invention is not limited to the above embodiments. All technical solutions under the concept of the present invention belong to the protection scope of the present invention. It should be pointed out that for ordinary technicians in this technical field, some improvements and modifications without departing from the principle of the present invention should also be regarded as the protection scope of the present invention.

Claims

1. A data transmission method based on a multi-link network, characterized in that: The multi-link network includes multiple links, and the data transmission method includes: Obtaining a status indicator of each of the links; selecting a transmission link according to a status indicator of each of the links; Allocating data packets to be transmitted to the transmission link based on a queuing theory model; The data packet to be transmitted is transmitted on the transmission link.

2. A data transmission method based on a multi-link network according to claim 1, characterized in that: The transmission links include a plurality of links, the data packets to be transmitted include a plurality of links, and the method of allocating the data packets to be transmitted to the transmission links based on the queuing theory model includes: Identifying a first data packet to be transmitted, and obtaining a data volume corresponding to the first data packet to be transmitted, wherein the first data packet to be transmitted is a data packet most recently uploaded to the multi-link network; Determine whether there is a first transmission link in the transmission links, where the first transmission link is a transmission link whose remaining load value is greater than the data volume corresponding to the first data packet to be transmitted; If not, the first data packet to be transmitted is placed in a buffer area, and all data packets in the buffer area are reordered to obtain a queue sequence; Taking the data packet at the first position in the queue sequence as the second data packet to be transmitted, determining whether there is a second transmission link in the transmission link, the second transmission link being a transmission link whose remaining load value is greater than the data volume corresponding to the second data packet to be transmitted; If so, the second data packet to be transmitted is allocated to the second transmission link for transmission.

3. A data transmission method based on a multi-link network according to claim 2, characterized in that: The determining whether there is a first transmission link in the transmission links includes: If there is one of the first transmission links in the transmission links, allocating the first data packet to be transmitted to the first transmission link for transmission; If there are multiple first transmission links in the transmission link, the first data packet to be transmitted is allocated to the first transmission link with the highest correlation for transmission.

4. A data transmission method based on a multi-link network according to claim 3, characterized in that: The allocating the first data packet to be transmitted to the first transmission link with the highest correlation for transmission includes: Obtaining a maximum load value and a relative load value of each of the first transmission links, wherein the relative load value is a load value occupied by data packets of the same level as the first data packet to be transmitted among the data packets being transmitted by the first transmission link; Calculating the association degree between the first data packet to be transmitted and each of the first transmission links according to the maximum load value and the relative load value of each of the transmission links; The first transmission link with the highest correlation is obtained according to the correlation between the first data packet to be transmitted and each of the first transmission links.

5. A data transmission method based on a multi-link network according to claim 4, characterized in that: The step of reordering all data packets in the buffer area comprises: Obtaining the level and queuing time of each data packet in the buffer area; Arrange the data packets in the buffer area in descending order according to the levels; If there are multiple data packets with the same level, the multiple data packets are arranged in descending order according to the queuing time; Acquire the data packets whose queuing time exceeds the fixed threshold as timed-out data packets; The timed-out data packets are placed at the head of the queue in descending order of queuing time.

6. A data transmission method based on a multi-link network according to claim 4, characterized in that: The calculation formula of the correlation degree is: Among them C a is the correlation between the first data packet to be transmitted and the ath first transmission link, a=1, ..., A, A is the total number of first transmission links, L a，max is the maximum load value of the first transmission link a, l a is the relative load value of the a-th first transmission link.

7. A data transmission method based on a multi-link network according to claim 1, characterized in that: The selecting a transmission link according to the status indicator of each link comprises: Calculating a state factor of each link according to a state indicator of each link, wherein the state indicator includes a delayed response time, a packet loss rate, and a load value; Arrange each of the links in ascending order according to the numerical value of the state factor, and select the first N links as transmission links, where N is a positive integer greater than 1.

8. A data transmission method based on a multi-link network according to claim 7, characterized in that: Obtaining the delayed response time and packet loss rate of each link, including: Sending a plurality of detection data packets to each of the links respectively, and collecting corresponding response data packets; Calculating the delayed response time of each of the links according to the timestamp in the response data packet; The packet loss rate of each link is calculated according to the number of the detection data packets and the response data packets.

9. A data transmission method based on a multi-link network according to claim 5, characterized in that: Also includes: Determine whether the length of the queue sequence reaches a set threshold. If so, obtain the identifier of the data packet at the end of the queue, discard the data packet at the end of the queue, and repeat the step of determining whether the length of the queue sequence exceeds the set threshold until the judgment result is no, and retransmit the discarded data packet according to the identifier.

10. A data transmission system based on a multi-link network, used to implement a data transmission method based on a multi-link network as claimed in any one of claims 1 to 9, characterized in that: The multi-link network includes multiple links, and the data transmission system includes: A collection module, used to obtain status indicators of each link, wherein the status indicators include delayed response time and packet loss rate; A selection module, used for selecting a transmission link according to a status indicator of each link; The transmission module is used to allocate data packets to be transmitted to the transmission link based on a queuing theory model and perform data transmission.

Images