Fair flow control of ABR service by per-VC virtual queuing

Authors:
Y. H. Long;T. K. Ho;A. B. Rad
Affiliations:
Department of Electrical Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China;Department of Electrical Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China;Department of Electrical Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China
Venue:
Computer Communications
Year:
2000

Citing 10
Cited 1

Time scale analysis scalability issues for explicit rate allocation in ATM networks

IEEE/ACM Transactions on Networking (TON)
Congestion control and traffic management in ATM networks: recent advances and a survey

Computer Networks and ISDN Systems
Phantom: a simple and effective flow control scheme

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
An efficient rate allocation algorithm for ATM networks providing max-min fairness

Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
Improved virtual queueing and dynamic EPD techniques for TCP over ATM

ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
A new rate-based switch algorithm for ABR traffic to achieve max-min fairness with analytical approximation and delay adjustment

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Performance of TCP over UBR in ATM with EPD and virtual queuing techniques

Computer Communications
The available bit rate service for data in ATM networks

IEEE Communications Magazine
Round-robin scheduling for max-min fairness in data networks

IEEE Journal on Selected Areas in Communications
Weighted round-robin cell multiplexing in a general-purpose ATM switch chip

IEEE Journal on Selected Areas in Communications

Congestion control based on optimal problem for long range dependence network

Journal of High Speed Networks

Quantified Score

Hi-index	0.24

Visualization

Abstract

In this paper, a rate-based flow control scheme based upon per-VC virtual queuing is proposed for the Available Bit Rate (ABR) service in ATM. In this scheme, each VC in a shared buffer is assigned a virtual queue, which is a counter. To achieve a specific kind of fairness, an appropriate scheduler is applied to the virtual queues. Each VC's bottleneck rate (fair share) is derived from its virtual cell departure rate. This approach of deriving a VC's fair share is simple and accurate. By controlling each VC with respect to its virtual queue and queue build-up in the shared buffer, network congestion is avoided. The principle of the control scheme is first illustrated by max-min flow control, which is realised by scheduling the virtual queues in round-robin. Further application of the control scheme is demonstrated with the achievement of weighted fairness through weighted round robin scheduling. Simulation results show that with a simple computation, the proposed scheme achieves the desired fairness exactly and controls network congestion effectively.