On cost-based routing in connection-oriented broadband networks

We propose a distributed cost-based routing scheme which has much less complexity than the centralized least-cost routing. We evaluate the performance of two cost-based routing schemes and the results indicate that the discrepancy between the performance of both schemes is small. We also compare them with least-loaded routing to demonstrate the ability of cost-based routing in stabilizing the network performance under heavy traffic. In addition, to make cost-based routing a viable option for a high-speed network, we had developed a theory of cost quantization that can significantly reduce the complexity of cost computation. The paper also demonstrates that the degradation of network performance is insignificant while the cost quantization is applied to cost computation