Abstract
We present a new adaptive TCP protocol for the control of congestion in communication networks. The key innovative idea in our protocol is to combine results from Frobenius-Perron theory with online adaptation to realise a TCP variant that: (i) allocates the network pipe fairly amongst competing flows; (ii) coexists with other TCP variants; (iii) responds rapidly to changes in available bandwidth; and (iv) which strives to achieve a high data rate through the bottleneck link. When implemented, the new protocol requires only sender-side modification of the standard window congestion control scheme and is transparent to network buffers and network sources operating other TCP-variants. Results from the network simulator NS are presented to illustrate the key features of our scheme.
Keywords
- Adaptive congestion control
- Network congestion control
- Communication networks
Download conference paper PDF
References
A. Berman, R. Shorten, and D. Leith, “Positive matrices associated with synchronised communication networks.” Submitted to Linear Algebra and its Applications, 2003.
M. Gerla, M. Sandaidi, M. Valla, and R. Wang, “TCP Westwood with adaptive bandwidth estimation to improve efficiency/friendliness tradeoffs.” To appear in Computer Communication Journal, 2003.
R. Shorten, D. Leith, J. Foy, and R. Kilduff, “Analysis and design of synchronised communication networks,” in Proceedings of 12th Yale Workshop on Adaptive and Learning Systems, 2003.
A. Berman and R. Plemmons, Nonnegative matrices in the mathematical sciences. SIAM, 1979.
V. Jacobson, “Congestion avoidance and control,” in Proceedings of ACM SIGCOMM, pp. 314–329, 1988.
A. A. Feldbaum, “Dual control theory: Part I,” Automation and Remote Control, vol. 21, no. 9, pp. 874–880, 1960.
S. Floyd, “High-Speed TCP for large congestion windows,” tech. rep., Internet draft draft-floyd-tcp-highspeed-02.txt: Work in progress, February 2003.
T. Kelly, “On engineering a stable and scalable TCP variant,” tech. rep., Cambridge University Engineering Department Report CUED/F-INFENG/TR.435, 2002.
S. Floyd and K. Fall, “Promoting the use of end-to-end congestion control in the internet,” IEEE/ACM Transactions on Networking, vol. 7, no. 4, pp. 458–472, 1999.
Various authors, “Special issue on TCP performance in future networking environments,” IEEE Commuications magazine, vol. 39, no. 4, 2001.
S. Low, F. Paganini, and J. Doyle, “Internet congestion control,” IEEE Control Systems Magazine, vol. 32, no. 1, pp. 28–43, 2002.
Various authors, “Special issue on internet technology and convergence of communication services,” Proceedings of the IEEE, vol. 90, no. 9, 2002.
J. Hespanha, S. Hohacek, K. Obrarzka, and J. Lee, “Hybrid model of TCP congestion control,” in Hybrid Systems: Computation and Control, pp. 291–304, 2001.
R. Horn and C. Johnson, Matrix Analysis. Cambridge University Press, 1985.
R. Shorten, D. Leith, and P. Wellstead, “Adaptive congestion control of the internet.” Submitted to Automatica, 2004.
D. Leith and R. Shorten, “H-TCP:TCP for high-speed and long-distance networks,” in http://www-didc.lbl.gov/PFLDnet2004/ Web-proceedings of the Second International Workshop on Protocols for Fast Long-Distance Networks (), Argonne National Laboratory, Argonne, , Illinois USA, 2004.
P. E. Wellstead and M. B. Zarrop, Self-Tuning Systems: Control and Signal Processing. Wiley, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shorten, R., Leith, D., Wellstead, P. (2004). An Adaptive AIMD Congestion Control Protocol for Communication Networks. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_58
Download citation
DOI: https://doi.org/10.1007/978-3-540-24693-0_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive