标题:An enhanced node mapping algorithm for VNE problem based on Path Relevance
作者:Zhang, Qijia; Zhu, Fangjin; Wang, Canhui
通讯作者:Zhu, FJ
作者机构:[Zhang, Qijia; Zhu, Fangjin; Wang, Canhui] Shandong Univ, Sch Comp Sci & Technol, Jinan, Peoples R China.
会议名称:15th IEEE Int Conf on Trust, Security and Privacy in Comp and Commun / 10th IEEE Int Conf on Big Data Science and Engineering / 14th IEEE Int Symposium on Parallel and Distributed Proc with Applicat (IEEE Trustcom/BigDataSE/ISPA)
会议日期:AUG 23-26, 2016
来源:2016 IEEE TRUSTCOM/BIGDATASE/ISPA
出版年:2016
页码:1204-1209
DOI:10.1109/TrustCom.2016.193
关键词:virtual network embedding; ant colony optimization; node degree; path; relevance
摘要:Network virtualization has been proposed to be a promising way to solve the Internet ossification problem. One of the main challenges for network virtualization is the virtual network embedding (VNE) problem, which focuses on the efficiency of the substrate resources allocation and involves the virtual node and link mapping problems. Node mapping process has serious influence on the whole mapping performance. Existing node mapping algorithms cannot efficiently support complex virtual network mapping processes, especially virtual networks with mesh topologies. The reason relies on mutual interference between shortest paths for various virtual links that are determined by node mapping process. In this paper, we introduce Path Relevance (PR) which is used to decrease the mutual interference among shortest paths, and an ant colony optimization (ACO) algorithm is proposed for the node mapping process. Our node mapping algorithm is combined with various link mapping algorithms in simulation. Simulation results show that our enhanced node mapping algorithm can help the successive link mapping process to find more suitable paths for virtual links and improve the acceptance ratio of complex virtual networks. Increasing revenue is also gained in various combinations than existing G-SP and D-ViNE algorithms.
收录类别:CPCI-S
资源类型:会议论文
TOP