Performance Evaluation of End-to-End Congestion Control Protocols

Torkey, Hanaa A.; Attiya, Gamal M.; Morsi, I. Z.

doi:10.21608/mjeer.2008.65232

	Performance Evaluation of End-to-End Congestion Control Protocols
Menoufia Journal of Electronic Engineering Research
Article 2, Volume 18, Issue 2, December 2008, Page 99-118
Document Type: Original Article
DOI: 10.21608/mjeer.2008.65232
View on SCiNiTO
Authors
Hanaa A. Torkey¹; Gamal M. Attiya¹; I. Z. Morsi²
¹Dept. of Computer Science and Eng., Faculty of Elect., Eng., Minufiya University
²Dept. of Electrical Engineering, Faculty of Engineering, Minufiya University
Abstract
Congestion control remains an important topic for today’s Internet protocols. Congestion is generally bad for users, applications and networks. Several mechanisms were proposed by researchers to improve congestion control. These mechanisms include TCP Tahoe, Reno, Vegas, SACK, and NewReno. In this paper, we evaluate the current congestion control protocols considering throughput, losses, delay, and fairness that provided by each variant. This study is done using the well known network simulator NS-2 and a realistic topology generator called GT-ITM.


References
[1] Van Jacobson, Michael J. Karels, “Congestion Avoidance and Control”, Sigcomm '88 Symposium, vol.18 (4): pp.314–329. Stanford, CA. August, 1988. [2] Navraj Chohan, “An Analysis of TCP through Simulation”, Technical report CS 276, 2006. [3] Jitendra Padhye, Victor Firoiu, Donald F. Towsley, and James F. Kurose, “Modeling TCP Reno Performance: A Simple Model and Its Empirical Validation”, IEEE/ACM Transactions on Networking, vol. 8, no. 2, pp:133-145,, April 2000. [4] S. Floyd, T. Henderson, “The NewReno Modification to TCP's Fast Recovery Algorithm”, RFC 2582, April 1999 [5] M. Mathis, J. Mahdavi, S. Floyd, A. Romanow, “TCP Selective Acknowledgment Options”, RFC 2018, October 1996. [6] LawrenceS. Brakmo, Sean W. O’Malley, Larry L. Peterson,” TCP Vegas: New Techniques for Congestion Detection and Avoidance”, ACM SIGCOMM Computer Communication Review, vol. 24 , Issue 4, pp:24-35,,October 1994 [7] Wilson Boulevard, Admiralty Way,” Transmission Control Protocol”, RFC 793, September 1981. [8] W. R. Stevens, “TCP/IP Illustrated, Volume 1 the Protocols”, Addison Wesley Professional, Oct. 1993. [9] S. J. Golestani, and S. Bhattacharyya, ”A Class of End-to-End Congestion Control Algorithms for the Internet”, the Sixth International Conference on Network Protocols, pp:137-151 , ISSN:1092-1658 , 1998 [10] Sonia Fahmy, Tapan P. Karwa, “Tcp congestion control: Overview and Survey of Ongoing Research”, Technical report CSD-TR-01-016, PurdueUniversity, 2000. [11] Chadi Barakat, “TCP/IP Modeling and Validation”, IEEE Network, vol.15 Issue 3, pp: 38-47, May 2001. [12] Sally Floyd and Kevin Fall, “Promoting the Use of End-to-End Congestion Control in the Internet”, IEEE/ACM Transactions On Networking, vol. 7, no. 4, pp: 458-472, AUG 1999. [13] Srisankar Kunniyur and R. Srikant , “End-to-End Congestion Control Schemes: Utility Functions, Random Losses and ECN Marks”, IEEE/ACM Transactions On Networking, vol. 7, no 5, pp:689-702,October 2003. [14] W. Stevens, “TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms”, RFC 2001, January 1997. [15] M. Allman, V. Paxson, W. Stevens,”TCP Congestion Control”, RFC 2581, April 1999. [16] Beomjoon Kim, Dongmin Kim, and Jaiyong Lee,” Lost Retransmission Detection for TCP SACK”, IEEE Communications Letters, vol. 8, no. 9, pp: 600 - 602 ,September 2004. [17] Kevin Fall and Sally Floyd, “Simulation-based Comparisons of Tahoe, Reno, and SACK TCP”, Computer Communication Review, V. 26 N. 3, pp:5-21, July 1996 [18] Biplab Sikdar, Shivkumar Kalyanaraman, and Kenneth S. Vastola, “Analytic Models for the Latency and Steady-State Throughput of TCP Tahoe, Reno, and SACK”, in IEEE/ACM Transactions On Networking, vol. 11, no. 6,pp: 959 - 971, December 2003 [19] Jeonghoon Mo, Rechard J. La, Venkat Anantharam, and Jean Walrand, “Analysis and comparison of TCP Reno and Vegas”, IEEE Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM apos`99, vol. 3, pp: 1556 – 1563, Mar 1999 [20] Nadim Parvez, Anirban Mahanti, Carey Williamson, “TCP NewReno: Slow-but-Steady or Impatient?”, Communications, IEEE International Conference ICC '06, vol. 2, pp: 716-722, June 2006. [21] Renaud Bruyeron, Bruno Hemon, Lixia Zhang, “Experimentations with TCP Selective Acknowledgment”, ACM SIGCOMM Computer Communication Review, vol.28 , Issue 2, pp: 54 - 77 April 1998 [22] K.N. Srijith, Lillykutty Jacob, A.L. Ananda, “WORST-CASE PERFORMANCE LIMITATION OF TCP SACK AND A FEASIBLE SOLUTION”,IEEE 8th International Conference on Communication Systems, vol. 2, pp: 1152- 1156, November 2002. [23] J.Jacobson, R. Braderand, and D. Borman, “TCP Extension for high performance. Technical report”, RFC1323, IETF, 1992. [24] Lawrence S. Brakmo, Sean W. O’Malley, and Larry L. Peterson, ”TCP Vegas: new techniques for congestion detection and avoidance”, ACM SIGCOMM Computer Communication Review, vol.24 Issue 4, pp:24-35, October 1994. [25] Omar Ait Hellal, Eithan Altman, “Analysis of TCP Vegas and Reno”, INFOCOM Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol.3, pp:21-25, Mar 1999. [26] Steven H. Low, Larry L. Peterson, and LiminWang, ”Understanding TCP Vegas: A Duality Model”, Journal of the ACM, Vol.49 No.2, pp:207235, March 2002. [27] Lawrence S. Brakmo, and Larry L. Peterson, ”TCP Vegas: End to End Congestion Avoidance on a Global Internet”, IEEE Journal on Selected Areas in Communications, vol.13, no.8, pp: 1465-1480, October 1995. [28] Yi-Cheng Chan, Chia-Tai Chan, and Yaw-Chung Chen, “An Enhanced Congestion Avoidance Mechanism for TCP Vegas", Communications Letters, vol. 7, no.7, pp: 343-345, July 2003. [29] Kevin Fall, Kannan Varadhan, “The ns Manual (formerly ns Notes and Documentation)”, UC Berkeley, LBL, USC/ISI, and Xerox PARC, December 6, 2006. [30] Oliver Heckmann, Michael Piringer, Jens Schmitt, Ralf Steinmetz, “On Realistic Network Topologies for Simulation”, ACM SIGCOMM workshop on Models, methods and tools for reproducible network ACM Press , pp: 28 - 32 August 2003. [31] Ellen W. Zegura, Kenneth L. Calvert, Samrat Bhattacharjee, “How to Model an Internetwork”, IEEE Fifteenth Annual Joint Conference of the Computer Networking the Next Generation, INFOCOM '96, vol. 2, pp: 594-602, March 1996. [32] GT-ITM “Georgia Tech Internetwork Topology”, http://www.cc.gatech.edu/project/gtitm. [33] BRITE “Bosten university Representative Internet Topology Generator”, http://www.cs.bu.edu/brite. [34] TIERS “Tiers Topology Generator”, http://www.isi.edu/nsnam/ns/ns-topogen.htm#tiers. [35] James R. Eagan, John Stasko, and Ellen Zegura, “Interacting with Transit-Stub Network Visualizations”,IEEE Symposium on Information Visualization , 2003 [36] Oliver Heckmann, Michael Piringer, Jens Schmitt, Ralf Steinmetz, “How to use Topology Generators to create realistic Topologies”, KOM Technical Report, Dec2002.
Statistics Article View: 117