Research On Restoration Strategies And Algorithms For Intelligent Optical Network Based On SRLG Constraint

Communication technology has become an important force to lead the trend of information, a strong impetus of the human society forward to the direction of information society. Optical Network, with its great advantages, has become a future national information infrastructure building an important cornerstone. ASON (Automatically Switched Optical Network) technology, as a typical representative of the ION (Intelligent Optical Network), has unprecedented flexibility and scalability, has become a trend in the evolution of next-generation optical networks. Network’s survivability has become one of the considerable aspects in Intelligent Optical Network design and operates&maintains, ASON carrying a variety of traffic, requirements on the network with fast, intelligent fault resilience and diversity, and requested reasonable and effective allocation of network resources; provide rapid recovery, which has become the ASON functional core and advantage. Protection and restoration is to achieve network survivability’s two mechanisms. Relative to the protection mechanism, restoration mechanism does not require pre-allocation of bandwidth resources, and the network can dynamically search for the remaining resources, have higher resource utilization ratio. At present, based on traditional optical transport network designed a series of restoration mechanism is far from meeting the requirements of ASON on the survivability. Therefore, the problem about restoration mechanism in ASON has become the focus of the direction of ASON.This thesis is based on studying in-depth ASON architecture, and network’s survivability issues, in particular restoration mechanism, and several existing algorithms based on SRLG-constraint on the survival networks. Combined with the SRLG cost of each link and sharing the bandwidth costs for restoration. using D*algorithm’s main ideas and principles of mixed strategy game to build the dynamics of heuristic function, proposing a dynamic equilibrium based on SRLG-constraints restoration algorithm-DRRSC (Dynamitic Routing Restoration with SRLG Constraint). Its purpose is rapidly run restoration mechanism when the network faults, and rationally using the network resources, enhancing the resource utilization ratio in the network. By simulating on GLASS platform to validate the DRRSC algorithm, comparing of SPR (Shortest Path Restoration) algorithm. and comprehensive analyzing on two algorithms’ performances about the blocking ratio, restoration ratio, resource utilization ration and restoration time and so on, the results show that DRSSC algorithm can effectively reduce the blocking rates, promote the restoration rates and resource utilization rates, thereby enhance substantially the network’s survivability.