Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Network flow control is formulated as a global optimization problem of user profit in this paper. A general global optimization flow control model is used to study the global rate allocation characteristic of TCP congestion control mechanism. It is proved that with active queue management TCP rates tend to be allocated to maximize the aggregate of a user utility function Us (called Us fairness) when the network reaches equilibrium. Compared with other fairness criteria, Us fairness is a more general conclusion because it considers the arbitrary topology and heterogeneous RTT case. A typical multi-bottleneck topology is used to validate Us fairness. Simulation results show the global rate allocation of TCP tends to accord with Us fairness in most scenarios.