A data transmission method and system based on a multi-link network

Abstract

The application discloses a kind of data transmission method and system based on multi-link network, belong to network transmission technical field, its technical scheme main points include: the state index of each link is obtained;According to the state index of each link, transmission link is selected;Based on queuing theory model, transmission link is allocated to be transmitted data packet;Transmit the data packet to be transmitted on transmission link;The application is by the real-time state of each link, and the link with poor current state is removed, so that the link selection process is optimized, based on queuing theory model, the data packet that needs to be transmitted is allocated to remaining link, and further optimize allocation strategy in combination with hierarchy and correlation, realize the dynamic management and optimization to data transmission process.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of network transmission, and more particularly to a data transmission method and system based on a multi-link network. BACKGROUND

[0002] With the emergence of various Internet terminal devices on the market, including mobile phones, computers, smart home appliances, etc., the popularity of Internet terminals has made it more convenient for people to access the Internet. Under such a background, the export link of the home network is upgraded from a hundred megabit fiber to a gigabit or even a terabit. However, a single operator fiber is always limited by hardware and geographical factors. Therefore, more and more smart homes access the Internet through multiple operator links in the local area, forming a multi-link access network.

[0003] A multi-link network transmission method and system are provided in Chinese patent application No. CN115580379A. For the target data to be sent, k data packets are taken as the original data packet number for each transmission. FEC error correction coding is performed on the k data packets to obtain a certain number of redundant packets. Then, the k data packets and the redundant packets are divided into m parts of data, where m is the number of links between the selected sending nodes and the receiving nodes. Each link sends one part of data to the receiving node. The receiving node receives the m parts of data and obtains the original data packet. If a link fails during transmission, resulting in the loss of one part to a preset number of data, the lost data packet can be restored using error correction coding.

[0004] However, this scheme assumes that the link state is relatively stable, but in actual applications, the network environment is often dynamic. Therefore, the prior art has deficiencies. SUMMARY

[0005] To address the deficiencies of the prior art, the present application provides a data transmission method and system based on a multi-link network. The available link list is updated in real time by the state factor of the link. Based on the queuing theory model, the association degree of the data packet and the link and the data level are combined to optimize the data transmission strategy and realize dynamic management of the data transmission process.

[0006] To achieve the above-mentioned purpose, the present application provides the following technical solutions:

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

[0008] obtaining a state index of each link;

[0009] selecting a transmission link according to the state index of each link;

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

[0011] transmitting the data packets to be transmitted on the transmission links.

[0012] As a further improvement of the application, the transmission links comprise a plurality, and the data packets to be transmitted comprise a plurality, and the allocating the data packets to be transmitted to the transmission links based on a queuing theory model comprises:

[0013] identifying a first data packet to be transmitted, obtaining a data amount corresponding to the first data packet to be transmitted, the first data packet to be transmitted being a data packet newly uploaded into the multi-link network;

[0014] determining whether there is a first transmission link in the transmission links, the first transmission link being a transmission link with a residual load value greater than the data amount corresponding to the first data packet to be transmitted;

[0015] if not, placing the first data packet to be transmitted in a buffer area, and reordering all data packets in the buffer area to obtain a queuing sequence;

[0016] taking a data packet at the head of the queuing sequence as a second data packet to be transmitted, and determining whether there is a second transmission link in the transmission links, the second transmission link being a transmission link with a residual load value greater than the data amount corresponding to the second data packet to be transmitted;

[0017] if yes, allocating the second data packet to be transmitted to the second transmission link for transmission.

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

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

[0020] if there are a plurality of first transmission links in the transmission links, allocating the first data packet to be transmitted to the first transmission link with the highest correlation degree for transmission.

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

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

[0023] According to the maximum load value and the relative load value of each transmission link, the association degree of the first to-be-transmitted data packet and each first transmission link is calculated;

[0024] According to the association degree of the first to-be-transmitted data packet and each first transmission link, the first transmission link with the highest association degree is obtained.

[0025] As a further improvement of the present application, the reordering of all data packets in the buffer area comprises:

