Using Advertised Rate for Multi-Path Relative Maxmin Routing

Maxmin is a flow control mechanism based on fairness criteria. In this paper we consider the problem of routing and maxmin rate allocation over a communication network. We present two contributions in this paper. The first contribution is to provide a new relative maxmin definition and to extend the concepts of advertised rate from single-path to multi-path networks. The second contribution is to propose a novel multi- path maxmin routing scheme based on new advertised rate algorithm. We prove that this new scheme will converge to relative maxmin solution.