A resource management algorithm based on multi-path max-min fairness

The Bandwidth Broker proposed to manage the resources for DiffServ networks has two ways to implement, namely centralized and distributed approach. The distributed Bandwidth Broker offers scalability advantages over the centralized one, but the improper pre-compute of resource will make its bandwidth allocation unfair. The solution to this issue is characterized by a new fairness criterion, multi-path max-min fairness. In this paper, we generalize single-path max-min fairness to multi-path, and show that the multi-path max-min fairness allocation is relevant to bottleneck links. Based on multi-path max-min fairness, we propose a new resource management algorithm for the distributed Bandwidth Broker scheme. The experiment results show that our resource management algorithm is better than previous one from the aspect of fairness.