[0026] The rank and the queuing time length of each data packet in the buffer area are obtained;

[0027] The data packets in the buffer area are arranged in descending order of the rank;

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

[0029] Data packets with a queuing time length exceeding a fixed threshold are obtained as timeout data packets;

[0030] The timeout data packets are placed at the head of the queue in descending order of the queuing time length.

[0031] As a further improvement of the present application, the rank 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 class data, corresponding to ranks 1 to 4 respectively.

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

[0033]

[0034] Wherein C a is the association degree of the first to-be-transmitted data packet and the a-th 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 a-th first transmission link, l a is the relative load value of the a-th first transmission link.

[0035] As a further improvement of the present application, the selection of the transmission link according to the state index of each link comprises:

[0036] The state factor of each link is calculated according to the state index of each link;

[0037] Each link is arranged in ascending order of the numerical value of the state factor, and the first N links are selected as transmission links, wherein N is a positive integer greater than 1.

[0038] As a further improvement of the present application, the delay response time and the packet loss rate of each link are obtained, comprising:

[0039] A plurality of probe data packets are sent to each link respectively, and the corresponding response data packets are collected;

[0040] The delay response time of each link is calculated according to the time stamp in the response data packet;

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

[0042] As a further improvement of the present application, it further comprises:

[0043] It is judged whether the length of the queue sequence reaches a set threshold value, if yes, the identifier of the data packet at the end of the queue is obtained, the data packet at the end of the queue is discarded, the step of judging whether the length of the queue sequence exceeds the set threshold value is repeated until the result is no, and the discarded data packet is retransmitted according to the identifier.

[0044] In a second aspect, the present application provides a data transmission system based on a multi-link network, characterized in that the multi-link network comprises a plurality of links, and the data transmission system comprises:

[0045] The acquisition module is used for obtaining the state indicators of each link, and the state indicators comprise the delay response time and the packet loss rate;

[0046] The selection module is used for selecting a transmission link according to the state indicators of each link;

[0047] The transmission module is used for allocating the data packets to be transmitted to the transmission link based on the queuing theory model, and performing data transmission.

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

[0049] Figure 1 The figure is a flowchart of the data transmission method based on a multi-link network of the present application;

[0050] Figure 2 The figure is a flowchart of the process of allocating the data packets to be transmitted to the transmission link based on the queuing theory model of the present application;

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

[0052] Figure 4A schematic diagram of a data transmission system module based on a multi-link network according to the present application;

[0053] Figure 5 A schematic diagram of a specific application scenario of a data transmission system based on a multi-link network according to the present application. DETAILED DESCRIPTION

[0054] The technical solutions of the present application will be described in detail below with reference to the accompanying drawings and specific embodiments. It should be understood that the embodiments of the present application and the specific features in the embodiments are detailed descriptions of the technical solutions of the present application, but not limitations of the technical solutions of the present application.

[0055] The term "and / or" in the following merely describes an association relationship of associated objects, which means that there can be three relationships, for example, A and / or B, which can represent the three cases of existence of A alone, existence of A and B together, and existence of B alone. In addition, the character " / " generally represents an "or" relationship between the front and rear associated objects.

[0056] In order to achieve efficient transmission in a multi-link network, as shown in the prior art, the embodiments of the present application provide a data transmission method based on a multi-link network, comprising: Figure 1

[0057] Obtaining the state indicators of each link;

[0058] Selecting a transmission link according to the state indicators of each link;

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

[0060] Transmitting the data packets to be transmitted on the transmission link.

[0061] The multi-link network includes multiple links, and the data transmission method based on a multi-link network refers to a technology of using multiple independent communication links to transmit data simultaneously in the data transmission process. This method utilizes 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, which not only increases the transmission rate, but also improves the stability of data transmission. Even if some links fail, other links can continue to transmit data, thereby ensuring the continuity and integrity of data transmission.

