检索结果-内蒙古大学图书馆

The Value of Simple Heuristics for Virtualized network function Placement

FUTURE INTERNET 2020年第10期12卷 1-16页

作者： Jahedi, Zahra Kunz, Thomas Carleton Univ Dept Syst & Comp Engn 1125 Colonel Dr Ottawa ON K1S 5B6 Canada

network function Virtualization (NFV) can lower the CAPEX and/or OPEX for service providers and allow for quick deployment of services. Along with the advantages come some challenges. The main challenge in the use of Virtualized network functions (VNF) is the VNFs' placement in the network. There is a wide range of mathematical models proposed to place the network functions (NF) optimally. However, the critical problem of mathematical models is that they are NP-hard, and consequently not applicable to larger networks. In wireless networks, we are considering the scarcity of Bandwidth (BW) as another constraint that is due to the presence of interference. While there exist many efforts in designing a heuristic model that can provide solutions in a timely manner, the primary focus with such heuristics was almost always whether they provide results almost as good as optimal solution. Consequently, the heuristics themselves become quite non-trivial, and solving the placement problem for larger networks still takes a significant amount of time. In this paper, in contrast, we focus on designing a simple and scalable heuristic. We propose four heuristics, which are gradually becoming more complex. We compare their performance with each other, a related heuristic proposed in the literature, and a mathematical optimization model. Our results demonstrate that while more complex placement heuristics do not improve the performance of the algorithm in terms of the number of accepted placement requests, they take longer to solve and therefore are not applicable to larger *** contrast, a very simple heuristic can find near-optimal solutions much faster than the other more complicated heuristics while keeping the number of accepted requests close to the results achieved with an NP-hard optimization model.

关键词： virtualized network function wireless multi-hop networks network function embedding problem Service graph linear programming interference simple fast

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：