VNF-P: A model for efficient placement of virtualized network functions
VNF-P: A model for efficient placement of virtualized network functions
复制标题
DOI：
10.1109/cnsm.2014.7014205
复制
发表时间：
2014-11
期刊：
影响因子：
--
通讯作者：
Hendrik Moens;F. Turck
中科院分区：
文献类型：
--
作者：
Hendrik Moens;F. Turck
网络功能虚拟化(NFV)是一种即将到来的范例，它将网络功能虚拟化并拆分成多个构建块，这些构建块可以链接在一起以提供所需的功能。这种方法提高了网络灵活性和可伸缩性，因为这些构建块可以在运行时根据需求进行分配和重新分配。这种方法的成功取决于算法的存在和性能，这些算法决定了这些构建块在哪里实例化以及如何实例化。本文提出并评价了NFV环境下虚拟网络功能资源分配的形式化模型，我们称之为虚拟网络功能布局问题(VNF-P)。我们关注的是混合场景，其中部分服务可能由专用物理硬件提供，而部分服务使用虚拟服务实例提供。我们使用一个小型服务提供商场景和两种类型的服务链对VNF-P模型进行了评估，并评估了其执行速度。我们发现，对于小型服务提供商场景，算法在16秒或更短的时间内完成，从而使其能够对不断变化的需求做出快速反应。
Network Functions Virtualization (NFV) is an upcoming paradigm where network functionality is virtualized and split up into multiple building blocks that can be chained together to provide the required functionality. This approach increases network flexibility and scalability as these building blocks can be allocated and reallocated at runtime depending on demand. The success of this approach depends on the existence and performance of algorithms that determine where, and how these building blocks are instantiated. In this paper, we present and evaluate a formal model for resource allocation of virtualized network functions within NFV environments, a problem we refer to as Virtual Network Function Placement (VNF-P). We focus on a hybrid scenario where part of the services may be provided by dedicated physical hardware, and where part of the services are provided using virtualized service instances. We evaluate the VNF-P model using a small service provider scenario and two types of service chains, and evaluate its execution speed. We find that the algorithms finish in 16 seconds or less for a small service provider scenario, making it feasible to react quickly to changing demand.