CN116170119A - Route retransmission method, device, equipment and storage medium - Google Patents
Route retransmission method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN116170119A CN116170119A CN202310204660.0A CN202310204660A CN116170119A CN 116170119 A CN116170119 A CN 116170119A CN 202310204660 A CN202310204660 A CN 202310204660A CN 116170119 A CN116170119 A CN 116170119A
- Authority
- CN
- China
- Prior art keywords
- sub
- retransmission
- streams
- stream
- average time
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1848—Time-out mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1832—Details of sliding window management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/187—Details of sliding window management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/188—Time-out mechanisms
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method, a device, equipment and a storage medium for route retransmission, wherein the method comprises the following steps: acquiring a retransmission mode of the multi-link aggregation router, and calculating average time of successful transmission of different sub-streams when timeout retransmission occurs; a plurality of sub-streams exist between the multilink aggregation routers for data transmission; if the situation that the minimum average time is the same does not exist, selecting a sub-stream corresponding to the minimum average time for retransmission; and if the minimum average time is the same, selecting the corresponding sub-stream for retransmission according to the maximum congestion control window value and the maximum slow start threshold. The invention solves the technical problems of only considering single factor, sub-stream transmission delay and high packet loss rate in the prior art, slows down buffer blocking and improves MPTCP throughput.
Description
Technical Field
The present invention relates to the field of network transmission technologies, and in particular, to a method, an apparatus, a device, and a storage medium for route retransmission.
Background
The multilink aggregation routers each employ the MPTCP protocol (multiplex control protocol) for communication data fusion, the purpose of which is to allow transmission control protocol (TCP, transmission Control Protocol) connections to use multiple paths to maximize channel resource usage.
The core idea of MPTCP is to establish 2 or more TCP substreams in one connection and allow multiple substreams to simultaneously transmit data while being transparent to the upper application layers, thereby improving the throughput of the transmission. However, the limited buffering at the receiving end during multiplexing is likely to cause buffering congestion, which severely affects the overall performance, and in MPTCP, a sub-stream corresponds to an association in CMT. During retransmission, the same original substream can be selected, the substream with the window space can be selected, the substream with the maximum congestion control window can be selected, the substream with the maximum slow start threshold can be selected, and the substream with the lowest packet loss rate can be selected. However, based on either strategy, only a single factor is considered, which may not achieve the desired result in a realistic environment where network performance parameters are variable.
Therefore, a need exists for a method of route retransmission that can take into account multiple factors and reduce the delay and packet loss rate of sub-stream transmission.
Disclosure of Invention
The invention provides a method, a device, equipment and a storage medium for route retransmission, which are used for solving the technical problems of only considering single factors, and high sub-stream transmission delay and packet loss rate in the prior art.
In order to solve the above technical problems, an embodiment of the present invention provides a method for retransmitting a route, including:
acquiring a retransmission mode of the multi-link aggregation router, and calculating average time of successful transmission of different sub-streams when timeout retransmission occurs; a plurality of sub-streams exist between the multilink aggregation routers for data transmission;
if the situation that the minimum average time is the same does not exist, selecting a sub-stream corresponding to the minimum average time for retransmission;
and if the minimum average time is the same, selecting the corresponding sub-stream for retransmission according to the maximum congestion control window value and the maximum slow start threshold.
Preferably, the retransmission mode includes fast retransmission and timeout retransmission; the fast retransmission comprises: and enabling the multilink aggregation router to retransmit according to the original sub-stream.
As a preferred scheme, the calculating the average time of successful transmission of different sub-streams specifically includes:
according to the packet loss rate, delay and timeout time corresponding to different sub-streams, calculating the average time of successful transmission of different sub-streams: t (T) i =1-l i 4 )·[RT·l i 2 + i (1-l i )];
Wherein l i For packet loss rate of the sub-stream i, RT is timeout time of the sub-stream i, d i Is the delay of this substream i.
As a preferred solution, the selecting a corresponding sub-stream for retransmission according to the maximum congestion control window value and the maximum slow start threshold specifically includes:
acquiring congestion control window values corresponding to sub-streams with the same minimum average time, and judging whether the congestion control window values corresponding to the sub-streams are the same;
if the sub-streams are the same, a slow start threshold corresponding to the sub-streams is obtained, and the sub-stream with the largest slow start threshold is selected for retransmission;
and if the congestion control window values are different, selecting the sub-stream with the largest congestion control window value for retransmission.
Correspondingly, the invention also provides a routing retransmission device, which comprises: a retransmission mode module, a first retransmission module and a second retransmission module;
the retransmission mode module is used for acquiring a retransmission mode of the multi-link aggregation router and calculating the average time of successful transmission of different sub-streams when timeout retransmission occurs; a plurality of sub-streams exist between the multilink aggregation routers for data transmission;
the first retransmission module is configured to select a sub-stream corresponding to the minimum average time to retransmit if the condition that the minimum average time is the same does not exist;
and the second retransmission module is used for selecting the corresponding sub-streams for retransmission according to the maximum congestion control window value and the maximum slow start threshold if the conditions that the minimum average time is the same exist.
Preferably, the retransmission mode includes fast retransmission and timeout retransmission; the fast retransmission comprises: and enabling the multilink aggregation router to retransmit according to the original sub-stream.
As a preferred scheme, the calculating the average time of successful transmission of different sub-streams specifically includes:
according to the packet loss rate, delay and timeout time corresponding to different sub-streams, calculating the average time of successful transmission of different sub-streams: t (T) i =1-l i 4 )·[RT·l i 2 + i (1-l i )];
Wherein l i For packet loss rate of the sub-stream i, RT is timeout time of the sub-stream i, d i Is the delay of this substream i.
As a preferred solution, the selecting a corresponding sub-stream for retransmission according to the maximum congestion control window value and the maximum slow start threshold specifically includes:
acquiring congestion control window values corresponding to sub-streams with the same minimum average time, and judging whether the congestion control window values corresponding to the sub-streams are the same;
if the sub-streams are the same, a slow start threshold corresponding to the sub-streams is obtained, and the sub-stream with the largest slow start threshold is selected for retransmission;
and if the congestion control window values are different, selecting the sub-stream with the largest congestion control window value for retransmission.
Correspondingly, the invention further provides a terminal device, comprising a processor, a memory and a computer program stored in the memory and configured to be executed by the processor, wherein the processor implements the route retransmission method according to any one of the above when executing the computer program.
Correspondingly, the invention further provides a computer readable storage medium, which comprises a stored computer program, wherein the computer program controls the equipment where the computer readable storage medium is located to execute the routing retransmission method according to any one of the above.
Compared with the prior art, the embodiment of the invention has the following beneficial effects:
according to the technical scheme, the retransmission mode of the multi-link aggregation router is obtained, under the condition that retransmission timeout occurs, average time of sub-stream transmission success is calculated for different sub-streams, non-timeout atomic streams are adopted for retransmission, subsequent average time calculation is avoided, route retransmission efficiency is improved, when the minimum average time is the same, sub-streams corresponding to the minimum average time are directly selected for retransmission, when the minimum average time is the same, corresponding sub-streams are selected for retransmission according to the maximum congestion control window value and the maximum slow start threshold, transmission delay and packet loss rate of sub-stream retransmission are comprehensively considered, better performance is achieved, buffer blockage is slowed down, throughput of the multi-link aggregation router is improved, and time delay and packet loss rate of sub-stream transmission are reduced.
Drawings
Fig. 1: the step flow chart of the route retransmission method provided by the embodiment of the invention;
fig. 2: the sub-stream transmission schematic diagram provided by the embodiment of the invention;
fig. 3: the embodiment of the invention provides a structural schematic diagram of a routing retransmission device.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Example 1
Referring to fig. 1, a method for retransmitting a route according to an embodiment of the present invention includes steps S101 to S103:
step S101: acquiring a retransmission mode of the multi-link aggregation router, and calculating average time of successful transmission of different sub-streams when timeout retransmission occurs; and a plurality of sub-streams exist between the multilink aggregation routers for data transmission.
In this embodiment, after acquiring the retransmission mode of the multi-link aggregation router, judging the retransmission mode, and if the retransmission is overtime retransmission, calculating the average time of successful transmission of different sub-streams; if the retransmission is fast, the original sub-stream is selected for transmission, and the sub-stream which is transmitted without timeout is fast confirmed.
As a preferred solution of this embodiment, the retransmission method includes fast retransmission and timeout retransmission; the fast retransmission comprises: and enabling the multilink aggregation router to retransmit according to the original sub-stream.
It should be noted that, the multi-link aggregation router enables the routing protocol to advertise a plurality of networks by using one address, so as to reduce the size of the routing table in the router, save memory, and shorten the time required for the IP to analyze the routing table to find the path to the remote network, each router is a node, and the channels for data transmission between the nodes are sub-flows.
As a preferred solution of this embodiment, the calculating the average time of successful transmission of different sub-streams specifically includes:
according to the packet loss rate, delay and timeout time corresponding to different sub-streams, calculating the average time of successful transmission of different sub-streams: t (T) i =1-l i 4 )·[RT·l i 2 + i (1-l i )]The method comprises the steps of carrying out a first treatment on the surface of the Wherein l i For packet loss rate of the sub-stream i, RT is timeout time of the sub-stream i, d i Is the delay of this substream i.
In this embodiment, the packet loss times between the routing node packets are independent of each other, and one data packet reaches the receiving end in one time 0 = i ×(1-l i ) The method comprises the steps of carrying out a first treatment on the surface of the Time R for data packet to reach receiving end after one retransmission 1 =T·l i + i ×(1- i ) The method comprises the steps of carrying out a first treatment on the surface of the Time R that data packet is successfully arrived at receiving end after undergoing two retransmissions 2 =T·l i 2 + i ×(1- i ) The method comprises the steps of carrying out a first treatment on the surface of the Time R for data packet to reach receiving end after m times of retransmission m =T·l i m + i ×(1- i ). Further, the average time T for a packet to successfully arrive at the receiving end i =(1- i )×R 0 + i ×(1- i )×R 1 +…+ i m ×(1- i )×R m Thereby obtaining the average time of successful sub-stream transmission: t (T) i =1-l i m+1 )·[RT·l i 2 + i (1-l i )]. In an actual network environment, the probability of occurrence of 3 consecutive timeout retransmissions by using the MPTCP protocol is substantially zero, so that m in the final formula is 3, and the average time of successful sub-stream transmission is: t (T) i =1-l i 4 )·[RT·l i 2 +d i (1-l i )]。
Step S102: if the situation that the minimum average time is the same does not exist, selecting a sub-stream corresponding to the minimum average time for retransmission.
It should be noted that, if there is no condition that the minimum average time is the same, that is, there is only one minimum average time for successful transmission in all the calculated sub-streams, the smaller the average time for successful transmission, the higher the retransmission efficiency of the sub-stream is, the shorter the time delay and the time-out time are, and the retransmission efficiency is improved when the sub-stream is used as a route for retransmission.
Step S103: and if the minimum average time is the same, selecting the corresponding sub-stream for retransmission according to the maximum congestion control window value and the maximum slow start threshold.
In this embodiment, when retransmission is performed overtime, the average time of successful transmission of different sub-stream message segments is calculated, and the sub-stream with the minimum time is selected; if the same minimum time exists, selecting the sub-stream with the maximum congestion control window value; if the CWND value is also the same, the substream with the largest slow start threshold is continued to be selected.
As a preferred solution of this embodiment, the selecting, according to the maximum congestion control window value and the maximum slow start threshold, a corresponding sub-stream for retransmission specifically includes:
acquiring congestion control window values corresponding to sub-streams with the same minimum average time, and judging whether the congestion control window values corresponding to the sub-streams are the same; if the sub-streams are the same, a slow start threshold corresponding to the sub-streams is obtained, and the sub-stream with the largest slow start threshold is selected for retransmission; and if the congestion control window values are different, selecting the sub-stream with the largest congestion control window value for retransmission.
It should be noted that, the congestion control window value (Congestion Window, CWND value) is calculated by the MPTCP protocol by default for each sub-stream, is a state variable maintained by the sender, and can be dynamically changed according to the congestion degree of the network, so long as no congestion occurs in the network, the CWND value will increase, but congestion occurs in the network, and the CWND value will decrease; and calculating the congestion control window value corresponding to each sub-stream, namely selecting the sub-stream with the largest congestion control window value for transmission, thereby slowing down the buffer blocking and improving the MPTCP throughput.
Further, when the congestion control window values corresponding to the sub-flows are the same, the sub-flow for retransmission is determined through the slow start threshold, that is, the sub-flow with the largest slow start threshold state variable is selected for retransmission by acquiring the slow start threshold state variable ssthresh (slowstart threshold) for judgment.
In another embodiment of the present invention, referring to fig. 2, node a represents the source end and node B represents the destination end. Both the source and destination are equipped with two IP addresses, and the end-to-end transmission rate is 5Mbit/s. The time delay of the sub-stream 1 is 40ms, the packet loss rate is fixed to be 1%, the timeout time is 500ms, the time delay of the sub-stream 2 is 30ms, and the packet loss rate is fixed to be 5%. The timeout time is 600ms, the forward and backward packet loss rates of the links are the same, and the packet loss events of the data packets are mutually independent.
Substream 1: packet loss rate l i Time delay d =1 i Time-out time rt=500 ms, average time T of the sub-streams is calculated by a calculation formula i = 39.6460ms. Substream 2:packet loss rate l i Time delay d =5 i Time-out time rt=600ms, average time T of the sub-streams is calculated by a calculation formula i = 28.5035ms. Comparing the average transmission time of substream 1 and substream 2, it is known that using substream 2 is more efficient for retransmission. Compared with the traditional single scheme, if the sub-streams are only considered based on time delay or packet loss indexes, the sub-streams are selected as retransmission sub-streams, but after comprehensive analysis and calculation, the efficiency of sub-stream 2 retransmission is found to be better. Therefore, the mode of the embodiment avoids the wrong selection caused by single factor comparison, and can select the optimal transmission scheme after combining scientific calculation of multiple reference factors.
The implementation of the above embodiment has the following effects:
according to the technical scheme, the retransmission mode of the multi-link aggregation router is obtained, under the condition that retransmission timeout occurs, average time of sub-stream transmission success is calculated for different sub-streams, non-timeout atomic streams are adopted for retransmission, subsequent average time calculation is avoided, route retransmission efficiency is improved, when the minimum average time is the same, sub-streams corresponding to the minimum average time are directly selected for retransmission, when the minimum average time is the same, corresponding sub-streams are selected for retransmission according to the maximum congestion control window value and the maximum slow start threshold, transmission delay and packet loss rate of sub-stream retransmission are comprehensively considered, better performance is achieved, buffer blockage is slowed down, throughput of the multi-link aggregation router is improved, and time delay and packet loss rate of sub-stream transmission are reduced.
Example two
Referring to fig. 3, a routing retransmission apparatus according to the present invention includes: a retransmission mode module 201, a first retransmission module 202 and a second retransmission module 203.
The retransmission mode module 201 is configured to obtain a retransmission mode of the multi-link aggregation router, and calculate an average time for successful transmission of different sub-streams when timeout retransmission occurs; and a plurality of sub-streams exist between the multilink aggregation routers for data transmission.
The first retransmission module 202 is configured to select, if there is no situation that the minimum average time is the same, a sub-stream corresponding to the minimum average time for retransmission.
And the second retransmission module 203 is configured to select, if the minimum average time is the same, a corresponding sub-stream for retransmission according to the maximum congestion control window value and the maximum slow start threshold.
Preferably, the retransmission mode includes fast retransmission and timeout retransmission; the fast retransmission comprises: and enabling the multilink aggregation router to retransmit according to the original sub-stream.
As a preferred scheme, the calculating the average time of successful transmission of different sub-streams specifically includes:
according to the packet loss rate, delay and timeout time corresponding to different sub-streams, calculating the average time of successful transmission of different sub-streams: t (T) i =1-l i 4 )·[RT·l i 2 + i (1-l i )]The method comprises the steps of carrying out a first treatment on the surface of the Wherein l i For packet loss rate of the sub-stream i, RT is timeout time of the sub-stream i, d i Is the delay of this substream i.
As a preferred solution, the selecting a corresponding sub-stream for retransmission according to the maximum congestion control window value and the maximum slow start threshold specifically includes:
acquiring congestion control window values corresponding to sub-streams with the same minimum average time, and judging whether the congestion control window values corresponding to the sub-streams are the same; if the sub-streams are the same, a slow start threshold corresponding to the sub-streams is obtained, and the sub-stream with the largest slow start threshold is selected for retransmission; and if the congestion control window values are different, selecting the sub-stream with the largest congestion control window value for retransmission.
It will be clear to those skilled in the art that, for convenience and brevity of description, reference may be made to the corresponding process in the foregoing method embodiment for the specific working process of the above-described apparatus, which is not described herein again.
The implementation of the above embodiment has the following effects:
according to the technical scheme, the retransmission mode of the multi-link aggregation router is obtained, under the condition that retransmission timeout occurs, average time of sub-stream transmission success is calculated for different sub-streams, non-timeout atomic streams are adopted for retransmission, subsequent average time calculation is avoided, route retransmission efficiency is improved, when the minimum average time is the same, sub-streams corresponding to the minimum average time are directly selected for retransmission, when the minimum average time is the same, corresponding sub-streams are selected for retransmission according to the maximum congestion control window value and the maximum slow start threshold, transmission delay and packet loss rate of sub-stream retransmission are comprehensively considered, better performance is achieved, buffer blockage is slowed down, throughput of the multi-link aggregation router is improved, and time delay and packet loss rate of sub-stream transmission are reduced.
Example III
Correspondingly, the invention also provides a terminal device, comprising: a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, the processor implementing the method of route retransmission as described in any one of the embodiments above when the computer program is executed.
The terminal device of this embodiment includes: a processor, a memory, a computer program stored in the memory and executable on the processor, and computer instructions. The processor, when executing the computer program, implements the steps of the first embodiment described above, such as steps S101 to S103 shown in fig. 1. Alternatively, the processor may implement the functions of the modules/units in the above-described apparatus embodiments, such as the retransmission mode module 201, when executing the computer program.
The computer program may be divided into one or more modules/units, which are stored in the memory and executed by the processor to accomplish the present invention, for example. The one or more modules/units may be a series of computer program instruction segments capable of performing the specified functions, which instruction segments are used for describing the execution of the computer program in the terminal device. For example, the retransmission mode module 201 is configured to obtain a retransmission mode of the multi-link aggregation router, and calculate an average time for successful transmission of different sub-streams when timeout retransmission occurs; and a plurality of sub-streams exist between the multilink aggregation routers for data transmission. .
The terminal equipment can be computing equipment such as a desktop computer, a notebook computer, a palm computer, a cloud server and the like. The terminal device may include, but is not limited to, a processor, a memory. It will be appreciated by those skilled in the art that the schematic diagram is merely an example of a terminal device and does not constitute a limitation of the terminal device, and may include more or less components than illustrated, or may combine some components, or different components, e.g., the terminal device may further include an input-output device, a network access device, a bus, etc.
The processor may be a central processing unit (Central Processing Unit, CPU), other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), off-the-shelf programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. The general purpose processor may be a microprocessor or the processor may be any conventional processor or the like, which is a control center of the terminal device, and which connects various parts of the entire terminal device using various interfaces and lines.
The memory may be used to store the computer program and/or the module, and the processor may implement various functions of the terminal device by running or executing the computer program and/or the module stored in the memory and invoking data stored in the memory. The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data created according to the use of the mobile terminal, etc. In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as a hard disk, memory, plug-in hard disk, smart Media Card (SMC), secure Digital (SD) Card, flash Card (Flash Card), at least one disk storage device, flash memory device, or other volatile solid-state storage device.
Wherein the terminal device integrated modules/units may be stored in a computer readable storage medium if implemented in the form of software functional units and sold or used as stand alone products. Based on such understanding, the present invention may implement all or part of the flow of the method of the above embodiment, or may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when the computer program is executed by a processor, the computer program may implement the steps of each of the method embodiments described above. Wherein the computer program comprises computer program code which may be in source code form, object code form, executable file or some intermediate form etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), an electrical carrier signal, a telecommunications signal, a software distribution medium, and so forth. It should be noted that the computer readable medium contains content that can be appropriately scaled according to the requirements of jurisdictions in which such content is subject to legislation and patent practice, such as in certain jurisdictions in which such content is subject to legislation and patent practice, the computer readable medium does not include electrical carrier signals and telecommunication signals.
Example IV
Correspondingly, the invention further provides a computer readable storage medium, which comprises a stored computer program, wherein the computer program controls a device where the computer readable storage medium is located to execute the routing retransmission method according to any one of the embodiments.
The foregoing embodiments have been provided for the purpose of illustrating the general principles of the present invention, and are not to be construed as limiting the scope of the invention. It should be noted that any modifications, equivalent substitutions, improvements, etc. made by those skilled in the art without departing from the spirit and principles of the present invention are intended to be included in the scope of the present invention.
Claims (10)
1. A method of route retransmission, comprising:
acquiring a retransmission mode of the multi-link aggregation router, and calculating average time of successful transmission of different sub-streams when timeout retransmission occurs; a plurality of sub-streams exist between the multilink aggregation routers for data transmission;
if the situation that the minimum average time is the same does not exist, selecting a sub-stream corresponding to the minimum average time for retransmission;
and if the minimum average time is the same, selecting the corresponding sub-stream for retransmission according to the maximum congestion control window value and the maximum slow start threshold.
2. The method of claim 1, wherein the retransmission mode includes fast retransmission and timeout retransmission; the fast retransmission comprises: and enabling the multilink aggregation router to retransmit according to the original sub-stream.
3. The method for retransmitting the route as claimed in claim 1, wherein the calculating the average time of successful transmission of different sub-streams is specifically as follows:
according to the packet loss rate, delay and timeout time corresponding to different sub-streams, calculating the average time of successful transmission of different sub-streams: t (T) i =(1-l i 4 )·[RT·l i 2 +d i (1-l i )];
Wherein l i For packet loss rate of the sub-stream i, RT is timeout time of the sub-stream i, d i Is the delay of this substream i.
4. The method for retransmitting the route as claimed in claim 1, wherein the selecting the corresponding sub-stream for retransmitting according to the maximum congestion control window value and the maximum slow start threshold is specifically as follows:
acquiring congestion control window values corresponding to sub-streams with the same minimum average time, and judging whether the congestion control window values corresponding to the sub-streams are the same;
if the sub-streams are the same, a slow start threshold corresponding to the sub-streams is obtained, and the sub-stream with the largest slow start threshold is selected for retransmission;
and if the congestion control window values are different, selecting the sub-stream with the largest congestion control window value for retransmission.
5. A routing retransmission apparatus, comprising: a retransmission mode module, a first retransmission module and a second retransmission module;
the retransmission mode module is used for acquiring a retransmission mode of the multi-link aggregation router and calculating the average time of successful transmission of different sub-streams when timeout retransmission occurs; a plurality of sub-streams exist between the multilink aggregation routers for data transmission;
the first retransmission module is configured to select a sub-stream corresponding to the minimum average time to retransmit if the condition that the minimum average time is the same does not exist;
and the second retransmission module is used for selecting the corresponding sub-streams for retransmission according to the maximum congestion control window value and the maximum slow start threshold if the conditions that the minimum average time is the same exist.
6. The method of claim 5, wherein the retransmission mode includes fast retransmission and timeout retransmission; the fast retransmission comprises: and enabling the multilink aggregation router to retransmit according to the original sub-stream.
7. The method for retransmitting the route as claimed in claim 5, wherein the calculating the average time of successful transmission of different sub-streams is specifically:
according to packet loss rate, delay and timeout time corresponding to different sub-streamsCalculating the average time of successful transmission of different substreams: t (T) i =(1-l i 4 )·[RT·l i 2 +d i (1-l i )];
Wherein l i For packet loss rate of the sub-stream i, RT is timeout time of the sub-stream i, d i Is the delay of this substream i.
8. The method for retransmitting route as claimed in claim 5, wherein the selecting the corresponding sub-stream for retransmitting according to the maximum congestion control window value and the maximum slow start threshold is specifically as follows:
acquiring congestion control window values corresponding to sub-streams with the same minimum average time, and judging whether the congestion control window values corresponding to the sub-streams are the same;
if the sub-streams are the same, a slow start threshold corresponding to the sub-streams is obtained, and the sub-stream with the largest slow start threshold is selected for retransmission;
and if the congestion control window values are different, selecting the sub-stream with the largest congestion control window value for retransmission.
9. A terminal device comprising a processor, a memory and a computer program stored in the memory and configured to be executed by the processor, the processor implementing the method of route retransmission according to any one of claims 1 to 4 when executing the computer program.
10. A computer readable storage medium, characterized in that the computer readable storage medium comprises a stored computer program, wherein the computer program, when run, controls a device in which the computer readable storage medium is located to perform the route retransmission method according to any one of claims 1 to 4.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310204660.0A CN116170119A (en) | 2023-03-03 | 2023-03-03 | Route retransmission method, device, equipment and storage medium |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310204660.0A CN116170119A (en) | 2023-03-03 | 2023-03-03 | Route retransmission method, device, equipment and storage medium |
Publications (1)
Publication Number | Publication Date |
---|---|
CN116170119A true CN116170119A (en) | 2023-05-26 |
Family
ID=86416354
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202310204660.0A Pending CN116170119A (en) | 2023-03-03 | 2023-03-03 | Route retransmission method, device, equipment and storage medium |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN116170119A (en) |
-
2023
- 2023-03-03 CN CN202310204660.0A patent/CN116170119A/en active Pending
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US9088511B2 (en) | Multi-hop error recovery | |
US11570021B2 (en) | Packet processing method and network device in hybrid access network | |
CN108881008B (en) | Data transmission method, device and system | |
US20080159150A1 (en) | Method and Apparatus for Preventing IP Datagram Fragmentation and Reassembly | |
CN106576073B (en) | Method and system for transmitting data through aggregated connections | |
RU2560819C2 (en) | Method, device and system for data redirection in communication system | |
US20120079065A1 (en) | Data packet transfer over wide area network in fast and reliable manner | |
US20050220097A1 (en) | Expedited data transmission in packet based network | |
US8711689B1 (en) | Dynamic trunk distribution on egress | |
US20080137669A1 (en) | Network of nodes | |
US11888960B2 (en) | Packet processing method and apparatus | |
WO2018144234A1 (en) | Data bandwidth overhead reduction in a protocol based communication over a wide area network (wan) | |
EP3820088A1 (en) | Method and network device for multi-path communication | |
JP2018511275A (en) | Method and system for scheduling packets in bundling scenarios based on TCP tunnel and native TCP information | |
CN115766605A (en) | Network congestion control method, device and system | |
JP2002204269A (en) | Method for transmitting data by network and computer network | |
CN115776443A (en) | Method, device and system for determining network optimization strategy | |
CN116170119A (en) | Route retransmission method, device, equipment and storage medium | |
EP3562108B1 (en) | Load sharing between hybrid tunnels | |
US11805071B2 (en) | Congestion control processing method, packet forwarding apparatus, and packet receiving apparatus | |
US11240164B2 (en) | Method for obtaining path information of data packet and device | |
US10594593B2 (en) | Methods and apparatus for transmitting data | |
TWI757887B (en) | Method, network controller, and computer program product for facilitating multipath transmission of a data stream from a sender to a receiver | |
US11729099B2 (en) | Scalable E2E network architecture and components to support low latency and high throughput | |
JP2001007862A (en) | Communication load distributing method |
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 |