Least Square Approach to Multi-Path Maxmin Rate Allocation
Dan-han Tsai, Thomas Liau, Wei Tsai · 2006
The maxmin fair bandwidth allocation has been proposed as a flow control mechanism for managing the data traffic in connection-oriented networks. This paper devises a fast convergence algorithm based on the least square approach to solve multi-level multi-path maxmin problems. We prove that the least square result obtained by our method converges to the optimal solution which is multi-level multi-path maxmin. Our approach is the only known algorithm that can achieve lexicographical separation among the many maxmin levels