Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/1891

A fast switch algorithm for ABR traffic to achieve max-min fairness

Authors Tsang, Danny H. K.
Wong, Wales Kin Fai
Jiang, Shengming
Liu, Eric Y. S.
Issue Date 1996
Source Proceedings of International Zurich Seminar on Digital Communications '96, Zurich , ,1996, Februar, p. 161-172
Summary In this paper, a new rate-based switch mechanism is proposed for flow control of ABR traffic. By making use of the most up-to-date information from both the upstream and the downstream paths, the current bottleneck of the VC can quickly be found. The bandwidth allocation for different VCs can then be adjusted by using this new bottleneck information to achieve max-min fairness allocation. We compare the proposed scheme to CAPC and ERICA. Simulation results showed that the transient response times of the sources are significantly reduced in the proposed scheme. Furthermore, the peak queue lengths of the switches are generally smaller.
Subjects
Language English
Format Conference paper
Access
Files in this item:
File Description Size Format
waizs961.pdf pre-published version 207561 B Adobe PDF