Home        Author Index        Search                 Volume 1      May 2009      ISSN 1797-9617

International Journal of

Recent Trends in Engineering

Home > Vol. 1, No. 1


International Journal of Recent Trends in Engineering (IJRTE)

ISSN 1797-9617

Volume 1,  Number 1,  May 2009

Issue on Computer Science

Page(s): 478-482

Network Survivability for a Regular WDM Optical Network from Double-Link Failures Using Greedy Algorithm

           Kalamani.K, Palaniswami.S, and Nagarajan.N

Full text:  PDF


Network survivability is an important requirement in high-speed optical networks. The survivability of these networks from the failure of a single component such as a link or a node needs some typical approaches. In this paper, we have considered double-link failures in a hypercube optical network and present three loopback methods suggested by the researchers for handling such failures. In the first two methods, two edge-disjoint backup paths are computed for each link for rerouting traffic when a pair of links fails. These methods require the identification of the failed links before recovery can be completed. The third method requires the pre-computation of a single backup path and does not require link identification before recovery. The greedy algorithm is used for all the three methods. Protection capacity, restorability, worst-case and average hop-length, worst-case and average number of connections are used as performance measures in our analysis. Numerical results comparing the performance of these methods using this algorithm suggest that it is possible to achieve almost 100% recovery from double–link failures with a moderate increase in backup capacity for the given network.

Index Terms

Hypercube network, wavelength division multiplexing, 3-edge connected graph, double-link failures, shared risk link group, loop back recovery, greedy algorithm

Published by Academy Publisher in cooperation with the ACEEE

@ Copyright 2009 ACADEMY PUBLISHER — All rights reserved