2016
DOI: 10.1109/tmc.2015.2483494
|View full text |Cite
|
Sign up to set email alerts
|

Receiver-Side TCP Countermeasure to Bufferbloat in Wireless Access Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
19
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 19 publications
(19 citation statements)
references
References 41 publications
0
19
0
Order By: Relevance
“…Research papers [16] and [17] try to control the traffic sending rate by making modification on the congestion window of the receiver side (cwnd). Both of the works take advantage of Round Trip Time (RTT) and aim to solve Bufferbloat in cellular networks.…”
Section: B State-of-the-artmentioning
confidence: 99%
See 1 more Smart Citation
“…Research papers [16] and [17] try to control the traffic sending rate by making modification on the congestion window of the receiver side (cwnd). Both of the works take advantage of Round Trip Time (RTT) and aim to solve Bufferbloat in cellular networks.…”
Section: B State-of-the-artmentioning
confidence: 99%
“…The estimated RTT is the average of RTT value from all the samples of RTT and if the estimated RTT is larger than the minimum RTT, the Receiver Window (rwnd) will be reduced. Work [17] controls rwnd by monitoring queue states. The queue state is estimated using the difference between the minimum RTT value and the real RTT value.…”
Section: B State-of-the-artmentioning
confidence: 99%
“…us, there is overflow of RLC queues due to the large volume of traffic in a short period of time leading to high delay resulting in poor performance. To guarantee high throughput and low delay during congestion, the researchers have proposed various methods such as buffer-aware scheduling [5][6][7][8], active queue management (AQM) techniques [9][10][11][12], receiver window control [13][14][15], loss-based congestion control [16][17][18], delay-based congestion control [16,19,20], rate-based congestion control [4,20,21], admission and congestion control [22][23][24][25], and resource starvation [26][27][28].…”
Section: Introductionmentioning
confidence: 99%
“…During congestion in the network, the enormous amount of packets start accumulating in the large queue space at eNodeB and wait for the resources to be allotted [29,30]. 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.…”
Section: Introductionmentioning
confidence: 99%
“…It has been reported in [7]- [10] that TCP often suffers from large delays in wireless networks due to excessively large buffer installation at access points (APs) to compensate for capacity fluctuation of wireless channels. In MPTCP, longdelay paths can aggravate the delay performance since packets arriving at the receiver through short-delay paths may need to wait for out-of-order packets arriving through long-delay paths.…”
Section: Introductionmentioning
confidence: 99%