On the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm
Additive increase multiplicative decrease (AIMD) algorithm is the prevailing algorithm for congestion avoidance and control in the Internet. Reducing the end-to-end delays and enhancement of the link utilization are the important goals of this algorithm. In this work, we continue to study the perfor...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Academic Journals
2010
|
Online Access: | http://psasir.upm.edu.my/id/eprint/15915/1/15915.pdf http://psasir.upm.edu.my/id/eprint/15915/ https://academicjournals.org/journal/SRE/article-abstract/74F732817032 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Putra Malaysia |
Language: | English |
id |
my.upm.eprints.15915 |
---|---|
record_format |
eprints |
spelling |
my.upm.eprints.159152018-10-18T06:23:35Z http://psasir.upm.edu.my/id/eprint/15915/ On the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm Jasem, Hayder Natiq Ahmad Zulkarnain, Zuriati Othman, Mohamed Subramaniam, Shamala Additive increase multiplicative decrease (AIMD) algorithm is the prevailing algorithm for congestion avoidance and control in the Internet. Reducing the end-to-end delays and enhancement of the link utilization are the important goals of this algorithm. In this work, we continue to study the performance of the New-AIMD (additive increase multiplicative decrease) mechanism as one of the core protocols for TCP, to avoid and control the congestion. We want to evaluate the effect of using the AIMD algorithm after developing it, which we called the New-AIMD algorithm, to find a new approach to measure the end-to-end delay and bottleneck link utilization and use the NCTUns simulator to obtain the results after making the modification for the mechanism. We will use the DropTail mechanism as the active queue management mechanism (AQM) in the bottleneck router. After the implementation of our new approach with a different number of flows, we expect the end-to-end delay to be less when we measure the delay dependent on the throughput for the entire system. In addition, we will measure the bottleneck link utilization using this mechanism and expect to get high utilization for bottleneck link and avoid the collisions in the link. Academic Journals 2010-12-04 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/15915/1/15915.pdf Jasem, Hayder Natiq and Ahmad Zulkarnain, Zuriati and Othman, Mohamed and Subramaniam, Shamala (2010) On the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm. Scientific Research and Essays, 5 (23). art. no. 74F732817032. pp. 3719-3729. ISSN 1992-2248 https://academicjournals.org/journal/SRE/article-abstract/74F732817032 |
institution |
Universiti Putra Malaysia |
building |
UPM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Putra Malaysia |
content_source |
UPM Institutional Repository |
url_provider |
http://psasir.upm.edu.my/ |
language |
English |
description |
Additive increase multiplicative decrease (AIMD) algorithm is the prevailing algorithm for congestion avoidance and control in the Internet. Reducing the end-to-end delays and enhancement of the link utilization are the important goals of this algorithm. In this work, we continue to study the performance of the New-AIMD (additive increase multiplicative decrease) mechanism as one of the core protocols for TCP, to avoid and control the congestion. We want to evaluate the effect of using the AIMD algorithm after developing it, which we called the New-AIMD algorithm, to find a new approach to measure the end-to-end delay and bottleneck link utilization and use the NCTUns simulator to obtain the results after making the modification for the mechanism. We will use the DropTail mechanism as the active queue management mechanism (AQM) in the bottleneck router. After the implementation of our new approach with a different number of flows, we expect the end-to-end delay to be less when we measure the delay dependent on the throughput for the entire system. In addition, we will measure the bottleneck link utilization using this mechanism and expect to get high utilization for bottleneck link and avoid the collisions in the link. |
format |
Article |
author |
Jasem, Hayder Natiq Ahmad Zulkarnain, Zuriati Othman, Mohamed Subramaniam, Shamala |
spellingShingle |
Jasem, Hayder Natiq Ahmad Zulkarnain, Zuriati Othman, Mohamed Subramaniam, Shamala On the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm |
author_facet |
Jasem, Hayder Natiq Ahmad Zulkarnain, Zuriati Othman, Mohamed Subramaniam, Shamala |
author_sort |
Jasem, Hayder Natiq |
title |
On the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm |
title_short |
On the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm |
title_full |
On the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm |
title_fullStr |
On the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm |
title_full_unstemmed |
On the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm |
title_sort |
on the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm |
publisher |
Academic Journals |
publishDate |
2010 |
url |
http://psasir.upm.edu.my/id/eprint/15915/1/15915.pdf http://psasir.upm.edu.my/id/eprint/15915/ https://academicjournals.org/journal/SRE/article-abstract/74F732817032 |
_version_ |
1643826066319474688 |