Research on Mapping Algorithm of High-Priority Low-Latency Network Slicing
The article proposes a high-priority low-latency network slice mapping algorithm(P-ADE)to address the problem of long queuing time for high-priority network slices.The algo-rithm establishes a network slice queuing model using a priority task queue,and divides network slice mapping into two parts:node mapping and link mapping.In node mapping,high-priority network slices are allocated with high-performance resources,and virtual network functions are mapped to corresponding devices.For link mapping,the article proposes an improved differenti-al evolution algorithm(ADE)to solve the optimal path,and designs a corresponding virtual link mapping algorithm.Simulation results show that the P-ADE algorithm effectively improves the problem of long latency for high-priority network slices under different network slice sizes.
万方数据
维普
