2020 4th Conference on Cloud and Internet of Things (CIoT) 2020
DOI: 10.1109/ciot50422.2020.9244292
|View full text |Cite
|
Sign up to set email alerts
|

Path Recovery Algorithm Using Fast-Failover for Software-Defined Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…the logic of the original PMU1-PDC path c → p. To solve this kind of problem, the VLAN ID is used in [24], and the identifier (not specified) is used in [25], to identify the redirected data flows. For example, after the link (p, q) in Fig.…”
Section: Linkid-based Backup Path Installationmentioning
confidence: 99%
See 1 more Smart Citation
“…the logic of the original PMU1-PDC path c → p. To solve this kind of problem, the VLAN ID is used in [24], and the identifier (not specified) is used in [25], to identify the redirected data flows. For example, after the link (p, q) in Fig.…”
Section: Linkid-based Backup Path Installationmentioning
confidence: 99%
“…Several works have utilized the FF group table to perform dataplane based fast failover [23]- [25]. In [24], the loop-free group table installation methods are proposed for SDN-enabled substation communication network; while in the work [25], the fast failover is based on finding and installing a new path between the two end nodes of the failed link with minimum amount of flow entries. The main drawback of existing works is that they only use the FF group table, but do not optimize the solution, i.e., the FF group table based backup path is not well constructed to guarantee the end-to-end transmission performance.…”
Section: Introductionmentioning
confidence: 99%