Performance Evaluation of Shared Mesh Protection in WDM Networks

Abstract

The efficient use of network capacity in shared restoration schemes strongly depends upon the path selection procedure. In this paper we propose and evaluate path selection algorithms for sharable and restorable connections in optical networks. Namely, two distributed path selection algorithms are proposed. The first approach maintains global information on network resource usage to determine link sharability and compute optimal shared paths. The second approach only relies upon local information maintained at each node. Subsequently, we present an analytical model to evaluate the performance of these path selection algorithms and show its accuracy through numerical examples. Results indicate that path selection algorithms that maximally exploit the use of reserved sharable channels do not necessarily result in fast restoration; rather these two optimality criteria can conflict most of the time. Additionally, algorithms that maximally exploit the sharability condition typically result in lower scalability and higher complexity.