Journal of South China University of Technology (Natural Science Edition) ›› 2015, Vol. 43 ›› Issue (1): 66-71,78.doi: 10.3969/j.issn.1000-565X.2015.01.011

• Computer Science & Technology • Previous Articles     Next Articles

Virtual Network Mapping Algorithm Based on Graph Adjacency Segmentation

Peng Li - min   

  1. School of Automation Science and Engineering , South China University of Technology , Guangzhou 510640 , Guangdong , China 
  • Received:2014-07-04 Revised:2014-09-11 Online:2015-01-25 Published:2014-12-01
  • Contact: 彭利民(1976-),男,博士后,副教授,主要从事网络虚拟化、分布式计算研究 . E-mail:penglm86@126.com
  • About author:彭利民(1976-),男,博士后,副教授,主要从事网络虚拟化、分布式计算研究 .
  • Supported by:
    Supported by the National Natural Science Foundation of China ( 61103037 ) and the Natural Science Foundation of Guangdong Pronvince ( S2012040007599 )

Abstract: As the existing mapping algorithms of large-scale virtual networks are of low execution efficiency and are prone to network partition when mapping virtual nodes and links , a method of graph adjacency segmentation is proposed , which decomposes a virtual network into several adjacent star configurations and reduces the size of large-scale virtual network evidently. At the same time , a resource allocation model matching nodes and their adjacency links is proposed , which enables nodes mapping to adapt links ’ resource state and makes links mapping match with the resource size of related nodes in a coordinated way. Thus , the inharmonious operation of mapping nodes and links , as well as the mismatching of allocating network resources , is solved effectively.Simulated results show that the proposed algorithm reduces the mapping path length of virtual links and improves the mapping efficiency of virtual networks as well as the load-balancing performance , and thus high acceptance ratio of virtual network requests can be achieved.

Key words: virtual network mapping, graph, adjacency segmentation, resource allocation