Generalized max-min rate allocation: Theory and a simple implementation

Citation
Yt. Hou et al., Generalized max-min rate allocation: Theory and a simple implementation, J COMMUN N, 2(3), 2000, pp. 277-286
Citations number
9
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
JOURNAL OF COMMUNICATIONS AND NETWORKS
ISSN journal
12292370 → ACNP
Volume
2
Issue
3
Year of publication
2000
Pages
277 - 286
Database
ISI
SICI code
1229-2370(200009)2:3<277:GMRATA>2.0.ZU;2-3
Abstract
An important concept in the available bit rate (ABR) service model is the m inimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constr aint for each how Due to the MCR and PCR requirements, the well-known max-m in rate allocation policy no longer suffices to determine the rate allocati on for each flow since it does not support either MCR or PCR, In this paper we present a generalized max-min (GMM) rate allocation policy, which suppo rts both the MCR and PCR requirements for each flow. Furthermore, a simple distributed algorithm using the ABR flow control protocol is developed to a chieve the GMM rate allocation in a distributed network environment, The ef fectiveness of this distributed algorithm is demonstrated by simulation res ults.