An Advanced Exponential Max-Min Kelly Control

摘要

EMKC is an explicit congestion control algorithm which is designed for high bandwidth delay product (BDP) networks. Although delay-independence is an appealing characteristic, the EMKC system developed in exhibits undesirable equilibrium properties and slow fairness convergence behavior. To overcome these drawbacks, we propose a new method called AEMKC (Advanced Exponential Max-Min Kelly Control). In this paper, we investigate AEMKC, prove its stability with heterogeneous delay, study the convergence behavior of AEMKC, and also examine how to implement AEMKC flows briefly. Extensive simulations confirm that AEMKC eliminates stationary packet loss while speeding up the fairness convergence rate. Simulations also show that AEMKC preserves the good properties of EMKC, such as delay-independent stability and max-min fairness in steady state.