A high-speed minimum potential delay-fair rate allocation algorithm

Fairness is an important aspect of any rate allocation strategy. Many fairness criteria have been proposed by different researchers. Mo and Walrand have introduced the notion of (Ω,α)-fairness in their pioneering work in 2000. Different fairness criteria such as proportional, minimum potential delay and max-min fairness are derived as special cases of (Ω,α)-fairness. In the current paper, a fast second-order rate allocation algorithm is proposed that can improve the convergence speed of conventional minimum potential delay fair rate allocation algorithm. Under certain (and almost) practical premises about the network topology, an end-to-end implementation of well-known minimum potential delay fair rate allocation algorithm is introduced. The proposed algorithm has been compared with the conventional method and TCP using simulation. The simulation results show that the proposed method outperforms the conventional one in convergence rate.