Advertisement

A Novel ECN-Based Congestion Control and Avoidance Algorithm with Forecasting and Verifying

  • H. -s. Liu
  • K. Xu
  • M. -w. Xu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3124)

Abstract

The congestion control and avoidance algorithms can be divided into source and link algorithms. The source algorithms are based on ’pipe’ model; which includes TCP Tahoe, TCP Reno, TCP NewReno, SACK and TCP Vegas. In this paper, we present a novel congestion control source algorithm-FAV(Forecast And Verify), which measures packets delay to forecast whether there will be congestion in network, and uses ECN to verify whether the forecast is precise or not. Experiments are performed by ns2 to compare FAV with TCP Reno and TCP Vegas, and the results imply that FAV algorithm can decrease loss rate and link delay efficiently, and keep link utilization high. We think FAV can control the congestion better than other source algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Jacobson, V.: Congestion Avoidance and Control. In: Proc. ACM SIGCOMM 1988, pp. 314–329 (1988)Google Scholar
  2. 2.
    Jacobson, V.: Modified TCP Congestion Avoidance Algorithm, Message to end2endinterest mailing list (April 1990)Google Scholar
  3. 3.
    Ramakrishnan, K.: The Addition of Explicit Congestion Notification (ECN) to IP, RFC 3168 (September 2001) Google Scholar
  4. 4.
    Network Simulator - ns (version 2), http://www.isi.edu/nsnam/ns/
  5. 5.
    Wang, Z., Crowcroft, J.: Eliminating Periodic Packet Losses in 4.3-Tahoe BSD TCP Congestion Control Algorithm. ACM Computer Communication Review 22(2), 9–16 (1992)CrossRefGoogle Scholar
  6. 6.
    Jain, R.: A Delay-Based Approach for Congestion Avoidance in Interconnected Heterogeneous Computer Networks. ACM Computer Communication Review 19(5), 56–71 (1989)CrossRefGoogle Scholar
  7. 7.
    Wang, Z., Crowcroft, J.: A New Congestion Control Scheme: Slow Start and Search (Tri-S). ACM Computer Communication Review 21(1), 32–43 (1991)CrossRefGoogle Scholar
  8. 8.
    Brakmo, L., O’Malley, S., Peterson, L.: TCP Vegas: New techniques for congestion detection and avoidance. In: Proceedings of the ACM SIGCOMM 1994, August 1994, pp. 24–35 (1994)Google Scholar
  9. 9.
    Brakmo, L., Peterson, L.: TCP Vegas: End to End Congestion Avoidance on a Global Internet. IEEE Journal on Selected Areas in Communication 13(8), 1465–1480 (1995)CrossRefGoogle Scholar
  10. 10.
    Chiu, D.-M., 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)zbMATHCrossRefGoogle Scholar
  11. 11.
    Floyd, S., Jacobson, V.: Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking 1(4), 397–413 (1993)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • H. -s. Liu
    • 1
  • K. Xu
    • 1
  • M. -w. Xu
    • 1
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina

Personalised recommendations