咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Topology-aware virtual network... 收藏

Topology-aware virtual network embedding based on closeness centrality

Topology-aware virtual network embedding based on closeness centrality

作     者:Zihou WANG Yanni HAN Tao LIN Yuemei XU Song CI Hui TANG 

作者机构:High Performance Network Laboratory Institute of Acoustics Chinese Academy of Sciences Beijing 100190 China Department of Computer and Electronics Engineering University of Nebraska-Lincoln NE 68182 USA 

出 版 物:《Frontiers of Computer Science》 (中国计算机科学前沿(英文版))

年 卷 期:2013年第7卷第3期

页      面:446-457页

核心收录:

学科分类:12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术(可授工学、理学学位)] 

基  金:This work has been supported by National Science and Technology Major Project of China (NMP) (2010ZX03004-002 and 2012ZX03003-003)  the Strategic Pilot Project of Chinese Academy of Sciences (XDA06010302)  and the National Natural Science Foundation of China (Grant No. 60972083) 

主  题:network virtualization virtual network embedding complex networks closeness centrality 

摘      要: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 net- works 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 evalua- tion, 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.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分