Skip to Main content Skip to Navigation
Conference papers

A Virtual Network Embedding Algorithm Based on Graph Theory

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01513758
Contributor : Hal Ifip <>
Submitted on : Tuesday, April 25, 2017 - 2:33:25 PM
Last modification on : Tuesday, September 3, 2019 - 3:56:00 PM
Long-term archiving on: : Wednesday, July 26, 2017 - 2:02:06 PM

File

978-3-642-40820-5_1_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

167

Files downloads

326