2016
DOI: 10.1016/j.jnca.2016.03.018
|View full text |Cite
|
Sign up to set email alerts
|

TCP congestion control algorithm for heterogeneous Internet

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 26 publications
(13 citation statements)
references
References 17 publications
0
13
0
Order By: Relevance
“…Then the performance of the algorithm becomes slow, and transmission flow also decreases. [ 15 , 27 , 28 ]. Since Slow Start, Congestion Avoidance, and Fast Retransmit techniques followed in Tahoe.…”
Section: Related Workmentioning
confidence: 99%
“…Then the performance of the algorithm becomes slow, and transmission flow also decreases. [ 15 , 27 , 28 ]. Since Slow Start, Congestion Avoidance, and Fast Retransmit techniques followed in Tahoe.…”
Section: Related Workmentioning
confidence: 99%
“…In order to boost the traffic level in the network, the receiver has to intimate the sender to immediately increase the data traffic generation rate in the network based on the rwnd value. e rwnd value is in the range of 101 to 120, and once the sender receives the rwnd value, it does further computation to increase (19) if ((current_time − last_time) > targetperiod) or (counter > targetcounter) then (20) datarate � totaldata/totaldelay (21) currentpercentage � (datarate/datarate max ) × 100% 22Diffpercentage � 100% − currentpercentage (23) if Diffpercentage ≥ limit high then (24) rwnd � (Diffpercentage − limit low ) (25) else if (Diffpercentage ≥ limit low ) then (26) rwnd � (Diffpercentage − limit low ) × (Diffpercentage − limit low /limit high − limit low ) (27) else if (Diffpercentage ≤ lowest) then (28) rwnd � (lowest − Diffpercentage) + 100 (29) end if (30) Avoiding aggressive reduction in congestion window size (31) if ((current_time − last_time) < targetperiod) and (rwnd < 100) then (32) if rwnd > oldrwnd then (33) rwnd � rwnd − oldrwnd (34) oldrwnd � rwnd (35) else (36) oldrwnd � rwnd (37) end if (38) else (39) oldrwnd � 0 (40) end if (41) last_time � current_time (42) totaldata � totaldelay � counter � 0 (43) end if (44) end procedure ALGORITHM 1: Network congestion estimation at the receiver side.…”
Section: Network Congestion Estimation At Receiver Sidementioning
confidence: 99%
“…is leads to increase in packet delivery time which adversely affects the delay sensitive applications known as bufferbloat problem [13]. Another problem in the loss-based TCP congestion control method is that it detects the network congestion only after the packet gets lost [17,31], that is, when congestion window (cwnd) size is large and user queue at eNodeB overflows. To overcome these problems, the delay-based congestion detection approach was introduced in TCP Vegas [20] and TCP Westwood [21].…”
Section: Introductionmentioning
confidence: 99%
“…The work on new TCP congestion control algorithms includes work on adapting to the changing characteristics of the internet such as the higher and more variable bandwidths offered by cellular accesses [1,11,34,50,52,80,84], possibly using cross layer approaches [6,10,59,61], but also simple tuning of existing TCP such as increasing the size of the initial window [13,16,66,82].…”
Section: Developments In Transport Control Protocolsmentioning
confidence: 99%