[0062] The embodiments of the present application quantify the performance of each link through the real-time state of the link, select suitable links from all links for data transmission, and apply a queuing theory model to the data packet allocation process. By modeling the link and quantifying its data transmission capacity, the transmission efficiency is improved.

[0063] Further, the embodiments of the present application provide a method for selecting a link according to a link state, comprising:​

[0064] calculating a state factor of each link according to the state index of each link;

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

[0066] Specifically, the state factor K i is calculated according to the following formula:

[0067]

[0068] where K i represents the state factor of the ith link, i = 1,..., G, G is the total number of links, R i is the delay 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 are related to the physical characteristics of the link itself, and different links have different values, which are usually constants.

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

[0070] The prior art usually only considers a single factor (such as delay, bandwidth, etc.) for link selection. The present embodiment considers three commonly used indicators related to the state of the link, 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 with time, so that the real-time changes in link performance can be accurately detected.

[0071] Further, the present embodiment provides a method for calculating the delay response time and the packet loss rate, comprising:

[0072] sending a plurality of probe data packets to each link respectively, and collecting the corresponding response data packets;

[0073] Calculate the delay response time for each link based on the timestamp in the response data packet;

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

[0075] Specifically, suppose k probe data packets {p1, ..., p1} are sent to the i-th link. k}, where p k For the k-th probe data packet, and collect m response data packets {rtt1, ...,rtt} m}, where rtt m For the m-th response data packet, m≤k, the packet loss rate of the i-th link can be obtained as follows:

[0076]

[0077] Furthermore, since the response packet will return the identifier, sequence number, and optional data portion of the probe packet, when the link receives the response packet, it can extract the timestamp from its optional data portion and compare it with the current time to determine the delay response time of the i-th response packet.

[0078] t j =T now -T stamp

[0079] Where t j This represents the delay response time of the j-th response data packet, where j = 1, ..., m, T now T represents the current time. stamp Given the time in the timestamp, the latency response time of the i-th link is obtained as follows:

[0080]

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

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

[0083] Identify the first data packet to be transmitted and obtain the data volume corresponding to the first data packet to be transmitted. The first data packet to be transmitted is the latest data packet uploaded to the multi-link network.

[0084] Determine whether a first transmission link exists in the transmission link. 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.

[0085] If not, place the first data packet to be transmitted in the buffer area, and reorder all data packets in the buffer area to obtain the queuing sequence;

[0086] The data packet at the head of the queue is taken as the second data packet to be transmitted. It is then determined whether a second transmission link exists. The second transmission link is one whose remaining load value is greater than the data volume corresponding to the second data packet to be transmitted.

[0087] If so, the second data packet to be transmitted will be assigned to the second transmission link for transmission.

[0088] If a second transmission link does not exist, the process of determining whether a second transmission link exists is repeated until a second transmission link exists. Then, the second data packet to be transmitted is assigned to the second transmission link for transmission.

[0089] The transmission link includes a first transmission link and a second transmission link. Since the transmission link is determined based on the state factor, the selected transmission link will also change as the state factor changes over time, and consequently the first and second transmission links will also change over time.

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

[0091] Queuing models can be divided into multi-server M / M / S queuing systems, such as... Figure 3 As shown in case (a), and the M / M / 1 queuing system with a single service counter, such as Figure 3 As shown in case (b) in this embodiment, the number of links is the same as the number of service desks.

[0092] A single-server M / M / 1 queuing system creates a buffer for each transmission link and places the first data packet to be transmitted in the buffer of the corresponding link for queuing, without subsequently changing the transmission link. This embodiment, based on a multi-server M / M / S queuing system, creates the same buffer for all transmission links, queuing all data packets into a single sequence for transmission, which can effectively improve transmission efficiency.

[0093] For example, assuming that 3 transmission paths are screened out by the state factor, i.e. N=3, the average arrival rate of the first to-be-transmitted data packet arriving at the buffer area obeys the Poisson distribution, λ=0.9 per second, and the average service time μ=0.4 per second, wherein the service time refers to the time for the data packet to be transmitted in the link and be confirmed, and a queuing sequence is formed after the first to-be-transmitted data packet arrives at the buffer area, at this time, the queuing system is an M / M / 3 queuing system, if a buffer area is created for each transmission link, 3 queuing sequences will be formed, at this time, the queuing system is 3 M / M / 1 queuing systems, and the transmission efficiency in different ways can be obtained through calculation, as shown in Table 1.

