Skip to main content

Hybrid Modeling of TCP Congestion Control

  • Conference paper
  • First Online:
Hybrid Systems: Computation and Control (HSCC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2034))

Included in the following conference series:

Abstract

In this paper we propose a hybrid model for TCP’s congestion control mechanism operating under drop-tail queuing policy. Using this model we confirmed the standard formula \( T: = \tfrac{{1.23}} {{\overline {RTT} \sqrt p }} \) used by TCP-friendly congestion control algorithms, which relates the average packet drop rate p, the average round-trip time \( \overline {RTT} \) , and the average throughput T. The hybrid model also allows us to understand the transient behavior and theoretically predict the flow synchronization phenomena that have been observed in simulations and in real networks but, to the best of our knowledge, have not been theoretically justified. This model can also be used to detect abnormalities in TCP traffic flows, which has important applications in network security.

This research was supported by the Defense Advanced Research Projects Agency and the Office of Naval Research. The views presented here are those of the authors and do not represent the views of the funding agencies.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Jacobson, “Congestion avoidance and control,” in Proc. of SIGCOMM, vol. 18.4, pp. 314–329, Aug. 1988.

    Article  Google Scholar 

  2. V. Jacobson, “Modified TCP congestion avoidance algorithm.” Posted on end2endinterest mailing list, Apr. 1990. Available at ftp://ftp.ee.lbl.gov/email/vanj.90apr30.txt.

  3. M. Allman, V. Paxson, and W. Stevens, “TCP congestion control,” RFC 2581, p. 13, Apr. 1999.

    Google Scholar 

  4. K. Fall and S. Floyd, “Simulation-based comparisons of Tahoe Reno and SACK TCP,” Computer Communication Review, vol. 27, pp. 5–21, July 1996.

    Article  Google Scholar 

  5. Y. Yang and S. Lam, “General AIMD congestion control. technical report,” Tech. Rep. TR-200009, Department of Computer Science, University of Texas at Austin, May 2000.

    Google Scholar 

  6. T. Ott, J. H. B. Kemperman, and M. Mathis, “Window size behavior in TCP/IP with constant loss probability,” in Proc. of the DIMACS Workshop on Performance of Realtime Applications on the Internet, Nov. 1996.

    Google Scholar 

  7. J. Mahdavi and S. Floyd, “TCP-friendly unicast rate-based flow control." Technical note sent to the end2end-interest mailing list, Jan. 1997.

    Google Scholar 

  8. T. V. Lakshman, U. Madhow, and B. Suter, “Window-based error recovery and flow control with a slow acknowledgment channel: A study of TCP/IP performance,” in Proc. of INFOCOMM, Apr. 1997.

    Google Scholar 

  9. M. Mathis, J. Semke, J. Mahdavi, and T. Ott, “The macroscopic behavior of the TCP congestion avoidance algorithm,” Computer Communication Review, vol. 27, July 1997.

    Google Scholar 

  10. S. Floyd, M. Handley, J. Padhye, and J. Widmer, “Equation-based congestion control for unicast applications.” To appear in SIGCOMM, May 2000.

    Google Scholar 

  11. L. Zhang, S. Shenker, and D. D. Clark, “Observations on the dynamics of a congestion control algorithm: The effects of two-way traffic,” in Proc. of SIGCOMM, Sept. 1991.

    Google Scholar 

  12. S. Floyd and V. Jacobson, “On traffic phase effects in packet-switched gateways,” Internetworking: Research and Experience, vol. 3, pp. 115–116, Sept. 1992.

    Google Scholar 

  13. S. Floyd and V. Jacobson, “Random early detection gateways for congestion avoidance,” IEEE/ACM Trans. on Networking, vol. 1, pp. 397–413, Aug. 1993.

    Article  Google Scholar 

  14. L. Tavernini, “Differential automata and their discrete simulators,” Nonlinear Anal. Theory, Methods, and Applications, vol. 11, no. 6, pp. 665–683, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  15. A. S. Morse, D. Q. Mayne, and G. C. Goodwin, “Applications of hysteresis switching in parameter adaptive control,” IEEE Trans. Automat. Contr., vol. 37, pp. 1343–1354, Sept. 1992.

    Article  MATH  MathSciNet  Google Scholar 

  16. A. Back, J. Guckenheimer, and M. Myers, “A dynamical simulation facility for hybrid systems,” in Grossman et al. [29].

    Google Scholar 

  17. A. Nerode and W. Kohn, “Models for hybrid systems: Automata, topologies, stability,” in Grossman et al. [29], pp. 317–356.

    Google Scholar 

  18. P. J. Antsaklis, J. A. Stiver, and M. D. Lemmon, “Hybrid system modeling and autonomous control systems,” in Grossman et al. [29], pp. 366–392.

    Google Scholar 

  19. R. W. Brockett, “Hybrid models for motion control systems,” in Essays in Control: Perspectives in the Theory and its Applications (H. L. Trentelman and J. C. Willems, eds.), pp. 29–53, Boston: Birkhäuser, 1993.

    Google Scholar 

  20. M. S. Branicky, V. S. Borkar, and S. K. Mitter, “A unified framework for hybrid control: Background, model and theory,” in Proc. of the 33rd Conf. on Decision and Contr., vol. 4, pp. 4228–4234, Dec. 1994.

    Google Scholar 

  21. M. S. Branicky, Studies in Hybrid Systems: Modeling, Analysis, and Control. PhD thesis, MIT, Cambridge, MA, June 1995.

    Google Scholar 

  22. J. Lygeros, C. Tomlin, and S. Sastry, “Multi-objective hybrid controller synthesis: Least restrictive control,” in Proc. of the 36th Conf. on Decision and Contr., vol. 1, pp. 127–132, Dec. 1997.

    Article  Google Scholar 

  23. The VINT Project, a collaboratoin between researchers at UC Berkeley, LBL, USC/ISI, and Xerox PARC, The ns Manual (formerly ns Notes and Documentation), Oct. 2000. Available at http://www.isi.edu/nsnam/ns/ns-documentation.html.

  24. J. P. Hespanha, S. Bohacek, K. Obraczka, and J. Lee, “Hybrid modeling of tcp congestion control,” tech. rep., University of Southern California, Los Angeles, CA, Oct. 2000.

    Google Scholar 

  25. A. W. Naylor and G. R. Sell, Linear Operator Theory in Engineering and Science. No. 40 in Applied Mathematical Sciences, New York: Springer-Verlag, 1982.

    Google Scholar 

  26. J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, “Modeling TCP throughput: a simple model and its empirical validation,” in Proc. of SIGCOMM, Sept. 1998.

    Google Scholar 

  27. V. Misra, W. Gong, and D. Towsley, “Stochastic differential equation modeling and analysis of TCP-windowsize behavior,” in In Proceedings of PERFORMANCE99, (Istanbul, Turkey), 1999.

    Google Scholar 

  28. F. Baccelli and D. Hong, “TCP is max-plus linear,” in Proc. of SIGCOMM, Sept. 2000.

    Google Scholar 

  29. R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rishel, eds., Hybrid Systems, vol. 736 of Lecture Notes in Computer Science. New York: Springer-Verlag, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hespanha, J.P., Bohacek, S., Obraczka, K., Lee, J. (2001). Hybrid Modeling of TCP Congestion Control. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A. (eds) Hybrid Systems: Computation and Control. HSCC 2001. Lecture Notes in Computer Science, vol 2034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45351-2_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45351-2_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41866-5

  • Online ISBN: 978-3-540-45351-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics