FAW 2008: Frontiers in Algorithmics pp 264-275 | Cite as

Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback

  • Huixiang Zhang
  • Guanzhong Dai
  • Lei Yao
  • Hairui Zhou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5059)

Abstract

Traditional TCP has significant limitations such as unclear congestion implication, low utilization in high bandwidth delay product networks, unstable throughput and limited fairness. In order to overcome such limitations, research on design and development of more effective congestion control algorithms, especially in the high bandwidth delay product networks, is very active. Variable-structure congestion Control Protocol (VCP) uses two ECN bits to deliver the bottleneck link utilization region to end systems, and achieves high utilization, low persistent queue length, negligible packet loss rate and reasonable fairness. Owing to the utilization of large multiplicative decrease factor, VCP flows need very long time to finish fairness convergence. To address this problem, a new method called VCP-Fast Convergence (VCP-FC) is proposed in this paper. VCP-FC uses more bits to deliver precise network load factor back to end systems. The end system calculates the fairness bandwidth based on the variance rates of the load factor and throughput, and then quickly adjusts the congestion window to approach the fairness bandwidth. VCP-FC shortens the fairness convergence time effectively, and meanwhile improves the efficiency and fairness of VCP. At last, the performance of VCP-FC is evaluated using ns2 simulations.

Keywords

Congestion Control Convergence Time Congestion Window Link Utilization Bottleneck Link 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chiu, D., Jain, R.: Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN Systems 17(1), 1–14 (1989)MATHCrossRefGoogle Scholar
  2. 2.
    Jacobson, V.: Congestion Avoidance and Control. ACM SIGCOMM Computer Communication Review 25(1), 157–187 (1995)CrossRefGoogle Scholar
  3. 3.
    Floyd, S.: RFC3649: HighSpeed TCP for Large Congestion Windows. Internet RFCs (2003)Google Scholar
  4. 4.
    Bhandarkar, S., Jain, S., Reddy, A.: Improving TCP Performance in High Bandwidth High RTT Links Using Layered Congestion Control. In: The 3rd International Workshop on Protocols for FAST Long-Distance Networks (2005)Google Scholar
  5. 5.
    Wei, D., Jin, C., Low, S., Hegde, S.: FAST TCP: Motivation, Architecture, Algorithms, Performance. IEEE/ACM Trans. Networking 16(6), 1246–1259 (2006)CrossRefGoogle Scholar
  6. 6.
    Kelly, T.: Scalable TCP: Improving Performance in Highspeed Wide Area Networks. ACM SIGCOMM Computer Communication Review 32(2), 83–91 (2003)CrossRefGoogle Scholar
  7. 7.
    Xia, Y., Subramanian, L., Stoica, I., Kalyanaraman, S.: One More Bit Is Enough. In: The 2005 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 37–48. ACM Press, New York (2005)CrossRefGoogle Scholar
  8. 8.
    Dukkipati, N., Kobayashi, M., Rui, Z., McKeown, N.: Processor Sharing Flows in the Internet. In: The 13th International Workshop on Quality of service, pp. 286–297. Springer, Berlin (2005)Google Scholar
  9. 9.
    Lestas, M., Pitsillides, A., Ioannou, P., Hadjipollas, G.: Adaptive congestion protocol: A congestion control protocol with learning capability. Computer Networks 51(13), 3773–3798 (2007)MATHCrossRefGoogle Scholar
  10. 10.
    Katabi, D., Handley, M., Rohrs, C.: Congestion Control for High Bandwidth-Delay Product Networks. In: The 2002 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 89–102. ACM Press, New York (2002)CrossRefGoogle Scholar
  11. 11.
    Nabeshima, M., Yata, K.: Improving the convergence time of highspeed TCP. In: The 12th IEEE International Conference on Networks, pp. 19–23. IEEE press, New York (2004)Google Scholar
  12. 12.
    Attie, P., Lahanas, A., Tsaoussidis, V.: Beyond AIMD: Explicit Fair-share Calculation. In: The 8th IEEE International Symposium on Computers and Communications, pp. 727–734. IEEE press, Washington (2003)Google Scholar
  13. 13.
    Jiang, H., Dovrolis, C.: Passive Estimation of TCP Round-Trip Times. ACM Computer Communications Review 32(3), 75–88 (2002)CrossRefGoogle Scholar
  14. 14.
    The network simulator ns-2.30, http://www.isi.edu/nsnam/ns
  15. 15.
    Bansal, D., Balakrishnan, H., Floyd, S., Shenker, S.: Dynamic Behavior of Slowly-Responsive Congestion Control Algorithms. In: The 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 263–274. ACM Press, New York (2001)CrossRefGoogle Scholar
  16. 16.
    Jain, R., Chiu, D., Hawe, W.: A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Systems. Technical Report TR-301, Digital Equipment Corporation (1984)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Huixiang Zhang
    • 1
  • Guanzhong Dai
    • 1
  • Lei Yao
    • 1
  • Hairui Zhou
    • 1
  1. 1.College of AutomaticNorthwestern Polytechnical UniversityXi’anChina

Personalised recommendations