| Summary: | Virtual network mapping is a hot issue over the past decade, which aims to map virtual networks to the underlying network as required. This procedure is a NP-hard question, therefore many previous algorithms just impose some constraints or use simple heuristic method to get the relative optimal result. Traditional researches almost focus on two independent stages: node embedding and link mapping. To address existing questions such as low acceptance ratio and high mapping time, we propose an efficient and fast embedding algorithm, named as AEF(An Efficient and Fast embedding algorithm), which is a two coordinated mapping stages algorithm. AEF uses some innovative strategies in two stages to improve the mapping time and ensure high performance. It has great advantages in large-scale complex networks or occasions with high real-time requirements because of faster mapping speed. Besides, it will also have more practical value in actual scenarios due to higher acceptance ratio and more balanced link load. The worst time complexity of our AEF is proved to be O(|N<sup>S</sup>|<sup>2</sup> · |N<sup>V</sup>|·(log(|N<sup>S</sup>|) + |N<sup>V</sup>|)). A large number of experimental results show that our algorithm is faster than most other algorithms and ensures the overall better efficiency.
|
|---|