A study of the generalised max–min fair rate allocation for ABR control in ATM


Autoria(s): Long, Y.H.; Ho, T.K.; Rad, A.B.; Lam, S.P.S.
Data(s)

1999

Resumo

In the rate-based flow control for ATM Available Bit Rate service, fairness is an important requirement, i.e. each flow should be allocated a fair share of the available bandwidth in the network. Max–min fairness, which is widely adopted in ATM, is appropriate only when the minimum cell rates (MCRs) of the flows are zero or neglected. Generalised max–min (GMM) fairness extends the principle of the max–min fairness to accommodate MCR. In this paper, we will discuss the formulation of the GMM fair rate allocation, propose a centralised algorithm, analyse its bottleneck structure and develop an efficient distributed explicit rate allocation algorithm to achieve the GMM fairness in an ATM network. The study in this paper addresses certain theoretical and practical issues of the GMM fair rate allocation.

Identificador

http://eprints.qut.edu.au/38470/

Publicador

Elsevier

Relação

DOI:10.1016/S0140-3664(99)00111-5

Long, Y.H., Ho, T.K., Rad, A.B., & Lam, S.P.S. (1999) A study of the generalised max–min fair rate allocation for ABR control in ATM. Computer Communications, 22(13), pp. 1247-1259.

Fonte

Faculty of Built Environment and Engineering; School of Engineering Systems

Palavras-Chave #010206 Operations Research #080503 Networking and Communications #Available bit rate service #Generalised max–min fairness #Rate-based flow control
Tipo

Journal Article