Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Computer networks (3rd ed.)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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 methods. Under certain (and almost) practical premises about the network topology, an end-to-end implementation of well-known proportional and minimum potential delay fair rate allocation algorithms 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 ones in convergence rate.