[0094] Table 1

[0095] M / M / 3 queuing system 3 M / M / 1 queuing system Average queue length of the queuing sequence 3.95 9 Average waiting time of each data packet 1.89 7.5

[0096] According to the above example, it can be known that the average queue length and the average waiting time of the queuing sequence of the method provided by the embodiment are relatively short, and therefore the method provided by the embodiment can effectively improve the data transmission efficiency and ensure that the data packets can be reasonably allocated and transmitted.

[0097] Further, if the data packets transmitted at the current time are relatively few, or the transmission links screened out according to the state factor are relatively many, it may cause that multiple first transmission links can be used to transmit the first to-be-transmitted data packet at the same time, and therefore the embodiment provides a judgment step for selecting a suitable link from the multiple first transmission links, comprising:

[0098] If there is one first transmission link in the transmission link, the first to-be-transmitted data packet is allocated to the first transmission link for transmission;

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

[0100] The embodiment can effectively handle the case that multiple first transmission links appear at the same time by selecting a suitable first transmission link according to the association degree.

[0101] Further, the embodiment provides a method for calculating the association degree, specifically comprising:

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

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

[0104] Sort each first transmission link according to the value of the correlation degree in descending order to obtain the first transmission link with the highest correlation degree.

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

[0106]

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

[0108] In the multi-link data transmission, the data packet can be sent to any link, and the different physical characteristics of the links result in different data arrival sequences. 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 can cause huge delay. The method provided in the embodiment considers the correlation degree between the data packet and the link, and can not only be used to handle the case where multiple first transmission links appear at the same time, but also can transmit data packets with the same level to the same link, reduce the number of data packet disordering, and improve the transmission efficiency.

[0109] In addition, in the step of judging whether the transmission link exists the second transmission link, the case where multiple second transmission links exist at the same time can also occur. At this time, the second transmission link can also be selected by calculating the correlation degree, and the specific calculation steps are the same as the above steps, which will not be described in detail here.

[0110] Further, since multiple data packets can exist in the buffer area, the embodiment provides a step of reordering in the buffer area, comprising:

[0111] Obtain the level and queuing time length of each data packet in the buffer area;

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

[0113] If multiple data packets have the same level, arrange the multiple data packets in descending order according to the queuing time length;

[0114] Obtain the data packet with the queuing time length exceeding the fixed threshold as the timeout data packet;

[0115] Place the timeout data packet at the head of the queue in descending order of the queuing time length.

[0116] In the multi-link network, the types of data packets tend to present a certain diversity, and different data types correspond to different transmission requirements. Therefore, the data packets are divided into multiple levels according to the types of the data packets in the embodiment. The data packets include four types of 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 data packet needs to be transmitted as soon as possible. Therefore, the data packets in the buffer area are sorted by level, so that the high-level data packets can be transmitted in a shorter time.

[0117] If there are multiple data packets with the same level in the buffer area, 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 preferentially to ensure transmission efficiency.

[0118] However, in the above scheme, the high-level data packets have unlimited priority, that is, only after all the high-level data packets in the queuing sequence are transmitted, the low-level data packets can be transmitted, which leads to a long waiting time of the low-level data packets and affects the fairness of data transmission to some extent.

[0119] Therefore, the queuing rule can be further improved, that is, a fixed threshold is set, and if the queuing time of a data packet exceeds the fixed threshold, the data packet is regarded as an overtime data packet and placed at the head of the queue. If multiple overtime data packets exist at the same time, they are placed at the head of the queue in descending order of queuing time, and the data packet with longer queuing time is transmitted preferentially.

