A Virtual Network Embedding Algorithm Based on Graph Theory - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

A Virtual Network Embedding Algorithm Based on Graph Theory


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.
Fichier principal
Vignette du fichier
978-3-642-40820-5_1_Chapter.pdf (374.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01513758 , version 1 (25-04-2017)





Zhenxi Sun, Yuebin Bai, Songyang Wang, Yang Cao, Shubin Xu. A Virtual Network Embedding Algorithm Based on Graph Theory. 10th International Conference on Network and Parallel Computing (NPC), Sep 2013, Guiyang, China. pp.1-12, ⟨10.1007/978-3-642-40820-5_1⟩. ⟨hal-01513758⟩
107 View
136 Download



Gmail Facebook X LinkedIn More