Virtual Network Embedding Based on Complex Network Theory

DOI

10.2991/icmemtc-16.2016.88How to use a DOI?

Keywords

virtual network; betweenness centrality based on random walks; cluster coefficient.

Abstract

How to effectively map the virtual network in the network infrastructure is a huge challenge in network virtualization. In this paper, for the first time, we evaluate the global network node weight according to the betweenness centrality based on random walks, then introduce cluster coefficient theory into the virtual network embedding to evaluate the topological information and bandwidth resource of the link local which is around the target node to complete the twice evaluation of node. Based on the two points above, we put forward the virtual network mapping algorithm based on social network centrality. Experimental results show that the new algorithm can increase the revenue/cost (R/C) ratio and acceptance ratio.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Junwei Ge
AU  - Ruizhi Yuan
AU  - Yiqiu Fang
PY  - 2016/04
DA  - 2016/04
TI  - Virtual Network Embedding Based on Complex Network Theory
BT  - Proceedings of the 2016 3rd International Conference on Materials Engineering, Manufacturing Technology and Control
PB  - Atlantis Press
SP  - 455
EP  - 458
SN  - 2352-5401
UR  - https://doi.org/10.2991/icmemtc-16.2016.88
DO  - 10.2991/icmemtc-16.2016.88
ID  - Ge2016/04
ER  -