[0120] Or every fixed time, 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 located at the head of the queue needs to wait for the transmission of the inserted low-level data packet to be completed before it can be transmitted, thereby providing relatively fair transmission service for each data packet.

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

[0122] It is judged whether the length of the queuing sequence reaches a set threshold. If yes, the identifier of the data packet at the tail of the queue is obtained, the data packet at the tail of the queue is discarded, and the step of judging whether the length of the queuing sequence exceeds the set threshold is repeated until the result is no. The discarded data packet is retransmitted according to the identifier.

[0123] The packet dropping method provided by the embodiment is to preferentially discard the data packet at the tail of the queue. Since the data packet at the tail of the queue has a low level, the impact of discarding the data packet is small. At the same time, the length of the queuing sequence is monitored in real time, and if there is a spare position, the data packet can be retransmitted according to the identifier.

[0124] As can be seen from the above embodiments, the data transmission method based on multi-link networks provided in this application establishes state factors through multiple state indicators, comprehensively measures the state of the links, allocates data packets based on queuing theory models, and further improves the accuracy of transmission decision schemes by combining the correlation between data packets and links and the level of data packets.

[0125] The system constructed using the methods described in the above embodiments will be further described below.

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

[0127] The data acquisition module is used to obtain the status indicators of each link, including latency response time and packet loss rate.

[0128] The selection module is used to select the transmission link based on the status indicators 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 to transmit the data.

[0130] The system provided in this embodiment, through its modular design, allows the acquisition module, selection module, and transmission module to work together, enabling more effective acquisition of link status indicators and rapid response. At the same time, based on the queuing theory model, it allocates data packets to be transmitted, which can optimize the utilization of link network resources and improve overall transmission performance.

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

[0132] With the continuous emergence of various Internet access devices on the market, including mobile phones, computers, and smart home appliances, the widespread availability of Internet access devices has made it easier for people to access the Internet. Against this backdrop, home networks are upgrading their outbound links from 100 Mbps fiber optic cables to gigabit or even 10 Mbps. However, a single operator's fiber optic cable is always limited by factors such as hardware and geographical location. Therefore, more and more smart homes are accessing the Internet through multiple local operator links, forming a multi-link access network.

[0133] The data transmission system based on multi-link networks provided in this embodiment will be applied in multi-link access networks in new smart home scenarios. The smart home's exit gateway 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, forming a multi-link access gateway.

[0134] In the multi-link access network, the access of new links and the disconnection of failed links are prone to occur. For this case, the embodiments of the present application can more accurately, quickly and timely acquire the information of each link, instead of manually configuring fixed link information when the link changes, and can effectively evaluate the link quality based on the link state information. Meanwhile, the transmission path is reasonably allocated based on the quality of the link using the queuing theory method, so as to realize 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 based on the real-time state of the link, the available link list can be updated in real time, the performance of the link is ensured to be optimal when data transmission is selected, and the data packets to be transmitted are allocated to the link based on the queuing theory, the correlation degree and the hierarchical system, so as to realize dynamic management and optimization of the data transmission process.

[0136] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system or a computer program product. Therefore, the present application can be in the form of a complete hardware embodiment, a complete software embodiment or an embodiment combining software and hardware aspects. Moreover, the present application can be in 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 application is described with reference to flowcharts and / or block diagrams of the method, device (system) and computer program product according to the embodiments of the present application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of the flows and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions can be provided to the 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 produce a device that implements the functions specified in the flowcharts and / or block diagrams. Figure 1 The functions specified in one or more flows and / or blocks. Figure 1 The means for performing the functions specified in one or more flows and / or blocks.

[0138] These computer program instructions can also be stored in a computer readable storage medium that can guide the computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable storage medium produce a manufactured product including instruction means, which implements the functions specified in the flowcharts and / or block diagrams. Figure 1 The functions specified in one or more flows and / or blocks. Figure 1 The means for performing the functions specified in one or more flows and / or blocks.

