A Virtual Network Mapping Algorithm Based on Time

作     者：Ming Jiang Zhiyang Zhao Min Zhang Jingfan Tang Chunming Wu Xiao Min 

作者机构：Institute of Software and Intelligent Technology Hangzhou Dianzi University Hangzhou China College of Computer Science and Technology Zhejiang University Hangzhou China Mathematics and Information Engineering College of Jiaxing University Jiaxing China 

出 版 物：《Chinese Journal of Electronics》 

年 卷 期：2025年第23卷第1期

页      面：31-36页

学科分类：0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 

基　　金：National Basic Research Program of China (973 Program) National Natural Science Foundation of China 

摘      要：As one of the challenges for network virtualization, virtual network embedding which maps Virtual network (VN) to the substrate network and allocates resources according to the requirements of VN in an efficient way has gained great attention. Existing algorithms generally make their decision according to the present available substrate network resource, especially bandwidth. This paper proposes a time-based VN embedding algorithm. A probability model is formulated to obtain the maximum probability that the available resources of substrate network can be used by succeeding VN requests. The probability is set as the weight of the node and the greedy algorithm is employed to embed the virtual node. The reciprocal of the probability is set as the weight of the link and the shortest path algorithm is employed to embed the virtual link. Simulation experiments show that the proposed algorithm increases the acceptance rate and the revenue compared to the existing algorithms.