A study on the end-to-end protection and restoration alorithm in the IP over WDM network

Abstract

As Internet traffic is unexpectedly and rapidly growing, a single-link failure in networks can cause critical problems, especially, survivability. Because it can lead to the failure of all paths traversing the failed link, and thus result in significant loss of traffic. While, it is introduced the new architecture that directly transports IP traffic to optical networks and the concept of link-share, called shared risk link group that enables limited bandwidth to be used efficiently. In this thesis we propose the end-to-end protection and restoration algorithm considering link-shared to maximize resource efficiency in the IP over WDM network. In this algorithm, we use a hybrid approach, the combination with online path selection and offline path computation. First, we describe the IP over WDM network architecture based on an integrated model and its node architecture. And we analyze end-to-end protection and restoration schemes in terms of three main factors: restoration time, availability/blocking probability and bandwidth efficiency in the IP over WDM network. We get restoration time from operation procedure availability/blocking probability with the assumption of a queueing model. And we compare bandwidth efficiency in protection schemes.