AmarA. Mahawish
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
AmarA. Mahawish has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
Hassan J. Hassan
Computer Engineering Department, University of Technology-Iraq, Baghdad, Iraq
3 shared publications- Hassan Jalee.L Hassan
Computer Engineering Department, University of Technology, Baghdad, Iraq
1 shared publication
Latest Publications
- Open Access
- 31 December 2023
- Published by University of Technology, Iraq - DIGITAL COMMONS in Iraqi Journal of Computers, Communications, Control and Systems Engineering
- Vol. 23 (4) , 84-94
Developed the EX-RED Algorithm to Find Best Parameters Based on Load Connection Factor
The performance of the Internet is significantly impacted by network congestion. Because of the internet's current rapid growth, congestion could increase and cause more packets to be dropped. The Transmission Control Protocol (TCP) connection is used as the reliable transmission of packets which has a Drop Tail (DT) mechanism since congestion DT signals occur only when the queue has become full. The Random Early Detection algorithm mechanism can be developed as congestion control which eliminates the drawback of a tail drop queue full. The Red algorithm also has problems dealing with different numbers of connections due to fix parameter tuning. In this study, the EXhaustive search used with the RED algorithm to develop the EX-RED algorithm. Based on network performance metrics such as packet drop, delay, and throughput, the developed algorithm adjusts the default RED parameter to find the best of them. When the number of TCP connections changes, the exhaustive search used systematically enumerates all possible states of the parameter. The simulation results showed that the EXRED improved performance of the network as compared with the other five algorithms (GRED, RED, ARED, NLRED, and NLGRED) by decreasing delay and dropped packets and increasing packet throughput. Index Terms— AQM, Congestion Control, Exhaustive search, RED.
- 31 December 2023
- Published by University of Technology, Iraq - DIGITAL COMMONS in Iraqi Journal of Computers, Communications, Control and Systems Engineering
- Vol. 23 (4) , 84-94
Open AccessDeveloped the EX-RED Algorithm to Find Best Parameters Based on Load Connection Factor
The performance of the Internet is significantly impacted by network congestion. Because of the internet's current rapid growth, congestion could increase and cause more packets to be dropped. The Transmission Control Protocol (TCP) connection is used as the reliable transmission of packets which has a Drop Tail (DT) mechanism since congestion DT signals occur only when the queue has become full. The Random Early Detection algorithm mechanism can be developed as congestion control which eliminates the drawback of a tail drop queue full. The Red algorithm also has problems dealing with different numbers of connections due to fix parameter tuning. In this study, the EXhaustive search used with the RED algorithm to develop the EX-RED algorithm. Based on network performance metrics such as packet drop, delay, and throughput, the developed algorithm adjusts the default RED parameter to find the best of them. When the number of TCP connections changes, the exhaustive search used systematically enumerates all possible states of the parameter. The simulation results showed that the EXRED improved performance of the network as compared with the other five algorithms (GRED, RED, ARED, NLRED, and NLGRED) by decreasing delay and dropped packets and increasing packet throughput. Index Terms— AQM, Congestion Control, Exhaustive search, RED.
- Open Access
- 16 November 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-2
Author Correction: Improving RED algorithm congestion control by using the Markov decision process
- 16 November 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-2
Open AccessAuthor Correction: Improving RED algorithm congestion control by using the Markov decision process
- Open Access
- 3 August 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-9
Improving RED algorithm congestion control by using the Markov decision process
Congestion control plays an essential role on the internet to manage overload, which affects data transmission performance. The random early detection (RED) algorithm belongs to active queue management (AQM), which is used to manage internet traffic. The RED is used to eliminate weakness in default control of the Transport Control Protocol (TCP) drop-tail mechanism. The drawback of RED is parameter tuning, while adaptive RED (ARED) automatically adjusts these parameters. In this study, the suggested algorithm, the Markov decision process RED (MDPRED) uses the Markov decision process (MDP) to suitably adapt values for queue weight in the RED algorithm based on average queue length to enhance the performance of the traditional RED during TCP Slow Startup phase. This study is conducted based on fluctuations among the rate of service, queuing weight, and the mean queue length by using open-source network simulator NS3. The study shows efficient results by fluctuating end-to-end packet throughput and fast response to the inception of congestion in the network. The modified algorithm achieves a low level of drop packets by evaluating the results with other five algorithms, which is done by increasing the algorithm’s response when the average queue size becomes close to the maximum queue length threshold.
- 3 August 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-9
Open AccessImproving RED algorithm congestion control by using the Markov decision process
Congestion control plays an essential role on the internet to manage overload, which affects data transmission performance. The random early detection (RED) algorithm belongs to active queue management (AQM), which is used to manage internet traffic. The RED is used to eliminate weakness in default control of the Transport Control Protocol (TCP) drop-tail mechanism. The drawback of RED is parameter tuning, while adaptive RED (ARED) automatically adjusts these parameters. In this study, the suggested algorithm, the Markov decision process RED (MDPRED) uses the Markov decision process (MDP) to suitably adapt values for queue weight in the RED algorithm based on average queue length to enhance the performance of the traditional RED during TCP Slow Startup phase. This study is conducted based on fluctuations among the rate of service, queuing weight, and the mean queue length by using open-source network simulator NS3. The study shows efficient results by fluctuating end-to-end packet throughput and fast response to the inception of congestion in the network. The modified algorithm achieves a low level of drop packets by evaluating the results with other five algorithms, which is done by increasing the algorithm’s response when the average queue size becomes close to the maximum queue length threshold.
- Open Access
- 14 March 2022
- Published by Springer Nature in Research Square
Improving RED algorithm congestion control by using the Markov Decision Process
Congestion control plays an essential role on the internet to manage overload, which affects data transmission performance. The random early detection (RED) algorithm belongs to active queue management (AQM), which is used to manage internet traffic. The RED is used to eliminate weakness in default control of the transport control protocol (TCP) drop-tail mechanism. The drawback of RED is parameter tuning, while adaptive RED (ARED) automatically adjusts these parameters. In this study, the suggested algorithm, the Markov decision process RED (MDPRED) uses the Markov decision process (MDP) to suitably adapt values for queue weight in the RED algorithm based on average queue length to enhance the performance of the traditional RED. This study is conducted based on fluctuations among the rate of service, the queuing weight, and the mean queue length by using open-source network simulator NS3. The study shows efficient results by fluctuating end-to-end packet throughput and fast response to the inception of congestion in the network. The modified algorithm achieves a low level of loss packets by evaluating the results with the default RED algorithm and ARED, which is done by increasing the algorithm’s response when the average queue size becomes close to the maximum queue length threshold.
- 14 March 2022
- Published by Springer Nature in Research Square
Open AccessImproving RED algorithm congestion control by using the Markov Decision Process
Congestion control plays an essential role on the internet to manage overload, which affects data transmission performance. The random early detection (RED) algorithm belongs to active queue management (AQM), which is used to manage internet traffic. The RED is used to eliminate weakness in default control of the transport control protocol (TCP) drop-tail mechanism. The drawback of RED is parameter tuning, while adaptive RED (ARED) automatically adjusts these parameters. In this study, the suggested algorithm, the Markov decision process RED (MDPRED) uses the Markov decision process (MDP) to suitably adapt values for queue weight in the RED algorithm based on average queue length to enhance the performance of the traditional RED. This study is conducted based on fluctuations among the rate of service, the queuing weight, and the mean queue length by using open-source network simulator NS3. The study shows efficient results by fluctuating end-to-end packet throughput and fast response to the inception of congestion in the network. The modified algorithm achieves a low level of loss packets by evaluating the results with the default RED algorithm and ARED, which is done by increasing the algorithm’s response when the average queue size becomes close to the maximum queue length threshold.