Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Adaptive congestion control method based on delay

A congestion control and self-adaptive technology, which is applied in digital transmission systems, data exchange networks, electrical components, etc., can solve the problem that the minimum value point cannot be close to 0, so as to avoid excessive window adjustment, good fairness, The effect of low latency

Active Publication Date: 2019-12-27
CENT SOUTH UNIV
View PDF4 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0041] The problem to be solved by the present invention is: when the round-trip link propagation delay is very small or the bottleneck bandwidth is very small or the number of streams in the network is large, the minimum value point in the queuing delay oscillation cycle cannot be close to 0.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Adaptive congestion control method based on delay
  • Adaptive congestion control method based on delay
  • Adaptive congestion control method based on delay

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0074] The specific embodiment of the present invention is described in further detail below in conjunction with accompanying drawing:

[0075] figure 1 It is the overall frame diagram of Adaptive-Copa, a delay-based adaptive congestion control method. First, the current rate is calculated according to the ratio of the window and the round-trip delay, and then the target rate is calculated according to the preset parameter δ and the ratio of the queuing delay. Finally, the current rate is compared and the target rate to determine whether the network is congested. When it is judged that the network is congested, the congestion window is adjusted according to V*θ*δ. The operation steps are as follows:

[0076] Step 1, each time the sender receives an ACK packet, it adjusts the congestion window cwnd by the following formula:

[0077]

[0078] Among them, cwnd' is a new congestion window calculated according to the current congestion window cwnd, δ is a parameter that ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a delay-based adaptive congestion control method, which comprises the following steps of: judging whether a network is congested or not at a sending end according to queuing delay and a window size, and adjusting a congestion window according to a congestion condition, wherein the adjustment amplitude of the congestion window each time is V * theta * delta, delta is a constant, V is used for accelerating the convergence rate of the congestion control algorithm, and theta is a parameter adjusted according to the situation whether zero point is reached or not in the queuing delay periodic jitter process, wherein the parameter is used for controlling the window adjusting amplitude in the current network environment, so that the problems that the link utilization rate is reduced under the condition that the long-term queuing delay is 0 and the minimum round-trip delay cannot be measured when the queuing delay is not 0 for a long time are solved. Experimental resultsshow that the bottleneck link buffer queue can be controlled to periodically generate emptying behaviors, so that each stream can measure accurate round-trip link propagation delay. Compared with a Copa algorithm, the method has the advantages of being lower in delay and better in fairness.

Description

technical field [0001] The invention relates to the field of network congestion control, in particular to a delay-based adaptive congestion control method. Background technique [0002] In the Internet, traditional mainstream congestion control protocols mainly perform congestion control based on packet loss information. However, when the network is not congested, the congestion control protocol based on packet loss will always increase the size of the congestion window until the buffer overflows at the network bottleneck where the data flow is congested. This makes the larger the buffer, the longer the queuing queue at the bottleneck, thus increasing the transmission delay of the data packet. In order to avoid this problem, the existing delay-based congestion control method proposes to use the delay information to judge whether the network is congested. When the delay is too large, it is judged as network congestion, so as to reduce the congestion window before the buffer ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/841
CPCH04L47/283
Inventor 蒋万春吴佳王建新
Owner CENT SOUTH UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products