Computer and Modernization

Previous Articles     Next Articles

Virtual Network Embedding Based on Node’s Multiple Attributes Ranking

  

  1. 1. College of Computer & Communication Engineering, China University of Petroleum (East China), Qingdao 266580, China;
    2. State Key Lab of Networking and Switching, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2016-06-17 Online:2016-11-15 Published:2016-11-23

Abstract:  To address the problem that the node ranking algorithm only takes node’s computing resources and neighbor’s bandwidth resources into consideration, this paper proposed a novel virtual network embedding algorithm based on node’s multiple attributes ranking. This algorithm takes advantage of node’s multiple attributes to measure the node’s importance, in order to make the adjacent virtual nodes mapping onto the adjacent substrate nodes, to accomplish the node mapping stage through the breadth first search of graph, to finish the link mapping stage using the K-shortest path algorithm. Simulation results show that, the proposed algorithm can improve the acceptance ratio of virtual network requests and revenue/cost (R/C) ratio.

Key words: virtual network embedding, multiple attributes ranking, breadth first search, node mapping, link mapping

CLC Number: