Skip to main content

A Simple Rate-Based Congestion Control Scheme Using an Enhanced BECN in ATM Networks

  • Conference paper
  • First Online:
Information Networking: Wired Communications and Management (ICOIN 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2343))

Included in the following conference series:

  • 343 Accesses

Abstract

In the rate-based congestion control, three distinct schemes - Explicit Forward Congestion Indication (EFCI), Backward Explicit Congestion Notification (BECN), and Explicit rate based scheme - are mixed within the ATM Forum. With respect to implementation complexity, the EFCI or BECN are better than the explicit rate based scheme. In this paper, we propose an Enhanced BECN scheme to support max-min fairness problem and a method to determine the optimal source recovery time and filter period in order to minimize the maximum queue length and improve the link utilization. Especially the minimization of queue length fluctuation gives better performance over cell delay variation, end-to-end delay, and so on. Moreover the max-min fairness can be guaranteed with simple use of Resource Management (RM) cells containing Current Cell Rate generated by Source-End-Systems without increasing implementation complexity of the switch.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
eBook
USD 39.99
Price excludes VAT (USA)
Softcover Book
USD 54.99
Price excludes VAT (USA)

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.

Similar content being viewed by others

References

  1. Peter Newman, “Backward Explicit Congestion Notification for ATM Local Area Networks,” Proc. GLOBECOM’93, pp. 719–723, 1993.

    Google Scholar 

  2. Peter Newman, “Traffic Management for ATM Local Area Networks,” IEEECommunications Mag., pp. 44–50, 1994.

    Google Scholar 

  3. D. Bertsekas and R. Gallager, Data Networks, Prentice-Hall, 1987.

    Google Scholar 

  4. Flavio Bonomi and Kerry W. Fendick, “The Rate-Based Flow Control Framework for the Available Bir Rate ATM Service,” IEEE Network Mag., pp. 25–39, 1995.

    Google Scholar 

  5. H.T. Kung and R. Morris, “Credit-Based Flow Control for ATM Networks,” IEEENetwork Mag., pp. 25–39, 1995.

    Google Scholar 

  6. K.K. Ramakrishnan and P. Newman, “Integration of Rate and Credit Schemes for ATM Flow Control,” IEEENetwork Mag., pp. 25–39, 1995.

    Google Scholar 

  7. M. Butto et al. “Effectiveness of the “Leaky Bucket” Policing Mechanism in ATM Networks,” IEEE JSAC, Vol. 9, No. 3, pp. 335–342, April 1991.

    Google Scholar 

  8. A. Gersht and K. J. Lee, “A congestion Control Framework for ATM Networks,” IEEE JSAC, Vol. 9, No. 7, pp. 1119–1130, Sep. 1991

    Google Scholar 

  9. Y. T. Wang and B. Sengupta, “Performance Analysis of a Feedback Congestion Policy,” Computer Communication Review, Vol. 21(4), Sep. 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, IK., Kang, K., Kim, ZO., Jang, JS., Baek, Y. (2002). A Simple Rate-Based Congestion Control Scheme Using an Enhanced BECN in ATM Networks. In: Chong, I. (eds) Information Networking: Wired Communications and Management. ICOIN 2002. Lecture Notes in Computer Science, vol 2343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45803-4_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45803-4_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44256-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics