On the benefits of multi-path recovery in flexgrid optical networks

Castro, Alberto; Velasco, Luis; Comellas, Jaume; Junyent, G.

doi:10.1007/s11107-014-0443-5

Cited by 15 publications

(2 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since connection restorability is related to the availability of continuous and contiguous spectrum resources, the multipath (MP) restoration scheme was proposed in [17] to increase restorability; it divides original connections into several parallel disaggregated connections (sub-connections), which are routed independently among them, additionally enabling recovering only part of the original bitrate (bitrate squeezing). Although multipath restoration has benefits, it provides poor resource utilization and is spectrally inefficient and hence, re-optimizing the network just after a link is repaired becomes essential.…”

Section: Introductionmentioning

confidence: 99%

First Experimental Assessment of ABNO-Driven In-Operation Flexgrid Network Re-Optimization

Gifre

Paolucci

Velasco

et al. 2015

J. Lightwave Technol.

View full text Add to dashboard Cite

Abstract-Traffic affected by link failures can be recovered using path restoration schemes. In dynamically operated networks provided with a control plane, restoration algorithms run in a centralized element, such as the Path Computation Element (PCE). To increase traffic restorability in flexgrid networks, multiple paths, sub-connections, can be used to restore every single affected connection. However, the multipath restoration scheme might result in a poor resource utilization entailing a lesser grade of service. In-operation network planning algorithms can be used to mitigate this problem once the failed link is repaired; we propose solving the so-called multipath after failure repair optimization problem (MP-AFRO) to reduce sub-connections count by aggregating those belonging to the same original connection and re-routing the resulting connection to release spectral resources. The MP-AFRO problem is modelled using a Mixed Integer Linear Program (MILP) formulation. In view of the complexity of the model and the limited time to solve the problem, we propose a heuristic algorithm that provides a good trade-off between complexity and optimality. The performance on the MP-AFRO heuristic is firstly validated by simulation. Next, the heuristic algorithm is deployed inside an in-operation planning tool in the form of back-end PCE (bPCE) inside the Application-based Network Operations (ABNO) architecture controlling a network; the bPCE is connected to the centralized active stateful PCE. MP-AFRO is experimentally demonstrated using a distributed field trial test-bed connecting the premises of Telefonica (Madrid), CNIT (Pisa), and UPC (Barcelona).

show abstract

Section: Introductionmentioning

confidence: 99%

First Experimental Assessment of ABNO-Driven In-Operation Flexgrid Network Re-Optimization

Gifre

Paolucci

Velasco

et al. 2015

J. Lightwave Technol.

View full text Add to dashboard Cite

show abstract

“…Recent works have been proposing approaches to path provisioning and traffic grooming in more wavelength-flexible networks (flexgrid optical network) [7,28,12].…”

Section: Related Workmentioning

confidence: 99%

Finding multicolour paths in graphs

Santos¹

View full text Add to dashboard Cite

In this work we study a problem of finding minimum coloured paths in graphs that has applications in WDM optical networks when high bandwidths are required to send data between a pair of nodes in the graph. Let G = (V, E) be a (directed) graph with a set of nodes V and a set of edges E in which each edge has an associated positive weight w(i, j), and C = {1, 2, . . . , x} be a set of x colours, x ∈ N. The function c : E → 2 C maps each edge of the graph G to a subset of colours, where 2 C is the power set of C. Given a positive integer k > 1, a k-multicolour path is a path in G such that there exists a set of k colours K = {c 1 , . . . , c k } ⊆ C, with K ⊆ c(i, j) for each edge (i, j) in the path.The problem of finding one or more k-multicolour paths in a graph has applications in optical network and social network analysis. In the former case, the available wavelengths in the optical fibres are represented by colours in the edges and the objective is to connect two nodes through a path offering a minimum required bandwidth. For the latter case, the colours represent relations between elements and paths help identify structural properties in such networks.In this work we investigate the complexity of the multicolour path establishment problem. We show it is NP-hard and hard to approximate. Additionally, we develop Branch and Bound algorithms, ILPs, and heuristics for the problem. We then perform an experimental analysis of the developed algorithms to compare their performances.

show abstract

Elastic Optical Networks

Walkowiak

2016

Modeling and Optimization of Cloud-Ready and Content-Oriented Networks

View full text Add to dashboard Cite

On the benefits of multi-path recovery in flexgrid optical networks

Cited by 15 publications

References 22 publications

First Experimental Assessment of ABNO-Driven In-Operation Flexgrid Network Re-Optimization

First Experimental Assessment of ABNO-Driven In-Operation Flexgrid Network Re-Optimization

Finding multicolour paths in graphs

Elastic Optical Networks

Contact Info

Product

Resources

About