  With the tremendous increase of the Internet traffic, achieving the best
performance with limited resources is becoming an extremely urgent problem. In
order to address this concern, in this paper, we build an optimization problem
which aims to maximize the total utility of traffic flows with the capacity
constraint of nodes and links in the network. Based on Duality Theory, we
propose an iterative algorithm which adjusts the rates of traffic flows and
capacity of nodes and links simultaneously to maximize the total utility.
Simulation results show that our algorithm performs better than the NUP
algorithm on BA and ER network models, which has shown to get the best
performance so far. Since our research combines the topology information with
capacity constraint, it may give some insights for resource allocation in real
communication networks.