[0139] These computer program instructions can also be loaded into a computer or other programmable data processing devices, so that a series of operational steps are performed on the computer or other programmable data processing devices to generate a computer implemented process, so that the instructions executed on the computer or other programmable data processing devices provide a process for implementing the flowchart Figure 1 one flow or multiple flows and / or the functions specified in the block Figure 1 one flow or multiple flows and / or the functions specified in the block

[0140] The above is only the preferred embodiment of the present application, the protection scope of the present application is not limited to the above-mentioned examples, all the technical solutions belonging to the idea of the present application are within the protection scope of the present application. It should be pointed out that for ordinary skilled in the art, without departing from the principles of the present application under the premise of a number of improvements and refinements, these improvements and refinements should also be considered as the protection scope of the present application.

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: Obtain the status indicators for each of the links; Select the transmission link based on the status indicators of each link; The data packets to be transmitted are allocated to the transmission link based on the queuing theory model; The data packet to be transmitted is transmitted over the transmission link; The transmission links include multiple links, the data packets to be transmitted include multiple data packets, and the allocation of data packets to be transmitted for the transmission links based on the queuing theory model includes: Identify the first data packet to be transmitted and obtain the data volume corresponding to the first data packet to be transmitted. The first data packet to be transmitted is the latest data packet uploaded to the multi-link network. Determine whether a first transmission link exists in the transmission link, wherein 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, place the first data packet to be transmitted in the buffer area, and reorder all data packets in the buffer area to obtain a queuing sequence; The data packet at the head of the queue is taken as the second data packet to be transmitted. It is determined whether there is a second transmission link in the transmission link. 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. If so, the second data packet to be transmitted is assigned to the second transmission link for transmission.

2. The data transmission method based on a multi-link network according to claim 1, characterized in that, The determination of whether a first transmission link exists in the transmission link includes: If one of the first transmission links exists in the transmission links, the first data packet to be transmitted is assigned 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 assigned to the first transmission link with the highest correlation for transmission.

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

4. The data transmission method based on a multi-link network according to claim 3, characterized in that, The step of reordering all data packets in the buffer includes: Obtain the level and queuing time of each data packet in the buffer area; Arrange the data packets in the buffer in descending order according to the level; If multiple data packets have the same priority, they are arranged in descending order according to the queuing time. Data packets whose queuing time exceeds a fixed threshold are identified as timeout data packets. The timeout data packets are placed at the head of the queue in descending order of queuing time.

5. The data transmission method based on a multi-link network according to claim 3, characterized in that, The formula for calculating the correlation degree is: ； in For the first data packet to be transmitted and the second The correlation of the first transmission link, , This represents the total number of the first transmission links. For the first The maximum load value of the first transmission link, For the first The relative load value of the first transmission link.

6. The data transmission method based on a multi-link network according to claim 1, characterized in that, The step of selecting a transmission link based on the status indicators of each link includes: A status factor for each link is calculated based on the status indicators of each link, including latency response time, packet loss rate, and load value. Each link is sorted in ascending order according to the value of the state factor, and the first N links are selected as transmission links, where N is a positive integer greater than 1.

7. The data transmission method based on a multi-link network according to claim 6, characterized in that, Obtain the latency response time and packet loss rate for each of the links, including: Multiple probe data packets are sent to each of the links, and corresponding response data packets are collected. The delay response time for each link is calculated based on the timestamp in the response data packet; The packet loss rate for each link is calculated based on the number of probe packets and response packets.

8. A data transmission method based on a multi-link network according to claim 4, characterized in that... It also includes: Determine whether the length of the queue has reached 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 exceeds the set threshold until the determination result is negative. Then, retransmit the discarded data packet according to the identifier.

9. A data transmission system based on a multi-link network, used to implement the data transmission method based on a multi-link network according to any one of claims 1-8, characterized in that, The multi-link network includes multiple links, and the data transmission system includes: The acquisition module is used to acquire the status indicators of each link, including latency response time and packet loss rate; The selection module is used to select a transmission link based on the status indicators of each link. The transmission module is used to allocate data packets to be transmitted to the transmission link based on the queuing theory model and to transmit the data.

Images