A VNF Placement Method based on VNF Characteristics

Abstract

Network Function Virtualization (NFV) is a technology that provides the network function made through software based on virtualization technology to a high-performance universal server, separating the existing hardware-dependent network equipment into the hardware part and the software part. NFV-related technologies include various elementary technologies, such as virtualization technology, Virtual Network Function (VNF) placement technology, Service Function Chaining (SFC) technology, and resource management technology, and in particular, research on how to assign VNFs efficiently is actively discussed as a key technology. The VNF placement technology aims to operate VNFs with stable performance to the maximum within the limited resources through efficient placement, and it is investigated in various ways based on the optimization algorithms, such as Integer Linear Programming (ILP) algorithm, greedy algorithm, and Dynamic Programming algorithm, which have been used in the computing field previously. This paper proposes a method for VNF placement using information about resources of each node, a method to assign VNFs to each node more efficiently compared to the existing scheme based on the total volume of resources. In addition, this paper proposes a method for looking for the appropriate node for placement in advance through periodic information about resources update prior to VNF placement and assigning VNFs fast upon request for the placement, instead of calculating information about resources and assigning VNF when there is a request for VNF placement.