DSCD: Delay Sensitive Cross-Domain Virtual Network Embedding Algorithm

Abstract

In the coming 5G era, more and more applications are time-delay sensitive, and the importance of low delay in fields such as telemedicine, autonomous driving and military order transmission is self-evident. However, for different application scenarios, their delay requirements are different. How to meet different Quality of service (QoS) requirements simultaneously becomes a challenge. The emergence of network virtualization (NV) technology can overcome this problem. However, it is difficult for the existing embedding algorithms to meet the requirements of virtual networks on time delay performance. Therefore, in order to study the delay problem of virtual network, we proposed a Delay Sensitive Cross-Domain Virtual Network Embedding Algorithm (DSCD-VNE) in this paper. First of all, different from the traditional virtual network embedding (VNE) algorithm, this algorithm divides the mapping process into a “node-link-node” three-stage embedding algorithm. Second, node resource metrics and set constraints are introduced in the generation phase of candidate link matrix. Third, the algorithm takes candidate link matrix as the core, and uses Kruskal minimum spanning tree to choose the link with the shortest delay for embedding. Fourth, path splitting mechanism and $K$ -shortest path algorithm are introduced with the aim of increasing the utilization of the substrate links in link mapping stage. The simulation results show that the proposed DSCD-VNE algorithm greatly improves the performance of the algorithm compared with the traditional node-link two-stage algorithm, especially in the aspect of delay, the improvement rate is as high as 77%.