CN117041153A - Multi-path data scheduling method and device and electronic equipment - Google Patents
Multi-path data scheduling method and device and electronic equipment Download PDFInfo
- Publication number
- CN117041153A CN117041153A CN202311181357.XA CN202311181357A CN117041153A CN 117041153 A CN117041153 A CN 117041153A CN 202311181357 A CN202311181357 A CN 202311181357A CN 117041153 A CN117041153 A CN 117041153A
- Authority
- CN
- China
- Prior art keywords
- transmission
- transmission time
- data
- time
- link
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 56
- 230000005540 biological transmission Effects 0.000 claims abstract description 374
- 230000004044 response Effects 0.000 claims abstract description 54
- 238000012360 testing method Methods 0.000 claims description 68
- 238000013507 mapping Methods 0.000 claims description 24
- 230000002159 abnormal effect Effects 0.000 claims description 19
- 238000013101 initial test Methods 0.000 claims description 16
- 238000012545 processing Methods 0.000 claims description 13
- 238000004364 calculation method Methods 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 10
- 230000008569 process Effects 0.000 claims description 6
- 230000006798 recombination Effects 0.000 claims description 6
- 238000005215 recombination Methods 0.000 claims description 6
- 238000011156 evaluation Methods 0.000 abstract description 11
- 230000000903 blocking effect Effects 0.000 description 11
- 238000004891 communication Methods 0.000 description 6
- 238000012549 training Methods 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000012935 Averaging Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008521 reorganization Effects 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Algebra (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Pure & Applied Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application discloses a multipath data scheduling method and device and electronic equipment, and relates to the technical field of computers. The method comprises the following steps: establishing a Markov prediction model of link transmission, and predicting the link transmission time at the next moment to obtain predicted transmission time; calculating an ideal transmission time based on the transmission parameters; calculating a link response ratio according to the predicted transmission time and the ideal transmission time; and scheduling and distributing the data based on the link response ratio of each transmission path. The application adopts the Markov prediction model to predict the transmission time at the next moment, so as to avoid the prediction deviation caused by accumulated prediction; and the transmission capacity of the link is evaluated by adopting a link response ratio mode, and a performance evaluation basis for each transmission path is established, so that the data is more accurately scheduled and distributed, and the problems of out-of-order arrival of the data packets and blockage of a buffer area of a receiving end in the multipath transmission process are avoided.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method and an apparatus for multipath data scheduling, and an electronic device.
Background
With the rise of network live broadcast, online conferences, industrial internet, cloud host security monitoring and the like, demands of users for real-time and reliability of mass video data and log file data transmission are increased. In order to create multiple transmission paths between the end-to-end, a multi-path link may be established by using a device port through a multi-path protocol (MPTCP), and data of the multi-path transmission may be coordinated and balanced by means of data scheduling.
At present, three types of data scheduling schemes are adopted, namely, a polling mode is adopted, so that data quantity is directly distributed to each link, and fairness of data distribution of each link is guaranteed; secondly, dynamic scheduling, namely judging the transmission blocking condition of different transmission links by detecting window values of the different transmission links, and further dynamically distributing data according to the conditions of the different links; thirdly, the data quantity at the future moment of the link is predicted to schedule in a prediction mode.
In the above three schemes, the first class and the second class have the problem that different link performances are not considered, so that the sequence of the data packets is easily disordered in the transmission process, and the problem of buffer blocking of the receiving end is easily caused. And the third type of prediction method has deviation between a predicted value and an actual value in the long-time transmission process, error accumulation is generated after multiple rounds of scheduling, and the prediction of a link is not reliable. Therefore, in the current data scheduling method, the problems of out-of-order arrival of data packets and buffer area blocking exist.
Disclosure of Invention
In view of the above, the present application provides a method, an apparatus and an electronic device for multi-path data scheduling, which are mainly aimed at improving the problem of out-of-order arrival of data packets and blocking of a buffer area at a receiving end in a multi-path transmission process.
In a first aspect, the present application provides a multi-path data scheduling method, including:
establishing a Markov prediction model of link transmission, and predicting the link transmission time at the next moment to obtain predicted transmission time;
calculating an ideal transmission time based on the transmission parameters;
calculating a link response ratio according to the predicted transmission time and the ideal transmission time;
and scheduling and distributing the data based on the link response ratio of each transmission path.
Optionally, the establishing a markov prediction model of the link transmission, and predicting the link transmission time at the next moment to obtain a predicted transmission time, includes: predicting the arrival time of the ACK frame at the next moment based on the data packet transmission time at the moment on the current transmission path and the response time of the current ACK frame by using the Markov prediction model; and calculating the transmission time of the next moment according to the arrival time of the ACK frame of the next moment to obtain the predicted transmission time.
Optionally, the transmission parameters include a test transmission time and a test transmission time; the calculating the ideal transmission time based on the transmission parameters comprises: calculating the test sending time and the test transmission time; and taking the sum of the test sending time and the test transmission time as an ideal transmission time.
Optionally, calculating the test transmission time includes: calculating initial test sending time according to the distributed data quantity of the current transmission path and the link bandwidth; and correcting the initial test sending time by analyzing the packet loss rate of the current transmission path to obtain the test sending time.
Optionally, calculating the test transmission time includes: calculating initial test transmission time according to the time interval of the current transmission path for transmitting the data packet and the time interval of the link round trip; and correcting the initial test transmission time by analyzing the packet loss rate of the current transmission path to obtain the test transmission time.
Optionally, after the scheduling assignment of the data, the method further comprises: when an abnormal condition is detected in the data transmission process, mapping is carried out through a data sequence; the abnormal condition comprises data packet loss and/or transmission timeout; and distributing the data subjected to the data sequence mapping processing to other transmission paths for transmission.
Optionally, when an abnormal situation is detected in the data transmission process, the mapping process through the data sequence includes: mapping the data in the transmission path with abnormal condition in sequence and numbering the mapped data of each part; the number is used for the receiving end to carry out data recombination on the data subjected to the data sequence mapping processing according to the number.
In a second aspect, the present application provides a multipath data scheduling apparatus, comprising:
the prediction unit is configured to establish a Markov prediction model of link transmission, and predict the link transmission time at the next moment to obtain predicted transmission time;
a first calculation unit configured to calculate an ideal transmission time based on the transmission parameter;
a second calculation unit configured to calculate a link response ratio from the predicted transmission time and the ideal transmission time;
and a scheduling allocation unit configured to schedule and allocate data based on the link response ratio of each transmission path.
In a third aspect, the present application provides a computer readable storage medium having stored thereon a computer program which when executed by a processor implements the multipath data scheduling method of the first aspect.
In a fourth aspect, the present application provides an electronic device, including a storage medium, a processor, and a computer program stored on the storage medium and executable on the processor, where the processor implements the multi-path data scheduling method according to the first aspect when executing the computer program.
By means of the technical scheme, the multipath data scheduling method, the multipath data scheduling device and the electronic equipment provided by the application are used for predicting the transmission time of the link by using the Markov prediction model and then according to the ideal transmission time of the link; and calculating the response ratio of the link data transmission, taking the link response ratio as a judgment standard of the link transmission performance, and further carrying out scheduling distribution on the data quantity of each transmission path. Compared with the related art, the application predicts the transmission time at the next moment by adopting the Markov prediction model, and the time at the next moment has correlation with the previous moment only, so that the prediction deviation caused by accumulated prediction is avoided, and the transmission capacity of a link is evaluated by adopting a link response ratio mode, so that the performance evaluation basis of each transmission path is established, the data is more accurately scheduled and distributed, and the problems of out-of-order arrival of the data packet and blockage of a buffer area of a receiving end in the multipath transmission process are avoided.
The foregoing description is only an overview of the present application, and is intended to be implemented in accordance with the teachings of the present application in order that the same may be more clearly understood and to make the same and other objects, features and advantages of the present application more readily apparent.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application.
In order to more clearly illustrate the embodiments of the application or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, and it will be obvious to a person skilled in the art that other drawings can be obtained from these drawings without inventive effort.
Fig. 1 shows a flow chart of a multi-path data scheduling method according to an embodiment of the present application;
fig. 2 is a schematic flow chart of another multi-path data scheduling method according to an embodiment of the present application;
fig. 3 shows a schematic structural diagram of a multi-path data scheduling apparatus according to an embodiment of the present application.
Detailed Description
In order that the above objects, features and advantages of the application will be more clearly understood, a further description of the application will be made. It should be noted that, without conflict, the embodiments of the present application and features in the embodiments may be combined with each other.
The multi-path data scheduling method provided in the embodiment is applied to a multi-path data scheduling device or electronic equipment, which can be installed or integrated in some large-scale interconnection devices or interconnection systems, and any of the multi-path data scheduling methods mentioned below can be executed during operation.
In order to solve the problem of out-of-order arrival of data packets and blocking of a buffer area at a receiving end in a multipath transmission process, this embodiment provides a multipath data scheduling method, as shown in fig. 1, which includes:
s101, establishing a Markov prediction model of link transmission, and predicting the link transmission time at the next moment to obtain the predicted transmission time.
And based on the current link transmission, establishing a Markov prediction model to predict the link transmission time at the next moment. It should be noted that, the transmission time at the next time is related to the transmission time at the previous time, and specifically, the transmission time of the data packet at the previous time and the response time of the current ACK frame may be calculated.
The markov prediction model is a probability prediction method for occurrence of an event, and predicts the state of variation at each time in the future based on the current situation of time. In combination with the scheme of the embodiment, a Markov prediction model is established according to the transmission condition of each path in the link at the current moment, so as to predict the link transmission time at the next moment.
S102, calculating ideal transmission time based on the transmission parameters.
The predicted transmission time is obtained in the previous step, and the ideal transmission time at the next time is obtained in the present step. The ideal transmission time can be understood as what the transmission time at the next time should be in the actual case, but may not be limited to the next time, but what the data transmission time in the current path should be. Analyzing the ideal transmission time composition may include the transmission time of the sender and the transmission time of the intermediate link transmission.
S103, calculating the link response ratio according to the predicted transmission time and the ideal transmission time.
The link response ratio is calculated according to the predicted transmission time and the ideal transmission time of the current transmission path, and is used for evaluating the performance standard of the current transmission path and used as a judgment basis for evaluating the transmission performance of the link. Each set of transmission paths has a corresponding link response ratio, wherein the closer the ratio of the link response ratio is to 1, the closer the predicted transmission time and the ideal transmission time are proved to be, and the better the performance of the current transmission path is; otherwise, poor performance is demonstrated.
And S104, scheduling and distributing the data based on the link response ratio of each transmission path.
In this embodiment, firstly, a markov prediction model is used to predict the transmission time of a link, and then the ideal transmission time of the link is used; and calculating the response ratio of the link data transmission, taking the link response ratio as a judgment standard of the link transmission performance, and further carrying out scheduling distribution on the data quantity of each transmission path. Compared with the related art, the method and the device have the advantages that the Markov prediction model is adopted to predict the transmission time of the next moment, the time of the next moment is only related to the previous moment, prediction deviation caused by accumulated prediction is avoided, the transmission capacity of a link is evaluated by adopting a link response ratio mode, and the performance evaluation basis of each transmission path is established, so that data are more accurately scheduled and distributed, and the problems of data packet out-of-order arrival and receiving end buffer area blocking in the multipath transmission process are avoided.
Optionally, establishing a markov prediction model of link transmission, and predicting the link transmission time at the next moment to obtain a predicted transmission time, including: predicting the arrival time of the ACK frame at the next moment based on the transmission time of the data packet at one moment on the current transmission path and the response time of the current ACK frame by using a Markov prediction model; and calculating the transmission time of the next moment by the arrival time of the ACK frame of the next moment to obtain the predicted transmission time.
In this embodiment, a procedure of how to obtain a predicted transmission time is described. After the Markov prediction model is established, the arrival time of the ACK frame at the next moment is predicted based on the transmission time of the data packet at the moment on the current transmission path and the response time of the current ACK frame. The transmission time of the data packet at the previous moment is the transmission time of the data at the previous moment, and the ACK frame is an acknowledgement character (Acknowledge character, commonly called as an ACK frame), wherein the transmission time and the response time of the ACK frame are training set materials of a Markov prediction model, and the arrival time of the ACK frame at the next moment can be predicted more accurately by multiple times of training; and the predicted transmission time can be obtained through the arrival time of the ACK frame at the next moment, so that the prediction accuracy is improved.
Further, the markov prediction model atmosphere waits, blocks and sends three states, and a low-order model is adopted to conduct time prediction, namely the next transmission time consists of the current ACK time and the transmission time of the last moment.
The transmission time at the i-th moment is related to the transmission time at the i-1 moment, and the simplified transmission prediction model is as follows:
p(RTT i |RTT i-1 ,…,RTT 2 ,RTT 1 )≈p(RTT i |RTT i-1 ) (equation I)
In RTT i Indicating the transmission time at the current instant i. The transmission time prediction formula of the next moment of the transmission link i is:
RTT i ＝p(i|i-1)RTT i-1 +(1-p(i|-1))RTT ACK (equation II)
Introducing a cost function, wherein the initial state is 1, taking the inverse of the response ratio of the link as the value of the predicted value, and the cost function is as follows:
where v (i) is the value at the ith time, QS i Is the link response ratio. The following transmission time prediction formula is:
RTT i ＝v(i)p(i|i-1)RTT i-1 +(1-p(i|-1))RTT ACK (equation IV)
The predicted transmission time RTT of the next moment can be obtained through a formula IV i 。
Optionally, the transmission parameters include a test transmission time and a test transmission time; calculating an ideal transmission time based on the transmission parameters, comprising: calculating test transmission time and test transmission time; the sum of the test transmission time and the test transmission time is taken as the ideal transmission time.
In this embodiment, the transmission parameter shall be also called an ideal transmission parameter, which refers to an ideal transmission condition at the next moment in the actual situation. Specifically, the ideal transmission time is the sum of the test transmission time and the test transmission time, and the link response ratio can be calculated through the ideal transmission time and the predicted transmission time, so that the ideal transmission time is used as an evaluation index of the link performance, a performance evaluation basis for each transmission path is established, and the data is more accurately scheduled and distributed. It should be noted that, although the ideal transmission time is obtained by calculating the actual existing transmission time and the obtained transmission time, the ideal transmission time means the ideal transmission time of the current path in actual situations, so that the test transmission time and the test transmission time capable of representing the transmission quality of the path should be selected, for example, by setting a period of test period under the condition of better communication quality, the test transmission time and the test transmission time are obtained; or the transmission quality of the current path can be better reflected by the test transmission time and the test transmission time by means of averaging and the like.
Optionally, calculating the test transmission time includes: calculating initial test sending time according to the distributed data quantity of the current transmission path and the link bandwidth; and correcting the initial test sending time by analyzing the packet loss rate of the current transmission path to obtain the test sending time.
In the present embodiment, the calculation of the test transmission time is the ratio of the link allocation data amount to the current link bandwidth and the test transmission time is expressed as:
wherein T is 1 (or E (T) i send ) For testing the transmission time d i Is to allocate data volume, w i The current link bandwidth, p is the link packet loss rate, needs to be set according to specific conditions, and the test sending time can be calculated through a formula five.
Optionally, calculating the test transmission time includes: calculating initial test transmission time according to the time interval of the current transmission path for transmitting the data packet and the time interval of the link round trip; and correcting the initial test transmission time by analyzing the packet loss rate of the current transmission path to obtain the test transmission time.
In the present embodiment, the transmission time T is tested 2 Is the time required for data to be transmitted over the link, i.e. the time interval between three transmissions of a data packetAnd link round trip time->Wherein the influence of the packet loss rate of the link on the test transmission time is considered at the same time, the test transmission time T 2 The method comprises the following steps:
the reason for sending the data packet three times is three-way handshake based on TCP protocol, and the test transmission time T can be obtained through a formula six 2 And then T 1 And T is 2 The sum of (1) is the ideal transmission time RTT e 。
Further, the predicted transmission time and the ideal transmission time are obtained through the formula four and the formula six respectively, and then the link response ratio can be calculated according to the following formula:
QS i ＝RTT i /RTT e (equation seven)
In the formula, QS i RTT is the link response ratio i RTT for predicting transmission time e The ratio of the two is taken as the link response ratio of the current path for ideal transmission time. In addition, equation seven is just one way to illustrate the link response ratio, which is closer to 1, demonstrating better current link performance; it is also possible to choose to introduce correction values and the like for further optimization thereof, and the link response ratio is not limited to the form of equation seven. By adopting the link response ratio mode to evaluate the transmission capacity of the link, the performance evaluation basis of each transmission path is established, so that the data is more accurately scheduled and distributed, and the problems of data packet out-of-order arrival and receiving end buffer area blocking in the multipath transmission process are avoided.
Optionally, after the scheduling allocation is performed on the data, the method further includes: when an abnormal condition is detected in the data transmission process, mapping is carried out through a data sequence; abnormal conditions include packet loss and/or transmission timeout; and distributing the data subjected to the data sequence mapping processing to other transmission paths for transmission.
In this embodiment, after the technical solution provided in the foregoing embodiment is adopted to schedule and allocate data, if a packet loss or a situation of a transmission supermarket exists in a data transmission process, the data after the mapping processing of the data sequence is allocated to other transmission paths for transmission. The data sequence mapping processing is to avoid the problem that the data cannot be recombined in disorder at the receiving end after being distributed to other transmission paths in disorder, and the data of each link is mapped in the data sequence by adopting a secondary queue for data retransmission and data recombination, so that the efficiency of the data at the receiving end can be improved, and the disorder condition can not occur.
Optionally, when an abnormal situation is detected in the data transmission process, the mapping process through the data sequence includes: mapping the data in the transmission path with abnormal condition in sequence and numbering the mapped data of each part; the serial number is used for the receiving end to carry out data recombination on the data subjected to the data sequence mapping processing according to the serial number.
In this embodiment, after mapping the data in sequence, the mapped partial data is numbered, so that the original sequence of the data packet is not changed, and the disorder condition is reduced. The data is transmitted by adopting the secondary queue, the data is distributed on the transmission link and numbered by adopting the data sequence mapping, so that the efficiency of the data at the receiving end can be improved, and the disorder condition can not occur.
Further, as shown in fig. 2, a flow chart of another multi-path data scheduling method according to an embodiment of the present application is shown. The method comprises the following steps:
s201, predicting the arrival time of the ACK frame at the next moment by using a Markov prediction model.
Firstly, a state transition Markov prediction model of link transmission is established, and the method can be concretely divided into three states of waiting, blocking and sending.
Since the transmission time at the i-th time is related to the transmission time at the i-1 time, the arrival time of the ACK frame at the next time can be predicted based on the packet transmission time at the one time on the current transmission path and the response time of the current ACK frame. The transmission time of the data packet at the previous moment is the transmission time of the last data and the response time of the ACK frame, which are training set materials of the Markov prediction model, and the arrival time of the ACK frame at the next moment can be predicted more accurately by the prediction model through multiple times of training; and the predicted transmission time can be obtained by the arrival time of the ACK frame at the next moment.
S202, calculating the predicted transmission time of the current path according to the arrival time of the ACK frame at the next moment.
S203, calculating an ideal transmission time based on the transmission parameters.
Specifically, calculating a test transmission time and a test transmission time; the sum of the test transmission time and the test transmission time is taken as the ideal transmission time. The transmission parameter shall also be called ideal transmission parameter, which refers to the ideal transmission situation at the next moment in the actual situation. The ideal transmission time is the sum of the test transmission time and the test transmission time, and the link response ratio can be calculated through the ideal transmission time and the predicted transmission time, so that the ideal transmission time is used as an evaluation index of the link performance, a performance evaluation basis for each transmission path is established, and the data is more accurately scheduled and distributed.
It should be noted that, although the ideal transmission time is obtained by calculating the actual existing transmission time and the obtained transmission time, the ideal transmission time means the ideal transmission time of the current path in actual situations, so that the test transmission time and the test transmission time capable of representing the transmission quality of the path should be selected, for example, by setting a period of test period under the condition of better communication quality, the test transmission time and the test transmission time are obtained; or the transmission quality of the current path can be better reflected by the test transmission time and the test transmission time by means of averaging and the like.
The calculation of the test transmission time is the ratio of the amount of data allocated by the link to the current link bandwidth, and in the case that the packet loss rate exists in the link is considered, the test transmission time is the time required for transmitting data on the link, namely the time interval of three data packet transmission and the time of link round trip, wherein the influence of the packet loss rate existing in the link on the test transmission time is considered at the same time. The specific calculation formulas are shown in the formula five and the formula six, and are not described in detail herein.
S204, calculating the link response ratio of the current path according to the predicted transmission time and the ideal transmission time.
The predicted transmission time and the ideal transmission time are obtained in the above-described S202 and S203, respectively, and then the link response ratio can be calculated as a performance evaluation basis of the transmission path.
S205, scheduling and distributing the data according to the link response ratio of each transmission path.
The link response ratio, in this embodiment the ratio of the predicted transmission time to the ideal transmission time, is closer to 1, demonstrating better current link performance. And further, after the link corresponding ratio of each transmission path is calculated, it can be judged which paths have better transmission performance, so that more data can be distributed to the paths.
Here, it should be noted that, in the scheme in the related art, for example, the window value of the transmission link is detected in a dynamic scheduling manner, and although the transmission diversity between different transmission paths is considered, the actual performance of each path in the transmission process is not considered; in this embodiment, the link response ratio is an index, which is not used as a short-term path condition judgment basis only by the data window value in the related art, so that data scheduling and distribution can be more effectively performed, and the problems of out-of-order arrival of data packets and blocking of a buffer area at a receiving end in the multipath transmission process are improved.
S206, when an abnormal condition is detected in the transmission path, the data are mapped in sequence and the mapped data of each part are numbered.
S207, the numbered data are distributed to other transmission paths for transmission.
The abnormal condition comprises packet loss or transmission overtime, and when the packet loss or the transmission overtime occurs in the link, the data on the transmission link with the current problem is subjected to data sequence mapping processing again, and the data is transferred to other preferred paths for transmission. The data sequence mapping is to map the data in the transmission path with abnormal condition in sequence and number the mapped data, and the number is used for the data reorganization of the receiving end. For example, a data packet a is transmitted in the path a, and when an abnormal situation occurs in the path a, the data packet a is mapped with a data sequence and numbered a 1 、a 2 、a 3 、a 4 Four parts. And then a is 1 、a 2 、a 3 、a 4 Respectively sent to other transmission paths B or B, C, D, E, because the transmission speeds of the disturbed order and different paths may be different, the receiving end can compare a according to the number of the data packet a 1 、a 2 、a 3 、a 4 The four parts are used for data recombination without changing the original sequence of the data packets, thereby reducing the disorder condition of the data in the buffer area.
The embodiment provides a multipath data scheduling method, which uses a Markov prediction model to predict the transmission time of a link, and then according to the ideal transmission time of the link; and calculating the response ratio of the link data transmission, taking the link response ratio as a judgment standard of the link transmission performance, and further carrying out scheduling distribution on the data quantity of each transmission path. Compared with the related art, the method and the device have the advantages that the Markov prediction model is adopted to predict the transmission time of the next moment, the time of the next moment is only related to the previous moment, prediction deviation caused by accumulated prediction is avoided, the transmission capacity of a link is evaluated by adopting a link response ratio mode, and the performance evaluation basis of each transmission path is established, so that data are more accurately scheduled and distributed, and the problems of data packet out-of-order arrival and receiving end buffer area blocking in the multipath transmission process are avoided.
Further, as a specific implementation of the method shown in fig. 1 and fig. 2, the embodiment provides a multi-path data scheduling apparatus, as shown in fig. 3, including: a prediction unit 31, a first calculation unit 32, a second calculation unit 33 and a schedule allocation unit 34.
A prediction unit 31 configured to establish a markov prediction model of link transmission, and predict a link transmission time at a next time to obtain a predicted transmission time;
a first calculation unit 32 configured to calculate an ideal transmission time based on the transmission parameter;
a second calculation unit 33 configured to calculate a link response ratio from the predicted transmission time and the ideal transmission time;
the scheduling assignment unit 34 is configured to schedule and assign data based on the link response ratio of each transmission path.
In a specific application scenario, the processing unit 31 is specifically configured to predict, by using the markov prediction model, an arrival time of an ACK frame at a next time based on a packet transmission time at a time on a current transmission path and a response time of a current ACK frame; and calculating the transmission time of the next moment according to the arrival time of the ACK frame of the next moment to obtain the predicted transmission time.
In a specific application scenario, the first computing unit 32 is specifically further configured to calculate the test transmission time and the test transmission time; and taking the sum of the test sending time and the test transmission time as an ideal transmission time.
In a specific application scenario, the first calculating unit 32 is specifically further configured to calculate an initial test transmission time according to the allocated data amount and the link bandwidth of the current transmission path; and correcting the initial test sending time by analyzing the packet loss rate of the current transmission path to obtain the test sending time.
In a specific application scenario, the first calculating unit 32 is specifically further configured to calculate an initial test transmission time according to a time interval of a transmission data packet of a current transmission path and a time interval of a link round trip; and correcting the initial test transmission time by analyzing the packet loss rate of the current transmission path to obtain the test transmission time.
In a specific application scenario, the scheduling allocation unit 34 is specifically configured to perform mapping processing through a data sequence when an abnormal situation is detected in the data transmission process; the abnormal condition comprises data packet loss and/or transmission timeout; and distributing the data subjected to the data sequence mapping processing to other transmission paths for transmission.
In a specific application scenario, the scheduling allocation unit 34 is specifically further configured to map the data in the transmission path where the abnormal situation occurs in sequence and number each part of the mapped data; the number is used for the receiving end to carry out data recombination on the data subjected to the data sequence mapping processing according to the number.
It should be noted that, for other corresponding descriptions of each functional unit related to the multi-path data scheduling apparatus provided in this embodiment, reference may be made to corresponding descriptions in fig. 1 and fig. 2, and details are not repeated here.
Based on the above-described methods shown in fig. 1 and 2, correspondingly, the present embodiment further provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor, implements the above-described methods shown in fig. 1 and 2.
Based on such understanding, the technical solution of the present application may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.), and includes several instructions for causing a computer device (may be a personal computer, a server, or a network device, etc.) to execute the method of each implementation scenario of the present application.
Based on the methods shown in fig. 1 and fig. 2 and the virtual device embodiment shown in fig. 3, in order to achieve the above objects, an embodiment of the present application further provides an electronic device, which may be configured on a computer side or the like, where the device includes a storage medium and a processor; a storage medium storing a computer program; a processor for executing a computer program to implement the method as shown in fig. 1 and 2 described above.
Based on the methods shown in fig. 1 and fig. 2 and the virtual device embodiment shown in fig. 3, in order to achieve the above objects, an embodiment of the present application further provides a chip, including one or more interface circuits and one or more processors; the interface circuit is configured to receive a signal from a memory of an electronic device and to send the signal to the processor, the signal including computer instructions stored in the memory; the computer instructions, when executed by the processor, cause the electronic device to perform the methods described above and shown in fig. 1 and 2.
Optionally, the entity device may further include a user interface, a network interface, a camera, a Radio Frequency (RF) circuit, a sensor, an audio circuit, a WI-FI module, and so on. The user interface may include a Display screen (Display), an input unit such as a Keyboard (Keyboard), etc., and the optional user interface may also include a USB interface, a card reader interface, etc. The network interface may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface), etc.
It will be appreciated by those skilled in the art that the above-described physical device structure provided in this embodiment is not limited to this physical device, and may include more or fewer components, or may combine certain components, or may be a different arrangement of components.
The storage medium may also include an operating system, a network communication module. The operating system is a program that manages the physical device hardware and software resources described above, supporting the execution of information handling programs and other software and/or programs. The network communication module is used for realizing communication among all components in the storage medium and communication with other hardware and software in the information processing entity equipment.
From the above description of the embodiments, it will be apparent to those skilled in the art that the present application may be implemented by means of software plus necessary general hardware platforms, or may be implemented by hardware. By applying the scheme of the embodiment, the transmission time of the link is predicted by using a Markov prediction model, and then the ideal transmission time of the link is used; and calculating the response ratio of the link data transmission, taking the link response ratio as a judgment standard of the link transmission performance, and further carrying out scheduling distribution on the data quantity of each transmission path. Compared with the related art, the method and the device have the advantages that the Markov prediction model is adopted to predict the transmission time of the next moment, the time of the next moment is only related to the previous moment, prediction deviation caused by accumulated prediction is avoided, the transmission capacity of a link is evaluated by adopting a link response ratio mode, and the performance evaluation basis of each transmission path is established, so that data are more accurately scheduled and distributed, and the problems of data packet out-of-order arrival and receiving end buffer area blocking in the multipath transmission process are avoided.
It should be noted that in this document, relational terms such as "first" and "second" and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The foregoing is only a specific embodiment of the application to enable those skilled in the art to understand or practice the application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A multi-path data scheduling method, comprising:
establishing a Markov prediction model of link transmission, and predicting the link transmission time at the next moment to obtain predicted transmission time;
calculating an ideal transmission time based on the transmission parameters;
calculating a link response ratio according to the predicted transmission time and the ideal transmission time;
and scheduling and distributing the data based on the link response ratio of each transmission path.
2. The method of claim 1, wherein the establishing a markov prediction model of the link transmission and predicting the link transmission time at the next moment to obtain the predicted transmission time comprises:
predicting the arrival time of the ACK frame at the next moment based on the data packet transmission time at the moment on the current transmission path and the response time of the current ACK frame by using the Markov prediction model;
and calculating the transmission time of the next moment according to the arrival time of the ACK frame of the next moment to obtain the predicted transmission time.
3. The method of claim 1, wherein the transmission parameters include a test transmit time and a test transmission time; the calculating the ideal transmission time based on the transmission parameters comprises:
calculating the test sending time and the test transmission time;
and taking the sum of the test sending time and the test transmission time as an ideal transmission time.
4. A method according to claim 3, wherein calculating the test transmission time comprises:
calculating initial test sending time according to the distributed data quantity of the current transmission path and the link bandwidth;
and correcting the initial test sending time by analyzing the packet loss rate of the current transmission path to obtain the test sending time.
5. A method according to claim 3, wherein calculating the test transmission time comprises:
calculating initial test transmission time according to the time interval of the current transmission path for transmitting the data packet and the time interval of the link round trip;
and correcting the initial test transmission time by analyzing the packet loss rate of the current transmission path to obtain the test transmission time.
6. The method according to any one of claims 1 to 5, wherein after scheduling allocation of data, the method further comprises:
when an abnormal condition is detected in the data transmission process, mapping is carried out through a data sequence; the abnormal condition comprises data packet loss and/or transmission timeout;
and distributing the data subjected to the data sequence mapping processing to other transmission paths for transmission.
7. The method according to claim 6, wherein the mapping process by the data sequence when an abnormal situation is detected during the data transmission process includes:
mapping the data in the transmission path with abnormal condition in sequence and numbering the mapped data of each part; the number is used for the receiving end to carry out data recombination on the data subjected to the data sequence mapping processing according to the number.
8. A multi-path data scheduling apparatus, comprising:
the prediction unit is configured to establish a Markov prediction model of link transmission, and predict the link transmission time at the next moment to obtain predicted transmission time;
a first calculation unit configured to calculate an ideal transmission time based on the transmission parameter;
a second calculation unit configured to calculate a link response ratio from the predicted transmission time and the ideal transmission time;
and a scheduling allocation unit configured to schedule and allocate data based on the link response ratio of each transmission path.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the method of any of claims 1 to 7.
10. An electronic device comprising a storage medium, a processor and a computer program stored on the storage medium and executable on the processor, characterized in that the processor implements the method of any one of claims 1 to 7 when executing the computer program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311181357.XA CN117041153A (en) | 2023-09-13 | 2023-09-13 | Multi-path data scheduling method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311181357.XA CN117041153A (en) | 2023-09-13 | 2023-09-13 | Multi-path data scheduling method and device and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117041153A true CN117041153A (en) | 2023-11-10 |
Family
ID=88633891
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311181357.XA Pending CN117041153A (en) | 2023-09-13 | 2023-09-13 | Multi-path data scheduling method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117041153A (en) |
-
2023
- 2023-09-13 CN CN202311181357.XA patent/CN117041153A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2689602B1 (en) | Buffer sizing for multi-hop network | |
| US8352594B2 (en) | Network monitoring device, bus system monitoring device, method and program | |
| US8059541B2 (en) | End-host based network management system | |
| US9326161B2 (en) | Application-driven control of wireless networking settings | |
| Maity et al. | TCP download performance in dense WiFi scenarios: Analysis and solution | |
| Wu et al. | A novel scheduling approach to concurrent multipath transmission of high definition video in overlay networks | |
| US20220248259A1 (en) | Data processing method and apparatus | |
| CN101656653A (en) | Method and device for configuring receive buffer applied to multi-path transmission | |
| CN111817985B (en) | Service processing method and device | |
| WO2019233284A1 (en) | Link detection method and related apparatus | |
| CN114513467A (en) | Network traffic load balancing method and device of data center | |
| Bruhn et al. | Performance and improvements of TCP CUBIC in low-delay cellular networks | |
| CN109511176A (en) | Scheduling request processing method, device and storage medium | |
| US9391852B2 (en) | Computer-readable recording medium and information processing apparatus | |
| WO2021234764A1 (en) | Burst traffic detection device, burst traffic detection method and burst traffic detection program | |
| US20230370389A1 (en) | Out of order packet scheduler | |
| CN117041153A (en) | Multi-path data scheduling method and device and electronic equipment | |
| Hong et al. | Adaptive bandwidth binning for bandwidth management | |
| US9749203B2 (en) | Packet analysis apparatus and packet analysis method | |
| US20170222897A1 (en) | Application Aware Cluster Monitoring | |
| JP4974366B2 (en) | Wireless environment monitoring apparatus and program for monitoring time occupation ratio of wireless environment | |
| Bruno et al. | Performance modelling and measurements of TCP transfer throughput in 802.11-based WLAN | |
| CN112637055B (en) | Multi-link aggregation method, system and storage medium based on VPN tunnel | |
| Gokhale et al. | On QoS-compliant telehaptic communication over shared networks | |
| US11233886B2 (en) | Storage medium and packet analyzing device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |