research-article

Identification of TCP Congestion Control Algorithms from Unidirectional Packet Traces

Authors:

Toshihiko Kato,

Satoshi OhzahataAuthors Info & Claims

ICTCE '18: Proceedings of the 2nd International Conference on Telecommunications and Communication Engineering

Pages 22 - 27

https://doi.org/10.1145/3291842.3291922

Published: 28 November 2018 Publication History

Abstract

Recently, according to the diversification of network environments, various TCP congestion control mechanisms have been introduced. Since the TCP congestion control algorithms affect the traffic characteristic in the Internet, it is important to analyze which algorithms are used widely. This paper proposes a method to identify a congestion control algorithm from passively collected packet traces that include only unidirectional packet traces. In unidirectional traces, it is hard to map a data segment and the ACK segment corresponding to it and to estimate round-trip time. So, the proposed method uses the curve fitting for sequence number vs. time graphs by applying the least squares method with linear through quartic functions, and maps the first-order and second-order differentiations. This paper applies the proposed method to various TCP congestion control algorithms including TCP Reno, CUBIC TCP, Hamilton TCP, TCP Vegas, and TCP Veno.

References

[1]

Floyd, S., Henderson, T., and Gurtov, A. 2004. The NewReno Modification to TCP's Fast Recovery Algorithm. IETF RFC 3728 (April 2004).

Digital Library

[2]

Javobson, V. 1988. Congestion Avoidance and Control. ACM SIGCOMM Comp. Commun. Review, 18, 4 (Aug. 1988), 314--329.

Digital Library

[3]

Afanasyev, A., Tilley, N., Reiher, P., and Kleinrock, L. 2010. Host-to-Host Congestion Control for TCP. IEEE Commun. Surveys & Tutorials, 12, 3 (May 2010), 304--342.

Digital Library

[4]

Floyd, S. 2003. HighSpeed TCP for Large Congestion Windows. IETF RFC 3649 (Dec. 2003).

Digital Library

[5]

Kelly, T. 2003. Scalable TCP: improving performance in highspeed wide area networks. ACM Comp. Commun. Review, 32, 2 (Apr. 2003), 83--91.

Digital Library

[6]

Ha, S., Rhee, I., and Xu, L, 2008. CUBIC: A New TCP-Friendly High-Speed TCP Variant. ACM SIGOPS Operating Systems Review, 42, 5 (Jul. 2008), 64--74.

Digital Library

[7]

Leith, D. and Shorten, R. 2004. H-TCP: TCP for high-speed and long distance networks. Proc. Int. Workshop on PFLDnet (Feb. 2004), 1--16.

[8]

Grieco, L. and Mascolo, S. 2004. Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control. ACM Comp. Commun. Review, 34, 2 (Apr. 2004), 25--38.

Digital Library

[9]

Brakmo, L. and Perterson, L. 1995. TCP Vegas: End to End Congestion Avoidance on a Global Internet. IEEE J. Selected Areas in Commun., 13, 8, (Oct. 1995), 1465--1480.

Digital Library

[10]

Fu, C. and Liew, S. 2003. TCP Veno: TCP Enhancement for Transmission Over Wireless Access Networks. IEEE J. Sel. Areas in Commun., 21, 2 (Feb. 2003), 216--228.

Digital Library

[11]

Tan, K., Song, J., Zhang, Q., and Sridharan, M. 2006. A Compound TCP Approach for High-speed and Long Distance Networks. Proc. INFOCOM 2006 (Apr. 2006), 1--12.

[12]

Paxson, V. 1997. Automated Packet Trace Analysis of TCP Implementations. ACM Comp. Commun. Review, 27, 4, (Oct. 1997), 167--179.

Digital Library

[13]

