Weighted fairness with MCR guarantee and a general-purpose explicit rate allocation algorithm for ATM ABR service

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

Citing 8
Cited 0

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
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
The available bit rate service for data in ATM networks

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

IEEE Communications Magazine
The rate-based flow control framework for the available bit rate ATM service

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.24

Visualization

Abstract

In this paper, weighted fair rate allocation for ATM available bit rate (ABR) service is discussed with the concern of the minimum cell rate (MCR). Weighted fairness with MCR guarantee has been discussed recently in the literature. In those studies, each ABR virtual connection (VC) is first allocated its MCR, then the remaining available bandwidth is further shared among ABR VCs according to their weights. For the weighted fairness defined in this paper, the bandwidth is first allocated according to each VC's weight; if a VC's weighted share is less than its MCR, it should be allocated its MCR instead of the weighted share. This weighted fairness with MCR guarantee is referred to as extended weighted (EXW) fairness. Certain theoretical issues related to EXW, such as its global solution and bottleneck structure, are first discussed in the paper. A distributed explicit rate allocation algorithm is then proposed to achieve EXW fairness in ATM networks. The algorithm is a general-purpose explicit rate algorithm in the sense that it can realise almost all the fairness principles proposed for ABR so far whilst only minor modifications may be needed.