A new algorithm of virtual network embedding based on minimum node stress and adjacent principle

As the main approach of solving the ossification of current internet, network virtualization has been the focus of international future network research. The core problem of the area is virtual network embedding, which is centering on how to efficiently map the virtual requests to the substrate network. In order to reduce the computational complexity, previous researches mainly devise heuristic algorithm and divide the whole process into node mapping and link mapping. But most of them consider separately node mapping and link mapping, which may lead to poor performance of the whole algorithm because of the unreasonable node mapping. In this paper, a new algorithm is proposed based on the minimum node stress and adjacent principle. During the period of node mapping, the node stress is kept balanced. Meanwhile, using the adjacent principle, the link stress can be reduced to a low level. Thus, the possibility of bottleneck node is reduced and the resource of substrate network can be efficiently used. The simulation demonstrates that the new algorithm reduces the maximum node stress and link stress of the substrate network, and makes it load balance.