IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 13, NO. 1, FEBRUARY 2005.
This paper is aimed at designing a congestion control system that scales gracefully with network capacity, providing high utilization, lowqueueing delay, dynamic stability, and fairness among users. The focus is on developing decentralized control laws at end-systems and routers at the level of fluid-flowmodels, that can provably satisfy such properties in arbitrary networks, and subsequently approximate these features through practical packet-level implementations.
Two families of control laws are developed. The first dual control law is able to achieve the first three objectives for arbitrary networks and delays, but is forced to constrain the resource allocation policy. We subsequently develop a primal-dual law that overcomes this limitation and allows sources to match their steady-state preferences at a slower time-scale, provided a bound on round-triptimes is known.
