Abstract:
Network function virtualization (NFV) is a network built by an architectural concept and
technique that involves the different information technologies for the virtualized functioning of
different nodes and switches involved in it. Network function virtualization also creates a
virtualized environment for commodity hardware that runs the different services by using the
Network Function NFs through chaining and placement. Therefore, the involvement of chaining
and placement in network function virtualization makes our services and applications easy and
fast to accessible. However, it will be more cost-effective and will be a reason for increasing
robustness throughout the whole working system.
To optimize the NFV chaining and placement, it is necessary to ensure that resource
allocation is carefully carried out and orchestrated, preventing under or over-utilized NFs and
service placement. In this order, we have formalized the network function chaining and
placement problem and to cope with NFV placement, we propose the lightweight network
function placement solution that takes into account dynamic hardware parameters and finding the
shortest path to determine the utilization to place the Network function NF. In the process of
chaining, we have performed the automation of the system as well. We have also demonstrated
that we can run the Network function NFs with minimal 12 MB RAM and one vCPU to acquire
our expected outputs.
