Fast Efficient Design of Shared Backup Path Protected Networks Using a Multi-Flow Optimization Model

Todd, Brody; Doucette, John

doi:10.1109/tr.2011.2170229

Cited by 11 publications

(9 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results there showed that compared with traditional 1 + 1 path protection, the SBPP technique was effective in reducing both the number of FSs needed and the spare capacity redundancy required. A new SBPPtype protection mechanism and an accompanying ILP model were given in [26] where this new mechanism and accompanying model allowed better benchmarking of SBPP-like network designs, and would facilitate further study into the performance of SBPP relative to other network survivability approaches. However, the integer linear program (ILP) design model for SBPP is difficult to solve with reasonable computing and time resources.…”

Section: Sbpp Techniquementioning

confidence: 99%

Benefit of adaptive FEC in shared backup path protected elastic optical network

Guo¹,

Dai²,

Wang³

et al. 2015

Opt. Express

View full text Add to dashboard Cite

We apply an adaptive forward error correction (FEC) allocation strategy to an Elastic Optical Network (EON) operated with shared backup path protection (SBPP). To maximize the protected network capacity that can be carried, an Integer Linear Programing (ILP) model and a spectrum window plane (SWP)-based heuristic algorithm are developed. Simulation results show that the FEC coding overhead required by the adaptive FEC scheme is significantly lower than that needed by a fixed FEC allocation strategy resulting in higher network capacity for the adaptive strategy. The adaptive FEC allocation strategy can also significantly outperform the fixed FEC allocation strategy both in terms of the spare capacity redundancy and the average FEC coding overhead needed per optical channel. The proposed heuristic algorithm is efficient and not only performs closer to the ILP model but also does much better than the shortest-path algorithm.

show abstract

Section: Sbpp Techniquementioning

confidence: 99%

Benefit of adaptive FEC in shared backup path protected elastic optical network

Guo¹,

Dai²,

Wang³

et al. 2015

Opt. Express

View full text Add to dashboard Cite

show abstract

“…The number of backup lightpaths and the type of protection provided to the connections (dedicated or shared) must be defined during the network planning stage. To do so, two different approaches are commonly used: a) providing every network connection with the same number of backup lightpaths or type of protection, as in [14,15,19] or b) providing every network connection with the number of backup lightpaths or type of protection that ensures the level of availability required by that connection. The latter approach is known as availability-guaranteed or availability-aware network planning process and the task of actually establishing the corresponding working and backup lightpaths is carried out by availability-aware provisioning algorithms.…”

Section: Introductionmentioning

confidence: 99%

Availability‐driven optimal design of shared path protection in WDM networks

2016

View full text Add to dashboard Cite

2016. Availability-driven optimal design of shared path protection in WDM networks. Networks, 68(3), pp. 224-237. ISSN 0028-3045 [Article]Abstract Availability, defined as the fraction of time a network service is operative, is a key network service parameter.Dedicated protection increases availability but also the cost. Shared protection instead decreases the cost, but also the availability.In this paper, we formulate and solve an integer linear programming (ILP) model for the problem of minimizing the backup resources required by a shared-protected static optical network whilst guaranteeing an availability target per connection. The main research challenge is dealing with the non-linear expression for the availability constraint.Taking the working/backup routes and the availability requirements as input data, the ILP model identifies the set of connections sharing backup resources in any given network link.We also propose a greedy heuristic to solve large instances in much shorter time than the ILP model with low levels of relative error (2.49% average error in the instances studied) and modify the ILP model to evaluate the impact of wavelength conversion.Results show that considering availability requirements can lead up to 56.4% higher backup resource requirements than not considering them at all, highlighting the importance of availability requirements in budget estimation.

show abstract

“…One of the most common and efficiently used measures is to take backup paths. 34,35,[39][40][41][42] In the cellular manufacturing system (CMS), Safaei et al 39 used ''reliable route,'' which consisted of a number of units or alternative machines allocated to cells, to avoid production interruptions. As pointed out by the authors, the reliable route approach could minimize the total cost and maximize the overall system reliability.…”

Section: Introductionmentioning

confidence: 99%

“…Remark (0, 200) 1200 X 1 = (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 30, 40, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0) Yes (10,190) 1240 X 2 = (10, 10, 10, 0, 0, 0, 0, 0, 0, 0, 30, 40, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0) X 2 5X 1 (20,180) 1280 X 3 = (10, 10, 10, 0, 0, 0, 0, 0, 0, 0, 30, 40, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0) X 3 5X 1 (30,170) 1320 X 4 = (10, 10, 10, 0, 0, 0, 0, 0, 0, 0, 30, 40, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0) X 4 5X 1 (40,160) 1360 X 5 = (10, 10, 10, 0, 0, 0, 0, 0, 0, 0, 30, 40, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0) X 5 5X 1 (50, 150) 1400 X 6 = (10, 10, 10, 0, 0, 0, 0, 0, 0, 0, 30, 40, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0) Table 3. Results for generating (200, 13, 2000, (P 2 , P 4 )) À LBPs.…”

mentioning

confidence: 99%

“…(0, 200) 1200 X 1 = (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 30, 40, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0) Yes (10,190) 1210 X 2 = (0, 0, 0, 10, 10, 10, 0, 0, 0, 0, 30, 40, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0) X 2 5X 1 (20, 180) 1220 X 3 = (0, 0, 0, 10, 10, 10, 0, 0, 0, 0, 30, 40, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0) X 3 5X 1 (30,170) 1230 X 4 = (0, 0, 0, 10, 10, 10, 0, 0, 0, 0, 30, 40, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0) X 4 5X 1 (40,160) 1240 …”

mentioning

confidence: 99%

See 1 more Smart Citation

Single minimal path based backup path for multi-state network

Zhang

Wang

et al. 2013

Proceedings of the Institution of Mechanical Engineers, Part O:

View full text Add to dashboard Cite

Backup path is an important mechanism to sustain the reliability of a multi-state network. As a popular backup path method, the double minimal path based backup path algorithm can improve the multi-state network's reliability when the main paths fail. However, this algorithm cannot work efficiently when a single main minimal path fails. To improve the reliability in the first main minimal path failure case, we propose a single minimal path based backup path algorithm. In the single minimal path based backup path algorithm, two disjoint minimal paths are used as the main routing pair to transmit the data, and one single minimal path, which is disjoint with the main minimal paths, acts as the backup path. In the second main minimal path failure case, we propose a double-single minimal path based backup path algorithm to improve the multi-state network reliability. To develop the single minimal path based backup path and the double-single minimal path based backup path algorithms, this article first formulates the multi-state network reliability analysis problem. Then, a solution procedure is proposed to calculate the multi-state network reliability. Furthermore, numerical examples are given to validate the effectiveness of the algorithms. Finally, some comparisons are made between the single minimal path based backup path/double-single minimal path based backup path and the double minimal path based backup path/double minimal path based backup path algorithms. The comparison results indicate that the single minimal path based backup path and the double-single minimal path based backup path algorithms lead to considerable improvement in terms of the multi-state network reliability in the first and the second main minimal path failure cases, respectively, which are verified by both the mathematical analysis and numerical experiments.

show abstract

Fast Efficient Design of Shared Backup Path Protected Networks Using a Multi-Flow Optimization Model

Cited by 11 publications

References 28 publications

Benefit of adaptive FEC in shared backup path protected elastic optical network

Benefit of adaptive FEC in shared backup path protected elastic optical network

Availability‐driven optimal design of shared path protection in WDM networks

Single minimal path based backup path for multi-state network

Contact Info

Product

Resources

About