Kato, T., Ogishi, T., Idoue, A., and Suzuki, K. 1997. Design of Protocol Monitor Emulating Behaviors of TCP/IP Protocols. Proc. 10th Int. Workshop on Testing of Communicating Systems (IWTCS '97), (Sep. 1997), 416--431.

[14]

Jaiswel, S., Iannaccone, G., Diot, C., Kurose, J., and Towsley, D. 2004. Inferring TCP Connection Characteristics Through Passive Measurements. Proc. INFOCOM 2004, (Mar. 2004), 1582--1592.

[15]

Oshio, J. Ata, S., and Oka, I. 2009. Identification of Different TCP Versions Based on Cluster Analysis. Proc. ICCCN 2009 (Aug. 2009), 1--6.

Digital Library

[16]

Qian, F., Gerber, A., and Mao, Z. 2009. TCP Revisited: A Fresh Look at TCP in the Wild. Proc. IMC '09 (Nov. 2009), 76--89.

Digital Library

[17]

Yang, P., Luo, W., Xu, L., Deogun, J., and Lu, Y. 2011. TCP Congestion Avoidance Algorithm Identification. Proc. ICDCS '11 (Jun. 2011), 310--321.

Digital Library

[18]

Kato, T., Oda, A., Wu, C., and Ohzahata, S. 2015. Comparing TCP Congestion Control Algorithms Based on Passively Collected Packet Traces. Proc. Tenth Int. Conf. on Systems and Networks Communications (ICSNC 2015) (Nov. 2015), 135--141.

[19]

Kato, T., Yongxialee, L., Yamamoto, R., and Ohzahata S.2016. A Study on How to Characterize TCP Congestion Control Algorithms from Unidirectional Packet Traces. Proc. Eleventh Int. Conf. on Internet Monitoring and Protection (ICIMP 2016) (May 2016), 23--28.

[20]

Kato, T., Yan, X., Yamamoto, R., and Ohzahata, S. 2018. Applying Lomb Periodogram to Round-trip Time Estimation from Unidirectional Packet Traces with Different TCP Congestion Controls. Proc. Thirteenth Int. Conf. on Internet Monitoring and Protection (ICIMP 2018) (Jul. 2018), to be presented.

[21]

Y. Zhang, Y., L. Breslau, L., V. Paxson, V., and S. Shenker, S. 2002. On the Characteristics and Origins of Internet Flow Rates. Proc. ACM SIGCOMM'02 (Aug. 2002), 309--322.

Digital Library

[22]

Lan, K., and Heidemann, J. 2006. Measurement Study of Correlations of Internet Flow Characteristics. Computer Networks, 50, 1 (Jan. 2006), 46--62.

Digital Library

Cited By

Tlaiss ZHamchaoui IAmigo IFerrieux AVaton S(2023)Troubleshooting Enhancement with Automated Slow-Start Detection2023 26th Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)10.1109/ICIN56760.2023.10073485(129-136)Online publication date: 6-Mar-2023
https://doi.org/10.1109/ICIN56760.2023.10073485
Kfoury ECrichigno JBou-Harb E(2023)P4CCI: P4-Based Online TCP Congestion Control Algorithm Identification for Traffic SeparationICC 2023 - IEEE International Conference on Communications10.1109/ICC45041.2023.10279386(4007-4012)Online publication date: 28-May-2023
https://doi.org/10.1109/ICC45041.2023.10279386
Tlaiss ZFerrieux AAmigo IHamchaoui IVaton S(2023)Automated slow-start detection for anomaly root cause analysis and BBR identificationAnnals of Telecommunications10.1007/s12243-023-00982-7Online publication date: 18-Aug-2023
https://doi.org/10.1007/s12243-023-00982-7

Index Terms

Identification of TCP Congestion Control Algorithms from Unidirectional Packet Traces
1. Networks
  1. Network protocols
    1. Transport protocols

Recommendations

Performance evaluation of Westwood+ TCP congestion control
Internet performance symposium (IPS 2002)

Westwood+ TCP is a sender-side only modification of the classic Tahoe/Reno TCP that has been recently proposed to improve fairness and efficiency of TCP. The key idea of Westwood+ TCP is to perform an end-to-end estimate of the bandwidth available for a ...
Delay-based congestion avoidance for TCP

The set of TCP congestion control algorithms associated with TCP/Reno (e.g., slow-start and congestion avoidance) have been crucial to ensuring the stability of the Internet. Algorithms such as TCP/NewReno (which has been deployed) and TCP/Vegas (which ...
Comparative performance analysis of TCP-based congestion control algorithms

Congestion control is a challenging problem for us. We tried to analyse the end-to-end congestion control algorithms, i.e., TCP Tahoe, TCP Reno, TCP Newreno, TCP Veno, etc. In the literature, TCP implements a window-based flow control mechanism which ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICTCE '18: Proceedings of the 2nd International Conference on Telecommunications and Communication Engineering

November 2018

420 pages

ISBN:9781450365857

DOI:10.1145/3291842

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

Shanghai Jiao Tong University: Shanghai Jiao Tong University
Nanyang Technological University
Beijing University of Posts and Telecommunications

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 November 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ICTCE 2018

ICTCE 2018: 2018 The 2nd International Conference on Telecommunications and Communication Engineering

November 28 - 30, 2018

Beijing, China

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
94
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Tlaiss ZHamchaoui IAmigo IFerrieux AVaton S(2023)Troubleshooting Enhancement with Automated Slow-Start Detection2023 26th Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)10.1109/ICIN56760.2023.10073485(129-136)Online publication date: 6-Mar-2023
https://doi.org/10.1109/ICIN56760.2023.10073485
Kfoury ECrichigno JBou-Harb E(2023)P4CCI: P4-Based Online TCP Congestion Control Algorithm Identification for Traffic SeparationICC 2023 - IEEE International Conference on Communications10.1109/ICC45041.2023.10279386(4007-4012)Online publication date: 28-May-2023
https://doi.org/10.1109/ICC45041.2023.10279386
Tlaiss ZFerrieux AAmigo IHamchaoui IVaton S(2023)Automated slow-start detection for anomaly root cause analysis and BBR identificationAnnals of Telecommunications10.1007/s12243-023-00982-7Online publication date: 18-Aug-2023
https://doi.org/10.1007/s12243-023-00982-7

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten