Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Gurtov, TCP Performances in the Presence of Congestion and Corruption Losses, Master’s Thesis, Department of Computer Sciences, University of helsinki, December 2000.
M. Allman, V. Richard Stevens, TCP Congestion Conttrol, RFC 2581, April 1999.
H. Benaboud and N. Mikou, CANIT: A New Algorithm to Improve the Fairness of TCP Congestion Avoidance, Submitted in the 6th IEEE Symposium on Computers and Communications, July, 2001 Hammamet, Tunisia
S. Floyd, Connections with Multiple Congested Gateways in Packet-Switched Networks, Part 1: One-wayT raffic, ACM Computer Communications Review, V 21, N 5, October 1991.
T. Henderson, R. Katz, On Improving the Fairness of TCP Congestion Avoidance,Proceeding of IEEE Globecom’98 Conference 1998.
Van Jacobson, Congestion Avoidance and Control, Computer Communication Review, vol 18. no 4, pp 314–329, August 1988. ftp://ftp.ee.lbl.gov/papers/ congavoid.ps.Z
V. Jacobson, Modified TCP Congestion Avoidance Algorithm, end2end-interest mailing list, April 30, 1990.
H. Kruse, Performance of Common Data Communications Protocols Over Long DelayLinks: An Experimental Examination, In 3rd International Conference on Telecommunication Systems Modeling and Design, 1995.
J. Postel, Transmission Control Protocol, RFC793, September 1981.
B. Suter, T. Lakshman, D. Stiliadis and A. Choudhury, Design Considerations for Supporting TCP with Per-flow Queuing. Proceedings of IEEE Infocom’98 Conference, 1998.
W. Richard Stevens, TCP Slow Start, Congestion Avoidance, Fast Retransmit and Fast RecoveryA lgorithms, RFC2001, January 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benaboud, H., Mikou, N. (2001). Performance Evaluation of CANIT Algorithm in Presence of Congestion Losses. In: Lorenz, P. (eds) Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47728-4_77
Download citation
DOI: https://doi.org/10.1007/3-540-47728-4_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42302-7
Online ISBN: 978-3-540-47728-0
eBook Packages: Springer Book Archive