CN103067301A - Fast and reliable congestion control improved algorithm based on user datagram protocol (UDP) - Google Patents
Fast and reliable congestion control improved algorithm based on user datagram protocol (UDP) Download PDFInfo
- Publication number
- CN103067301A CN103067301A CN2013100172677A CN201310017267A CN103067301A CN 103067301 A CN103067301 A CN 103067301A CN 2013100172677 A CN2013100172677 A CN 2013100172677A CN 201310017267 A CN201310017267 A CN 201310017267A CN 103067301 A CN103067301 A CN 103067301A
- Authority
- CN
- China
- Prior art keywords
- state
- window
- frudp
- congestion
- send
- 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
Abstract
The invention provides a fast and reliable congestion control strategy (FRUDP) which is based on a user datagram protocol (UDP) of a transport layer, and is designed to guarantee an information flow to run high-efficiently and stably in a high speed network environment between an application layer and the transport layer on the basis that network address translator (NAT) equipment can be penetrated through and transportation stability are guaranteed. The FRUDP is mainly formed by an estimating module, a window control module, a data processing model and an emergency control module, wherein the estimating module is arranged at a sending end, does not need to modify a network layer protocol, estimates transmission paths and propagation delay through collaboration according to the local information capable of being obtained by the sending end, and accurately estimates the actual number of the queued packages remaining in periodic line buffer areas in each process. The window control module designs congestion control strategies in a collaboration mode at the sending end, taking the queue size of a bottleneck periodic line buffer area as a balance point, actively controls the queuing length of periodic line buffer areas, and actively prevents the overflow of the queues of the buffer areas and congestion phenomena from occurring. The data processing module determines which groups to be sent from a candidate pool. The emergency control module determines when to send the groups.
Description
Technical field
The present invention relates to Internet Transmission control protocol algorithm and improve field, is specifically when transport layer is selected user datagram (UDP) agreement, can meet the improvement algorithm of the requirement of fast transport, reliability and penetrating NAT equipment simultaneously.
Background technology
Current the Internet is based on the 4th edition of Internet protocol (being called for short IPv4) framework, and along with the various application of network universal, development rapidly, IP address resource plaque further is weary.In order to address this problem, each enterprise, company and ISP have disposed a large amount of network address translation apparatus (Network Address Translation, NAT).Utilize these NAT device and corresponding NAT technology, can make the All hosts in a local area network (LAN) visit Internet by one or several public network IP address.But different due to local area network (LAN) and Internet addressing mode, NAT device has been hidden intranet host IP address.Therefore, in order to make to be positioned at different N AT main frame afterwards, be convenient to penetrate these NAT device nodes, connect each other, a lot of application programs can transport layers adopt User Datagram Protoco (UDP) (User Datagram Protocol, UDP).And UDP is towards disconnected agreement, it does not connect with the other side, and directly just Packet Generation is gone over, the transmission data speed is fast, and efficiency is high, can support massive concurrent to connect, but, because UDP does not provide error checking and correction and retransmission mechanism, there are the characteristics of poor reliability.
Select the poor shortcoming of udp protocol transmission data reliability in order to make up in transport layer, existing scholar introduces reliable control and the congestion control mechanism of TCP (Transmission Control Protocol), has designed a kind of reliable data transmission agreement based on UDP.Through a large amount of practical application tests and client's feedback, show, the reliable mechanism of above-mentioned transmission data wins initial success, but the effect of congestion control is undesirable, especially in the situation that file transfer and video playback, communication system presents unstable, the phenomenon that bandwidth availability ratio is low.2 points of having traced it to its cause.One produces congestedly from bottleneck link, to transmitting terminal, obtain congestion information, and certain time interval is arranged, and transmitting terminal can't promptly and accurately be estimated the congestion information of link, so there is the hysteresis problem in the congestion control policy that transmitting terminal is taked, controls effect undesirable.The additivity on the other hand adopted at present increases, the property taken advantage of reduces (Additive Increase Multiplicative Decrease, AIMD) congestion avoidance algorithm adaptability in complicated express network is not strong, efficiency is lower, as the send window increase is slow under normal circumstances, cause large send window to recover slow after congested generation, limited the ability of obtaining idle bandwidth, utilance is low for a comparatively long period of time to make link, can not effectively carry out the big data quantity transmission, be difficult to take full advantage of the network bandwidth; And, when congested generation, large send window but reduces at double, thereby cause the mass data packet loss, network presents the thermal agitation phenomenon.Therefore, udp protocol based on transport layer, on the basis that guarantees correct penetrating NAT equipment and transmission reliability, design and can guarantee the efficiently and smoothly operated congestion avoidance algorithm of information flow under high speed network environment in application layer, network application is had to good promotion and reference value.
Research and improvement for the udp protocol reliability have become current hot issue.In the mass communication terminal frequently sends the environment of small size message to private server, Wang Ji has just proposed the RUDP agreement, this improved protocol is in order to guarantee reliability, every data message of transmitting terminal, just enter the waiting-timeout state, until receive that the confirmation information that receiving terminal is replied just carries out follow-up transmission.If the overtime confirmation of also not receiving of transmitting terminal, think and carry out retransmission process by this message dropping.Visible, the waiting-timeout mechanism of this process and TCP is closely similar, although that this RUDP will simplify than TCP is many, its various time delay is unsuitable for the fast transport of large data.Doan Thanh Tran further improves above-mentioned RUDP agreement, and every data message of transmitting terminal, just enter the waiting-timeout queue, continues to send next message, and receiving terminal is made and replied confirmation received message; Transmitting terminal removes the message of wait acknowledge after receiving confirmation from waiting list; Also do not receive confirmation if in waiting list, the message of wait acknowledge is overtime, transmitting terminal is retransmitted this message.Zhou Jincai is on the basis of Doan algorithm, proposition all enters waiting list and continue to send next message often sending a message, rather than until send again next message after receiving the confirmation information of this message, than the RUDP of Doan, saved a large amount of stand-by period.But it still will be confirmed every message, be expended more resource.Based on above-mentioned 3 deficiencies of improving RUDP, Wang Haijun has proposed the concept of confirming or regularly confirming in batches.Confirm in batches to be that receiving terminal is unified to acknowledge message of transmitting terminal transmission (or transmitting terminal requires receiving terminal to reply an acknowledge message after the packet that sends some) after receiving the packet of some; The corresponding certain time interval that changes into of the packet of the some in confirming is in batches just become to the timing confirmation, will confirm in batches for the time being to confirm to be referred to as BA2RUDP (Bulk Ack 2 Reliable UDP) with timing.Two than front RUDP of the algorithm of BA2RUDP have saved a lot of time and resource, but it still exists deficiency: the send finger of transmitting terminal only has one, be after transmitting terminal is received confirmation at every turn, the packet retransmitted if necessary, send finger all obtains and temporarily stops transmit operation, search in requisition for the packet of retransmitting and carry out retransmit operation, continue again the transmission of back after retransmit operation completes.This process remains one and stops the process of waiting for, expends the suitable time.Wan Guofu proposes a kind of mechanism of reissuing, on this basis, retransmission mechanism, flow control and congestion control mechanism in conjunction with packet, provide a kind of enhancement mode reliable UDP transmission agreement ERUDP (Enhanced Reliable UDP), this agreement has obtained practical application in high definition media playback terminal system.Measured result shows, the transmission means that the document proposes is better than TCP and traditional RUDP (Reliable UDP, reliable UDP) on speed, guaranteed again reliability simultaneously.Wang Yanfang has proposed a kind of reliable data transmission Extended Protocol---UDT based on UDP, makes every effort to realize the real-time transmitting of mass data.Its main thought is to set up new technology and the new algorithm that the real-time transmitting of data is relevant in agreement, and existing relevant technology and calculating method is improved.These new technologies and new algorithm, improved technology and calculating method can be realized more effectively utilizing Internet resources, improve efficiency of transmission, reduce data-bag lost, reduce time delay and delay jitter end to end.
Jin Haili is the efficiency of solution TCP and the communication reliability problem of UDP, udp protocol is improved, set up sliding window mechanism on UDP, for guaranteeing that packet is without repeating, without packet loss ground, submitting to according to the order of sequence application process, and the congestion control ability can be provided, CPU usage does not under equal conditions obviously increase simultaneously.Packet loss problem when Huang Yuanfeng realizes the network real-time Data Transmission for the use udp protocol, on the basis of being analysed in depth in the principle of the reliable data transmission agreement-UDT to based on UDP, confirmation mechanism and the minimizing of the improved AIMD(additivity increase property taken advantage of that time-based and number of data packets combine have been proposed) congestion avoidance algorithm, realize thus the high-quality real-time Transmission of network audio-video data.Experiment showed, and use improved UDT agreement, can effectively improve reliability and the efficiency of transfer of data.
Above-mentioned research is mainly to launch research for the reliability of udp protocol and congestion control mechanism.Find that in actual test process effect is not very desirable, is mainly manifested in the following aspects:
(l). the hysteresis problem that congestion state is estimated.Because Internet is the huge system of a complexity, add its isomerism in essence and extensive the distribution, make the end of link congestion information can't feed back to timely transmitting terminal.When router occurs when congested, transmitting terminal will could obtain packet loss information through the time of a round trip delay time, during this period of time, the transmitting terminal window has sent again a large amount of data, and these packets that newly increase all will be lost while finding packet loss, too much packet loss has a strong impact on systematic function.
(2). global synchronization problem.Due to the bursty nature of the upper data of Internet, the bag of arrival router also happens suddenly often.If queue is full or is almost full, will cause at short notice continuously packet loss in large quantities.And the CC2010 of the congestion control mechanism that induces one has adaptive characteristic when transmitting terminal sends data, transmitting terminal finds that packet loss just reduces send window sharp, and the bag arrival rate just descends rapidly, so network congestion is removed.But transmitting terminal is learnt network and is started again to increase transmission speed after no longer congested, finally causes again network congestion.And this phenomenon usually can go on again and again, thus within a period of time the network state very low in link bandwidth utilization rate, reduced entire throughput, phenomenon that Here it is so-called " TCP global synchronization ".
(3). the express network bad adaptability.Congestion avoidance algorithm adaptability in complicated express network that the additivity of design increases, the property taken advantage of reduces is not strong, efficiency is lower, as the send window increase is slow under normal circumstances, cause large send window to recover slow after congested generation, limited the ability of obtaining idle bandwidth, utilance is low for a comparatively long period of time to make link, can not effectively carry out the big data quantity transmission, is difficult to take full advantage of the network bandwidth; And, when congested generation, large send window but reduces at double, thereby cause the mass data packet loss, network presents the thermal agitation phenomenon.
Therefore, the present invention will solve the validity problem of introducing congestion control mechanism at udp protocol.When the data of transmitting terminal transmission surpass the bandwidth of bottleneck link, will cause the bottleneck link buffer queue length to increase.When queue length is increased to a certain degree, buffering area can overflow, and causes mass data to lose, and produces congestion phenomenon, and network performance sharply descends.
At present, do not have good method make transmitting terminal can be accurately, estimation network congestion state in time.Therefore, the present invention changes the thought of passive estimation end of link congestion state in the past, and take the queue length of bottleneck link buffering area at transmitting terminal is balance point, design transmitting terminal send window control strategy.This control strategy is always usingd expectation and is stayed the number of link buffer as equilibrium valve, when estimating that the actual number of staying buffering area is greater than this equilibrium valve, just turn send window down, when estimating that the actual number of staying buffering area is less than this equilibrium valve, just increase send window.Like this, just can initiatively go the queue length of control link buffering area, thereby initiatively avoid the appearance of buffering area queue overflow and congestion phenomenon.
Summary of the invention
A kind of based on user datagram (UDP) agreement
'sthe improved Algorithm of Congestion Control of fast and reliable.This algorithm is guaranteeing correctly to penetrate network address translation (NAT, Network Address Translation) on the basis of equipment and transmission reliability, in application layer and wear between defeated layer design can guarantee information flow under high speed network environment efficiently and smoothly operated fast, congestion control policy (FAST RELIABEL UDP reliably, be called for short FRUDP), specifically comprise as follows:
Step 1. design FRUDP controls, the data packet head form.FRUDP has two kinds of bags: packet and control bag, by data type (flag bit), distinguish, and if 0 expression is packet, 1 means it is to control to wrap.
Step 2. design FRUDP main functional modules, comprise that estimation module, window control module, data processing module and burst control module form.Wherein estimation module is estimated the situation of change of end of link packet queue time delay, computing network congestion state; The window control module obtains the network congestion state according to estimation module and adjusts transmitting terminal send window size, determines will send how many groupings in a round trip delay time; Data processing module from candidate pool (comprise new data packet, sent grouping unconfirmed, send but lost packets) determine to send which grouping, the burst control module determines when to send these groupings.
For being connected, each FRUDP can obtain fast propagation delay accurately, design a kind of Collaborative Control synchronized callback strategy at transmitting terminal, this strategy takes full advantage of each connection can obtain local message, determine synchronized callback time and rational rollback amplitude, when one has new connection to arrive, newly, old connection can empty queue by the Fast synchronization rollback, makes new connection can obtain fast accurate propagation delay.Specifically comprise as follows:
Definition Flag is flag bit, and initial value is true;
maximized window value for linkage record;
Step 1. is defined as follows four kinds of states:
Initial state: FRUDP connects foundation, starts to transmit data, and Flag is true.
Final state: DTD, FRUDP Connection Release.
Transient state: nonequilibrium state, the absolute value that send window changes is not less than
.
Equilibrium state: the absolute value perseverance that send window changes continuously is less than
.
Step 2. is defined as follows 3 kinds of events:
The absolute value that event 1:FRUDP transmitting terminal send window changes occurs first continuously
inferior being greater than
.
The absolute value that event 2:FRUDP transmitting terminal send window changes is continuous first
inferior being less than
(very little constant).
Event 3:FRUDP connection data end of transmission.
Step 3. is defined as follows 2 conditions
Condition 1: simultaneously meet following 4 points:
I .Flag is Flase, and this equilibrium state delivery flow rate is less than equilibrium state delivery flow rate last time, shows that the equilibrium state caused because of newly-built connection shifts.
II. not by old connection rollback state, avoid continuous rollback situation between twice equilibrium state.
III. propagation delay does not reduce, and gets rid of after new connection return back to equilibrium state and continues again rollback.
IV. the system operation arrives lock in time.
Condition 2:Flag is true, and it is continuous that this connects send window
inferior change is large, and round trip delay time is continuous
inferior diminishing.
Step 4. is defined as follows 4 actions
Action 1: within the rollback time of appointment (integral multiple of round trip delay time), reduce send window, rollback.
Action 2: within the rollback time of appointment (integral multiple of round trip delay time), reduce send window, it is false that Flag is set.
Action 3: record enters the time of transient state
.
Step 5., when in initial condition, if there is event 1 to occur, enters into transient state.
When in transient state, if there is event 3 to occur, enter into final state.
When in transient state, if there is event 2 to occur, enter into equilibrium state.
When beinthebalancestate, if there is event 1 to occur, perform an action 3, enter into transient state.
When beinthebalancestate, if satisfy condition 1, perform an action 1, enter into transient state.
When beinthebalancestate, if satisfy condition 2, perform an action 2, enter into transient state.
The window control module changes the thought of passive estimation end of link congestion state in the past, and take the queue length of bottleneck link buffering area at transmitting terminal is balance point, cooperative cooperating design congestion control policy.This control strategy is always usingd expectation and is stayed the number of link buffer as equilibrium valve, when estimating that the actual number of staying buffering area is greater than this equilibrium valve, just by turning send window down, when estimating that the actual number of staying buffering area is less than this equilibrium valve, just scale up send window, thereby realized the queue length of ACTIVE CONTROL link buffer, initiatively avoided the appearance of buffering area queue overflow and congestion phenomenon.It is characterized in that, specifically comprise as follows:
Step 1: the propagation delay of estimating according to estimation module takes full advantage of and connects local message and the upper sampling period network operation state that transmitting terminal can obtain, cooperative cooperating analysis judgement network operation state (slight, moderate, at full capacity and equilibrium state).
Step 2: according to mode state, select parameter strategy.As when the transmitting terminal window continuously than leap ahead, queuing delay is little, and while there is no packet loss, the judgement network system, in slight load, now should take positive window to increase strategy.If find packet loss but queuing delay is little, illustrate still in slight load.When the transmitting terminal window changes when slow, near the illustrative system beinthebalancestate, select less window control strategy, increase the stability of a system.When the packet loss time interval, have continuously than leap ahead, when queuing delay head, packet loss are large, the explanation network, in the heavy load congestion state, should take significantly window to reduce strategy etc.
The accompanying drawing explanation
Fig. 1 network architecture.
Fig. 2 FRUDP data packet format.
Fig. 3 server end is connected with client to be set up and closes.
Fig. 4 FRUDP network congestion control structure.
Fig. 5 synchronized callback Policy Status event transition diagram.
Fig. 6 works in coordination with congestion control policy figure.
Embodiment
FRUDP is based upon on UDP, other connection oriented protocol of application-level, and protocol package has contained reliable control and congestion control policy, is that a kind of data based on UDP are quick, reliability application layer Congestion control protocol.From the angle of computer network architectures, the hierarchical structure of FRUDP is as shown in Fig. 1.
In the new five layer network architectures that form, the actual UDP that remains transport layer that is used for transmitting data, the new FRUDP layer added has the controlling mechanism that packet confirmation, repeating transmission and congestion control etc. guarantee reliable data transmission, has so just realized a kind of connection-oriented quick, authentic data pass through mechanism based on UDP.
FRUDP has two kinds of bags: packet and control bag, and they distinguish by data type (flag bit), if 0 expression is packet, 1 means it is to control to wrap.Packet structure as shown in Figure 2.
As shown in Figure 3, after connecting foundation, server end and client all will enter the state that sends or receive data.Server is controlled to client transmission (or re-transmission) application data bag according to flow control and speed, the client packet, and send and control bag to server accordingly, control wraps between the server and client side and mutually transmits.The same udp port of sending and receiving procedure sharing of FRUDP entity carrys out the sending and receiving bag.Simultaneously, reception program also is responsible for triggering and processing all control events, comprises reliable control, congestion control and associated various controlling mechanisms, such as bandwidth estimation, confirmation, re-transmission and error control etc.
In application layer design FRUDP network congestion control structure as shown in Figure 4.Mainly by being formed by estimation module, window control module, data processing module and burst control module.Wherein estimation module is estimated the situation of change of end of link packet queue time delay, computing network congestion state; The window control module obtains the network congestion state according to estimation module and adjusts transmitting terminal send window size, determines will send how many groupings in a round trip delay time; Data processing module from candidate pool (comprise new data packet, sent grouping unconfirmed, send but lost packets) determine to send which grouping, the burst control module determines when to send these groupings.Transmitting terminal window adjusting strategy is as follows:
FRUDP connects (hereinafter to be referred as connecting) using the minimum round trip delay time of transmitting terminal acquisition as propagation delay.Therefore, in network, existed FRUDP under poised state to connect (hereinafter to be referred as old connection), if when Persistent Congestion, newly-built FRUDP connects (hereinafter to be referred as new connection) will be difficult to obtain fast propagation delay accurately, thereby can't accurately calculate the actual packet number of staying buffering area, affect the control effect of algorithm.
For in the situation that Persistent Congestion, each is connected and can obtain fast propagation delay accurately, we design a kind of Collaborative Control synchronized callback strategy at transmitting terminal, this strategy takes full advantage of each connection can obtain local message, determine synchronized callback time and rational rollback amplitude, when one has new connection to arrive, new, old connection can empty queue by the Fast synchronization rollback, makes new connection can obtain fast accurate propagation delay.
This policing algorithm thought, adopt state event graph model as shown in Figure 5 to describe for convenience of description.This model comprises 4 kinds of states, 3 events, 2 conditions and 3 actions, and specific definition is shown in summary of the invention.Definition
,
,
,
.
The window control module takes full advantage of and to connect local message and the upper sampling period network operation state that transmitting terminal can obtain, as shown in Figure 6, and cooperative cooperating analysis judgement network operation state (slight, moderate, at full capacity and equilibrium state).Select parameter strategy according to mode state.As when the transmitting terminal window continuously than leap ahead, queuing delay is little, and while there is no packet loss, the judgement network system, in slight load, now should take positive window to increase strategy.If find packet loss but queuing delay is little, illustrate still in slight load.When the transmitting terminal window changes when slow, near the illustrative system beinthebalancestate, select less window control strategy, increase the stability of a system.When the packet loss time interval, have continuously than leap ahead, when queuing delay head, packet loss are large, the explanation network, in the heavy load congestion state, should take significantly window to reduce strategy etc.
Claims (3)
1. one kind based on user datagram (UDP) agreement
'sthe improved Algorithm of Congestion Control of fast and reliable, this algorithm is guaranteeing correctly to penetrate network address translation (NAT, Network Address Translation) on the basis of equipment and transmission reliability, in application layer and wear between defeated layer design can guarantee information flow under high speed network environment efficiently and smoothly operated fast, congestion control policy (FAST RELIABEL UDP reliably, be called for short FRUDP), it is characterized in that, specifically comprise as follows:
Step 1: design FRUDP control, data packet head form, FRUDP has two kinds of bags: packet and control bag, by data type (flag bit), distinguish, and if 0 expression is packet, 1 expression is to control to wrap;
Step 2: design FRUDP main functional modules comprises that estimation module, window control module, data processing module and burst control module form; Wherein estimation module is estimated the situation of change of end of link packet queue time delay, computing network congestion state; The window control module obtains the network congestion state according to estimation module and adjusts transmitting terminal send window size, determines will send how many groupings in a round trip delay time; Data processing module from candidate pool (comprise new data packet, sent grouping unconfirmed, send but lost packets) determine to send which grouping, the burst control module determines when to send these groupings.
2. according to claim 1 based on User Datagram Protoco (UDP)
'sthe improved Algorithm of Congestion Control of fast and reliable, it is characterized in that, for being connected, each FRUDP can obtain fast propagation delay accurately, design a kind of Collaborative Control synchronized callback strategy at transmitting terminal, this strategy takes full advantage of each connection can obtain local message, determines synchronized callback time and rational rollback amplitude, when one has new connection to arrive, newly, old connection can empty queue by the Fast synchronization rollback, makes new connection can obtain fast accurate propagation delay, specifically comprises as follows:
Definition Flag is flag bit, and initial value is true;
maximized window value for linkage record;
Step 1: be defined as follows four kinds of states:
Initial state: FRUDP connects foundation, starts to transmit data, and Flag is true;
Final state: DTD, FRUDP Connection Release;
Transient state: nonequilibrium state, the absolute value that send window changes is not less than
;
Equilibrium state: the absolute value perseverance that send window changes continuously is less than
;
Step 2: be defined as follows 3 kinds of events:
The absolute value that event 1:FRUDP transmitting terminal send window changes occurs first continuously
inferior being greater than
;
The absolute value that event 2:FRUDP transmitting terminal send window changes is continuous first
inferior being less than
(very little constant);
Event 3:FRUDP connection data end of transmission;
Step 3: be defined as follows 2 conditions
Condition 1: simultaneously meet following 4 points:
I .Flag is Flase, and this equilibrium state delivery flow rate is less than equilibrium state delivery flow rate last time, shows that the equilibrium state caused because of newly-built connection shifts;
II. not by old connection rollback state, avoid continuous rollback situation between twice equilibrium state;
III. propagation delay does not reduce, and gets rid of after new connection return back to equilibrium state and continues again rollback;
IV. the system operation arrives lock in time;
Condition 2:Flag is true, and it is continuous that this connects send window
inferior change is large, and round trip delay time is continuous
inferior diminishing;
Step 4. is defined as follows 4 actions
Action 1: within the rollback time of appointment (integral multiple of round trip delay time), reduce send window, rollback;
Action 2: within the rollback time of appointment (integral multiple of round trip delay time), reduce send window, it is false that Flag is set;
Action 3: record enters the time of transient state
;
Step 5., when in initial condition, if there is event 1 to occur, enters into transient state;
When in transient state, if there is event 3 to occur, enter into final state;
When in transient state, if there is event 2 to occur, enter into equilibrium state;
When beinthebalancestate, if there is event 1 to occur, perform an action 3, enter into transient state;
When beinthebalancestate, if satisfy condition 1, perform an action 1, enter into transient state;
When beinthebalancestate, if satisfy condition 2, perform an action 2, enter into transient state.
3. according to claim 1 based on User Datagram Protoco (UDP)
'sthe improved Algorithm of Congestion Control of fast and reliable, it is characterized in that, the window control module changes the thought of passive estimation end of link congestion state in the past, take the queue length of bottleneck link buffering area at transmitting terminal is balance point, cooperative cooperating design congestion control policy, this control strategy is always usingd expectation and is stayed the number of link buffer as equilibrium valve, when estimating that the actual number of staying buffering area is greater than this equilibrium valve, just by turning send window down, when estimating that the actual number of staying buffering area is less than this equilibrium valve, just scale up send window, thereby realized the queue length of ACTIVE CONTROL link buffer, initiatively avoided the appearance of buffering area queue overflow and congestion phenomenon, specifically comprise as follows:
Step 1: the propagation delay of estimating according to estimation module takes full advantage of and connects local message and the upper sampling period network operation state that transmitting terminal can obtain, cooperative cooperating analysis judgement network operation state (slight, moderate, at full capacity and equilibrium state);
Step 2: select parameter strategy according to mode state, as when the transmitting terminal window continuously than leap ahead, queuing delay is little, and while there is no packet loss, the judgement network system, in slight load, now should take positive window to increase strategy; If find packet loss but queuing delay is little, illustrate still in slight load; When the transmitting terminal window changes when slow, near the illustrative system beinthebalancestate, select less window control strategy, increase the stability of a system; When the packet loss time interval, have continuously than leap ahead, when queuing delay head, packet loss are large, the explanation network, in the heavy load congestion state, should take significantly window to reduce strategy etc.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013100172677A CN103067301A (en) | 2013-01-17 | 2013-01-17 | Fast and reliable congestion control improved algorithm based on user datagram protocol (UDP) |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013100172677A CN103067301A (en) | 2013-01-17 | 2013-01-17 | Fast and reliable congestion control improved algorithm based on user datagram protocol (UDP) |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103067301A true CN103067301A (en) | 2013-04-24 |
Family
ID=48109769
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2013100172677A Pending CN103067301A (en) | 2013-01-17 | 2013-01-17 | Fast and reliable congestion control improved algorithm based on user datagram protocol (UDP) |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103067301A (en) |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105187862A (en) * | 2015-08-31 | 2015-12-23 | 北京暴风科技股份有限公司 | Distributed player flow control method and system |
| CN105376173A (en) * | 2014-09-02 | 2016-03-02 | 中兴通讯股份有限公司 | Sending window flow control method and terminal |
| CN107078970A (en) * | 2014-10-30 | 2017-08-18 | 三菱电机株式会社 | Data diode device |
| CN108111434A (en) * | 2017-12-14 | 2018-06-01 | 四川大学 | A kind of aeronautical Ad hoc networks method for reliable transmission based on reliable UDP and fountain codes |
| CN108881378A (en) * | 2018-05-02 | 2018-11-23 | 象翌微链科技发展有限公司 | A kind of transmission method of file, system and equipment |
| TWI646807B (en) * | 2017-09-07 | 2019-01-01 | 宏碁股份有限公司 | Dynamic adjustment method of RUDP device and sliding window parameters |
| CN109729178A (en) * | 2019-02-22 | 2019-05-07 | 苏州华必讯信息科技有限公司 | A kind of network download method of large-data documents |
| CN110650095A (en) * | 2018-06-26 | 2020-01-03 | 复旦大学 | Method for improving congestion control algorithm |
| CN111478821A (en) * | 2019-01-24 | 2020-07-31 | 中国信息通信研究院 | Network performance test method and system |
| CN113114580A (en) * | 2021-04-16 | 2021-07-13 | 电子科技大学 | User mode transport protocol development framework and method for 5G network congestion control |
| CN113438180A (en) * | 2021-06-02 | 2021-09-24 | 广联达科技股份有限公司 | Transmission control method, device and equipment for UDP (user Datagram protocol) data packet and readable storage medium |
| CN113642137A (en) * | 2021-08-04 | 2021-11-12 | 温州科技职业学院 | 5G network transmission access conversion protocol control system |
| CN114584517A (en) * | 2022-02-25 | 2022-06-03 | 百果园技术(新加坡)有限公司 | Congestion processing method, system, equipment and storage medium based on cache state |
| CN114866523A (en) * | 2022-03-30 | 2022-08-05 | 广东悦伍纪网络技术有限公司 | UDP-based video rapid transmission method and system |
| CN115085864A (en) * | 2022-04-27 | 2022-09-20 | 中国科学院空天信息创新研究院 | Data transmission method and device |
| CN115174304A (en) * | 2022-06-24 | 2022-10-11 | 南京国电南自维美德自动化有限公司 | CAN bus communication method with self-defined identifier segments |
| CN115208830A (en) * | 2022-05-27 | 2022-10-18 | 上海大学 | High-performance non-blocking data sending method and device |
| CN117675716A (en) * | 2024-01-26 | 2024-03-08 | 北京天维信通科技股份有限公司 | Method and device for accelerating file transmission based on modification of TCP sliding window parameters |
| CN113642137B (en) * | 2021-08-04 | 2024-05-03 | 温州科技职业学院 | 5G network transmission access conversion protocol control system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6535482B1 (en) * | 1998-05-08 | 2003-03-18 | Nortel Networks Limited | Congestion notification from router |
| CN101184052A (en) * | 2007-12-25 | 2008-05-21 | 北京广视通达网络技术有限公司 | Congestion control method of implementing reliable UDP transmission |
| CN101388833A (en) * | 2008-07-18 | 2009-03-18 | 广东工业大学 | Network controlling method based on adaptive threshold mechanism |
| CN101969432A (en) * | 2010-09-27 | 2011-02-09 | 江苏科技大学 | Random backoff based control method of TCP (Transmission Control Protocol) congestion window |
| CN102045362A (en) * | 2010-12-21 | 2011-05-04 | 北京高森明晨信息科技有限公司 | Data transmission method and system based on UDP protocol |
-
2013
- 2013-01-17 CN CN2013100172677A patent/CN103067301A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6535482B1 (en) * | 1998-05-08 | 2003-03-18 | Nortel Networks Limited | Congestion notification from router |
| CN101184052A (en) * | 2007-12-25 | 2008-05-21 | 北京广视通达网络技术有限公司 | Congestion control method of implementing reliable UDP transmission |
| CN101388833A (en) * | 2008-07-18 | 2009-03-18 | 广东工业大学 | Network controlling method based on adaptive threshold mechanism |
| CN101969432A (en) * | 2010-09-27 | 2011-02-09 | 江苏科技大学 | Random backoff based control method of TCP (Transmission Control Protocol) congestion window |
| CN102045362A (en) * | 2010-12-21 | 2011-05-04 | 北京高森明晨信息科技有限公司 | Data transmission method and system based on UDP protocol |
Non-Patent Citations (3)
| Title |
|---|
| DAVID X. WEI ET AL.: "《FAST TCP: Motivation, Architecture, Algorithms,Performance》", 《IEEE/ACM TRANSACTIONS ON NETWORKING》, vol. 14, no. 6, 31 December 2006 (2006-12-31) * |
| 李潭洪: "《基于UDP的可靠高效传输研究》", 《中国优秀硕士学位论文全文数据库 信息科技辑》, no. 12, 15 December 2011 (2011-12-15) * |
| 陈晓龙: "《FAST TCP高速网络拥塞控制策略与稳定性研究》", 《万方数据库》, 22 December 2010 (2010-12-22) * |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105376173A (en) * | 2014-09-02 | 2016-03-02 | 中兴通讯股份有限公司 | Sending window flow control method and terminal |
| CN105376173B (en) * | 2014-09-02 | 2020-04-28 | 中兴通讯股份有限公司 | Sending window flow control method and terminal |
| CN107078970A (en) * | 2014-10-30 | 2017-08-18 | 三菱电机株式会社 | Data diode device |
| CN105187862A (en) * | 2015-08-31 | 2015-12-23 | 北京暴风科技股份有限公司 | Distributed player flow control method and system |
| CN105187862B (en) * | 2015-08-31 | 2017-12-15 | 暴风集团股份有限公司 | A kind of distributed player flow control methods and system |
| TWI646807B (en) * | 2017-09-07 | 2019-01-01 | 宏碁股份有限公司 | Dynamic adjustment method of RUDP device and sliding window parameters |
| US10530701B2 (en) | 2017-09-07 | 2020-01-07 | Acer Incorporated | RUDP apparatus and dynamic adjustment method of sliding window parameter |
| CN108111434A (en) * | 2017-12-14 | 2018-06-01 | 四川大学 | A kind of aeronautical Ad hoc networks method for reliable transmission based on reliable UDP and fountain codes |
| CN108881378A (en) * | 2018-05-02 | 2018-11-23 | 象翌微链科技发展有限公司 | A kind of transmission method of file, system and equipment |
| CN110650095A (en) * | 2018-06-26 | 2020-01-03 | 复旦大学 | Method for improving congestion control algorithm |
| CN111478821A (en) * | 2019-01-24 | 2020-07-31 | 中国信息通信研究院 | Network performance test method and system |
| CN109729178A (en) * | 2019-02-22 | 2019-05-07 | 苏州华必讯信息科技有限公司 | A kind of network download method of large-data documents |
| CN113114580A (en) * | 2021-04-16 | 2021-07-13 | 电子科技大学 | User mode transport protocol development framework and method for 5G network congestion control |
| CN113438180A (en) * | 2021-06-02 | 2021-09-24 | 广联达科技股份有限公司 | Transmission control method, device and equipment for UDP (user Datagram protocol) data packet and readable storage medium |
| CN113642137A (en) * | 2021-08-04 | 2021-11-12 | 温州科技职业学院 | 5G network transmission access conversion protocol control system |
| CN113642137B (en) * | 2021-08-04 | 2024-05-03 | 温州科技职业学院 | 5G network transmission access conversion protocol control system |
| CN114584517A (en) * | 2022-02-25 | 2022-06-03 | 百果园技术(新加坡)有限公司 | Congestion processing method, system, equipment and storage medium based on cache state |
| CN114866523A (en) * | 2022-03-30 | 2022-08-05 | 广东悦伍纪网络技术有限公司 | UDP-based video rapid transmission method and system |
| CN115085864A (en) * | 2022-04-27 | 2022-09-20 | 中国科学院空天信息创新研究院 | Data transmission method and device |
| CN115085864B (en) * | 2022-04-27 | 2024-02-27 | 中国科学院空天信息创新研究院 | Data transmission method and device |
| CN115208830A (en) * | 2022-05-27 | 2022-10-18 | 上海大学 | High-performance non-blocking data sending method and device |
| CN115208830B (en) * | 2022-05-27 | 2023-09-08 | 上海大学 | High-performance non-blocking data transmission method and device |
| CN115174304A (en) * | 2022-06-24 | 2022-10-11 | 南京国电南自维美德自动化有限公司 | CAN bus communication method with self-defined identifier segments |
| CN115174304B (en) * | 2022-06-24 | 2023-12-22 | 南京国电南自维美德自动化有限公司 | CAN bus communication method with sectional self-definition identifier |
| CN117675716A (en) * | 2024-01-26 | 2024-03-08 | 北京天维信通科技股份有限公司 | Method and device for accelerating file transmission based on modification of TCP sliding window parameters |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103067301A (en) | Fast and reliable congestion control improved algorithm based on user datagram protocol (UDP) | |
| Scharf et al. | NXG03-5: Head-of-line Blocking in TCP and SCTP: Analysis and Measurements | |
| CN109327288B (en) | Data transmission acceleration method, device and system | |
| US10715282B2 (en) | Method and related device for improving TCP transmission efficiency using delayed ACK | |
| EP1690391B1 (en) | Transparent optimization for transmission control protocol initial session establishment | |
| WO2018205688A1 (en) | Method, apparatus and system for data transmission | |
| CN110830472B (en) | Flexible data transmission method of flexible data transmission protocol based on TCP/IP protocol | |
| US8812725B2 (en) | System and method for latency reduction in a network environment | |
| CN106059951B (en) | A kind of transfer control method for based on multilevel congestion feedback in DCN | |
| EP3533162B1 (en) | Handling of data packet transfer via a proxy | |
| CN101510816B (en) | Multi-route parallel transmission method based on route relationship | |
| WO2016033948A1 (en) | Transmission window traffic control method and terminal | |
| Géhberger et al. | Performance evaluation of low latency communication alternatives in a containerized cloud environment | |
| Chen et al. | Mp-rdma: enabling rdma with multi-path transport in datacenters | |
| WO2022121469A1 (en) | Flow control method, apparatus, and device, and readable storage medium | |
| Le et al. | Rogue: Rdma over generic unconverged ethernet | |
| Lu et al. | Dynamic ECN marking threshold algorithm for TCP congestion control in data center networks | |
| Guo et al. | Traffic control for RDMA-enabled data center networks: A survey | |
| CN102055774B (en) | Based on http server and the data processing method thereof of bag process | |
| Zhang et al. | Adaptive marking threshold method for delay-sensitive TCP in data center network | |
| CN111654505B (en) | UDP data packet reliable transmission method, system, computer equipment and storage medium | |
| US20170070442A1 (en) | Buffer bloat control | |
| WO2016169251A1 (en) | Tcp data transmission method for virtual machine and virtual machine system | |
| Du et al. | R-AQM: Reverse ACK active queue management in multitenant data centers | |
| Le et al. | SFC: Near-source congestion signaling and flow control |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130424 |