Skip to main content

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

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((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.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jacobson, V.: Congestion Avoidance and Control. In: Proc. ACM SIGCOMM 1988, pp. 314–329 (1988)

    Google Scholar 

  2. Jacobson, V.: Modified TCP Congestion Avoidance Algorithm, Message to end2endinterest mailing list (April 1990)

    Google Scholar 

  3. Ramakrishnan, K.: The Addition of Explicit Congestion Notification (ECN) to IP, RFC 3168 (September 2001)

    Google Scholar 

  4. Network Simulator - ns (version 2), http://www.isi.edu/nsnam/ns/

  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)

    Article  Google Scholar 

  6. Jain, R.: A Delay-Based Approach for Congestion Avoidance in Interconnected Heterogeneous Computer Networks. ACM Computer Communication Review 19(5), 56–71 (1989)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

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

    Article  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  11. Floyd, S., Jacobson, V.: Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking 1(4), 397–413 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, H.s., Xu, K., Xu, M.w. (2004). A Novel ECN-Based Congestion Control and Avoidance Algorithm with Forecasting and Verifying. In: de Souza, J.N., Dini, P., Lorenz, P. (eds) Telecommunications and Networking - ICT 2004. ICT 2004. Lecture Notes in Computer Science, vol 3124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27824-5_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27824-5_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22571-3

  • Online ISBN: 978-3-540-27824-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics