Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Journal of Applied Sciences
  Year: 2011 | Volume: 11 | Issue: 3 | Page No.: 438-449
DOI: 10.3923/jas.2011.438.449
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Efficiency and Fairness of New-additive Increase Multiplicative Decrease Congestion Avoidance and Control Algorithm

H.N. Jasem, Z.A. Zukarnain, M. Othman and S. Subramaniam

Abstract:
When using of the Internet increased dramatically; the congestion avoidance problem became even more important. The congestion is usually caused by the multiplexing for packets when the packets are at the bottleneck links. Efficiency and fairness are the important metrics in the performance of congestion avoidance mechanisms. And also all of the researches for the congestion avoidance algorithms, interest about this parameters metrics to evaluate the performance of the algorithms. This research studied the performance of the New-Additive Increase Multiplicative Decrease (AIMD) algorithm as one of the core protocols for the TCP congestion avoidance and control mechanism. In addition, to evaluate the effect of using the AIMD algorithm after its development to measure the efficiency and fairness and find new enhancement results for our approach, which named as the New-AIMD algorithm. The NCTUns simulator is used to obtain the results after implementing the modifications to the mechanism.
PDF Fulltext XML References Citation Report Citation
 RELATED ARTICLES:
  •    Performance Assessment of AGRED, RED and GRED Congestion Control Algorithms
How to cite this article:

H.N. Jasem, Z.A. Zukarnain, M. Othman and S. Subramaniam, 2011. Efficiency and Fairness of New-additive Increase Multiplicative Decrease Congestion Avoidance and Control Algorithm. Journal of Applied Sciences, 11: 438-449.

DOI: 10.3923/jas.2011.438.449

URL: https://scialert.net/abstract/?doi=jas.2011.438.449

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 

Curve Bottom