Genetic Algorithm for Service Function Chaining in NFV

초록

Network function virtualization (NFV) is a network architecture concept that virtualizes network functions into building blocks of software. NFV can reduce cost and increase operational efficiency by assigning a network function that specific equipment has to a virtualized general server. Such virtualized functions should be connected or chained together to create communication services. This technology is called a service function chaining (SFC) and SFC should be computed with consideration of two or more conditions such as bandwidth, memory, and CPU of virtualized resources and physical node. It is irrelevant to use conventional distance vector routing algorithm or link state routing algorithm to find the optimal path while maintaining multiple constraints. This paper suggests a method of finding an efficient routing path by using genetic algorithm with consideration of multiple conditions regarding this issue.