Skip to main content

Comparison of Explicit Rate and Explicit Forward Congestion Indication Flow Control Schemes for ABR service

  • Conference paper
  • First Online:
Broadband Communications Networks, Services, Applications, Future Directions (IZS 1996)

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

Included in the following conference series:

  • 141 Accesses

Abstract

An adaptive end-to-end rate based congestion control scheme to support a class of best effort service known as Available Bit Rate Service (ABR) is being proposed by the ATM Forum. In this paper we investigate two variants of this control scheme: the Explicit Forward Congestion Indication (EFCI) scheme and the Explicit Rate (ER) scheme. We show that for EFCI based switches the performance of virtual channels traversing large number of hops in WANs can be substantially improved by giving priority to network transit traffic over traffic entering the network. The EFCI scheme with priority exhibits a robust behavior, and ensures fair share of the bandwidth for all VCs, regardless of the number of hops they traverse. The ER scheme however is very stable, even under extreme loading conditions, and ensures fair sharing of resources.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. D. Prycker, Asynchronous Transfer Mode: Solutions for BISDN. Ellis Horwood, New York, 1993.

    Google Scholar 

  2. A. Kolarov and G. Ramamurthy, “Comparison of Congestion Control Schemes for ABR Service in ATM Local Area Networks,” in Proc. IEEE GLOBECOM '94, San Francisco, CA, pp. 913–918, Dec. 1994.

    Google Scholar 

  3. ATM Forum Traffic Management Specification Version 4.0, ABR Flow Control, Mar. 1995.

    Google Scholar 

  4. K. K. Ramakrishnan and R. Jain, “A Binary Feedback Scheme for Congestion Avoidance in Computer Networks,” ACM Trans. on Computer Systems, vol. 8, no. 2, pp. 158–181, 1990.

    Article  Google Scholar 

  5. A. Kolarov and G. Ramamurthy, “Evaluation of Congestion Control Schemes for ABR Services,” ATM Forum Technical Committee Meeting TMWG, Lake Tahoe, CA, Jan. 1994.

    Google Scholar 

  6. G. Ramamurthy, A. Kolarov, C. Ikeda, and H. Suzuki, “Evaluation of Rate Based Congestion Control Schemes for ABR Service — Wide Area Networks,” ATM Forum Technical Committee Meeting TMWG, Munich, Germany, May 1994.

    Google Scholar 

  7. F. Bonomi and K. W. Fendick, “The Rate-Based Flow Control Framework for the Available Bit Rate ATM Service,” IEEE Network, vol. 9, no. 2, pp. 25–39, 1995.

    Article  Google Scholar 

  8. A. Kolarov and G. Ramamurthy, “End-to-end Adaptive Rate Based Congestion Control Scheme for ABR Service in Wide Area ATM Networks,” in Proc. IEEE ICC '95, Seattle, WA, pp. 138–143, June 1995.

    Google Scholar 

  9. L. Benmohamed and S. M. Meerkov, “Feedback Control of Congestion in Packet Switching Networks: The Case of a Single Congested Node,” IEEE/ACM Trans. on Networking, vol. 1, no. 6, pp. 693–707, 1993.

    Article  Google Scholar 

  10. G. Ramamurthy and B. Sengupta, “A Predictive Congestion Control Policy for High-Speed Wide Area Networks,” in Proc. IEEE INFOCOM '93, San Francisco, CA, pp. 1033–1041, May 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bernhard Plattner

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kolarov, A., Ramamurthy, G. (1996). Comparison of Explicit Rate and Explicit Forward Congestion Indication Flow Control Schemes for ABR service. In: Plattner, B. (eds) Broadband Communications Networks, Services, Applications, Future Directions. IZS 1996. Lecture Notes in Computer Science, vol 1044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022239

Download citation

  • DOI: https://doi.org/10.1007/BFb0022239

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60895-0

  • Online ISBN: 978-3-540-49669-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics