Title
Repeatable optimization algorithm based discrete PSO for virtual network embedding
Abstract
Aiming at reducing the link load and improving substrate network resource utilization ratio, we model the virtual network embedding (VNE) problem as an integer linear programming and present a discrete particle swarm optimization based algorithm to solve the problem. The approach allows multiple virtual nodes of the same VN can be embedded into the same physical node as long as there is enough resource capacity. It not only can cut down embedding processes of virtual link and reduce the embedding time, but also can save the physical link cost and make more virtual networks to be embedded at the same time. Simulation results demonstrate that comparing with the existing VNE algorithm, the proposed algorithm performs better for accessing more virtual networks and reducing embedding cost.
Year
DOI
Venue
2013
10.1007/978-3-642-39065-4_41
ISNN (1)
Keywords
Field
DocType
discrete pso,virtual network embedding,physical link cost,link load,embedding cost,virtual link,virtual network,embedding time,repeatable optimization algorithm,embedding process,existing vne algorithm,multiple virtual node
Virtual network,Particle swarm optimization,Mathematical optimization,Embedding,Virtual link,Computer science,Integer programming,Optimization algorithm,Virtual network embedding,Network virtualization,Distributed computing
Conference
Citations 
PageRank 
References 
1
0.35
7
Authors
5
Name
Order
Citations
PageRank
Ying Yuan195.28
Cong Wang2139.63
Cong Wan332.16
Cong Wang410.69
Xin Song5156.88