An enhanced node repeatable virtual network embedding algorithm based PSO solution

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The major challenge in network virtualization is the efficient mapping of virtual nodes and links of virtual networks onto substrate network. In this paper we propose ENR-VNE, an algorithm which can achieves high VN request acceptance ratio in the same time. We modeled VNE problem as an optimal problem to minimize the substrate resource utilization degree. Leverage the advantage of ram data switch between virtual machines host on same physical machine instead of using physical link bandwidth, our algorithm allow repeatable node mapping for same VN. Because the initial value of PSO algorithm is crucial, we present an initial position assign method to accelerate convergence and achieve more repeatable features. Simulation results show that our algorithm achieve high acceptance ratio on same substrate network than un-repeatable approach and initial position assign method can further improve the algorithm performance. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wang, C., Yuan, Y., Yang, Y., & Hu, X. (2013). An enhanced node repeatable virtual network embedding algorithm based PSO solution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7928 LNCS, pp. 210–217). https://doi.org/10.1007/978-3-642-38703-6_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free