Backup Reprovisioning After Shared Risk Link Group (SRLG) Failures in WDM Mesh Networks

Xu Shao; Yong Kee Yeo; Yuebin Bai; Jian Chen; Luying Zhou; Lek Heng Ngoh

doi:10.1364/JOCN.2.000587

Journal of Optical Communications and Networking
Vol. 2,
Issue 8,
pp. 587-599
(2010)
•https://doi.org/10.1364/JOCN.2.000587

Backup Reprovisioning After Shared Risk Link Group (SRLG) Failures in WDM Mesh Networks

Xu Shao, Yong Kee Yeo, Yuebin Bai, Jian Chen, Luying Zhou, and Lek Heng Ngoh

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Xu Shao, Yong Kee Yeo, Yuebin Bai, Jian Chen, Luying Zhou, and Lek Heng Ngoh, "Backup Reprovisioning After Shared Risk Link Group (SRLG) Failures in WDM Mesh Networks," J. Opt. Commun. Netw. 2, 587-599 (2010)

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Citation alert
Save article

Abstract

In this paper, we study the impact of shared risk link group (SRLG) failures on shared-path protection by examining the percentage of connections that are vulnerable after SRLG failures, investigate the benefits of backup reprovisioning after SRLG failures, and evaluate different policies for backup reprovisioning. Compared with single-link failures, SRLG failures leave many more connections unprotected and vulnerable to the next failures and make the network topology much sparser. The major challenge of backup reprovisioning after SRLG failures is how to find SRLG-disjoint backup paths for those unprotected connections with a recovery ratio that is as high as possible within reasonable computational complexity. We are motivated to consider three reprovisioning policies by considering different sequences of reprovisioning according to the degree of SRLG constraints. The first policy is to reprovision backup paths for connections whose working paths traverse more SRLGs first (Policy I), and the second policy is to reprovision backup paths for connections whose working paths traverse fewer SRLGs first (Policy II). The third policy is to do backup reprovisioning randomly, i.e., we pick up an unprotected working path randomly (random reprovisioning). Extensive simulation results show that 1) SRLG failures will leave more connections unprotected compared with single-link failures, and the percentage of connections left vulnerable tends to be proportional to the SRLG size; 2) the network performance based on the first reprovisioning policy always performs best in recovery ratio; and 3) the network performance based on Policy II even underperforms the random reprovisioning. These results can be explained by the fact that connections whose working paths traverse fewer SRLGs are more flexible in finding SRLG-disjoint backup paths, and thus priority given to connections whose working paths traverse more SRLGs in Policy I can significantly improve the recovery ratio.

Full Article | PDF Article

More Like This

Best Effort SRLG Failure Protection for Optical WDM Networks

Xu Shao, Yuebin Bai, Xiaofei Cheng, Yong-Kee Yeo, Luying Zhou, and Lek Heng Ngoh
J. Opt. Commun. Netw. 3(9) 739-749 (2011)

Performance Evaluation of Impairment-Aware Routing Under Single- and Double-Link Failures

Konstantinos N. Georgakilas, Kostas Katrinis, Anna Tzanakaki, and Ole B. Madsen
J. Opt. Commun. Netw. 2(8) 633-641 (2010)

Hybrid Survivability Schemes Achieving High Connection Availability With a Reduced Amount of Backup Resources [Invited]

Jawwad Ahmed, Cicek Cavdar, Paolo Monti, and Lena Wosinska
J. Opt. Commun. Netw. 5(10) A152-A161 (2013)

Previous Article Next Article

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (6)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (2)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (5)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription


Unprotected Protections	$c_{22} (2)$	$c_{12} (3)$	$c_{40} (6)$	$c_{25} (8)$	$c_{7} (9)$
Reprovisioning Sequence	1	2	3	4	5
Policy I	$c_{7} (9)$	$c_{25} (8)$	$c_{40} (6)$	$c_{12} (3)$	$c_{22} (2)$
Policy II	$c_{22} (2)$	$c_{12} (3)$	$c_{40} (6)$	$c_{25} (8)$	$c_{7} (9)$
Random Reprovisioning	$c_{40} (6)$	$c_{22} (2)$	$c_{7} (9)$	$c_{12} (3)$	$c_{25} (8)$


Unprotected Protections	$c_{22} (2)$	$c_{12} (3)$	$c_{40} (6)$	$c_{25} (8)$	$c_{7} (9)$
Reprovisioning Sequence	1	2	3	4	5
Policy I	$c_{7} (9)$	$c_{25} (8)$	$c_{40} (6)$	$c_{12} (3)$	$c_{22} (2)$
Policy II	$c_{22} (2)$	$c_{12} (3)$	$c_{40} (6)$	$c_{25} (8)$	$c_{7} (9)$
Random Reprovisioning	$c_{40} (6)$	$c_{22} (2)$	$c_{7} (9)$	$c_{12} (3)$	$c_{25} (8)$


Step 1) Sort unprotected connections to a list according to Policy I, Policy II, or random reprovisioning, depending on what policies will be used.
Step 2) Choose the working path $P_{w}^{s, d, k}$ accordingly from the list. To compute the backup path, prune $G^{'}$ to $G^{″}$ by eliminating:
Step 2.1) All the links (including all the channels in these links) the working path $P_{w}^{s, d, k}$ traverses and the SRLG mates of these links.
Step 2.2) All the channels used by all the established working paths.
Step 2.3) If there is a working path $P_{w}^{s^{'}, d^{'}, k^{'}}$ that traverses the same SRLG as the current working path $P_{w}^{s, d, k}$ , remove all the channels used by $P_{b}^{s^{'}, d^{'}, k^{'}}$ .
Step 3) Compute the shortest paths on each wavelength layer from the pruned graph $G^{″}$ in step 2). Compare the shortest paths from each wavelength layer and choose the shortest one as $P_{b}^{s, d, k}$ . If some of the shortest paths from different wavelength layers are equal, use the First-Fit algorithm to break the tie. If no backup path can be found, count this backup reprovisioning as an unsuccessful backup reprovisioning.
Step 4). Go back to Step 2) for more iteration.


Step 1) Sort unprotected connections to a list according to Policy I, Policy II, or random reprovisioning, depending on what policies will be used.
Step 2) Choose the working path $P_{w}^{s, d, k}$ accordingly from the list. To compute the backup path, prune $G^{'}$ to $G^{″}$ by eliminating:
Step 2.1) All the links (including all the channels in these links) the working path $P_{w}^{s, d, k}$ traverses and the SRLG mates of these links.
Step 2.2) All the channels used by all the established working paths.
Step 2.3) If there is a working path $P_{w}^{s^{'}, d^{'}, k^{'}}$ that traverses the same SRLG as the current working path $P_{w}^{s, d, k}$ , remove all the channels used by $P_{b}^{s^{'}, d^{'}, k^{'}}$ .
Step 3) Compute the shortest paths on each wavelength layer from the pruned graph $G^{″}$ in step 2). Compare the shortest paths from each wavelength layer and choose the shortest one as $P_{b}^{s, d, k}$ . If some of the shortest paths from different wavelength layers are equal, use the First-Fit algorithm to break the tie. If no backup path can be found, count this backup reprovisioning as an unsuccessful backup reprovisioning.
Step 4). Go back to Step 2) for more iteration.

Abstract

Cited By

Figures (6)

Tables (2)

Equations (5)

Journal of Optical Communications and Networking