In this paper, we analize by queuing-simulation CANIT (Congestion Avoidance with Normalized Interval of Time) algorithm performances in presence of congestion losses. In a former work [3], we proposed the algorithm (CANIT) for TCP (Transmission Control Protocol) congestion avoidance phase in order to improve fairness during this phase, and we showed that using CANIT algorithm in an environment without loss, instead of standard congestion avoidance algorithm improves both congestion avoidance fairness and bandwith utilization for long RTT connections. In this paper, we consider congestion losses and show that the fairness as well as the bandwith utilization are more efficient when using CANIT algorithm than the standard one. Moreover, the losses in CANIT algorithm are equivalent to those in standard congestion avoidance.
CITATION STYLE
Benaboud, H., & Mikou, N. (2001). Performance evaluation of CANIT algorithm in presence of congestion losses. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2093, pp. 780–789). Springer Verlag. https://doi.org/10.1007/3-540-47728-4_77
Mendeley helps you to discover research relevant for your work.