Hybrid Virtual Network Embedding with Time-oriented Scheduling Policy

Network virtualization provides a powerful tool to allow multiple networks, each customized to a specific purpose, to run on a shared substrate. However, a big challenge is how to map multiple virtual networks onto specific nodes and links in the shared substrate network, known as virtual network embedding problem. Previous works in virtual network embedding can be decomposed to two classes: two-stage virtual network embedding and onestage virtual network embedding. In this paper, by pruning the topology of virtual network using k-core decomposition, a hybrid virtual network embedding algorithm, with consideration of location constraints, is proposed to leverage the respective advantage of the two kinds of algorithm simultaneously in the mapping process. In addition, a time-oriented scheduling policy is introduced to improve the mapping performance. We conduct extensive simulations and the results show that the proposed algorithm has better performance in the long-term run.