Optimal resource allocation under TCP Reno and Vegas in complex communication networks

The continuous growing number of applications in current communication networks highlights the necessity for efficient resource allocation strategies. Associated with the current widely-used TCP Reno and Vegas protocols, we build an optimization problem to find the optimal resource allocation strategy. The optimization problem is solved by using the Lagrangian dual method and the exact solution is derived. This optimal strategy can guarantee the globally optimal traffic performance compared with other resource allocation strategies.