All-optical Network Routing Optimization Design And Algorithm Research

As more and more users'usage patterns evolve to include more and more bandwidth intensive networking applications such as data browsing on the world wide web (WWW), java applications, video conferencing, etc. , it emerges an acute need for very high bandwidth transport network, whose capabilities are much beyond those that current high speed(ATM) networks can provide. WDM all-optical network can meet the need of modern network communication with good performance.This paper studies the wavelength-rounting all-optical networks without wavelength converters. Reasonable RWA algorithm can be employed to distribute the hardware resourses of the networks effectively and to reduce the blocking probability of the operation requests, as a result the network cost can be considerably diminished and the network performance greatly improved. First, the growing history and the basic principle of the WDM optical networks are introduced, then the construct of the WDM all-optical networks is discussed, physical topology and logical topology and so on. Then, the routing technology in WDM system is presented in this paper, as well as key optical components in optical networks. The routing and wavelength assignment issue in the optimal design of RWA algorithm is particularly explored. In addition, a model is presented to analyse the blocking probability problem. By using alternative routing method with adaptive element, the new dynamic RWA algorithm guarantees low blocking probability and high tolerance of the network mistakes. A shorter delay time is achieved by considering the first K links information to find a available route. The priority-based wavelength assignment method is employed to meet different operation requests. Another RWA algorithm based on the layered-gragh model is used to resolve the two subproblems of routing and wavelength assignment simultaneously. Finally the program code executing a heuristic algorithm and the simulation results are showed to demonstrate the achievement of the lightest weights of routing.