Translator Disclaimer
7 October 1998 Dynamic subsecond restoration on WDM transport networks
Author Affiliations +
Developing an efficient restoration strategy assumes a greater significance in a WDM backbone than a conventional WAN backbone due to the fact that a single link carries an enormous amount of bandwidth. This paper provides a summary of results of our spare capacity planning and restoration schemes on Pan-American and Pan-European networks. The spare capacity planning for both path and link based restoration are considered and their costs compared. Distributed and centralized restoration schemes, which have no preplanning and no a priori knowledge of the network capacities, are simulated on these networks for single link failures. Both link and path restorations are considered. We compare the restoration times of the various scenarios (centralized- link, distributed-link, centralized-path, distributed-path restorations) that arise in these two networks and show that our algorithms were able to achieve 100% restoration under a second for the networks considered. Our results show that centralized restoration can be faster than distributed restoration. This is against the common belief that distributed restoration is faster than the centralized restoration. We also analyze why this happens and the conditions (traffic matrix) under which the distributed restoration may be faster than the centralized. Additionally, we show that a centralized link restoration is always faster than a distributed link restoration.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Rajesh Jagannathan, Sridhar Alagar, Mathieu Garnot, Francesco B. Masetti, and S. Venkatesan "Dynamic subsecond restoration on WDM transport networks", Proc. SPIE 3531, All-Optical Networking: Architecture, Control, and Management Issues, (7 October 1998);

Back to Top