检索结果-南通市图书馆

Efficient virtual network embedding Algorithm Based on restrictive selection and optimization theory Approach

China Communications 2017年第10期14卷 39-60页

作者： Haotong Cao Zhicheng Qu Yishi Xue Longxiang Yang College of Communication and Information Engineering Nanjing University of Posts and Telecommunications Nanjing China Wolfson School of Mechanical Electrical and Manufacturing Engineering Loughborough University Leicestershire UK Key Laboratory of Broadband Wireless Communication and Sensor network Technique Ministry of Education Nanjing University of Postsand Telecommunications Nanjing China Wireless Communication Key Laboratory of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing China

network virtualization(NV) is widely considered as a key component of the future network and promises to allow multiple virtual networks(VNs) with different protocols to coexist on a shared substrate network(SN). One main challenge in NV is virtual network embedding(VNE). VNE is a nphard problem. Previous VNE algorithms in the literature are mostly heuristic, while the remaining algorithms are exact. heuristic algorithms aim to find a feasible embedding of each VN, not optimal or sub-optimal, in polynomial time. Though presenting the optimal or sub-optimal embedding per VN, exact algorithms are too time-consuming in smallscaled networks, not to mention moderately sized networks. To make a trade-off between the heuristic and the exact, this paper presents an effective algorithm, labeled as VNE-RSOT(restrictive selection and optimization theory), to solve the VNE problem. The VNERSOT can embed virtual nodes and links per VN simultaneously. The restrictive selection contributes to selecting candidate substrate nodes and paths and largely cuts down on the number of integer variables, used in the following optimization theory approach. The VNE-RSOT fights to minimize substrate resource consumption and accommodates more VNs. To highlight the efficiency of VNERSOT, a simulation against typical and stateof-art heuristic algorithms and a pure exact algorithm is made. Numerical results reveal that virtual network request(VNR) acceptance ratio of VNE-RSOT is, at least, 10% higher than the best-behaved heuristic. Other metrics, such as the execution time, are also plotted to emphasize and highlight the efficiency of VNE-RSOT.

关键词： network virtualization virtual network embedding np-hard heuristic exact restrictive selection optimization theory

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：