Abstract
In this paper, we present a novel congestion control algorithm for the Transmission Control Protocol (TCP) for the future Internet. Our assumption of future Internet is that, with the increasing quality of service (QoS) requirements, per-flow packet scheduling (per-flow here refers to per TCP or UDP connection) will replace the current first-come-first-serve algorithm used in routers. Based on the assumption, we design a new congestion control algorithm. In our TCP-CC algorithm, each connection adjusts the size of the congestion window according to the size of its packet queue at the bottleneck router. Thus, the queue size for each connection at the bottleneck router is within a controlled range. We show that congestion loss is effectively reduced compared to the current TCP congestion algorithm.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Jacobson, V.: Congestion avoidance and control. In: Proc. SIGCOMM 1988, Stanford, CA (August 1988)
Jacobson, V.: Modified TCP congestion control avoidance algorithm, Message to end2end-interest mailing list (April 1990)
Stevens, W.R.: TCP/IP illustrated, vol. 1. Addison-Wesley, Reading (1996)
Sawashima, H., Hori, Y., Sunahara, H., Oie, Y.: Characteristics of UDP packet loss: effect of TCP traffic. In: Proc. INET 1997 (June 1997)
Keshav, S., Sharma, R.: Issues and trends in router design. IEEE Communications Magazine 36(5), 144–145 (1998)
Shenker, S.: Fundamental design issues for the Future Internet. IEEE Journal of Selected Areas in Communication 13(7), 1176–1188 (1995)
Zhang, L., Berson, S., Herzog, S., Jamin, S.: Resource reservation protocol, RFC2205 (September 1997)
Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queuing algorithm. In: Proc. ACM SIGCOMM 1989, October 1989, vol. 19, pp. 1–12 (1989)
Nagle, J.: On packet switches with infinite storage. IEEE Transaction on Communications 35 (April 1987)
Shreedhar, M., Varghese, G.: Efficient fair queuing using deficit round-robin. IEEE/ACM Transactions on Networking 4(3) (June 1996)
Brakmo, L.S., O’Malley, S.W., Peterson, L.L.: TCP Vegas: new techniques for congestion detection and avoidance. In: Proc. ACM SIGCOMM 1994, October 1994, pp. 24–25 (1994)
Parsa, C., Aceves, L.: Improving TCP congestion control over Internets with heterogeneous transmission Media. In: Proc. IEEE Conference on Network Protocols (ICNP 1999), Toronto (1999)
Flyod, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking 4, 397–413 (1993)
Jacobson, V., Floyd, S.: TCP and explicit congestion notification. Computer Communication Review 24, 8–23 (1994)
Kalampoukas, L., Varma, A., Ramakrihnan, K.: Explicit window adaptation: a method to enhance TCP performance. In: Proc. IEEE INFOCOM 1998, pp. 242–251 (April 1998)
Keshav, S.: Congestion Control in Computer Networks PhD Thesis, published as UC Berkeley TR-654 (September 1991)
Wang, Z., Crowcroft, J.: Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm. Computer Communication Review 22, 9–16 (1992)
Wang, Z., Crowcroft, J.: A new congestion control scheme: slow start and search (Tri-S). Computer Communication Review 21, 32–43 (1991)
Hasegawa, G., Murata, M.: Survey on fairness issues in TCP congestion control mechanism. IEICE Transactions on Communications E84-B6, 1461–1472 (2001)
Cisco 12016 Gigabit Switch Router, available from http://www.cisco.com/warp/public/cc/cisco/mkt/core/12000/12016
NISTNet network emulator, available from http://snad.ncsl.nist.gov/itg/nistnet/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, H., Seah, W.K.G. (2005). A Novel TCP Congestion Control (TCP-CC) Algorithm for Future Internet Applications and Services. In: Braun, T., Carle, G., Koucheryavy, Y., Tsaoussidis, V. (eds) Wired/Wireless Internet Communications. WWIC 2005. Lecture Notes in Computer Science, vol 3510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424505_8
Download citation
DOI: https://doi.org/10.1007/11424505_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25899-5
Online ISBN: 978-3-540-32104-0
eBook Packages: Computer ScienceComputer Science (R0)