i-manager Publications

Comparative Performance Analysis of TCP Congestion Control Algorithms for the Efficiency Improvement of E-learning Applications

M. Chandrasekaran*, N. Kannan**, Kalpana M***

*Assistant Professor ,Electronics and communication Engineering department at Government College of Engineering, Salem.

**Assistant Professor ,Computer Science and Engineering Department at Jayaram College of Engineering and Technology, Trichy

***Assistant Professor , Electronics and Communication Engineering Department at Jayaram College of Engineering and Technology, Trichy.

Periodicity:August - October'2006
DOI : https://doi.org/10.26634/jfet.2.1.961

Abstract

This paper mainly aims at suggesting methods to improve the efficiency of the e-learning applications by making use of the optimal TCP/IP Congestion control algorithm. This is done by first analyzing the various TCP Congestion control algorithms and comparing their performance. An investigation of some of the TCP/IP congestion control algorithms implemented in ns2 is done. Then the performance of these algorithms in a TCP/IP Network is studied. A Dumbbell topology with 9 source nodes each operates with a different congestion control algorithm is simulated using ns2. Using this topology, the performance of these algorithms is compared by evaluating their total throughput and bandwidth sharing of the bottleneck link. This comparison results into the suggestion of the algorithm TCP/Reno for improving the efficiency of the e-learning application, as it provides the maximum long term total throughput of all the algorithms.

Keywords

E-learning, TCP/IP networks, Congestion control, ns2, Total throughput.

How to Cite this Article?

Chandrasekaran M, N. Kannan and Kalpana M (2006). Comparative Performance Analysis of TCP Congestion Control Algorithms for the Efficiency Improvement of E-learning Applications. i-manager’s Journal on Future Engineering and Technology, 2(1), 20-23. https://doi.org/10.26634/jfet.2.1.961

References

[1 ]. Van Jacobson, "Congestion Avoidance and Control," ACM Computer Communication Review, vol.18, pp. 314-329, Aug. 1988. Proceedings of the Sigcomm '88 Symposium in Stanford, CA, August 1988.

[2], M. Allman and V. Paxson, TCP Congestion Control, Internet Engineering Task Force, April 1999, RFC 2581.

[3], Sally Floyd and Kevin Fall, "Promoting the use of end- to-end congestion control in the Internet," IEEE/ACM Transactions on Networking, vol. 7(4), pp. 458472, August 1999.

[4], Deepak Bansal and Hari Balakrishnan, "Binomial congestion control algorithms," in Proceedings of IEEE INFOCOM. April 2001.

[5]. Y. Richard Yang and Simon S. Lam, "General AIMD congestion control," in Proceedings of ICNP, November 2000.

[6], Lawrence S. Brakmo and Sean W. O'Malley, "TCP Vegas: New Techniques for Congestion Detection and Avoidance," in SIGCOMM '94 Conference on Communications Architectures and Protocols, (London, United Kingdom), pp. 24-35, Oct. 1994,

[7]. D. Bansal and H. Balakrishnan, "TCP-friendly Congestion Control for Real-time Streaming Applications," Tech. Rep. MIT-LCS-TR-806, MIT Laboratory for Computer Science, May 2000

[8]"ns-2 Network Simulator,"http://www.isi.edu/nsnam/ns/, 2000.

[9], S. Floyd and V. Jacobson, "Random Early Detection Gateways for Congestion Avoidance," IEEE/ACM Transactions on Networking, vol. 1, no. 4, Aug. 1993

[10]. Tejas Kokje Vijay Kakadia, ’ Analysis of Congestion Control Strategies For TCP Variants Using Droptail and RED Queuing Disciplines Department of Computer Science University of Southern California, Los Angeles

[11 ]. http://www.e-learningguru.com.

If you have access to this article please login to view the article or kindly login to purchase the article

Single Article

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Online	15	15

ADD TO CART

Options for accessing this content:

If you would like institutional access to this content, please recommend the title to your librarian.
If you already have i-manager's user account: Login above and proceed to purchase the article.
New Users: Please register, then proceed to purchase the article.