(An) algorithm for the integrated model of routing and flow control in data communication networks

Abstract

This thesis deals with the integration of routing and flow control in virtual line-switched data communication networks. Based on the cost functions and constraints which incorporate the interactions between routing and flow control, a convex optimization problem is formulated in terms of average input rates and average link flows. The optimality conditions for the problem is derived and an algorithm is developed based on their implications. The algorithm consists of three phases; the first phase updates the network parameters, the second determines the input rates and the third determines the link flows. The descent property of the algorithm is proved and the distributive computation procedure of the algorithm at each node is discussed.