Design And Simulated Implementation Of Protection Routing Algorithms Based On The Sharable Degree Of Wavelengths And The Number Of Ports Constraint In WBS Networks

With the development trend of super-speed and super-capacity in optical networks, the number of wavelengths per fiber keeps growing, so that the size and the cost of convetional Optical Cross-Connects (OXCs) increase. At this situation, the technology of Waveband Switching (WBS) has got more attention since it is capable of switching an entire group of wavelengths by one port for reducing the number of ports and the total cost of the network. Meanwhile, the research on survivability in optical networks is an important issue since the optical network carries huge amounts of data and any failure may lead to a lot of traffic lost.This thesis focuses on the design and simulated implementation of protection routing algorithms based on the sharable degree of wavelengths and the number of ports constraint in WBS networks. The chapter two of this thesis presents a waveBand Layered Auxiliary Graph (BLAG) to solve the grooming problem of Label Switched Path (LSP) with wavelength granularity. The chapter three designs four dynamic multi-layered protection algorithms in WBS network; that is, End to end waveBand Dedicated Protection (EBDP), Sub-path waveBand Dedicated Protection (SBDP), End to end waveBand Shared Protection (EBSP), and Sub-path waveBand Shared Protection (SBSP).Chapter four develops the simuation software based on VC++ flatform. In simulation, the designed four algorithms are compared by some parameters, such as blocking probability, average port-cost and bandwidth utilization ratio. This chapter also studies the performance effect of wavelength sharable degree by the port number. The simulation results show that higher wavelength shareble degree will lead to less saved ports.