Capacity Efficiency and Restorability of Path Protection and Rerouting in WDM Networks Subject to Dual Failures

Schupke, Dominic; Prinz, Robert

doi:10.1023/b:pnet.0000033978.22198.6f

Cited by 46 publications

(37 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The basic idea of SPR is to reprovision new backups for connections that become unprotected or vulnerable for the next possible failure, due to losing the primary or the backup in the first failure or due to backup resource sharing. Therefore, for multi-link failures SPR has better survivable performance than previous algorithms in [1][2][3][4][5]. However, in our study we also find the drawback of SRP presented as follows.…”

Section: Introductioncontrasting

confidence: 56%

“…Step 12: Adjust the costs of all links according to (3). Run Dijsktra's algorithm to compute the least-cost routes from the source node to all other nodes.…”

Section: Process Of Smrmentioning

confidence: 99%

“…Previous articles have investigated the survivability problem of singlelink failures [1,2] and double-link failures [3][4][5], and they…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improving survivability for multi-link failures with reprovisioning in WDM mesh networks

Guo

Wang

2007

Photon Netw Commun

View full text Add to dashboard Cite

This article proposes a new heuristic algorithm, called Shared Multi-sub-backup-paths Reprovisioning (SMR), to improve the survivability for multi-link failures in WDM mesh networks. In SMR, each connection will be initially assigned one primary path, one backup path, and multiple sub-backup paths. When failures occur, based on the corresponding policy SMR will reprovision the primary or backup resources for these connections affected by the failures. Compared to previous algorithms, the survivable performance of SMR can be significantly improved.

show abstract

Section: Introductioncontrasting

confidence: 56%

“…Step 12: Adjust the costs of all links according to (3). Run Dijsktra's algorithm to compute the least-cost routes from the source node to all other nodes.…”

Section: Process Of Smrmentioning

confidence: 99%

See 1 more Smart Citation

Improving survivability for multi-link failures with reprovisioning in WDM mesh networks

Guo

Wang

2007

Photon Netw Commun

View full text Add to dashboard Cite

show abstract

“…Recently, several studies have discussed the multi-fault restoration issue [3,9,19,11,20,27]. For example, in [3], the authors considered three problems, namely dual-failure minimum capacity (DFMC), dual-failure maximum restorability (DFMR), and multi-restorability capacity placement (MRCP).…”

Section: Introductionmentioning

confidence: 99%

Locally reconfigurable p-cycle networks for dual-failure restoration

Sue

2008

Photon Netw Commun

View full text Add to dashboard Cite

p-Cycle reconfiguration methods (for instance complete, incremental, or dynamic-repair) based on the first event adaptive restoration model provide a promising approach for improving the dual-failure restorability characteristics of static p-cycle methods based on the static preplanned restoration model. However, if the reconfiguration process triggered by the first failure is not completed before a second failure occurs, p-cycle reconfiguration methods fail to achieve 100% dual-failure restorability and reduce to the static p-cycle methods which do not take advantage of the spare capacity to be reconfigured. In this study, we propose to use a new restoration model designated as first event locally adaptive restoration model with a coordinated re-restoration effort. This model is aimed to limit the reconfiguration scope to a local p-cycle where the spare capacity is only reconfigured on its straddling links for reducing the reconfiguration overhead (i.e., the average number of reconfigured links during the reconfiguration time.) According to this model, a twophase locally reconfigurable p-cycle method is proposed. Only the straddling links of the local p-cycle affected by the first failure are reconfigured in the first phase. The second phase is not initialized until the second failure really occurs in the affected local p-cycle. The second phase is to enable the dual-failure restorations with a coordinated re-restoration effort for the first failed link from its original end nodes for any damage that the second failure causes to previously deployed restoration paths. The objective of the proposed method is to maximize the dual-failure restorability within a limited reconfiguration scope. We evaluate the correlation between the normalized spare capacity cost and the dualfailure restorability. The results show that the proposed local reconfiguration heuristic method improves the average dualfailure restorability of the 9n17s and Cost 230 networks by 45.1% and 20.1%, respectively, relative to the static p-cycles method and achieves closely the optimal value obtained using integer linear programming (ILP). Additionally, the spare capacity cost of the proposed local reconfiguration method is smaller than that of previous p-cycle reconfiguration methods in the two test networks.

show abstract

“…Previous studies [3], [6] considered the effect of releasing stub capacity, showing that stub-release can increase the capacity efficiency; the actual benefit is however dependent on the studied network scenario. In these studies, only span resources are considered during the stub-release process, and they do not address the challenge of making highly scarce and needed nodal resources, such as WCs, widely available for the restoration process.…”

mentioning

confidence: 99%

Nodal Stub-Release in All-Optical Networks

Ruepp

Buron

Andriolli³

et al. 2008

IEEE Commun. Lett.

View full text Add to dashboard Cite

Abstract-In wavelength-routed networks, the scarcity of wavelength-converters severely impacts successful connection recovery. This can be mitigated by releasing the connection's stubs (i.e. the surviving upstream and downstream span and node resources) prior to the restoration process. Releasing span resources however heavily complicates the reversion process.In this study, we present a nodal stub-release method, where only node resources (i.e. wavelength-converters) are released, while the stubs' span resources are kept occupied. Our simulation results show that the nodal stub-release method can match the performance of full stub-release (releasing both span and node resources) while keeping complexity low.

show abstract

Capacity Efficiency and Restorability of Path Protection and Rerouting in WDM Networks Subject to Dual Failures

Cited by 46 publications

References 8 publications

Improving survivability for multi-link failures with reprovisioning in WDM mesh networks

Improving survivability for multi-link failures with reprovisioning in WDM mesh networks

Locally reconfigurable p-cycle networks for dual-failure restoration

Nodal Stub-Release in All-Optical Networks

Contact Info

Product

Resources

About