Enhanced Random Early Detection using Responsive Congestion Indicators

Abu-Shareha, Ahmad Adel

doi:10.14569/ijacsa.2019.0100347

Cited by 9 publications

(14 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although RED is proofed to provide sufficient throughput in different network status, some limitations have been found due to the busty nature of the real network traffic, which increased and decreased unsystematically and suddenly [8]. To enhance the performance of RED, variousAQM methods were proposed by modifying the utilized dropping technique and the congestion indicator.…”

Section: Figure 2 Weighted Random Early Detectionmentioning

confidence: 99%

“…The following AQM methods extend RED to achieve different objectives. Particularly, to reduce packet loss, Effective Random Early Detection (ERED) [6], Adaptive Queue Random Early Detection (AQMRD) [17], Research on Improving Random Early Detection (S-RED) [4], Enhanced RED (EnRED) and Time-window Augmented RED (Windowed-RED) [8]were proposed. Similarly, various methods were proposed to reduce packet droppings, such as Cloudbased Random Early Detection (CRED) [5], Adaptive Threshold RED [11], and Adaptive AQMRD [18].…”

Section: Related Workmentioning

confidence: 99%

“…Methods To reduce packet loss ERED [6], AQMRD [17], S-RED[4]EnRED) and Windowed-RED [8]. To reduce packet dropping CRED [5], Adaptive Threshold RED [11], and Adaptive AQMRD [18].…”

Section: Goalmentioning

confidence: 99%

“…The characteristics and advantages of the RED can be summarized in the following: 1) RED dropspackets early to avoid buffer overflowing and router congestion, by other means actively manages the buffer and avoid the congestion [8]. 2) RED drops packets randomly to avoid global synchronization.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Controlling Delay at the Router Buffer using Modified Random Early Detection

Abu-Shareha¹

2019

IJCNC

Self Cite

View full text Add to dashboard Cite

Active Queue Management (AQM) methods are used to manage the buffer of the network routers and avoid the problems caused by network congestion, especially packet loss. Among various AQM methods that have been proposed in the literature, Random Early Detection (RED)method has proved to stabilize the network performance under various traffic loads. However, as the primary concern of RED is to avoid loss when the router buffer overflowed, RED harms the delay at the router and increases the latency. Given that reducing delay is critical to some applications, such as online conferencing and broadcasting, RED needs to be adjusted to ease the delay problem. In this paper, RED is improved by monitoring the delay at the router buffer and implementing packet dropping to handle the issue of network delay and enhance the network performance. Accordingly, the modified method calculates and used a delay parameter with the RED to reduce the delay while maintaining the desirable RED's characteristics. The experimental results showed that the proposed Delay-Controller Random Early Detection (DcRED) improved network performance under various traffic loads. Compared to RED, DcRED results in less delay, while maintaining the loss and dropping rates.

show abstract

Section: Figure 2 Weighted Random Early Detectionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

“…Methods To reduce packet loss ERED [6], AQMRD [17], S-RED[4]EnRED) and Windowed-RED [8]. To reduce packet dropping CRED [5], Adaptive Threshold RED [11], and Adaptive AQMRD [18].…”

Section: Goalmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Controlling Delay at the Router Buffer using Modified Random Early Detection

Abu-Shareha¹

2019

IJCNC

Self Cite

View full text Add to dashboard Cite

show abstract

“…Every device that generates packets must be temporarily stored at the router buffer before forwarding to the next router or its destination. When the router buffer becomes full, congestion occurs, and it will lead to the case of packet loss (Figure 1) [7][8][9][10]. TCP protocol has its congestion control, however, congestion control at the router buffer that results in using TCP over the underlying networks is not considered [4,11].…”

Section: Introductionmentioning

confidence: 99%

Weight Queue Dynamic Active Queue Management Algorithm

Baklizi

2020

Symmetry

View full text Add to dashboard Cite

The current problem of packets generation and transformation around the world is router congestion, which then leads to a decline in the network performance in term of queuing delay (D) and packet loss (PL). The existing active queue management (AQM) algorithms do not optimize the network performance because these algorithms use static techniques for detecting and reacting to congestion at the router buffer. In this paper, a weight queue active queue management (WQDAQM) based on dynamic monitoring and reacting is proposed. Queue weight and the thresholds are dynamically adjusted based on the traffic load. WQDAQM controls the queue within the router buffer by stabilizing the queue weight between two thresholds dynamically. The WQDAQM algorithm is simulated and compared with the existing active queue management algorithms. The results reveal that the proposed method demonstrates better performance in terms mean queue length, D, PL, and dropping probability, compared to gentle random early detection (GRED), dynamic GRED, and stabilized dynamic GRED in both heavy or no-congestion cases. In detail, in a heavy congestion status, the proposed algorithm overperformed dynamic GRED (DGRED) by 13.3%, GRED by 19.2%, stabilized dynamic GRED (SDGRED) by 6.7% in term of mean queue length (mql). In terms of D in a heavy congestion status, the proposed algorithm overperformed DGRED by 13.3%, GRED by 19.3%, SDGRED by 6.3%. As for PL, the proposed algorithm overperformed DGRED by 15.5%, SDGRED by 19.8%, GRED by 86.3% in term of PL.

show abstract

Review of random early detection optimization for congestion control in vehicular ad hoc networks

Ali,

Kadir,

Abidin

et al. 2023

IJEECS

View full text Add to dashboard Cite

<span>The research area of “optimization of random early detection for congestion control in vehicular ad hoc networks (VANETS)” is emerging as a prominent area of research in internet, mobile and communication networks. The paper would draw the attention of development of VANETS in a wider context of internet and communications. It touches upon the problem of congestion that needs to be controlled or avoided for smooth performance of the network. It studies further to come up with methods of control or optimize. An update on these methods will be included. The concept of random early detection (RED) is included and studied in such a way the parameters are identified for defining the optimization problem for congestion control problem (CCP) in VANETS. Current trends of optimization of RED in CCP of VANETS will be reviewed, hence an outlook is created for the problem to be investigated with a final conclusion on the potential way forward for the research work.</span>

show abstract

Enhanced Random Early Detection using Responsive Congestion Indicators

Cited by 9 publications

References 25 publications

Controlling Delay at the Router Buffer using Modified Random Early Detection

Controlling Delay at the Router Buffer using Modified Random Early Detection

Weight Queue Dynamic Active Queue Management Algorithm

Review of random early detection optimization for congestion control in vehicular ad hoc networks

Contact Info

Product

Resources

About