CN105991461B - Jamming control method and device - Google Patents
Jamming control method and device Download PDFInfo
- Publication number
- CN105991461B CN105991461B CN201510047095.7A CN201510047095A CN105991461B CN 105991461 B CN105991461 B CN 105991461B CN 201510047095 A CN201510047095 A CN 201510047095A CN 105991461 B CN105991461 B CN 105991461B
- Authority
- CN
- China
- Prior art keywords
- value
- ratio
- cwnd
- congestion window
- old
- 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.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Communication Control (AREA)
Abstract
Embodiment discloses a kind of jamming control method and device.This method comprises: sender sets the first value for the value of congestion window according to Fast retransmission algorithm, and first segment is sent to recipient according to congestion window；After sending direction recipient sends first segment, the confirmation from recipient is received, is carried in the confirmation and repeats selective acknowledgement block；Sender sets second value for the value of congestion window according to ratio, the ratio be equal to the received repeated segments in the side of being received byte number divided by first segment byte number, second value is greater than the first value, the number of the byte of repeated segments is equal to the difference for repeating right margin and left margin in selective acknowledgement block, and repeated segments are the subsets of first segment.Above scheme helps to improve the utilization rate of network bandwidth.
Description
Technical field
The present invention relates to the communications field more particularly to jamming control methods and device.
Background technique
Transmission control protocol (Transmission Control Protocol, TCP) is transport layer protocol.TCP congestion control
The algorithm of system includes: slow turn-on (slow start), Congestion Avoidance (congestion avoidance), Fast retransmission (fast
) and four kinds of algorithms of fast quick-recovery (fast recovery) retransmit.
Wherein, Fast retransmission algorithm includes: when sender (sender) receives three duplicate acknowledgment (3duplicate
When ACKs), that is, think that section (segment) loses, then sender retransmits the section lost, without waiting for retransmission timer time-out.Fastly
Quick-recovery algorithm includes: when sender receives three duplicate acknowledgments, and sender reduces congestion by " multiplication reduction " mode
Window, and Slow start threshold (Slow Start Thresh, ssthresh) is halved.In existing fast restoration algorithm, lead to
It crosses " addition increase " mode and increases congestion window.After this, into congestion avoidance phase, slowly by congestion avoidance algorithm
Increase congestion window.In above-mentioned technical proposal, it be easy to cause the waste of network bandwidth.
Summary of the invention
The embodiment of the invention provides the method for congestion control and devices, help to improve the utilization rate of network bandwidth.
In a first aspect, providing a kind of jamming control method, comprising:
Sender sets the first value for the value of congestion window according to Fast retransmission algorithm, and according to the congestion window to
Recipient sends first segment；
After described sender sends the first segment to the recipient, the confirmation from the recipient is received, it is described
It is carried in confirmation and repeats selective acknowledgement block；
Described sender sets second value for the value of the congestion window according to ratio, and the ratio is equal to be connect by described
The number of the byte of the received repeated segments of debit is divided by the number of the byte of the first segment, and the second value is greater than described first
Value, the number of the byte of the repeated segments are equal to the difference of the right margin repeated in selective acknowledgement block and left margin, institute
State the subset that repeated segments are the first segments.
With reference to first aspect, in the first possible implementation, the second value is equal to first value plus the
Three values, the third value are equal to the value of the congestion window before setting first value for the congestion window and described
The product of the difference and function f of first value, function f is the bounded increasing function using the ratio as variable, and the value of function f is less than
Equal to 1.
The possible implementation of with reference to first aspect the first, in the second possible implementation, according to following
Formula determines the second value:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value,
cwndold* β is first value, cwndnewFor the second value, ratio is the ratio, and function f (ratio) is ratio's
Nth power, N are natural number, and β is the rational greater than 0 and less than 1.
The possible implementation of second with reference to first aspect, it is in the third possible implementation, past at i-th
In returning, according to following formula determine described i-th it is round-trip in the second value:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value,
cwndold* β is first value, cwndnewFor described i-th it is round-trip in the second value, ratio is round-trip described i-th
In the ratio, ratio be equal to the 1st toward return to described i-th back and forth in by the word of the received repeated segments of the recipient
The number of section is divided by the number of the byte of the first segment, and f (ratio) is the Nth power of ratio, and N is natural number, and β is greater than 0
And the rational less than 1, the i are the integer greater than 1.
With reference to first aspect, in the fourth possible implementation, described sender is gathered around according to the ratio by described
The value of plug window is set as second value, comprising: is based on first value, obtains the second value via iterative process；
The iterative process includes: successively to execute iteration 1 to iteration m from the sequence after arriving first according to the time, wherein iteration
The value that the value of the congestion window in x is equal to the congestion window in iteration y adds the 4th value, and the 4th value is equal to will
The congestion window be set as first value before the congestion window value and the iteration y in the congestion window
Value difference and function f product, function f is the bounded increasing function using the ratio as variable, and the value of function f is less than etc.
In 1；
Wherein, the second value is equal to the value of the congestion window in iteration m, the congestion window in iteration 1
Value is equal to first value, and it is all positive integer that x, which is greater than y, x and y, and x is less than or equal to m, and m is greater than the positive integer equal to 2.
The 4th kind of possible implementation with reference to first aspect, in a fifth possible implementation, the transmission
Root sets second value for the value of the congestion window according to the ratio, comprising:
Pass through following iterative algorithms
Cwnd (n+1)=cwnd (n)+(cwndold-cwnd(n))*f(ratio)
Determine the second value, wherein cwndoldTo set before first value described for the value of the congestion window
The value of congestion window, cwnd (n) are the second value in iteration n, and cwnd (n+1) is the second value in iteration n+1,
Cwnd (1) is first value, and ratio is the ratio in iteration n+1, and function f (ratio) is the i power of ratio, n, i
For positive integer.
Second aspect provides a kind of congestion control device, comprising:
Transmission unit for setting the first value for the value of congestion window according to Fast retransmission algorithm, and is gathered around according to described
It fills in window and sends first segment to recipient；
Receiving unit receives the confirmation from the recipient, institute after sending the first segment to the recipient
It states to carry in confirmation and repeats selective acknowledgement block D-SACK block；
Setting unit, for setting second value for the value of the congestion window according to ratio, the ratio is equal to by institute
The number of the byte of the received repeated segments of recipient is stated divided by the number of the byte of the first segment, the second value is greater than described
First value, the number of the byte of the repeated segments are equal to the difference of right margin and left margin in the D-SACK block, institute
State the subset that repeated segments are the first segments.
In conjunction with second aspect, in the first possible implementation, the second value is equal to first value plus the
Three values, the third value are equal to the value of the congestion window before setting first value for the congestion window and described
The product of the difference and function f of first value, the function f are the bounded increasing functions using the ratio as variable, and the letter of function f
Numerical value is less than or equal to 1.
In conjunction with the first possible implementation of second aspect, in the second possible implementation, described second
Value is determined by following formula:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value,
cwndold* β is first value, cwndnewFor the second value, ratio is the ratio, and function f (ratio) is ratio's
Nth power, N are natural number, and β is the rational greater than 0 and less than 1.
It is in the third possible implementation, past at i-th in conjunction with second of possible implementation of second aspect
In returning, the second value is determined by following formula:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value,
cwndold* β is first value, cwndnewFor described i-th it is round-trip in the second value, ratio is round-trip described i-th
In the ratio, ratio be equal to the 1st toward return to described i-th back and forth in by the word of the received repeated segments of the recipient
The number of section is divided by the number of the byte of the first segment, and f (ratio) is the Nth power of ratio, and N is natural number, and β is greater than 0
And the rational less than 1, the i are the integer greater than 1.
In conjunction with second aspect, in the fourth possible implementation, the setting unit is specifically used for: based on described the
One value obtains the second value via iterative process；
The iterative process includes: successively to execute iteration 1 to iteration m from the sequence after arriving first according to the time, wherein iteration
The value that the value of the congestion window in x is equal to the congestion window in iteration y adds the 4th value, and the 4th value is equal to will
The congestion window be set as first value before the congestion window value and the iteration y in the congestion window
Value difference and function f product, function f is the bounded increasing function using the ratio as variable, and the value of function f is less than etc.
In 1；
Wherein, the second value is equal to the value of the congestion window in iteration m, the congestion window in iteration 1
Value is equal to first value, and it is all positive integer that x, which is greater than y, x and y, and x is less than or equal to m, and m is greater than the positive integer equal to 2.
In conjunction with the 4th kind of possible implementation of second aspect, in a fifth possible implementation, the setting
Unit also particularly useful for: pass through following iterative algorithms
Cwnd (n+1)=cwnd (n)+(cwndold-cwnd(n))*f(ratio)
Determine the second value, wherein cwndoldTo set before first value described for the value of the congestion window
The value of congestion window, cwnd (n) are the second value in iteration n, and cwnd (n+1) is the second value in iteration n+1,
Cwnd (1) is first value, and ratio is the ratio in iteration n+1, and function f (ratio) is the i power of ratio, n, i
For positive integer.
It, can be by repeating selective acknowledgement after retransmitting first segment according to Fast retransmission algorithm in the embodiment of the present invention
The difference of right margin and left margin in block obtains the number of the byte of the received repeated segments in the side of being received, and is connect according to described
The ratio of the number of the byte of the number and first segment of the byte of the received repeated segments of debit increases congestion window, facilitates
Improve the utilization rate of network bandwidth.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is the flow chart of the first embodiment of jamming control method provided in an embodiment of the present invention；
Fig. 2 is the schematic diagram provided in an embodiment of the present invention for sending buffer area；
Fig. 3 is the flow chart of the second embodiment of jamming control method provided in an embodiment of the present invention；
Fig. 4 A is the schematic diagram of congestion window linear restoring provided in an embodiment of the present invention；
Fig. 4 B is the schematic diagram of the non-linear recovery of congestion window provided in an embodiment of the present invention；
Fig. 5 is the flow chart of the 3rd embodiment of jamming control method provided in an embodiment of the present invention；
Fig. 6 is the schematic diagram of the iterative recovery of congestion window provided in an embodiment of the present invention；
Fig. 7 is the structural schematic diagram of the first embodiment of congestion control device provided in an embodiment of the present invention；
Fig. 8 is the structural schematic diagram of the second embodiment of congestion control device provided in an embodiment of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention is clearly retouched
It states.Obviously, the described embodiment is only a part of the embodiment of the present invention, instead of all the embodiments.Based in the present invention
Embodiment, every other embodiment obtained by those of ordinary skill in the art without making creative efforts,
It shall fall within the protection scope of the present invention.It is related to multiple terms in embodiment.About the meaning for the term that embodiment is related to, please join
Examine request comment (request for comments, RFC) 2581, RFC2018 and RFC2883.
According to RFC2581, after sender receives three duplicate acknowledgments, it is believed that section is lost.In turn, sender thinks network
Congestion occurs, congestion window is reduced, and sends the section for being considered losing to recipient according to the congestion window after reduction.Invention
People's discovery, when sender receives three duplicate acknowledgments, section may not lose.Sender receives three duplicate acknowledgments may
Caused by being the multiple sections of out-of-order arrival recipients sent as sender.That is, to receive three repetitions true by sender
When recognizing, there is no congestions for network.It will lead to the waste of network bandwidth to recipient's delivery section according to the congestion window after reduction.
Congestion window in the technical solution that embodiment provides, after being reduced according to ratio increase.The ratio and the recipient receive
The number of the byte of the repeated segments arrived is directly proportional.Due to the number of the byte of repeated segments can be relatively good reflect sender send out
Out-of-order degree occurs during transmission for multiple sections sent.Sender receive identical quantity duplicate acknowledgment (such as
Three duplicate acknowledgments) in the case where, the multiple sections of degree that random ordering occurs are higher, then the degree of network generation congestion is smaller.Also
It is to say, the true value of the bandwidth of the channel of what the ratio can be relatively good reflect sender to recipient.According to the ratio
Value increases the congestion window after reducing, and is communicated according to the congestion window after increase with recipient, can make full use of Netowrk tape
It is wide.
The embodiment of the invention discloses a kind of jamming control method and device, can under the scene of network data random ordering,
Fast quick-recovery congestion window, promotes network rate.It is described in detail separately below.
Fig. 1 is the flow chart of the first embodiment of jamming control method provided in an embodiment of the present invention.Referring to Fig. 1, the party
Method includes:
S101, sender set the first value for the value of congestion window according to Fast retransmission algorithm, and according to the congestion
Window sends first segment to recipient.
Described sender is specially transmission control protocol sender (TCP sender).The recipient is specially to transmit control
Tocol receiver (TCP receiver) processed.The executing subject of method shown in FIG. 1 can be the TCP sender.It is described
TCP sender can be realized by network equipment.The network equipment can be router, the network switch, firewall or
Load balancer.
For example, the first segment is the loss section (lost that described sender is determined according to Fast retransmission algorithm
segment).Specifically, the first segment is that described sender does not obtain the recipient to what the recipient sent
The section of confirmation.The first segment can be a section or multiple sections.It will be understood to those skilled in the art that section can be with
Including a byte or multiple bytes.If a section includes multiple bytes, the corresponding multiple sequences of the multiple byte
Row number is continuous.First value can be equal to set first value for the value of the congestion window before described in gather around
Fill in the half of the value of window.
In embodiment, the receiving direction described sender sends confirmation, to confirm to the section received.It is described
The confirmation that recipient sends can be ACK, carries the ACK of SACK option or carry the ACK of D-SACK block.
Specifically, described sender can set the value of congestion window to described after receiving 3 duplicate acknowledgments
One value.Described sender sends the first segment to the recipient.Described sender sends described first to the recipient
Section specifically can be, and described sender sends whole bytes of the first segment to the recipient.Described sender is to described
Recipient sends the first segment and is specifically also possible to the partial words that described sender sends the first segment to the recipient
Section.In practical application, whole bytes in the first segment both can be sent to recipient back and forth by one by sender.Hair
Whole bytes in the first segment can also be sequentially sent to recipient back and forth by multiple by the side of sending.For example, described first
Section is the section being made of the byte of sequence number 3000 to 3999.Described sender can first pass through a message and send out to the recipient
Send the byte of sequence number 3000 to 3499.Then the transmission hair can send sequence to the recipient by another message
Numbers 3500 to 3999 byte.It should be noted that section involved in embodiment is that described sender is sent to the recipient
Message load (payload) in include a byte or successive byte.Multiple bytes point in the successive byte
Not corresponding multiple sequence numbers are continuous.For example, byte A, byte B and the corresponding sequence number of byte C are 3,4 and 5.
It is successive byte by multiple bytes that byte A, byte B and byte C are formed.For another example, byte D and byte E are corresponding
Sequence number is 6 and 8.It is discontinuous byte by multiple bytes that byte D and byte E are formed.In addition, it is necessary to explanation, such as
The not opposite explanation of fruit, the quantity being related in embodiment is metric.
It will be understood to those skilled in the art that described sender receives 3 duplicate acknowledgments from the recipient
It is arrived it is meant that described sender receives 4 from the recipient identical confirmations without any other interference message
Come (4identical ACKs without the arrival of any other intervening packets).About
3 duplicate acknowledgments and loss section please refer to Section of 3.2 Fast retransmission/fast quick-recovery (Fast in RFC2581
Retransmi t/Fast Recovery)。
S103 after described sender sends the first segment to the recipient, receives the confirmation from the recipient,
It is carried in the confirmation and repeats selective acknowledgement block.
Specifically, described repeat selective acknowledgement block (Dupl icate Selective Acknowledgment
Block, D-SACK Block) in the corresponding sequence number (Sequence Number) of right margin (Right Edge) and the left side
The difference of the corresponding sequence number in boundary (Left Edge) is equal to by the received repeated segments of the recipient (dupl icate
Segment the number for the byte for) including.For example, the left margin for repeating selective acknowledgement block and right margin are corresponding
Serial No. 3000 and 3500 is then to be made of the byte of sequence number 3000 to 3499 by the received repeated segments of the recipient
Section, the number of byte are 500 (3499-3000+1).
About the definition of repeated segments and repetition selective acknowledgement block, RFC2883 is please referred to, details are not described herein again.
S105, described sender set second value, the ratio for the value of the congestion window according to ratio (ratio)
Equal to the number by the number of the byte of the received repeated segments of the recipient divided by the byte of the first segment, the second value
Greater than first value, the number of the byte of the repeated segments is equal to the right margin and the left side repeated in selective acknowledgement block
The difference on boundary, the repeated segments are the subsets of the first segment.
For example, after setting second value for the value of the congestion window, if there are also surplus in the first segment
Remaining byte is not retransmitted, sender can it is next it is round-trip in the remainder bytes are sent to receiving according to the second value
Side, can repeat above-mentioned S101 to S105 to restore congestion window.Optionally, when the ratio is close or equal to 1, institute
It states second value and is close or equal to the value that the congestion window is arranged to the congestion window before first value.Namely
It says, the value that congestion window is approached or is restored to before Fast retransmission.For example, the repeated segments can be equal to described first
Section.The repeated segments are also possible to a part of the first segment.
In the embodiment of the present invention, before sending first segment to recipient according to the congestion window, sender can be tieed up
Protect a transmission buffer area shown in Fig. 2.It is stored in transmission buffer area shown in Fig. 2 and has sent data segment 201, sent number
According to section 202 and data segment 203 is sent.Wherein, having sent data segment 201 is the data segment that the side of being received confirms, has sent number
It is the data segment that the side of not being received does not confirm according to section 202, having sent data segment 203 is the out-of-order data segment that the side of being received confirms.It needs
It is noted that data segment involved in embodiment is section.
In the specific implementation, sender can be according to connecing before sending first segment to recipient according to the congestion window
The confirmation that debit returns updates above-mentioned transmission buffer area.Specifically, sender can will send the side of being received in data segment 202
The data segment of confirmation, which is added to, has sent data segment 201, the out-of-order number that can will have been sent the side of being received in data segment 202 and confirm
It is added to according to section and has sent data segment 203.
In the embodiment of the present invention, after sending first segment to recipient according to the congestion window, sender, which receives, to come
From the confirmation of recipient, and the word that can determine the received repeated segments in the side of being received according to D-SACK block is carried in the confirmation
The number of section.The number of the byte of the received repeated segments in the side of being received is equal to right margin and the left side in the D-SACK block
The difference on boundary.
In the embodiment of the present invention, sender can obtain the second value by function method.
For example, sender passes through function: cwnd=a0+ f (ratio) obtains the second value, wherein cwnd is described
Second value, a0For first value, ratio is the ratio, and f (ratio) is using the ratio as the increasing function of variable.Example
It is only a kind of implementation, other implementations can be used in actual use.
It should be noted that sender can be with each back and forth during by function method to restore congestion window
A S105 is executed, a S105 can also be executed back and forth with every two, S105 can also be executed according to dynamic step length.For example,
Execute a S105 during sender is round-trip at first, execute a S105 in third is round-trip, it is round-trip at the 6th in hold
S105 of row, i.e., the step-length that sender executes S105 every time all become larger.Recovery congestion window involved in embodiment, refers to increasing
The value of the big congestion window.
In the embodiment of the present invention, sender can also obtain the second value by iterative method.
For example, sender can pass through iterative algorithm: cwnd (n)=cwnd (n-1)+g (ratio) obtains described second
Value.Wherein, n is natural number, and cwnd (n) is the value of the congestion window in iteration n, and it is gathering around in iteration n-1 that cwnd (n-1), which is,
The value of window is filled in, cwnd (1) is first value, and g (ratio) > 0, ratio is the ratio, at the end of the iterative algorithm
The value of congestion window is the second value.
It should be noted that it is round-trip that iteration step length can be integer during restoring congestion window by iterative method.
Iteration step length is also possible to dynamically.For example, carry out first time iteration in round-trip at first, the is carried out in third is round-trip
Second iteration, in the 6th round-trip middle progress third time iteration.
In addition to above-mentioned function method and iterative method, in practical application, sender can also restore congestion using other modes
Window, so that the value of congestion window increases the recovery, it can be achieved that connection speed with the increase of the ratio.
By implementing the embodiment of the present invention, sender can retransmit the side's of not being received confirmation according to Fast retransmission algorithm
Data segment to recipient, and the D-SACK block carried in the confirmation returned according to recipient determines the received repetition in the side of being received
The number of the byte of section, to obtain the ratio.The congestion window can be arranged according to the ratio in described sender
Value (i.e. recovery congestion window) is, it can be achieved that under the scene of data random ordering, fast quick-recovery congestion window promotes network rate.
Fig. 3 is the flow chart of the second embodiment of jamming control method provided in an embodiment of the present invention.It is corresponding according to Fig. 3
Embodiment, under the scene of transport layer data random ordering, sender immediately arrives at described by functional relation and the ratio
Two-value is connected to the network rate, it can be achieved that quickly improving, and alleviates network congestion.The transport layer is located at open system interconnection (open
Systems interconnection) the 4th layer of reference model.Method shown in Fig. 3 is the improvement to method shown in FIG. 1.
The corresponding embodiment of Fig. 3 does not refer to content, can refer to the description of the corresponding embodiment of Fig. 1.Referring to Fig. 3, this method comprises:
S301, sender set the first value for the value of congestion window according to Fast retransmission algorithm, and according to the congestion
Window sends first segment to recipient.
Described sender is specially transmission control protocol sender.The recipient is specially that transmission control protocol receives
Side.The executing subject of method shown in Fig. 3 can be the TCP sender.The TCP sender can pass through network equipment
It realizes.The network equipment can be router, the network switch, firewall or load balancer.
For example, the first segment is the loss section that described sender is determined according to Fast retransmission algorithm.Specifically,
The first segment is the section for not obtaining the recipient and confirming that described sender has been sent to the recipient.The first segment
It can be a section or multiple sections.It will be understood to those skilled in the art that a section may include a byte or more
A byte.If a section includes multiple bytes, the multiple
The corresponding multiple sequence numbers of byte are continuous.First value can be equal to, and the value of congestion window is arranged
For the half of the value of the congestion window before first value.
For example, the recipient confirm specifically and can be to section, and the receiving direction described sender is sent
ACK, SACK or DSACK.After described sender receives above-mentioned ACK, SACK or DSACK, determine that the recipient receives institute
State section.
Specifically, described sender can set the value of congestion window to described after receiving 3 duplicate acknowledgments
One value.Described sender sends the first segment to the recipient.Described sender sends described first to the recipient
Section specifically can be, and described sender sends whole bytes of the first segment to the recipient.Described sender is to described
Recipient sends the first segment and is specifically also possible to the partial words that described sender sends the first segment to the recipient
Section.For example, the first segment is the section being made of the byte of sequence number 3000 to 3999.Described sender can first pass through a report
Text to the recipient transmit Sequence Number 3000 to 3499 byte.Then described sender can be by another message to institute
State recipient transmit Sequence Number 3500 to 3999 byte.
It will be understood to those skilled in the art that described sender receives 3 duplicate acknowledgments from the recipient
It is arrived it is meant that described sender receives 4 from the recipient identical confirmations without any other interference message
Come.About 3 duplicate acknowledgments and section is lost, please refers to Section of 3.2 Fast retransmission/fast quick-recovery in RFC2581.
S303 after described sender sends the first segment to the recipient, receives the confirmation from the recipient,
It is carried in the confirmation and repeats selective acknowledgement block.
Specifically, the corresponding sequence number of right margin and the corresponding sequence number of left margin repeated in selective acknowledgement block
Difference be equal to include by the received repeated segments of the recipient byte number.For example, described repeat selective acknowledgement block
Left margin and the corresponding Serial No. 3000 and 3500 of right margin, then by the received repeated segments of the recipient be by sequence
The section that the byte of row number 3000 to 3499 is constituted, the number of byte are 500.
S305, described sender set second value for the value of the congestion window according to ratio, and the second value is equal to
First value add third value, the third value be equal to set first value for the congestion window before described in gather around
The product of the value of window and the difference and function f of first value is filled in, function f is to increase letter by the bounded of variable of the ratio
Number, and the value of function f is less than or equal to 1.
In the embodiment of the present invention, the function f either the ratio linear function, be also possible to the ratio
Nonlinear function.Preferably, it is assumed that it is identical by the number of the byte of the received repeated segments of the recipient during each is round-trip, that
, when the function f is the linear function of the ratio, the value of the congestion window and round-trip relationship can be as in Fig. 4 A
Straight line 401 shown in.In addition, when the function f is the nonlinear function of the ratio, the value of the congestion window and round-trip
Relationship can be as shown in the curve 403 in Fig. 4 B.
Preferably, when stating the S305 in Fig. 3 embodiment on the implementation, described sender can pass through following formula
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
To obtain the second value, wherein cwndoldTo set institute before first value for the value of the congestion window
State the value of congestion window, cwndold* β is first value, cwndnewFor the second value, ratio is the ratio, function f
(ratio) Nth power for being ratio, N are natural number, and β is the rational greater than 0 and less than 1.
Using above-mentioned formula, described sender can quickly restore congestion window, also, when the value of ratio is close or
When equal to 1, cwndnewClose or equal to cwndold).That is, before congestion window approaches or is restored to Fast retransmission
Value.
In the specific implementation, in round-trip at i-th, described sender can be determined according to following formula described i-th it is round-trip
In the second value:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value,
cwndold* β is first value, cwndnewFor described i-th it is round-trip in the second value, ratio is round-trip described i-th
In the ratio, ratio be equal to the 1st toward return to described i-th back and forth in by the word of the received repeated segments of the recipient
The number of section is divided by the number of the byte of the first segment, and f (ratio) is the Nth power of ratio, and N is natural number, and β is greater than 0
And the rational less than 1, the i are the positive integer greater than 1.
It should be noted that f (ratio) (N is natural number) other than the Nth power that can be ratio, can also be with
Ratio is the function expression of the other forms of variable, and function f (ratio) can be bounded of the ratio on section [0,1]
Increasing function, when ratio is equal to 1, the functional value of function f (ratio) is 1.
By implementing the embodiment of the present invention, sender can retransmit the side's of not being received confirmation according to Fast retransmission algorithm
Data segment to recipient, and the D-SACK block carried in the confirmation returned according to recipient determines the received repetition in the side of being received
The number of the byte of section to obtain the ratio, and establishes the functional relation of congestion window and the ratio.Described sender
The second value can be immediately arrived at by functional relation and the ratio, it can be achieved that leading in count off according under out-of-order scene
It crosses function method and restores congestion window, promote network rate.
Fig. 5 is the flow chart of the 3rd embodiment of jamming control method provided in an embodiment of the present invention.It is corresponding according to Fig. 5
Embodiment, under the scene of transport layer data random ordering, sender restores congestion window by iterative method, i.e., constantly with old
The value iteration of congestion window goes out the value of new congestion window, improves network connection rate, alleviates network congestion.The transport layer position
In the 4th layer of open system interconnection reference model.Method shown in fig. 5 is the improvement to method shown in FIG. 1.Fig. 5 is corresponding
Embodiment does not refer to content, can refer to the description of the corresponding embodiment of Fig. 1.Referring to Fig. 5, this method comprises:
S501, sender set the first value for the value of congestion window according to Fast retransmission algorithm, and according to the congestion
Window sends first segment to recipient.
Described sender is specially transmission control protocol sender.The recipient is specially that transmission control protocol receives
Side.The executing subject of method shown in fig. 5 can be the TCP sender.The TCP sender can pass through network equipment
It realizes.The network equipment can be router, the network switch, firewall or load balancer.
For example, the first segment is the loss section that described sender is determined according to Fast retransmission algorithm.Specifically,
The first segment is the section for not obtaining the recipient and confirming that described sender has been sent to the recipient.The first segment
It can be a section or multiple sections.It will be understood to those skilled in the art that a section may include a byte or more
A byte.If a section includes multiple bytes, the corresponding multiple sequence numbers of the multiple byte are continuous.Described
One value can be equal to the half of the value of the congestion window set the value of the congestion window to before first value.
For example, the recipient confirm specifically and can be to section, and the receiving direction described sender is sent
ACK, SACK or DSACK.After described sender receives above-mentioned ACK, SACK or DSACK, determine that the recipient receives institute
State section.
Specifically, described sender can set the value of congestion window to described after receiving 3 duplicate acknowledgments
One value.Described sender sends the first segment to the recipient.Described sender sends described first to the recipient
Section specifically can be, and described sender sends whole bytes of the first segment to the recipient.Described sender is to described
Recipient sends the first segment and is specifically also possible to the partial words that described sender sends the first segment to the recipient
Section.For example, the first segment is the data segment being made of the byte of sequence number 3000 to 3999.Described sender can first pass through one
A message to the recipient transmit Sequence Number 3000 to 3499 byte.Then the transmission hair can pass through another message
It transmits Sequence Number 3500 to 3999 byte to the recipient.
It will be understood to those skilled in the art that described sender receives 3 duplicate acknowledgments from the recipient
It is arrived it is meant that described sender receives 4 from the recipient identical confirmations without any other interference message
Come.About 3 duplicate acknowledgments and section is lost, please refers to Section of 3.2 Fast retransmission/fast quick-recovery in RFC2581.
S503 after described sender sends the first segment to the recipient, receives the confirmation from the recipient,
It is carried in the confirmation and repeats selective acknowledgement block.
Specifically, the corresponding sequence number of right margin and the corresponding sequence number of left margin repeated in selective acknowledgement block
Difference be equal to include by the received repeated segments of the recipient byte number.For example, described repeat selective acknowledgement block
Left margin and the corresponding Serial No. 3000 and 3500 of right margin, then by the received repeated segments of the recipient be by sequence
The section that the byte of row number 3000 to 3499 is constituted, the number of byte are 500.
About the definition of repeated segments and repetition selective acknowledgement block, RFC2883 is please referred to, details are not described herein again.
S505, described sender are based on first value, obtain the second value via iterative process.Here, the hair
The side of sending can constantly be gone out the value of the new congestion window according to the ratio by the value iteration of the old congestion window, be used
To restore the congestion window.
Specifically, the iterative process can include: described sender is successively executed according to sequence of the time after arriving first and changed
Generation 1 to iteration m, wherein the value of the congestion window in iteration x is equal to the value of the congestion window in iteration y plus the
Four values, the 4th value are equal to the value of the congestion window before setting first value for the congestion window and described
The product of the difference and function f of the value of the congestion window in iteration y, function f are increased by the bounded of variable of the ratio
Function, and the value of function f is less than or equal to 1.Wherein, the second value is equal to the value of the congestion window in iteration m, iteration 1
In the value of the congestion window be equal to first value, it is all positive integer that x, which is greater than y, x and y, and x is less than or equal to m, and m is greater than
In 2 positive integer.It is intelligible, since x is greater than y, so iteration y occurs before iteration x in the iterative process.
Optionally, when the ratio is equal to 1, the value of above-mentioned function f is equal to 1, and the second value is equal to the congestion
Window is set as the value of the congestion window before first value.That is, congestion window is close or is restored to
Value before Fast retransmission.
In the embodiment of the present invention, the initial value of the congestion window in the iterative process can be first value.Institute
The iteration step length for stating iterative process can be round-trip for integer, for example, the iteration step length is one round-trip, i.e., described sender can
Increase the primary congestion window in each is round-trip, in another example, the iteration step length is two round-trip, i.e. described sender
The primary congestion window can be increased in every two is round-trip.
Preferably, when stating the S505 in Fig. 5 embodiment on the implementation, sender can pass through following iterative algorithms
Cwnd (n+1)=cwnd (n)+(cwndold-cwnd(n))*f(ratio)
To determine the second value, wherein cwndoldTo set institute before first value for the value of the congestion window
The value of congestion window is stated, cwnd (n) is the second value in iteration n, and cwnd (n+1) is the second value in iteration n+1,
Cwnd (1) is first value, and ratio is the ratio in iteration n+1, and function f (ratio) is the i power of ratio, n, i
For positive integer.
Intelligible, ratio is the ratio in iteration n+1, and value is equal to described into iteration n+1 from iteration 1
The number of the byte of the received whole repeated segments of recipient divided by the byte of the first segment number.If the iterative process
In iteration step length be two round-trip, then ratio be 2* (n+1) it is a it is round-trip in the ratio, value be equal to the 1st it is round-trip
To the 2* (n+1) it is a it is round-trip in by the number of the byte of the received repeated segments of the recipient divided by the word of the first segment
The number of section.
Optionally, when stating the S505 in Fig. 5 embodiment on the implementation, described sender can also pass through following iterative algorithms
Cwnd (n+1)=(cwnd (n)+cwnd (n-1))/2+
[cwndold-(cwnd(n)+cwnd(n-1))/2]*f(ratio)
To determine the second value.
It can be seen that in the iterative process from above-mentioned two iterative algorithm, for the congestion window in iteration n+1
For cwnd (n+1), the congestion window occurred in the iteration before iteration n+1 can be cwnd (n), be also possible to (cwnd
(n)+cwnd(n-1))/2。
Optionally, for the congestion window cwnd (n+1) in iteration n+1, occur in the iteration before iteration n+1
Congestion window can also be (cwnd (n)+cwnd (n-1)+cwnd (n-2))/3.It can also be other forms in practical application,
Here with no restriction.
It should be noted that function f (ratio) (N is natural number) other than the Nth power that can be ratio, can also be with
Ratio is the function expression of the other forms of variable.Function f (ratio) can be bounded of the ratio on section [0,1]
Increasing function.When ratio is equal to 1, the functional value of function f (ratio) is 1.
In the embodiment of the present invention, the congestion window, the recovery process of the congestion window are restored by above-mentioned iterative method
It can be as shown in the curve 601 in Fig. 6.When the ratio is smaller, the regeneration rate of the congestion window is larger, when the ratio
When larger, the regeneration rate of the congestion window slows down, it can be achieved that the gentle recovery congestion window.Involved in embodiment
Restore congestion window, refers to the value for increasing the congestion window.
It is intelligible, in above-mentioned preferred iterative algorithm, due to factor (cwndold- cwnd (n)) in * f (ratio)
(cwndold- cwnd (n)) with the increasing trend of f (ratio) on the contrary, thus, in the iterative process, be able to achieve the congestion
The gentle increase of window can avoid increasing sharply due to the ratio, and the congestion window is caused to increase suddenly.
By implementing the embodiment of the present invention, described sender can retransmit the side of not being received according to Fast retransmission algorithm
The data segment of confirmation is to recipient, and the D-SACK block carried in the confirmation returned according to recipient determines that the side of being received is received
The number of the byte of repeated segments, to obtain the ratio.Described sender can be according to the ratio constantly by old institute
The value iteration for stating congestion window goes out the value of the new congestion window, improves network connection rate, alleviates network congestion.
Fig. 7 is the structural schematic diagram of the first embodiment of congestion control device provided in an embodiment of the present invention.As shown in Figure 7
Congestion control device 70 can include: transmission unit 701, receiving unit 703, setting unit 705.Congestion control device 70 can be with
For executing Fig. 1, Fig. 3 or method shown in fig. 5.The content not referred in embodiment shown in Fig. 7, can with reference to Fig. 1,
Description in the corresponding embodiment of Fig. 3 or Fig. 5.
Transmission unit 701, for setting the first value for the value of congestion window according to Fast retransmission algorithm, and according to described
Congestion window sends first segment to recipient.
Receiving unit 703, for receiving and coming from institute after transmission unit 701 sends the first segment to the recipient
The confirmation of recipient is stated, carries D-SACK block in the confirmation.
Setting unit 705, for setting second value for the value of the congestion window according to ratio, the ratio is equal to quilt
The number of the byte of the received repeated segments of recipient is divided by the number of the byte of the first segment, and the second value is greater than institute
The first value is stated, the number of the byte of the repeated segments is equal to the difference of right margin and left margin in the D-SACK block,
The repeated segments are the subsets of the first segment.
In the embodiment of the present invention, the first segment is that described sender does not obtain described connect to recipient transmission
The section of debit's confirmation.First value can be equal to set first value for the value of the congestion window before described in gather around
Fill in the half of the value of window.In practical application, transmission unit 701 can both send the whole of the first segment to the recipient
Byte.Transmission unit 701 can also send the partial bytes of the first segment to the recipient.For example, the first segment is
The section being made of the byte of sequence number 3000 to 3999.Transmission unit 701 can first pass through a message and send to the recipient
The byte of sequence number 3000 to 3499.Then transmission unit 701 can send sequence to the recipient by another message
Numbers 3500 to 3999 byte.
In the embodiment of the present invention, the received right margin repeated in selective acknowledgement block of receiving unit 703 is corresponding
The difference of sequence number and the corresponding sequence number of left margin is equal to the number for the byte for including by the received repeated segments of the recipient.
For example, the left margin and the corresponding Serial No. 3000 and 3500 of right margin for repeating selective acknowledgement block, then by institute
Stating the received repeated segments of recipient is the section being made of the byte of sequence number 3000 to 3499, and the number of byte is 500.
Further, setting unit 705 can be restored by the functional relation of the determination second value and the ratio
The congestion window.Wherein, the second value is equal to first value plus third value, and the third value is equal to the congestion
Window be set as first value before the congestion window value and first value difference and function f product, institute
Stating function f is the bounded increasing function using the ratio as variable, and the functional value of function f is less than or equal to 1.
In the specific implementation, preferred, the second value can be determined by following formula:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value,
cwndold* β is first value, cwndnewFor the second value, ratio is the ratio, and function f (ratio) is ratio's
Nth power, N are natural number, and β is the rational greater than 0 and less than 1.
Further, in round-trip at i-th, the second value can be determined by following formula:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value,
cwndold* β is first value, cwndnewFor described i-th it is round-trip in the second value, ratio is round-trip described i-th
In the ratio, ratio be equal to the 1st toward return to described i-th back and forth in by the word of the received repeated segments of the recipient
The number of section is divided by the number of the byte of the first segment, and f (ratio) is the Nth power of ratio, and N is natural number, and β is greater than 0
And the rational less than 1, the i are the positive integer greater than 1.
Further, setting unit 705 can be with: being based on first value, obtains described second via iterative process
Value.The iterative process includes: successively to execute iteration 1 to iteration m from the sequence after arriving first according to the time.Wherein, in iteration x
The value that the value of the congestion window is equal to the congestion window in iteration y adds the 4th value, and the 4th value is equal to will be described
Congestion window be set as first value before the congestion window value and the congestion window in the iteration y value
Difference and function f product, function f is the bounded increasing function using the ratio as variable, and the value of function f is less than or equal to 1.
Wherein, the second value is equal to the value of the congestion window in iteration m, the congestion window in iteration 1
Value is equal to first value, and it is all positive integer that x, which is greater than y, x and y, and x is less than or equal to m, and m is greater than the positive integer equal to 2.
In the specific implementation, preferred, setting unit 705 can pass through following iterative algorithms
Cwnd (n+1)=cwnd (n)+(cwndold-cwnd(n))*f(ratio)
To determine the second value, wherein cwndoldTo set institute before first value for the value of the congestion window
The value of congestion window is stated, cwnd (n) is the second value in iteration n, and cwnd (n+1) is the second value in iteration n+1,
Cwnd (1) is first value, and ratio is the ratio in iteration n+1, and function f (ratio) is the i power of ratio, n, i
For positive integer.
Fig. 8 is the structural schematic diagram of the second embodiment of congestion control device provided in an embodiment of the present invention.Such as Fig. 8 institute
Show, congestion control device 80 can include: transmitter 801, receiver 802, memory 803 and processor 804.Congestion control dress
Setting 80 can be used for executing Fig. 1, Fig. 3 or method shown in fig. 5.The content not referred in embodiment shown in Fig. 8, can be with
With reference to the description in the corresponding embodiment of Fig. 1, Fig. 3 or Fig. 5.Congestion control device 80 can be used to implement shown in Fig. 7
Congestion control device 70.
Transmitter 801, for sending data, the data to other equipment can include: request, confirmation response or packet count
According to.
For example, transmitter 801 can be used to implement transmission unit 701.
Receiver 802, for receiving the data of other equipment transmission, the data can include: request, confirmation response divide
Group data.
For example, receiver 802 can be used to implement receiving unit 703.
Memory 803, for storing the program data for having various functions.Memory 803 stores in the embodiment of the present invention
Data include congestion control program and other program datas that can be called and run.In the specific implementation, the embodiment of the present invention
Memory 803 can be system storage, for example, volatile (such as RAM), non-volatile (such as ROM, flash memory
Deng), or both combination.In the specific implementation, the memory 803 of the embodiment of the present invention can also be that the outside except system is deposited
Reservoir, for example, disk, CD, tape etc..
Processor 804 for calling the program data stored in memory 803, and performs the following operations: according to quick weight
The value of congestion window is set the first value by propagation algorithm, and according to the congestion window, is sent by transmitter 801 to recipient
First segment.After sending the first segment to the recipient by transmitter 801, received by receiver 802 from described
The confirmation of recipient.It is carried in the confirmation and repeats selective acknowledgement block.The value of the congestion window is set to according to ratio
Second value.The ratio is equal to the byte by the number of the byte of the received repeated segments of the recipient divided by the first segment
Number.The second value is greater than first value, and the number of the byte of the repeated segments is equal to the repetition selective acknowledgement block
In right margin and left margin difference, the repeated segments are the subsets of the first segment.
For example, processor 804 can be used to implement setting unit 705.
In the embodiment of the present invention, processor 804 can execute function method to obtain the second value, and the second value is equal to
First value add third value, the third value be equal to set first value for the congestion window before described in gather around
The product of the value of window and the difference and function f of first value is filled in, function f is to increase letter by the bounded of variable of the ratio
Number, and the value of function f is less than or equal to 1.
In the specific implementation, processor 804 can determine the second value according to following formula:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value,
cwndold* β is first value, cwndnewFor the second value, ratio is the ratio, and function f (ratio) is ratio's
Nth power, N are natural number, and β is the rational greater than 0 and less than 1.
In the specific implementation, in round-trip at i-th, processor 804 can be determined according to following formula described i-th it is round-trip in
The second value:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value,
cwndold* β is first value, cwndnewFor described i-th it is round-trip in the second value, ratio is round-trip described i-th
In the ratio, ratio be equal to the 1st toward return to described i-th back and forth in by the word of the received repeated segments of the recipient
The number of section is divided by the number of the byte of the first segment, and f (ratio) is the Nth power of ratio, and N is natural number, and β is greater than 0
And the rational less than 1, the i are the positive integer greater than 1.
In the embodiment of the present invention, processor 804 can execute iterative method to obtain the second value: be based on described first
Value, obtains the second value via iterative process.The iterative process includes: that the sequence according to the time after arriving first successively executes
Iteration 1 is to iteration m, wherein the value that the value of the congestion window in iteration x is equal to the congestion window in iteration y adds
4th value, the 4th value are equal to value and the institute of the congestion window set the congestion window to before first value
The product of the difference and function f of the value of the congestion window in iteration y is stated, function f is using the ratio as the bounded of variable
Increasing function, and the value of function f is less than or equal to 1.
Wherein, the second value is equal to the value of the congestion window in iteration m, the congestion window in iteration 1
Value is equal to first value, and it is all positive integer that x, which is greater than y, x and y, and x is less than or equal to m, and m is greater than the positive integer equal to 2.
In the specific implementation, processor 804 can pass through following iterative algorithms
Cwnd (n+1)=cwnd (n)+(cwndold-cwnd(n))*f(ratio)
To determine the second value, wherein cwndoldTo set institute before first value for the value of the congestion window
The value of congestion window is stated, cwnd (n) is the second value in iteration n, and cwnd (n+1) is the second value in iteration n+1,
Cwnd (1) is first value, and ratio is the ratio in iteration n+1, and function f (ratio) is the i power of ratio, n, i
For positive integer.
In conclusion after retransmitting first segment according to Fast retransmission algorithm, can be passed through by implementing the embodiment of the present invention
The difference of right margin and left margin in repetition selective acknowledgement block obtains the number of the byte of the received repeated segments in the side of being received,
And restored according to the ratio of the number of the byte of the number and first segment of the byte of the received repeated segments in the side of being received
Congestion window promotes the net under data random ordering scene, it can be achieved that congestion window to be quickly adjusted to the level before Fast retransmission
The performance of network rate.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the program can be stored in a computer-readable storage medium
In, the program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein, the storage medium can be magnetic
Dish, CD, read-only memory (Read-Only Memory, ROM) or random access memory (Random Access
Memory, RAM) etc..
Above disclosed is only section Example of the present invention, cannot limit the right model of the present invention with this certainly
It encloses, those skilled in the art can understand all or part of the processes for realizing the above embodiment, and wants according to right of the present invention
Made equivalent variations is sought, is still belonged to the scope covered by the invention.
Claims (6)
1. a kind of jamming control method characterized by comprising
Sender sets the first value for the value of congestion window according to Fast retransmission algorithm, and according to the congestion window to reception
Side sends first segment；
After described sender sends the first segment to the recipient, the confirmation from the recipient, the confirmation are received
Middle carrying repeats selective acknowledgement block；
Described sender sets second value for the value of the congestion window according to ratio, and the ratio is equal to by the recipient
The number of the byte of received repeated segments divided by the byte of the first segment number, the second value be greater than first value,
The number of the byte of the repeated segments is equal to the difference of the right margin repeated in selective acknowledgement block and left margin, described heavy
Multiple section is the subset of the first segment；
The second value is equal to first value and adds third value, and the third value, which is equal to, sets described for the congestion window
The product of the difference and function f of the value of the congestion window before first value and first value, function f are with the ratio
For the bounded increasing function of variable, and the value of function f is less than or equal to 1.
2. the method according to claim 1, wherein determining the second value according to following formula:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value, cwndold*
β is first value, cwndnewFor the second value, ratio is the ratio, and function f (ratio) is the Nth power of ratio, N
For natural number, β is the rational greater than 0 and less than 1.
3. according to the method described in claim 2, it is characterized in that, in round-trip at i-th, described the is determined according to following formula
The second value during i is round-trip:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value, cwndold*
β is first value, cwndnewFor described i-th it is round-trip in the second value, ratio be described i-th back and forth in institute
State ratio, ratio be equal to the 1st toward return to described i-th it is round-trip in by a of the byte of the received repeated segments of the recipient
Number is divided by the number of the byte of the first segment, and f (ratio) is the Nth power of ratio, and N is natural number, and β is greater than 0 and less than 1
Rational, the i is positive integer greater than 1.
4. a kind of congestion control device characterized by comprising
Transmission unit, for setting the first value for the value of congestion window according to Fast retransmission algorithm, and according to the congestion window
Mouth sends first segment to recipient；
Receiving unit receives the confirmation from the recipient after sending the first segment to the recipient, described true
Recognize middle carrying and repeats selective acknowledgement block D-SACK block；
Setting unit, for setting second value for the value of the congestion window according to ratio, the ratio is equal to be connect by described
The number of the byte of the received repeated segments of debit is divided by the number of the byte of the first segment, and the second value is greater than described first
Value, the number of the byte of the repeated segments is equal to the difference of right margin and left margin in the D-SACK block, described heavy
Multiple section is the subset of the first segment；
The second value is equal to first value and adds third value, and the third value, which is equal to, sets described for the congestion window
The product of the difference and function f of the value of the congestion window before first value and first value, the function f is with described
Ratio is the bounded increasing function of variable, and the functional value of function f is less than or equal to 1.
5. device as claimed in claim 4, which is characterized in that the second value is determined by following formula:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value, cwndold*
β is first value, cwndnewFor the second value, ratio is the ratio, and function f (ratio) is the Nth power of ratio, N
For natural number, β is the rational greater than 0 and less than 1.
6. device as claimed in claim 5, which is characterized in that in round-trip at i-th, the second value is true by following formula
It is fixed:
cwndnew=cwndold*β+cwndold*(1-β)*f(ratio)
Wherein, cwndoldFor the value for setting the value of the congestion window to the congestion window before first value, cwndold*
β is first value, cwndnewFor described i-th it is round-trip in the second value, ratio be described i-th back and forth in institute
State ratio, ratio be equal to the 1st toward return to described i-th it is round-trip in by a of the byte of the received repeated segments of the recipient
Number is divided by the number of the byte of the first segment, and f (ratio) is the Nth power of ratio, and N is natural number, and β is greater than 0 and less than 1
Rational, the i is positive integer greater than 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510047095.7A CN105991461B (en) | 2015-01-30 | 2015-01-30 | Jamming control method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510047095.7A CN105991461B (en) | 2015-01-30 | 2015-01-30 | Jamming control method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105991461A CN105991461A (en) | 2016-10-05 |
| CN105991461B true CN105991461B (en) | 2019-07-12 |
Family
ID=57036640
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510047095.7A Active CN105991461B (en) | 2015-01-30 | 2015-01-30 | Jamming control method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105991461B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109905209B (en) * | 2017-12-07 | 2020-12-29 | 网宿科技股份有限公司 | Method and device for setting network disorder value |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8514715B2 (en) * | 2010-04-22 | 2013-08-20 | Akamai Technologies, Inc. | Congestion window control based on queuing delay and packet loss |
| CN101964755B (en) * | 2010-11-03 | 2012-03-07 | 中南大学 | Explicit congestion control method based on bandwidth estimation in high-bandwidth delay network |
| WO2012149762A1 (en) * | 2011-09-22 | 2012-11-08 | 华为技术有限公司 | Congestion control method and equipment |
| CN103051555A (en) * | 2013-01-05 | 2013-04-17 | 北京航空航天大学 | TCP (transmission control protocol) congestion control method based on network effective bandwidth and ECN (Explicit Congestion Notification) mechanism |
-
2015
- 2015-01-30 CN CN201510047095.7A patent/CN105991461B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN105991461A (en) | 2016-10-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103986548B (en) | A kind of method and terminal for determining packet loss reason | |
| Lin et al. | TCP fast recovery strategies: Analysis and improvements | |
| JP5020076B2 (en) | High performance TCP suitable for low frequency ACK system | |
| CN108418767A (en) | Data transmission method, equipment and computer storage media | |
| JPWO2008023656A1 (en) | Communication device | |
| CN104683259B (en) | TCP jamming control methods and device | |
| CN102891883A (en) | Wireless transmission control protocol processing method and equipment | |
| CN106789702A (en) | Control the method and device of TCP transmission performance | |
| CN105227484B (en) | A kind of data transfer control method towards satellite network | |
| GB2592314A (en) | Modified methods and system of transmitting and receiving transmission control protocol segments over internet protocol packets | |
| JP5832335B2 (en) | Communication apparatus and communication system | |
| CN110048955A (en) | Jamming control method, device, computer equipment and storage medium | |
| CN101141393B (en) | Communication terminal and communication control method | |
| CN105991461B (en) | Jamming control method and device | |
| Velenis et al. | SaTPEP: A TCP performance enhancing proxy for satellite links | |
| CN104580171B (en) | The transmission method of Transmission Control Protocol, device and system | |
| CN108667563A (en) | A kind of forward error correction packet number acquisition methods and device | |
| Psaras et al. | The TCP minimum RTO revisited | |
| Kamboj et al. | Various TCP options for congestion evasion | |
| Subedi et al. | Performance Evaluation of TCP Tahoe, Reno, Reno with SACK, and NewReno Using OPNET Modeler | |
| KR20090003848A (en) | Method for congestion control in transport control protocol, and recorded medium for them | |
| JP7123194B2 (en) | Data transmission method, transmission device, data reception method, and reception device | |
| Rizzo | Issues in the implementation of selective acknowledgements for TCP | |
| Altahir et al. | Performance evaluation of TCP congestion control mechanisms using NS-2 | |
| Torkey et al. | Performance Evaluation of End-to-End Congestion Control Protocols |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |