Abstract
This paper presents a sender-side TCP congestion control mechanism that improves both throughput and fairness in wired as well as wireless networks. A traditional windows-based congestion control scheme adjusts the transmission rate only when the TCP sender receives an acknowledgement message or it detects a transmission timeout. Therefore, competing flows with different packet roundtrip times experience throughput unfairness because a flow with a short packet roundtrip time increases the transmission rate more quickly than the others do. Moreover, the cumulative acknowledgement message induces burst traffic, which overloads the network. In addition, packet losses delay the packet transmission until the amount of date transmitted without acknowledgements from the receiver equals to the reduced congestion window size, and it degrades transmission performance. The proposed mechanism adjusts the transmission rate based on a timer maintained by the TCP sender. As the mechanism adjusts the transmission rate regardless of the reception of acknowledgement messages, it improves fairness among flows with different packet roundtrip time, and prevents burst traffic caused by the cumulative acknowledgement message. The mechanism has been implemented in the Linux platform, and experienced with various TCP variants in real environments. The experimental result shows that the mechanism improves both throughput and fairness in wired as well as wireless networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Jocobson, V.: Congestion Avoidance and Control. In: Proceedings of ACM SIGCOMM, pp. 314–329 (1998)
Floyd, S.: Connections with Multiple Congested Gateways in Packet-Switched Networks Part 2: Two-way Traffic. ACM Computer Communication Review 21(5), 30–47 (1991)
Grieco, L.A., Mascolo, S.: Performance Evaluation and Comparison of Westwood+, New Reno, and Vegas TCP Congestion Control. ACM SIGCOMM Computer Communication Review 34(2), 25–38 (2004)
Mascolo, S., Casetti, C., Gerla, M., Sanadidi, M.Y., Wang, R.: TCP Westwood: Bandwidth Estimation for Enhanced Transport over Wireless Links. Mobile Computing and Networking, 287–297 (2001)
Xu, L., Harfoush, K., Rhee, I.: Binary Increase Congestion Control (BIC) for Fast, Long Distance Networks. In: Proceedings of IEEE INFOCOM 2004, Hong Kong (2004)
Parker, S., Schmechel, C.: Some Testing Tools for TCP Implementers, RFC2398, IETF (1998)
Network Service & Consulting Cooperation: Internet Traffic Report, http://www.internettrafficreport.com
Allman, M., Floyd, S., Partridge, C.: Increasing TCP’s Initial Window, RFC3390, IETF (2002)
Jain, R., Chiu, D., Hawe, W.: A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer Systems, Technical Report DEC-TR-301, Digital Equipment Corporation (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, J., Cha, H., Ha, R. (2006). Enhancing TCP Throughput and Fairness with a Timer-Based Transmission Control over Heterogeneous Networks. In: Chong, I., Kawahara, K. (eds) Information Networking. Advances in Data Communications and Wireless Networks. ICOIN 2006. Lecture Notes in Computer Science, vol 3961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919568_65
Download citation
DOI: https://doi.org/10.1007/11919568_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48563-6
Online ISBN: 978-3-540-48564-3
eBook Packages: Computer ScienceComputer Science (R0)