检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李航 温向明[1,2,3] 孔紫璇[1,2,3] 向万 王鲁晗 LI Hang;WEN Xiangming;KONG Zixuan;XIANG Wan;WANG Luhan(School of Information and Communications Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,China;Beijing Key Laboratory of Network System Architecture and Convergence,Beijing University of Posts and Telecommunications,Beijing 100876,China;Beijing Laboratory of Advanced Information Networks,Beijing University of Posts and Telecommunications,Beijing 100876,China)
机构地区:[1]北京邮电大学信息与通信工程学院,北京100876 [2]北京邮电大学网络体系构建与融合北京市重点实验室,北京100876 [3]北京邮电大学先进信息网络北京实验室,北京100876
出 处:《北京邮电大学学报》2022年第2期9-15,共7页Journal of Beijing University of Posts and Telecommunications
基 金:国家重点研发计划项目(2019YFB1803301);北京市自然科学基金项目(L202002);国家自然科学基金项目(61801036)。
摘 要:网络切片通过业务链部署来实现切片的创建和编排。针对网络切片中的业务链部署,考虑了业务链的多样化需求,并引入了虚拟网络功能共享和准入控制,以降低部署成本并提高业务链的接受率。将上述问题建模成一个最大化网络净收益的优化模型,提出了部署算法。仿真结果表明,所提的部署算法优于已有的基准算法,能达到接近最优的性能。Network slicing realizes the creation and orchestration of slices through service function chain embedding. However, the service function chain embedding in network slicing should consider diversified requirements of service function chains, reduce deployment costs and increase the acceptance ratio by taking virtual network function sharing and admission control into consideration. The service chain embedding for network slicing with diversified requirements is studied, where virtual network function sharing and admission control are introduced. First, the above problem is formulated as an optimization model that maximizes the network net revenue, and then an embedding algorithm is devised. The simulation results show that the proposed algorithm outperforms the existing benchmark algorithm, and achieves near-optimal performance.
分 类 号:TP393.0[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222