A simple approach to congestion control of ABR traffic with weighted max-min fairness

Authors:
Rohan De Silva
Affiliations:
School of Information Systems, Technology & Management, University of New South Wales, Sydney, Australia
Venue:
ICECS'03 Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing
Year:
2003

Citing 7
Cited 0

Feedback control of congestion in packet switching networks: the case of a single congested node

IEEE/ACM Transactions on Networking (TON)
Intelligent congestion control for ABR service in ATM networks

ACM SIGCOMM Computer Communication Review
Computer-controlled systems (3rd ed.)

Computer-controlled systems (3rd ed.)
The ERICA switch algorithm for ABR traffic management in ATM networks

IEEE/ACM Transactions on Networking (TON)
Design and Analysis of Queue Control Functions for Explicit Rate Switch Schemes

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Design of a new globally stable explicit rate controller for ABR service with saturation

Computer Communications
Allocating fair rates for available bit rate service in ATM networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a simple algorithm called SAFARI (Simple Approach to Fair Allocation of Rate Indication) for the congestion control of available bit rate (ABR) service of asynchronous transfer mode (ATM) networks. The ATM Forum specifies a category of switches known as explicit rate (ER) switches that computes an ER for each source to satisfy a fairness criterion. To compute ER, an ATM switch needs to measure a number of traffic parameters on-line. There are a number of congestion control schemes for ABR service but SAFARI scheme is less complex compared to both the load factor-based schemes that require the measurement of many variables and the queue-level-based schemes that require much computation. As opposed to other load factor-based schemes, we measure only the number of virtual circuits, target rate and the load on the switch. This eliminates the need for the maintenance of any table of rates or the reading of rates off the forward resource management cells. Furthermore, as opposed to our method, the computational complexity of other schemes increases considerably when used for weighted max-min fairness criterion with non-zero minimum cell rate (MCR). Performance of this scheme has been studied via simulations on a GFC-II network.