Heuristics for Diverse Routing in Wavelength-Routed Networks with Shared Risk Link Groups

Pan, Xiaoshan; Xiao, Gaoxi

doi:10.1007/s11107-006-5321-3

Cited by 8 publications

(7 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This algorithm allows for an improvement on the resource utilization ratio (as bandwidth resources are shared among BPs) and for the consideration of differentiated reliability (DiR) requirements of different customers. A shared protection context is also considered in [18]. A hybrid protection scheme is proposed in [21], where shared-path and sharedlink protections are jointly used in WDM networks with SRLGs.…”

Section: Introductionmentioning

confidence: 99%

Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach

et al. 2015

View full text Add to dashboard Cite

Path protection is a fast and capacity-efficient approach for increasing the availability of end-to-end connections. However, sometimes it is not possible to obtain a fully disjoint path pair. In this case, it may be admissible to consider a path pair which is as disjoint as possible, and thus provide the best (in a certain sense) level of the single-fault protection that can be ensured using this type of approach. A shared risk link group (SRLG) is a group of links which have a common risk of failure. Two new heuristics for solving the min-sum maximally node and SRLG-disjoint path pair are presented. The relative performance of the new heuristics and also of two other previously proposed heuristics is evaluated using four different networks. Results, regarding accuracy and execution time of the studied heuristics, show that one of the new proposed algorithms can be a good compromise for use in the Generalized Multi-protocol Label Switching control plane.

show abstract

Section: Introductionmentioning

confidence: 99%

Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach

et al. 2015

View full text Add to dashboard Cite

show abstract

“…An algorithm based on the algorithm CoSE, in [11], for solving the min-sum SRLG diverse routing problem, enabling the calculation of an extremely high percentage of optimal solutions in short times, is proposed in [19]. In [20], the problem of path protection in wavelength-routed networks with SRLG, is addressed and a heuristic method is developed and compared with the trap avoidance algorithm in [21]. Note that the original SRLG diverse routing type problems gave rise to a significant number of variants, not addressed here, specially related to the constraints of the problem, in particular the nature of protection schemes, focused on the treatment of bandwidth in the AP/BP paths (where, typically, dedicated protection or shared protection schemes may be used) and the type of objective function(s) to be optimized.…”

Section: Introduction and Motivation 1introduction And Related Workmentioning

confidence: 99%

An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks

et al. 2015

View full text Add to dashboard Cite

The construction of overlay or broadcast networks, based on spanning trees, over WDM optical networks with SRLG information, has important applications in telecommunications. In this paper we propose a bicriteria optimization model for calculating communication spanning trees over WDM networks the objectives of which are the minimization of the total number of different SRLGs of the tree links (seeking to maximise reliability) and the minimization of the total bandwidth usage cost. An exact algorithm for generating the whole set of non-dominated solutions and methods for selecting a final solution in various decision environments are put forward. An extensive experimental study on the application of the model, including two sets of experiments based on reference transport network topologies, with random link bandwidth occupations and with random SRLG assignments to the links, is also presented, together with a discussion on potential advantages of the model.

show abstract

“…The heuristic proposed in [23] for solving this problem is an improvement of the Iterative Two-Step Approach (ITSA) [10]. In [19,20] the authors considered the problem of path protection in wavelength-routed networks with SRLGs, proposed a heuristic method, which they compared with the Trap Avoidance (TA) algorithm [25]. They concluded that the new algorithm, Minimum Total Weight (MTW), outperforms TA within the first few iterations.…”

Section: Introductionmentioning

confidence: 99%

Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost

2011

View full text Add to dashboard Cite

Ensuring network survivability is of the utmost importance in today's networks. A Shared Risk Link Group (SRLG) is the set of links in the network that share a common physical resource subject to fault(s). This concept allows an upper layer the ability to implement SRLG diverse routing. Two algorithms, the Conflicting SRLG Exclusion (CoSE) and the Iterative Modified Suurballe's Heuristic (IMSH), will be shortly reviewed. The first solves the min-min problem and the second the min-sum problem, considering SRLGdisjoint paths. It will then be described a new version of CoSE, which will be designated as CoSE-MS, for solving the min-sum problem for SRLG diverse routing. Finally CoSE-MS and IMSH performance will be compared using random networks and an optical network. Results show that CoSE-MS is a good compromise between the quality of obtained solutions and the used CPU time.

show abstract

Heuristics for Diverse Routing in Wavelength-Routed Networks with Shared Risk Link Groups

Cited by 8 publications

References 14 publications

Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach

Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach

An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks

Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost

Contact Info

Product

Resources

About