An Approach to Network Service Placement using Intelligent Search Strategies over Branch-and-Bound - Archive ouverte HAL Access content directly
Conference Papers Year :

An Approach to Network Service Placement using Intelligent Search Strategies over Branch-and-Bound

(1, 2) , (3) , (1, 2) , (4, 5)
1
2
3
4
5

Abstract

Network Function Virtualization (NFV) has been a significant shift from traditional dedicated hardware devices towards reusable software modules running over lightweight virtualized environments. While it brings many promising opportunities, it introduces several unprecedented complexities that need further considerations. Efficient placement of services is essential for achieving NFV expectations. We propose a highly reliable solution for systematically placing network services, touching the optimal results while maintaining the scalability, making it suitable for online scenarios with strict time constraints. We organized our solution as a Branch and Bound search structure, which leverages Artificial Intelligence (AI) search strategies (Especially A-Star) to address the placement problem, following the popular objective of Service Acceptance (SA). Extensive empirical analysis has been carried out and the results confirm a significant improvements.
Fichier principal
Vignette du fichier
main.pdf (124.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03510057 , version 1 (04-01-2022)

Identifiers

Cite

Masoud Taghavian, Yassine Hadjadj-Aoul, Géraldine Texier, Philippe Bertin. An Approach to Network Service Placement using Intelligent Search Strategies over Branch-and-Bound. GLOBECOM 2021 - IEEE Global Communications Conference, Dec 2021, Madrid, Spain. pp.1-7, ⟨10.1109/GLOBECOM46510.2021.9685796⟩. ⟨hal-03510057⟩
55 View
87 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More