8. Conclusion and future work
This paper aims to achieve an efficient online virtual network embedding algorithm in virtualized cloud data centers. In order to deal with the computationally intractable VNE problem, which is known as NP-hard, we formulated it as an MOLP problem with multiple practical objectives and designed an efficient VNE framework Presto consisting of a series of heuristic algorithms such as DHRO, HVNO, HVLO, HNM and HLM. With the benefit of Blocking Island paradigm derived from an AI model, Presto achieves a good performance in various aspects including revenue, embedding cost, acceptance ratio and computation efficiency. To the best of our knowledge, we are the first to apply BI model to deal with VNE problem. The extensive simulation results have witnessed the effectiveness of Presto adopting BI model. After all, there are still some open issues. For example, what the performance of Presto will be if path splitting and migration is allowed? How will the window size affect the acceptance ratio, overall revenue and embedding cost? How’s Presto’s performance if coordinated node and link mapping approach is applied? These issues are left for our future work. Besides, in future work more sophisticated recently proposed VNE algorithms will be implemented to conduct more comprehensive analysis and comparisons with our algorithm.