[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Transport Protocols in the TCP Paradigm and their Performance

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This paper defines a class of “TCP-like” transport protocols, called protocols in the TCP Paradigm. The name indicates the protocols are not TCP, but in some sense similar to it.

The class includes TCP and also Tom Kelly's “Scalable TCP”, and more. Most of the protocols in the class require ECN in order to become implementable. Most even require a form of ECN that allows a high rate of marked packets.

The paper analyzes performance of protocols in the TCP Paradigm and indicates a subset that is likely to perform as well as, or quite possibly better than, Scalable TCP. Criteria are the ability to achieve high throughput, to maintain a steady flow if the ECN marking probability is constant, and to adapt quickly to a changing marking probability.

A main conclusion is that in order to benefit from protocols in this paradigm, “source behavior” (reaction of endpoints to marked and unmarked packets) and “router behavior” (how routers choose marking probabilities) must be investigated together.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. E. Altman, K. Avrachenkov and C. Barakat, A stochastic model for TCP/IP with stationary random loss, SIGCOMM'OO (2000) 231–242.

  2. E. Altman, K. Avrachenkov and C. Barakat, TCP network calculus: The case of large delay-bandwidth product, in: IEEE INFOCOM (New-York, USA, 2002).

  3. E. Altman, K. Avrachenkov, C. Barakat, A.A. Kherani and B.J. Prabhu, Analysis of scalable TCP, 7-th IEEE HSNMC (2004) 51 – 62.

  4. E. Altman, K. Avrachenkov and B. Prabhu, Fairness in MIMD congestion control algorithms, IEEE Infocom, Miami (2005) 13–17.

    Google Scholar 

  5. E. Altman, K. Avrachenkov, A.A. Kherani and B.J. Prabhu, Analysis of scalable TCP in the presence of markovian losses, 3rd International workshop on protocols for fast long-distance networks, Lyon, France, February 3,4 (2005).

  6. E. Altman, K. Avrachenkov, A. Kherani and B. Prabhu, Performance analysis and stochastic stability of congestion control protocols, IEEE Infocom, Miami (2005) 13–17.

    Google Scholar 

  7. E. Altman, C. Barakat and V.M. Ramos Ramos, Analysis of AIMD protocols over paths with variable delay, IEEE Infocom Hong-Kong (2004).

    Google Scholar 

  8. E. Altman, T. Jimenez and D. Kofman. DPS queues with stationary ergodic service times and the performance of TCP in overload, IEEE INFOCOM Hong-Kong (2004).

    Google Scholar 

  9. J. Barras, A. Misra and T.J. Ott Generalized TCP Congestion Avoidance and its effect on Bandwidth Sharing and Variability, in: Proceedings Globecomm 2000, (San Francisco, 2000).

  10. J. Baras, A. Misra and T.J. Ott, in: Predicting Bottleneck Bandwidth Sharing by Generalized TCP Flows, Computer Networks 40/4 (2002) 557–576.

  11. D. Bansal and H. Balakrishnan, Binomial congestion control algorithms, in: Proceedings, INFOCOM pp. 631–640 (2001).

  12. D. Bansal, H. Balakrishnan, S. Floyd and S. Shenker, Dynamic behavior of slowly-responsive congestion control algorithms, in: Proceedings, SigComm (2001).

  13. J. Baras, A. Misra and T.J. Ott, The window distribution of multiple TCPs with random loss queues, Globecomm '99, (1999).

  14. J. Baras, A. Misra and T.J. Ott, Using drop-biasing to stabilize the occupancy of random drop queues with TCP traffic, in: Proceedings ICCS (Singapore, 2000).

  15. Lawrence S. Brakmo and Larry L. Peterson, Performance problems in BSD4.4 TCP, in: Proceedings of ACM SIGCOMM '95, (1995).

  16. Lawrence S. Brakmo, Sean W. O'Malley and Larry L. Peterson, TCP vegas: New techniques for congestion detection and avoidance, in: Proceedings of ACM SIGCOMM '94, (1994).

  17. A. Budhiraja, F. Hernandez-Campos, V.G. Kulkarni and F.D. Smith, Stochastic differential equation for TCP window size: Analysis and experimental validation, in: Probability in the Engineering and Informational Sciences, p. 18 (2004).

  18. D. Chiu and R. Jain, Analysis of the increase/decrease algorithms for congestion avoidance in computer networks, Journal of Computer Networks and ISDN, (1989).

  19. Committee on Research Horizons in Networking, National Research Council, Looking over the Fence at Networks, A Neighbor's View Networking Research. National Academy Press, Washington, D.C., (2001).

    Google Scholar 

  20. V. Dumas, F. Guillemin and P.H. Robert, A markovian analysis of additive-increase, multiplicative decrease (AIMD) algorithms. Adv. Appl. Prob. 34(1) (2002) 85–111.

    Google Scholar 

  21. R. El Khoury and E. Altman, Analysis of scalable TCP. Available at www-sop.inria.fr/mistral/personnel/Eitan.Altman/fl-cont.html, (2004).

  22. W. Feng, D. Kandlur, G. Kang and D. Saha, Adaptive packet marking for providing differential services in the internet. ICNP (1998).

  23. S. Finch, Ornstein—uhlenbeck process. Availabe at pauillac.inria.fr/algo/csolve/ou.pdf, (2004).

  24. Sally Floyd, Connections with multiple congested gateways in packet-switched networks Part I: One way traffic, CCR 21(5) (1991) 30–47.

    Google Scholar 

  25. S. Floyd, TCP and explicit congestion notification, ACM Computer Communications Review 21(5) (1994) 8–23.

    Google Scholar 

  26. Sally Floyd, HighSpeed TCP for large congestion windows, IETF RFC 3649, (2003).

  27. Sally Floyd and Van Jacobson, Random early detection gateways for congestion avoidance, IEEE/ACM Transactions on Networking, (1993).

  28. F. Guillemin, P.H. Robert and B. Zwart, AIMD algorithms and exponential functionals, Ann. Appl. Prob. 14(1) (2004) 90–117.

    Google Scholar 

  29. Van Jacobson, Congestion avoidance and control, in: Proceedings of ACM SIGCOMM'88, (1988).

  30. D. Katabi, M. Handley and C. Rohrs, Congestion control for high bandwidth-delay product networks, in: Proceedings. ACM SIGCOMM'02, (2002).

  31. C.T. Kelly, An ECN probe-based connection acceptance control, Available at www-lce.eng.cam.ac.uk/~ctk21/papers/, (2002).

  32. C.T. Kelly, Scalable TCP: Improving performance in highspeed wide area networks, ACM SIGCOMM Computer Communication Review 32(2) (2003) 83–91.

    Google Scholar 

  33. C.T. Kelly, Engineering Flow Controls for the Internet, PhD Thesis, Cambridge Univ, England, Available at http://www-lce.eng.cam.ac.uk/~ctk21/papers/, (2004).

  34. F.P. Kelly, A. Maulloo and D. Tan, Rate control for communication networks: Shadow prices, Proportional fairness and stability, J. Oper. Res. Soc. (1998) 237–252.

  35. S. Kunniyur and S. Srikant, Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management, in: Proceedings of ACM Sigcomm'01 pp. 123–134, (2001).

  36. T.V. Lakshman and U. Madhow, The performance of TCP/IP for networks with high Bandwidth-Delay products and random loss, Trans of Netw, (1997).

  37. T.V. Lakshman, U. Madhow and B. Suter, Window-based error recovery and flow control with a slow acknowledgement channel: A study of TCP/IP performance, Infocom'97, (1997).

  38. Steven H. Low and R. Srikant, A mathematical framework for designing a low-loss, low-delay internet. Network and Spatial Economics 4(1) (2004) 75–102.

    Google Scholar 

  39. A. Misra and T.J. Ott, Effect of exponential averaging on the variability of a RED queue, in: Proceedings, ICC'01, (2001) Helsinki.

  40. A. Misra and T.J. Ott, Jointly coordinating ECN and TCP for rapid adaptation to varying bandwidth, in: Proceedings of MILCOM 2001, Best Unclassified Paper in MILCOM, (2001).

  41. A. Misra and T.J. Ott, Performance sensitivity and fairness of ECN-aware Modified TCP, Journal of Performance Evaluation (PEVA) 53/3 (2003) 255–272.

    Google Scholar 

  42. R. Marquez, E. Altman and S. Sole-Alvarez, Modeling TCP and high speed TCP: A nonliinear extension to AIMD mechanisms. 7-th IEEE HSNMC (2004) 132–143.

  43. M. Mathis, J. Semke, J. Mahdavi and T.J. Ott, The macroscopic behavior of the TCP congestion avoidance algorithm, Computer Communications Review 27(3) (1997) 67–82.

    Google Scholar 

  44. A. Misra and T.J. Ott, The window distribution of idealized TCP congestion avoidance with variable packet loss, in: Proceedings Infocom '99, (1999), pp. 1564–1572.

  45. R. Morris, Scalable TCP congestion control. IEEE Infocom, (2000).

  46. T.J. Ott, ECN protocols and the TCP paradigm. Available at web.njit.edu/~ott/Papers Also presented at the Workshop on Modeling of Flow and Congestion Control Mechanisms, Ecole Normale Superieure, Paris, Sept., (2000).

  47. T.J. Ott, Rate of convergence for the “Square root formula’ in TCP. Available at web.njit.edu/~ott/ Papers Submitted for publication. On the same website there also is a “modified version” which contains stronger results for the case 0 < α < 1, (2004).

  48. T.J. Ott, The transient behavior of idealized TCP congestion avoidance, Work in progress, draft available on request, (2005).

  49. T.J. Ott, On the Ornstein-Uhlenbeck process with delayed feedback, Available at web.njit.edu/ ott/Papers, (draft).

  50. T.J. Ott, J.H.B. Kemperman and M. Mathis, The stationary behavior of ideal TCP congestion avoidance. [47] This paper has circulated on the Web since August 1996 and has frequently been cited. See http://web.njit.edu/~ott/Papers for a copy, (1996).

  51. J. Padhye, V. Firoiu, D. Towsley and J. Kurose, Modeling TCP throughput: A simple model and its empirical validation, ACM SIGCOMM, (1998).

  52. R. Srikant, The mathematics of internet congestion control Birkhauser, (2004).

  53. R. Srikant, Models and methods for analyzing internet congestion control algorithms, in: (eds.) Lecture Notes in Control and Information Sciences (LCNCIS), C.T. Abdallah, J. Chiasson, and S. Tarbourich, Springer Verlag, (2004).

  54. J. Swanson, Private Communication, (2005).

  55. A. Kumar, Comparative performance analysis of versions of TCP in a local network with a lossy link, IEEE/ACM Transactions on Networking, (1998).

  56. A. Tang, J. Wang and S.H. Low, Understanding CHOKe: Throughgput and spatial characteristics. IEEE/ACM Transactions on Networking (ToN) 12(4) (2004) 694–707.

    Article  Google Scholar 

  57. F. Paganini, Z. Wang, J.C. Doyle and S.H. Low, Congestion control for high performance, stability, and fairness in general networks, To appear in IEEE/ACM Transactions on Networking (ToN), (2005).

  58. T.J. Ott, T.V. Lakshman and L.H. Wong, SRED: Stabilized RED, in: Proceedings of IEEE INFOCOM'99, pp. 1346–1355 (1999).

  59. K.K. Ramakrishnan, F. Floyd and D. Black, The addition of explicit congestion control (ECN) to IP. IETF RFC 3168, (2001).

  60. W.R. Stevens, TCP/IP Illustrated, vol. 1. (Addison-Wesley, Reading MA, 1994).

    Google Scholar 

  61. G.R. Wright and W.R. Stevens, TCP/IP Illustrated, vol. 2. (Addison-Wesley, Reading MA, 1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, New Jersey Institute of Technology, New Jersey

    Teunis J. Ott

Authors
  1. Teunis J. Ott
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Teunis J. Ott.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ott, T.J. Transport Protocols in the TCP Paradigm and their Performance. Telecommun Syst 30, 351–385 (2005). https://doi.org/10.1007/s11235-005-5497-3

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-005-5497-3

Keywords

Search

Navigation