Paper Info
Title
A control-theoretic ABR explicit rate algorithm for ATM switches with per-VC queueing
Abstract
There have been numerous studies on congestion control for the ABR service in ATM networks. These studies typically focus on the performance and fairness of the algorithms and make simplistic assumptions regarding the switch architecture and the link scheduling. One central issue of these studies has been the computation of the fair share of the link bandwidth. On the other hand, newer generation of ATM chipsets and switches now implement per-VC queueing and scheduling that is capable of providing flow isolation as well as fair sharing of the link bandwidth among contending connections. As a result, ABR congestion control algorithms can now focus on solving the congestion control problem without unnecessarily being burdened by fairness considerations. In this paper, we take advantage of the per-VC queueing/scheduling capability of the new generation of ATM switches and develop an ABR rate-based congestion control algorithm. In contrast to most algorithms that appeared in the literature which are heuristics-based, this algorithm extends previous work (see IEEE/ACM Trans. on Networking, vol.1, no.6, p.693-707, 1993) using a control-theoretic approach and takes advantage of the per-VC queue length information to achieve a simple to implement and yet complete control of the stability, rate of convergence, and performance of ABR service. Simulation results confirm the excellent performance and fairness characteristics achieved by the algorithm
Year
DOI
Venue
1998
10.1109/INFCOM.1998.659653
INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Keywords
Field
DocType
asynchronous transfer mode,control theory,queueing theory,scheduling,telecommunication congestion control,ABR explicit rate algorithm,ABR rate-based congestion control algorithm,ABR service,ATM switches,congestion control,control-theoretic approach,convergence rate,fairness characteristics,flow isolation,link bandwidth,link scheduling,per-VC queueing,simulation results,stability
Scheduling (computing),Computer science,Queue,Algorithm,Computer network,Asynchronous Transfer Mode,Flow control (data),Bandwidth (signal processing),Queueing theory,Network congestion,Atmosphere (unit),Distributed computing
Conference
Volume
ISSN
ISBN
1
0743-166X
0-7803-4383-2
Citations 
PageRank 
References 
26
3.62
10
Authors
2
Name
Order
Citations
PageRank
Lotfi Benmohamed1196110.05
Yung-terng Wang229960.29