Skip to main content

A New Consolidation Algorithm for Point–to–Multipoint ABR Service in ATM Networks

  • Conference paper
Book cover Networking — ICN 2001 (ICN 2001)

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

Included in the following conference series:

  • 443 Accesses

Abstract

In ATM networks, ‘feedback implosion’ may occur at the source of a point-to-multipoint Available Bit Rate (ABR) service if the Backward Resource Management (BRM) cells are not consolidated at the branch-points. Existing consolidation algorithms do not consider information contents of a BRM cell to decide whether the cell should be passed to the upstream node or not, and they suffer from various undesirable effects, such as consolidation noise, slow transient response etc. In this paper, first we clearly identify the responsibilities of a branch-point of a point-to-multipoint ATM ABR connection, and then we propose a new consolidation algorithm where a BRM cell is passed to the upstream node immediately if it contains ‘critical information’, otherwise, it is discarded. We investigate the performance of our algorithm using simulation, and the results show that our proposed algorithm provides faster and more accurate feedback with excellent scalability, in comparison to the existing waitfor- all algorithm.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. ATM Forum Technical Committee, “Traffic Management Specification Version 4.1”, aftm-0121.000, Mar. 1999.

    Google Scholar 

  2. D-H. Kim, Y-Z. Cho, Y-Y. An, and Y. Kwon, “A Scalable Consolidation Algorithm for Point-to-Multipoint ABR Flow Control in ATM Networks,” in Proceedings of ICC’99, vol. 1, pp. 118–123, Jun. 1999.

    Google Scholar 

  3. Y-Z. Cho, S-M. Lee and M-Y. Lee, “An Efficient Rate-Based Algorithm for Point-to-Multipoint ABR Service,” in Proceedings of IEEE GLOBECOM’97, Dec. 1997.

    Google Scholar 

  4. S. Fahmy, R. Jain, S. Kalyanaraman, R. Goyal, B. Vandalore, and X. Cai, “Performance analysis of ABR point-to-multipoint connections for bursty and nonbursty traffic with and without VBR background,” ATM Forum/97-0422, Apr. 1997.

    Google Scholar 

  5. L. Roberts, “ Rate based algorithm for point to multipoint ABR service,” ATM Forum/94-0772R1, Nov. 1994.

    Google Scholar 

  6. H.-Y. Tzeng and K.-Y. Siu, “On Max-Min Fair Congestion Control for Multicast ABR Service in ATM,” IEEE Journal on Selected Areas in Communications, vol. 15, no. 3, pp. 545–555, Apr. 1997.

    Article  Google Scholar 

  7. W. Ren, K.-Y. Siu, and H. Suzuki, “On the performance of congestion control algorithms for multicast ABR service in ATM,” in Proceedings of IEEE ATM’96, Aug. 1996.

    Google Scholar 

  8. R. Jain, S. Kalyanaraman, R. Goyal, S. Fahmy, and R. Viswanathan, “ERICA Switch Algorithm: A Complete Description,” ATM Forum/96-1172, Aug 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shamsuzzaman, M., Gupta, A.K., Lee, BS. (2001). A New Consolidation Algorithm for Point–to–Multipoint ABR Service in ATM Networks. In: Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47734-9_81

Download citation

  • DOI: https://doi.org/10.1007/3-540-47734-9_81

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42303-4

  • Online ISBN: 978-3-540-47734-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics