Congestion control algorithm based on global optimization

According to the wide area network model, an Internet congestion control was formulated as a constrained convex programming problem to maximize the total utility of all sources over their transmission rates. Based on this formulation, the congestion control can be solved by means of a gradient projection algorithm with proper rate iteration. The algorithm can be separated into two parts including the router and the source by explicit congestion notification technology. The advantages of the scheme are fast convergence and robustness; it can provide the network with zero packet loss by properly choosing the queue threshold and send differentiated service to users by applying different utility functions.