Paper Info
Title
An Approach to Network Service Placement using Intelligent Search Strategies over Branch-and-Bound
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 significant improvements.
Year
DOI
Venue
2021
10.1109/GLOBECOM46510.2021.9685796
2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)
Keywords
DocType
ISSN
Network function virtualization, branch and bound, artificial intelligence, a-star
Conference
2334-0983
Citations 
PageRank 
References 
0
0.34
0
Authors
4
Name
Order
Citations
PageRank
Masoud Taghavian100.34
Yassine Hadjadj Aoul215825.25
Géraldine Texier3486.84
Philippe Bertin4393.77