Data networks
Congestion control and traffic management in ATM networks: recent advances and a survey
Computer Networks and ISDN Systems
A Fast Switch Algorithm for ABR Traffic to Achieve Max-Min Fairness
IZS '96 Proceedings of the 1996 International Zurich Seminar on Digital Communications: Broadband Communications - Networks, Services, Applications, Future Directions
The rate-based flow control framework for the available bit rate ATM service
IEEE Network: The Magazine of Global Internetworking
Phantom: a simple and effective flow control scheme
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
The ERICA switch algorithm for ABR traffic management in ATM networks
IEEE/ACM Transactions on Networking (TON)
On determining the fair bandwidth share for ABR connections in ATM networks
Journal of High Speed Networks
Improvement of Traffic Load Measurement Mechanism of ATM Switches in Presence of VBR Traffic
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
A study of the generalised max-min fair rate allocation for ABR control in ATM
Computer Communications
Fair flow control of ABR service by per-VC virtual queuing
Computer Communications
Design and analysis of a merging algorithm for multipoint-to-point ABR service in ATM networks
Computer Communications
A flow control scheme on ATM networks with max-min fairness
Computer Communications
ABR traffic management using minimal resource allocation (neural) networks
Computer Communications
Hi-index | 0.00 |
In this paper, a new rate-based switch mechanism for ABR traffic in ATM networks, which aims to rapidly achieve max-min fairness allocation, is proposed. Simulation results show that the proposed scheme can out-perform both CAPC [AF94-0983] and ERICA [AF95-0178] in terms of response times and peak queue lengths. An analytical approximation of the performance is also introduced and its accuracy is found to be close to the simulation results. A variant of the proposed scheme is presented for handling the problem of different source-to-bottleneck separations. By using this scheme, the peak queue lengths at the switches can further be reduced without any degradation in throughput.