Heuristic algorithms for locating the wavelength converters in WDM network
WDM网络中确定波长变换器位置与数目的启发式算法

In this paper, three heuristic algorithms are presented about deciding how many converters are needed in the best nodes of WDM network. By simulating in NSFNET, ARPANET and CERNET, the performances of three algorithms are compared. The results show that performance of the Algorithm 1 is the best and its complexity is the lowest. Furthermore, by using the Algorithm 1 in the best nodes and all nodes, it is found that the-performance of wavelength converters equipped in the best nodes is not worse than that in all nodes, so the cost and complexity of OXC in the network are reduced.