Weighted fairness with MCR guarantee and a general-purpose explicit rate allocation algorithm for ATM ABR service
✍ Scribed by Y.H. Long; T.K. Ho; A.B. Rad
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 252 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0140-3664
No coin nor oath required. For personal study only.
✦ Synopsis
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 ®rst allocated its MCR, then the remaining available bandwidth is further shared among ABR VCs according to their weights. For the weighted fairness de®ned in this paper, the bandwidth is ®rst 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 ®rst 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 modi®cations may be needed.