A local fairness algorithm for the MetaRing, and its performance study

It is shown that the local fairness algorithm given can exploit the throughput advantage offered by spatial reuse better than a global fairness algorithm. This is because it ensures fair use of network resources among nodes competing for the same subset of links, while permitting free access to noncongested parts of the network. The performance advantage of this local fairness scheme is demonstrated by simulating the system under various traffic scenarios, and the results are compared to results for the MetaRing SAT-based fairness algorithm. It is also shown that under certain traffic patterns, the performance of this algorithm achieves the optimal throughput result predicted by the known max-min fairness definition.<
>