Design And Simulated Implementation Of Protection Routing Algorithms In WBS Multi-domain Optical Networks

With the development of WDM technology, the number of the wavelengths per fiber is becoming large. It brings about a tremendous increase in the size of traditional optical cross-connects, as well as the cost and difficulty associated with controlling and management of such large cross connects. In order to reduce the high cost and complexity of switches, the field proposed Waveband Switching technology that allows several wavelengths to be grouped into a waveband through a port to switch, thus the switching ports and the expense can be saved. At the same time, the optical network carries a lot of traffic and then any breakdown may lead to huge loss. In addition, because there are several network operators, the actual backbone optical network is the multi-domain structure, and each domain is an independent region of routing and restoration. Therefore, besides considering the routing of inter-domain and intra-domain, it is necessary to study and solve the survivability in WBS multi-domain optical networks.This thesis mainly studies the traffic grooming and survivability problems in dynamic WBS multi-domain optical networks. The main idea of WBS algorithm is to reduce the ports of multi-granularity optical cross-connect and to achieve a tolerable blocking probability through the effective waveband grooming algorithm and resources assignment. The main idea of protection algorithm is to realize the protection of single-link failure through assigning link-disjoint protection path or sub-protection path for working path of each request.In this thesis, Chapter 2 introduces the waveband switching technology in WDM optical network. Chapter 3 defines three routing graphs for traffic grooming including virtual topology graph, waveband layered graph and integrated grooming graph, and then designs two dynamic grooming algorithms named Multi-Domain waveBand Routing Algorithm and Multi-Domain waveBand Integrated Grooming Algorithm. Based on integrated grooming graph, Chapter 4 designs two multi-domain dedicated path protection algorithms, which are respectively Intra-domain Segment Dedicated Protection algorithm and Span Domain Dedicated Protection algorithm. The algorithms which designed in this thesis are carried on the simulation and analysis in Chapter 5. The simulation results show that, the two designed algorithms can effectively decrease the network blocking probability and port-cost.