A New Approach to the Provision of Non-simple Node-Protecting p-Cycles in WDM Mesh Networks

Li, Honghui; Jaumard, Brigitte; Fu, Xueliang

doi:10.1007/978-3-642-20367-1_48

Cited by 2 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The pricing problem is used to generate nodeprotecting p-cycles on dynamically in each iteration of the optimization process. The master problem below is quite similar to the ones in [19], [20] thanks to their same functionality. However, the associated candidate constructions here are different.…”

Section: B Comparisons Of the Design Methodsmentioning

confidence: 78%

“…The key to use the CG techniques consists in the composition scheme of the original problem. Here, we use the same scheme as those in [19], [20], [22]. The master problem selects node-protecting p-cycles from the candidate set such that all (intermediate) nodes and links in an optical network are protected against any single failure.…”

Section: B Comparisons Of the Design Methodsmentioning

confidence: 99%

“…Constraints (10) say that, if the link of a working path is adjacent to its relay node, this link cannot be on the protection path. Constraints (11) -(13) are classical flow conservation constraints for defining the protection paths, which can be found in [19], [20] as well. Constraints (11) say that a protection path must end at two on-path nodes that are adjacent to the protected relay node.…”

Section: B the Pricing Problemmentioning

confidence: 99%

“…If one only considers a subset of pcycle candidates, the solution quality may not be guaranteed. The authors in [19], [20] studied link and node protection using respective ordinary p-cycles and nonsimple p-cycles. And they proposed scalable approaches to solve the ILP model where candidates are generated dynamically when needed.…”

Section: Introduction Wdm (Wavelength Divisionmentioning

confidence: 99%

See 3 more Smart Citations

A Novel Efficient Design of Survivable WDM Mesh Networks

Li¹,

Fu²

2014

JCP

Self Cite

View full text Add to dashboard Cite

The design of survivable WDM mesh networks based on p-cycles has been extensively studied. However, most of studies only deal with a single link failure rather than node failure. In this paper, we develop a new scalable and efficient design method for computing node-protecting p-cycles in order to ensure network survivability. The performance of our new proposed design method makes an obvious improvement ∼20% in capacity redundancy over that of the previous one. The conventional design methods formulate the problem of p-cycle design as an Integer Linear Program (ILP). To solve the ILP, the prerequisite is to a priori enumerated all possible p-cycle candidates. For a large network, the resulting ILP may be intractable as the huge number of cycles may exist. We propose a new design and solution method based on large scale optimization tools, namely Column Generation (CG), where p-cycle candidates are generated on-line when needed. The main advantage of our CG-based method is that no p-cycles are a-priori off-line enumerated; the generation of the promising set of p-cycles is embedded in the optimization process. Extensive experiments have been conducted for comparison. Experimental results show that our new proposed method outperforms the previous method in terms of capacity efficiency.

show abstract

Section: B Comparisons Of the Design Methodsmentioning

confidence: 78%

Section: B Comparisons Of the Design Methodsmentioning

confidence: 99%

Section: B the Pricing Problemmentioning

confidence: 99%

Section: Introduction Wdm (Wavelength Divisionmentioning

confidence: 99%

See 2 more Smart Citations

A Novel Efficient Design of Survivable WDM Mesh Networks

Li¹,

Fu²

2014

JCP

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, the short recovery time cannot always be guaranteed due to the flexibility of the protection structure. The authors in [16] enhanced the protection capacity utilization by solving the backhaul problem, in which the same link is traversed twice in opposite directions by the protection path before reaching the destination after a link failure. However, it suffers from longer switch reconfiguration time due to the fact that all failure-aware nodes need to carry out protection switching after failure detection.…”

Section: Background and Related Workmentioning

confidence: 99%

Scalable, Optimal and Capacity Efficient Survivable Technique (SOCEST) for Optical Network

Garg¹

2017

IJFGCN

View full text Add to dashboard Cite

show abstract

A New Approach to the Provision of Non-simple Node-Protecting p-Cycles in WDM Mesh Networks

Cited by 2 publications

References 6 publications

A Novel Efficient Design of Survivable WDM Mesh Networks

A Novel Efficient Design of Survivable WDM Mesh Networks

Scalable, Optimal and Capacity Efficient Survivable Technique (SOCEST) for Optical Network

Contact Info

Product

Resources

About