Enhancing TCP Throughput and Fairness with a Timer-Based Transmission Control over Heterogeneous Networks

  • Jongmin Lee
  • Hojung Cha
  • Rhan Ha
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3961)


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.


Transmission Rate Packet Loss Congestion Control Congestion Window Transmission Queue 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Jocobson, V.: Congestion Avoidance and Control. In: Proceedings of ACM SIGCOMM, pp. 314–329 (1998)Google Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Parker, S., Schmechel, C.: Some Testing Tools for TCP Implementers, RFC2398, IETF (1998)Google Scholar
  7. 7.
    Network Service & Consulting Cooperation: Internet Traffic Report,
  8. 8.
    Allman, M., Floyd, S., Partridge, C.: Increasing TCP’s Initial Window, RFC3390, IETF (2002)Google Scholar
  9. 9.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jongmin Lee
    • 1
  • Hojung Cha
    • 1
  • Rhan Ha
    • 2
  1. 1.Dept. of Computer ScienceYonsei UniversitySeoulKorea
  2. 2.Dept. of Computer EngineeringHongik UniversitySeoulKorea

Personalised recommendations