Optimal capacity assignment in IP networks

We present an analysis of the problem of routing and bandwidth allocation problem in packet switched networks. In this problem, we identify a route for every pair of communicating nodes and then assign a capacity to each link in the network in order to minimize the total line capacity and delay costs. We have developed a mathematical programming formulation which is an efficient solution. This formulation is indicated to be effective procedure based on computational results across a variety of networks.