On OR-based routing approaches for the Internet

Clímaco, João; Craveirinha, José

doi:10.1111/j.1475-3995.2010.00772.x

Search citation statements

Order By: Relevance

Paper Sections

Select...

Kimshd Heuristic1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [40] the authors state that the use of the theoretical worst-case complexity of QoS routing algorithms should be considered with care, because this is not the best indicator for the execution times in most practical problems. In [41] the authors reinforce the same view, namely regarding the use of algorithm MPS in multiple criteria shortest path models. MPS sorts the edges according to their reduced cost; this results that each time a k-th shortest path is selected, the generation of each new candidate path requires no network modification, unlike in Yen's algorithm.…”

Section: Kimshd Heuristicmentioning

confidence: 85%

Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost

et al. 2014

Self Cite

View full text Add to dashboard Cite

A shared risk link group (SRLG) is a set of links which share a common risk of failure. Routing protocols in Generalized MultiProtocol Label Switching, using distributed SRLG information, can calculate paths avoiding certain SRLGs. For single SRLG failure an end-to-end SRLG-disjoint path pair can be calculated, but to ensure connection in the event of multiple SRLG failures a set with more than two end-to-end SRLG-disjoint paths should be used. Two heuristic, the Conflicting SRLG-Exclusion Min Sum (CoSE-MS) and the Iterative Modified Suurballes's

show abstract

Section: Kimshd Heuristicmentioning

confidence: 85%