Abstract
TFRC (TCP Friendly Rate Control) is a \(\it rate\it-\it based\it\) congestion control protocol for non-TCP flows. TFRC controls the sending rate by using the TCP throughput equation considering the triple duplicate ACKs and the timeouts. However, this equation provides the conservative throughput bound of TCP. This conservativeness causes lower throughput and slower response time for TFRC than those for TCP. In this paper, we propose the Adaptive TCP Friendly Rate Control (ATFRC) protocol. Reflecting the transient behavior of TCP, we divide the throughput calculation periods into two. For each period, we adapt the sending rate based on different TCP throughput bounds. Simulation results show that the proposed algorithm gets closer to the long-term fair share of TCP than that of TFRC. In addition, ATFRC has faster convergence time than TFRC when bandwidth is available.
This work was supported by the Brain Korea 21 Project of the Korean Ministry of Education, and the University IT Research Supporting Program under the Ministry of Information & Communication of Korea.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Nagle, J.: Congestion Control in IP/TCP. IETF RFC 896 (January 1984)
WidMer, J., Denda, R., Mauve, M.: A Survey on TCP-Friendly Congestion Control. IEEE Network (May/June 2001)
Bansal, D., Balakrishnan, H.: Binomial Congestion Control Algorithms. In: Proceedings of IEEE INFOCOM 2001, Anchorage, Alaska (April 2001)
Yang, Y., Lam, S.: General AIMD Congestion Control. In: Proceedings of ICNP 2000, Osaka, Japan (November 2000)
Yang, Y., Kim, M., Lam, S.: Transient behaviors of TCP-friendly congestion control protocols. In: Proceedings of IEEE INFOCOM 2001, Anchorage, Alaska (April 2001)
Jin, S., Guo, L., Matta, I., Bestavros, A.: TCP-friendly SIMD Congestion Control and Its Convergence Behavior. In: Proceedings of 9th IEEE ICNP 2001 (2001)
Rejaie, R., Handly, M., Estrin, D.: RAP: An End-to-end Rate-Based Congestion Control Mechanism for Realtime Streams in the Internet. In: Proceedings of IEEE INFOCOM (March 1999)
Handley, M., Padhye, J., Floyd, S.: TCP Friendly Rate Control (TFRC): Protocol Specification. IETF Internet Draft (July 2001)
Bansal, D., Balakrishnan, H., Floyd, S., Shenker, S.: Dynamic Behavior of Slowly-Responsive Congestion Control Algorithms. In: Proceedings of SIGCOMM 2001, San Diego, CA (August 2001)
Zhang, X., Shin, K.: Second-Order Rate-Control Based Transport Protocols. In: Proceedings of 9th IEEE ICNP 2001, Riverside, CA, November (May 2001)
Sisalem, D., Wolisz, A.: LDA+ TCP-Friendly Adaptaion: A Measure-ment and comparison Study. In: Proceedings of International Workshop Network and Operation System Support for Digital Audio and Video (June 2000)
Rhee, I., Ozdemir, V., Yi, Y.: TEAR: TCP emulation at receivers - flow control for Multimedia streaming. Tech. report, Dept. of Comp. Sci., NCSU (April 2000)
Chiu, D., Jain, R.: Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. In: Computer Networks and ISDN Systems, vol. 17 (1989)
Padhye, J., Firoiu, V., Towsley, D., Kurose, J.: Modeling TCP Throughput: A Simple Model and its Empirical Validation. In: Proceedings of ACM SIGCOMM 1998, Vancouver, Canada (September 1998)
Mathis, M., Semske, J., Mahdavi, J., Ott, T.: The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm. Computer Communication Review 27(3) (July 1997)
Ott, T., Kemperman, J., Mathis, M.: The Stationary Behavior of Ideal TCP Congestion Avoidance (August 1996) (manuscript), ftp://ftp.bellcore.com/pub/tjo/TCPwindow.ps
ns-2 Network Simulator (2002), http://www.isi.edu/nsnam/ns
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cho, S., Woo, H., Lee, Jw. (2003). ATFRC: Adaptive TCP Friendly Rate Control Protocol. In: Kahng, HK. (eds) Information Networking. ICOIN 2003. Lecture Notes in Computer Science, vol 2662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45235-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-45235-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40827-7
Online ISBN: 978-3-540-45235-5
eBook Packages: Springer Book Archive