%0 Conference Proceedings
%T A Virtual Network Embedding Algorithm Based on Graph Theory
%+ School of Computer Science and Engineering [Beijing]
%+ Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory
%+ School of Computer Science [Wuhan]
%A Sun, Zhenxi
%A Bai, Yuebin
%A Wang, Songyang
%A Cao, Yang
%A Xu, Shubin
%Z Part 1: Session 1: Parallel Programming and Algorithms
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 10th International Conference on Network and Parallel Computing (NPC)
%C Guiyang, China
%Y Ching-Hsien Hsu
%Y Xiaoming Li
%Y Xuanhua Shi
%Y Ran Zheng
%I Springer
%3 Network and Parallel Computing
%V LNCS-8147
%P 1-12
%8 2013-09-19
%D 2013
%R 10.1007/978-3-642-40820-5_1
%K Virtual Network
%K VN Embedding
%K Graph Theory
%K Node Similarity
%Z Computer Science [cs]Conference papers
%X Network virtualization is becoming a promising way of removing the inherent ossification of the Internet, and has been steadily attracting more and more researchers’ attention during the decades. The major challenges in this field are improving the efficiency of virtual network embedding procedure and raising the rate of virtual network requests being successfully accepted by the substrate network. This paper introduces a new virtual network embedding algorithm based on node similarity, which means the similarity between the virtual nodes and the substrate nodes. For more details, by calculating the degree of nodes both in virtual network and substrate network, which is actually the number of links associated with them, the algorithm achieves better mapping results between virtual network and the substrate network on the topology aspect.
%G English
%2 https://inria.hal.science/hal-01513758/document
%2 https://inria.hal.science/hal-01513758/file/978-3-642-40820-5_1_Chapter.pdf
%L hal-01513758
%U https://inria.hal.science/hal-01513758
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-NPC
%~ IFIP-LNCS-8147