%0 Journal Article
%A LI Wen-jing
%A WANG Ying
%A XIONG Wen-cheng
%T Random Virtual Network Embedding Algorithm Based on Maximum Independent Link Set
%D 2014
%R 10.13190/j.jbupt.2014.s1.002
%J Journal of Beijing University of Posts and Telecommunications
%P 8-11
%V 37
%N s1
%X <p>A random virtual network embedding algorithm based on maximum independent link set was proposed. The algorithm redefines the concept of matching in the graph theory for the weighted graph and names it as independent link set.In order to improve the success rate of the virtual network embedding and reduce consumption of link embedding,in the stage of embedding virtual links in the independent link set, physical links are filtered by the availability of resources, and then the virtual link is randomly embedded to a single physical link.Randomly embedding can guarantee the load balancing for physical network. Simulation results show that the algorithm can effectively reduce the link consumption and improve virtual network acceptance rate.</p>
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2014.s1.002