Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.comcom.2004.07.004
Title: Protocols for rapid restoration in WDM optical networks
Authors: Sivakumar, C.
Mohan, G. 
Keywords: Distributed protocol
Protection
Restoration
Survivability
WDM optical networks
Issue Date: 31-Jan-2005
Source: Sivakumar, C., Mohan, G. (2005-01-31). Protocols for rapid restoration in WDM optical networks. Computer Communications 28 (1) : 86-96. ScholarBank@NUS Repository. https://doi.org/10.1016/j.comcom.2004.07.004
Abstract: Wavelength division multiplexing (WDM) networks have become a viable solution to meet the increasing bandwidth demand. These networks carry messages in the optical domain at data rates of several gigabits per second. Such high data rates make it necessary for using efficient restoration protocols in an event of a failure. This paper addresses the issue of dynamic path-based restoration in WDM optical networks. Dynamic restoration protocols can be used for restoring unprotected paths, that is, paths that do not reserve backup paths in advance. Our objective is to develop protocols that ensure rapid recovery while keeping the restoration ratio high. We develop two distributed dynamic restoration protocols called disjoint path-wavelength grouping (PWG) protocol and disjoint weighted PWG protocol. Those protocols group all the candidate backup paths of the failed paths into path-disjoint groups before assigning wavelengths to them. This allows the failed paths to search different sets of wavelengths on various candidate backup paths in parallel without any reservation conflicts. Also, it does not require any reservation retries, thus resulting in rapid restoration. The grouping method attempts to restore increased number of failed paths by allowing increased number of wavelengths to be searched on a path. We also consider the problem of prioritizing the paths where high-priority paths have better chances of recovery than the low-priority paths. The effectiveness of the proposed protocols is verified through extensive simulation results. © 2004 Elsevier B.V. All rights reserved.
Source Title: Computer Communications
URI: http://scholarbank.nus.edu.sg/handle/10635/57144
ISSN: 01403664
DOI: 10.1016/j.comcom.2004.07.004
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

3
checked on Nov 18, 2017

Page view(s)

15
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.