TY - GEN
T1 - A link failure recovery algorithm for Virtual Network Function chaining
AU - Soualah, Oussama
AU - Mechtri, Marouen
AU - Ghribi, Chaima
AU - Zeghlache, Djamal
N1 - Publisher Copyright:
© 2017 IFIP.
PY - 2017/7/20
Y1 - 2017/7/20
N2 - This paper addresses Virtual Network Functions (VNFs) placement and chaining in the presence of physical link failures. A decision tree approach to the NP-Hard VNF placement and chaining problem is used to minimize the penalties induced by service interruptions due to link outages. Formulating the problem as decision tree reduces the complexity significantly and leads to a new reliable algorithm, named R-SFC-MCTS, that builds incrementally the decision tree to efficiently search for good placement and chaining solutions. Execution time is improved thanks to the Monte-Carlo Tree Search strategy. The proposed link failure recovery algorithm selects and assigns reliable paths to prevent and avoid the negative effects of link failures and reactively re-maps impacted virtual links in safer physical paths once an outage occurs in the infrastructure. The performance of R-SFC-MCTS is compared via extensive simulations with a baseline and a reactive solution in terms of: i) acceptance rate, ii) induced penalties iii) provider revenue loss and iv) the final provider's profit.
AB - This paper addresses Virtual Network Functions (VNFs) placement and chaining in the presence of physical link failures. A decision tree approach to the NP-Hard VNF placement and chaining problem is used to minimize the penalties induced by service interruptions due to link outages. Formulating the problem as decision tree reduces the complexity significantly and leads to a new reliable algorithm, named R-SFC-MCTS, that builds incrementally the decision tree to efficiently search for good placement and chaining solutions. Execution time is improved thanks to the Monte-Carlo Tree Search strategy. The proposed link failure recovery algorithm selects and assigns reliable paths to prevent and avoid the negative effects of link failures and reactively re-maps impacted virtual links in safer physical paths once an outage occurs in the infrastructure. The performance of R-SFC-MCTS is compared via extensive simulations with a baseline and a reactive solution in terms of: i) acceptance rate, ii) induced penalties iii) provider revenue loss and iv) the final provider's profit.
KW - Link Failure
KW - Monte-Carlo Tree Search
KW - Network Function Virtualization
KW - Reliability
KW - Service Function Chaining
U2 - 10.23919/INM.2017.7987282
DO - 10.23919/INM.2017.7987282
M3 - Conference contribution
AN - SCOPUS:85021050052
T3 - Proceedings of the IM 2017 - 2017 IFIP/IEEE International Symposium on Integrated Network and Service Management
SP - 213
EP - 221
BT - Proceedings of the IM 2017 - 2017 IFIP/IEEE International Symposium on Integrated Network and Service Management
A2 - Chemouil, Prosper
A2 - Simoes, Paulo
A2 - Madeira, Edmundo
A2 - Secci, Stefano
A2 - Monteiro, Edmundo
A2 - Gaspary, Luciano Paschoal
A2 - dos Santos, Carlos Raniery P.
A2 - Charalambides, Marinos
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 15th IFIP/IEEE International Symposium on Integrated Network and Service Management, IM 2017
Y2 - 8 May 2017 through 12 May 2017
ER -