Multi-class Service Based on the Adaptive routing Algorithm in WDM networks

摘要

It is important to analyse blocking probability in the WDM networks. In this paper, we present an analytical model for supporting multi-class service with the blocking probability analysis and adaptive routing algorithm to solve the potential shortcomings in the real network. We make the use of the idea of segmented routes according to the finite wavelength conversion resources. We then combine the each segment to get the whole blocking probability. The results show that, by adopting the adaptive routing algorithms, the network can calculate the blocking probability for all the candidate routes, and the request which takes the highest priority will choose the minimum blocking probability route. There are two features in our paper. First, a method of segmented route is designed. Second, use k-shortest routing algorithm to get the minimum blocking probability routing between source node and destination node.