Skip to main content

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

  • Conference paper
Frontiers in Algorithmics (FAW 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5059))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  MATH  Google Scholar 

  2. Jacobson, V.: Congestion Avoidance and Control. ACM SIGCOMM Computer Communication Review 25(1), 157–187 (1995)

    Article  Google Scholar 

  3. Floyd, S.: RFC3649: HighSpeed TCP for Large Congestion Windows. Internet RFCs (2003)

    Google Scholar 

  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. Wei, D., Jin, C., Low, S., Hegde, S.: FAST TCP: Motivation, Architecture, Algorithms, Performance. IEEE/ACM Trans. Networking 16(6), 1246–1259 (2006)

    Article  Google Scholar 

  6. Kelly, T.: Scalable TCP: Improving Performance in Highspeed Wide Area Networks. ACM SIGCOMM Computer Communication Review 32(2), 83–91 (2003)

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. 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)

    Article  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. 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. Jiang, H., Dovrolis, C.: Passive Estimation of TCP Round-Trip Times. ACM Computer Communications Review 32(3), 75–88 (2002)

    Article  Google Scholar 

  14. The network simulator ns-2.30, http://www.isi.edu/nsnam/ns

  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)

    Chapter  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Franco P. Preparata Xiaodong Wu Jianping Yin

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, H., Dai, G., Yao, L., Zhou, H. (2008). Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback. In: Preparata, F.P., Wu, X., Yin, J. (eds) Frontiers in Algorithmics. FAW 2008. Lecture Notes in Computer Science, vol 5059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69311-6_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69311-6_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69310-9

  • Online ISBN: 978-3-540-69311-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics