2016 IEEE Symposium on Computers and Communication (ISCC) 2016
DOI: 10.1109/iscc.2016.7543903
|View full text |Cite
|
Sign up to set email alerts
|

Multi Topology Routing based IP Fast Re-Route for Software Defined Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 6 publications
0
4
0
Order By: Relevance
“…It has scalability issue. To address the scalability issue related failure convergence during single link and node failure the [61] has proposed the Multi Topology Routing (MTR) based IP Fast Re-Route (IPFRR) algorithms. It's based on multi path routing where it has been covered the failure convergence during node failure.…”
Section: ) Restoration Approachmentioning
confidence: 99%
“…It has scalability issue. To address the scalability issue related failure convergence during single link and node failure the [61] has proposed the Multi Topology Routing (MTR) based IP Fast Re-Route (IPFRR) algorithms. It's based on multi path routing where it has been covered the failure convergence during node failure.…”
Section: ) Restoration Approachmentioning
confidence: 99%
“…In backup path planning process, we have to find a set of backup paths which can meet the following requirements: (1) Any one of the backup path should not contain the failure node and be loop free;(2) The backup paths should be link disjoint; (3)The number of backup paths for every link should be no more than the upper bound Num p ; (4)The backup paths should provide as much available bandwidth as possible; (5) The backup paths should be as short as possible. So we can formalize the problem to a multi objective optimization problem as (1) shows:…”
Section: Sdmentioning
confidence: 99%
“…The formula (3) guarantees that any of the backup paths doesn't contain the failure link. The loop free of backup paths is obtained by formula (4) and (5). And formula (6) represents that all the paths are link disjoint.…”
Section: Sdmentioning
confidence: 99%
See 1 more Smart Citation