Virtual Network Embedding Algorithm Based Connective Degree and Comprehensive Capacity

摘要

Network virtualization allows multiple virtual networks to coexist on a shared physical substrate infrastructure. As far as possible to support more virtual networks on a shared substrate network, efficient physical resource utilization is crucial. This paper presents a novel approach to increase utility of the substrate network. As an optimization problem, such virtual network embedding problem is formulated as an integer linear programming model. By introducing a sliding window with priority for VN requests, the algorithm embeds virtual nodes based on both connective degree and comprehensive capacity. Experimental results show that comparing with the existing VNE algorithm the proposed algorithm achieve higher VNs accept ratio and gain higher revenuecost ratio for substrate network.