Abstract
Congestion control is an important function of traffic management in Asynchronous Transfer Mode (ATM) networks. Available Bit Rate (ABR) is a category of service for ATM networks wherein the source adapts its generation rate to network conditions based on feedback. In this paper we study closed-loop ABR congestion control using special cells called Resource Management (RM) cells to relay feedback to the source. In particular, we investigate both the effectiveness of rate-based ABR congestion control in the presence of bursty source traffic and the relationship between the burst time scale and the ABR control time scale. Two ABR congestion control schemes, the ABR Explicit Forward Congestion Indication (EFCI) and ABR Congestion Indication (CI) schemes, are compared with Unspecified Bit Rate (UBR) transport which makes no effort to control congestion. Traffic sources of various burst lengths of 100, 1000, 10000, and an equal mix of 100 and 10000 cells are used in simulations. It is found that ABR congestion control effectively controls low frequency, medium to long term traffic load transients, but does not control high frequency, short term load transients. In the latter case, ABR control is not necessary since short term transients do not require large amount of buffering. Of the two ABR schemes considered, the more sophisticated ABR CI scheme performs significantly better than the ABR EFCI scheme in terms of delay and buffer occupancy.
Chapter PDF
Similar content being viewed by others
Keywords
- Congestion Control
- Asynchronous Transfer Mode
- Link Utilization
- Buffer Occupancy
- Asynchronous Transfer Mode Network
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
ATM Forum Traffic Management Specification (1995) Version 4.0, Release 9.
Barnhart, A. W. (1995) Example Switch Algorithm for Section 5.4 of TM Specification, ATM Forum Contribution 95–0195 .
Bonomi, F. and Fendick, K. W. (1995) The Rate-Based Flow Control Framework for the Available Bit Rate ATM Service, IEEE Network Magazine, vol. 9, 25–39.
Chang, Y., Golmie, N. and Su, D. (1995) Study of Interoperability between EFCI and ER Switch Mechanisms for ABR Traffic in an ATM Network, IC3N 95, 1995 International Conference on Computer Communication Networks, 310–315.
Hluchyj, M. and Yin, N. (1994) On Closed-loop rate control for ATM networks, Proceedings of INFOCOM ’94, 99–108.
Ikeda, C., Suzuki, H., Osaki and Murata M. (1995) Recommendation Parameter Set for Binary Switch, ATM Forum Contribution 95–1482.
Kung, H. T. and Chapman, A. (1994) Credit-based flow control for ATM networks: Credit update protocol, adaptive credit allocation, and statistical multiplexing, The Proceedings of SIGCOMM ’94, vol. 24, 101–114.
Lee, D., Moh, W. M., Ramakrishnan, K. K. and Shankar, A. U. (1996) An Extended Finite State Machine Representation of the Source/Destination Behavior, ATM Forum Contribution 96–0231.
Ohsaki, H., Murata, M., Suzuki, H., Ikeda, C., and Miyahara, H. (1995) Rate-Based Congestion Control for ATM Networks, ACM SIGCOMM Computer Communication Review, 60–72.
Special issue on ‘Congestion control in high speed networks’, (1991) IEEE Communications Magazine vol. 29.
Woodruff, G. and Ksitpaiboon, R. (1990) Multimedia traffic management principles for guaranteed ATM network performance, IEEE Journal on Selected Areas in Communications, vol. 8, 437–446.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Hegde, M., Moh, W.M. (1996). Effect of Bursty Source Traffic on Rate-Based ABR Congestion Control Schemes. In: Mason, L., Casaca, A. (eds) Broadband Communications. BC 1996. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34987-9_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-34987-9_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2960-2
Online ISBN: 978-0-387-34987-9
eBook Packages: Springer Book Archive