Heuristic Service Chain Construction Algorithm Based on VNF Performances for Optimal Data Transmission Services

Yasuhito SUMI  Takuji TACHIBANA  

Publication
IEICE TRANSACTIONS on Communications   Vol.E104-B   No.7   pp.817-828
Publication Date: 2021/07/01
Publicized: 2021/01/08
Online ISSN: 1745-1345
DOI: 10.1587/transcom.2020CQP0011
Type of Manuscript: Special Section PAPER (Special Section on Future Directions of Research and Development on Communication Quality)
Category: 
Keyword: 
service chaining,  virtual network function,  network function virtualization,  optimization problem,  heuristic algorithm,  

Full Text: PDF>>
Buy this Article




Summary: 
In network function virtualization (NFV) environments, service chaining is an emerging technology that enables network operators to provide network service dynamically and flexibly by using virtual network function (VNF). In the service chaining, a service chain is expected to be constructed based on VNF performances such as dependences among VNFs and traffic changing effects in VNFs. For achieving optimal data transmission services in NFV environments, we focus on the optimal service chain construction based on VNF performances so that both the maximum amount of traffic on links and the total number of VNF instances are decreased. In this paper, at first, an optimization problem is formulated for determining placements of VNFs and a route for each service chain. The service chains can be constructed by solving this optimization problem with an optimization software or meta-heuristic algorithm. Then, for the optimization problem, we propose a heuristic service chain construction algorithm. By using our proposed algorithm, the service chains can be constructed appropriately more quickly. We evaluate the performance of the proposed heuristic algorithm with simulation, and we investigate the effectiveness of the heuristic algorithm from the performance comparison. From some numerical examples, we show that the proposed heuristic algorithm is effective to decrease the amount of traffic and the number of VNF instances. Moreover, it is shown that our proposed heuristic algorithm can construct service chains quickly.