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

DRWA: A Receiver-Centric Solution to Bufferbloat in Cellular Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
30
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(30 citation statements)
references
References 24 publications
0
30
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%
“…Both of the works take advantage of Round Trip Time (RTT) and aim to solve Bufferbloat in cellular networks. [16] is primarily based on the estimated RTT and the minimum RTT value. 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.…”
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%
“…To avoid queue overflow problem, the service providers have installed large capacity buffers (queue) in the eNodeB owing to the reduction in memory price [14]. 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].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation