2015 11th International Conference on the Design of Reliable Communication Networks (DRCN) 2015
DOI: 10.1109/drcn.2015.7149024
|View full text |Cite
|
Sign up to set email alerts
|

Multi-failure restoration with minimal flow operations in software defined networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
2
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 8 publications
0
9
0
Order By: Relevance
“…To address the problem of the unequal split of DMSP [119]. Farrugia et al [122] proposed a Globally Optimised Multipath Routing (GOMR) algorithm that splits a flow traffic equally among multiple paths using a stochastic mechanism. GOMR leverages the global knowledge of network topology and its traffic statistics to formulate the problem as linear programming LP to optimize per packet multipath routing proposed.…”
Section: Psa With Link Quality Awarementioning
confidence: 99%
“…To address the problem of the unequal split of DMSP [119]. Farrugia et al [122] proposed a Globally Optimised Multipath Routing (GOMR) algorithm that splits a flow traffic equally among multiple paths using a stochastic mechanism. GOMR leverages the global knowledge of network topology and its traffic statistics to formulate the problem as linear programming LP to optimize per packet multipath routing proposed.…”
Section: Psa With Link Quality Awarementioning
confidence: 99%
“…This way, routing paths for new flows are computed based on switches real-time Flowtable usage. The reference in [79] [80] formulates a problem to find an optimal path with the lowest path cost and update operation. They compute N number of paths and compare their operation cost.…”
Section: A Routing With Flows Operations Awarementioning
confidence: 99%
“…As such, it is challenging to find the best routing path considering the trade-off between flow table operation cost and path cost [23]. Astaneh et al [24,25] presented a local restoration scheme with a minimal number of flow operations for disaster scenarios. The scheme minimizes the cost of flow table update operations and also the number of hops based on a threshold value.…”
Section: Related Workmentioning
confidence: 99%
“…Interestingly, there may be some variation, or more than one Pi may have the same score. In this case, the Pi with a minimum number of hop count or distance is considered as the final path, Algorithm 2 demonstrates the procedure line (20)(21)(22)(23)(24)(25)(26)(27)(28)(29)(30)(31)(32). In practice, shorter paths typically tend to consume fewer network resources compare to longer paths, and hence the path which best minimizes the CWF score is one among the k shortest candidate path.…”
Section: Critical Switch Detection and Expected Loadmentioning
confidence: 99%