Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2014, Vol. 37 ›› Issue (s1): 8-11.doi: 10.13190/j.jbupt.2014.s1.002

• Papers • Previous Articles     Next Articles

Random Virtual Network Embedding Algorithm Based on Maximum Independent Link Set

WANG Ying, XIONG Wen-cheng, LI Wen-jing   

  1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2013-11-08 Online:2014-06-28 Published:2014-06-28
  • Supported by:
     

Abstract:

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.

Key words: network virtualization, virtual network embedding, matching, independent link set, random, load balancing

CLC Number: