Topology-aware virtual network embedding based on closeness centrality

被引:17
作者
Wang, Zihou [1 ]
Han, Yanni [1 ]
Lin, Tao [1 ]
Xu, Yuemei [1 ]
Ci, Song [1 ,2 ,3 ]
Tang, Hui [1 ]
机构
[1] Chinese Acad Sci, Inst Acoust, High Performance Network Lab, Beijing 100190, Peoples R China
[2] Univ Nebraska Lincoln, Dept Comp & Elect Engn, Omaha, NE 68182 USA
[3] Univ Nebraska Lincoln, Dept Elect & Engn, Omaha, NE 68182 USA
基金
中国国家自然科学基金;
关键词
network virtualization; virtual network embedding; complex networks; closeness centrality; INTERNET;
D O I
10.1007/s11704-013-2108-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
080201 [机械制造及其自动化];
摘要
Network virtualization aims to provide a way to overcome ossification of the Internet. However, making efficient use of substrate resources requires effective techniques for embedding virtual networks: mapping virtual nodes and virtual edges onto substrate networks. Previous research has presented several heuristic algorithms, which fail to consider that the attributes of the substrate topology and virtual networks affect the embedding process. In this paper, for the first time, we introduce complex network centrality analysis into the virtual network embedding, and propose virtual network embedding algorithms based on closeness centrality. Due to considering of the attributes of nodes and edges in the topology, our studies are more reasonable than existing work. In addition, with the guidance of topology quantitative evaluation, the proposed network embedding approach largely improves the network utilization efficiency and decreases the embedding complexity. We also investigate our algorithms on real network topologies (e.g., AT&T, DFN) and random network topologies. Experimental results demonstrate the usability and capability of the proposed approach.
引用
收藏
页码:446 / 457
页数:12
相关论文
共 31 条
[1]
Overcoming the Internet impasse through virtualization [J].
Anderson, T ;
Peterson, L ;
Shenker, S ;
Turner, J .
COMPUTER, 2005, 38 (04) :34-+
[2]
[Anonymous], 2006, Efficient mapping of virtual networks onto a shared substrate
[3]
[Anonymous], 2004, WOMEN HEALTH
[4]
Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[5]
In VINI veritas: Realistic and controlled network experimentation [J].
Bavier, Andy ;
Feamster, Nick ;
Huang, Mark ;
Peterson, Larry ;
Rexford, Jennifer .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (04) :3-14
[6]
Virtual Network Embedding Through Topology-Aware Node Ranking [J].
Cheng, Xiang ;
Su, Sen ;
Zhang, Zhongbao ;
Wang, Hanchi ;
Yang, Fangchun ;
Luo, Yan ;
Wang, Jie .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2011, 41 (02) :39-47
[7]
ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping [J].
Chowdhury, Mosharaf ;
Rahman, Muntasir Raihan ;
Boutaba, Raouf .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2012, 20 (01) :206-219
[8]
A survey of network virtualization [J].
Chowdhury, N. M. Mosharaf Kabir ;
Boutaba, Raouf .
COMPUTER NETWORKS, 2010, 54 (05) :862-876
[9]
Resource management with hoses: Point-to-cloud services for virtual private networks [J].
Duffield, NG ;
Goyal, P ;
Greenberg, A ;
Mishra, P ;
Ramakrishnan, KK ;
van der Merwe, JE .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (05) :679-692
[10]
Eppstein D., 1994, Proceedings. 35th Annual Symposium on Foundations of Computer Science (Cat. No.94CH35717), P154, DOI 10.1109/SFCS.1994.365697