This means that when S ≠ S 1, ′ we can always identify atleast one node v ∈ S (β v > 0) such that v ∉ S 1 ′ <strong>and</strong> moveit out of S. Clearly,<strong>in</strong>atmostN −|S 1| ′ iterations, we willhave S = S 1. ′ This shows that we have computed S 1 ′ <strong>and</strong> theb<strong>and</strong>width value for S 1 ′ (α 1 ) correctly.For general k, 1
1210MBAMMBALMMBA400350300B<strong>and</strong>width864<strong>Throughput</strong>2502001501005020MBA MMBA LMMBA01 5 10 15 20 25 30Sorted Node IndexFig. 8. Network throughput (n =25,N =20,C =12,CAP =53.9)Fig. 5. B<strong>and</strong>width allocation (n =35,N =30,C =3,CAP =10.9)<strong>Throughput</strong>1101009080706050B<strong>and</strong>width5550454035302520MBAMMBALMMBA403020100MBA MMBA LMMBA1510501 5 10 15 20 25 30Sorted Node IndexFig. 6. Network throughput (n =35,N =30,C =3,CAP =10.9)Fig. 9. B<strong>and</strong>width allocation (n =35,N =30,C =12,CAP =53.9)55504540MBAMMBALMMBA500450400350B<strong>and</strong>width3530252015105<strong>Throughput</strong>300250200150100500MBA MMBA LMMBA01 5 10 15 20Sorted Node IndexFig. 10. Network throughput (n =35,N =30,C =12,CAP =53.9)Fig. 7. B<strong>and</strong>width allocation (n =25,N =20,C =12,CAP =53.9)That is to say, based on the MBA scheme, some of users willnot be able to access the network at all, which is def<strong>in</strong>itelynot desirable. Compared with the MBA scheme, the MMBAscheme improves the fairness somehow, without sacrific<strong>in</strong>gthe network throughput too much. It guarantees every nodebe allocated some reasonable amount of b<strong>and</strong>width. For thecases <strong>in</strong> which the network resources are relatively sparse(C = 3,CAP = 10.9), the throughput provided by theMMBA scheme is very close to the maximum throughput,which can be seen from Fig. 4 <strong>and</strong> 6. As expected, amongthe three b<strong>and</strong>width allocation schemes, the LMMBA schemeachieves fairest b<strong>and</strong>width allocation. If the b<strong>and</strong>width isallocated us<strong>in</strong>g the LMMBA scheme, we observe from theresults that the nodes are partitioned to several groups (usuallythe number of groups is very small) <strong>and</strong> with<strong>in</strong> each group,all nodes are allocate exactly the same amount of b<strong>and</strong>width.The throughput provided by the LMMBA scheme is alwayssmaller than that provided by the other two schemes, especiallyThis full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication <strong>in</strong> the Proceed<strong>in</strong>gs IEEE Infocom.