MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization

Rostami, Mohammad Javad; Zarandi, Azadeh Alsadat Emrani; Hoseininasab, Seyed Mohamad

doi:10.1016/j.jnca.2011.08.009

Cited by 15 publications

(8 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In cases when it is not possible to find fully SRLG‐disjoint paths, one may try and find maximally SRLG‐disjoint paths . That is the problem to be considered in this work.…”

Section: Introductionmentioning

confidence: 99%

Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort

et al. 2020

View full text Add to dashboard Cite

The resilience to disasters is a very relevant problem in telecommunication networks. This work addresses the problem of 1 + 1 optical lightpath protection considering maximally shared risk link group (SRLG)‐disjoint geodiverse paths, applied in the context of an optical network. The resilience to geographically correlated disasters is accomplished by guaranteeing geodiversity of the paths. This work focuses on estimating the increase of the path lengths and the increase in cost of the required transponders, compared to simple link‐disjointness (i.e., when no constraints on SRLG‐disjointness or geodiversity are considered). Results in different networks allow to evaluate the effect of SRLG‐disjointness to ensure some geodiversity.

show abstract

“…In cases when it is not possible to find fully SRLG‐disjoint paths, one may try and find maximally SRLG‐disjoint paths . That is the problem to be considered in this work.…”

Section: Introductionmentioning

confidence: 99%

Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort

et al. 2020

View full text Add to dashboard Cite

show abstract

“…In Hu (2003), it is proved that the problem of computing a pair of paths, with the least number of groups in common, is NP-complete. Several heuristics and parallel processing procedures have been proposed for dealing with these problems, for instance (Xiao and Pan, 2004;Pan and Xiao, 2006;Rostami et al, 2012;Miletić et al, 2014;Martín et al, 2020). In many situations, such as in MPLS networks, it is also advisable to minimize a cost function (being a min-sum function, very commonly).…”

Section: Introductionmentioning

confidence: 99%

On a relaxed maximally disjoint path pair problem: a bicriteria approach

Pascoal

Clímaco

2019

Int Trans Operational Res

View full text Add to dashboard Cite

In some application areas in telecommunication and transportation networks, there are problems requiring the determination of pairs of paths, aiming at minimizing the number of links, or link groups that they share, and their total cost. In this paper, a new bicriteria algorithm is proposed to deal with this problem. The algorithm is based on ranking pairs of paths by order of the total cost, using an adaptation of a path‐ranking algorithm, after a suitable modification of the network topology. Nondominated solutions are then filtered by means of a dominance test. First, computational experiments are reported in order to assess the efficiency of the algorithm to calculate the whole set of nondominated pairs of paths. Second, we present computational results focused on the nondominated solutions close to the maximal disjoint pair (i.e., quasi‐disjoint pairs only, for a predefined admissible relaxation value) because in some application problems, such as shared risk link group pairs of paths, only those solutions have practical relevance.

show abstract

“…The existence of SRLGs requests routing algorithms to find maximally SRLG-disjoint paths, when fully disjoint paths do not exist in the network [6], [10], [11]. The problem to be tackled in this work is to find two maximally SRLG-disjoint paths, which should always be link (or edge) disjoint, for all traffic demands directly guided over end-to-end optical lightpaths (that is, in a transparent optical network).…”

Section: Introductionmentioning

confidence: 99%

SRLG-disjointness and geodiverse routing – a practical network study and operational conclusions

Nedic¹,

Gunkel

Gomes

et al. 2018

2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)

View full text Add to dashboard Cite

The problem of disaster resilience is of paramount importance in today's telecommunication networks. Here, this problem is tackled by considering 1+1 optical lightpath protection with maximally SRLG-disjoint paths and geodiversity in a transparent backbone network. Geodiversity was added to make the network more resilient to geographically correlated disasters. The aim is to estimate the increase of the path lengths (fibre lengths) and the increase in cost of the required transponders, with respect to simple link disjointness (no-SRLG nor geodiversity constraints) in a fully transparent optical network. The results obtained in a realistic test network show that SRLG-disjointness already ensures an acceptable geodiversity for the considered network.

show abstract

MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization

Cited by 15 publications

References 27 publications

Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort

Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort

On a relaxed maximally disjoint path pair problem: a bicriteria approach

SRLG-disjointness and geodiverse routing – a practical network study and operational conclusions

Contact Info

Product

Resources

About