IEICE TRANSACTIONS on Communications
Heuristic Service Chain Construction Algorithm Based on VNF Performances for Optimal Data Transmission Services
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.
- 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
Authors
Yasuhito SUMI
University of Fukui
Takuji TACHIBANA
University of Fukui
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yasuhito SUMI, Takuji TACHIBANA, "Heuristic Service Chain Construction Algorithm Based on VNF Performances for Optimal Data Transmission Services" in IEICE TRANSACTIONS on Communications,
vol. E104-B, no. 7, pp. 817-828, July 2021, doi: 10.1587/transcom.2020CQP0011.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2020CQP0011/_p
Copy
@ARTICLE{e104-b_7_817,
author={Yasuhito SUMI, Takuji TACHIBANA, },
journal={IEICE TRANSACTIONS on Communications},
title={Heuristic Service Chain Construction Algorithm Based on VNF Performances for Optimal Data Transmission Services},
year={2021},
volume={E104-B},
number={7},
pages={817-828},
abstract={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.},
keywords={},
doi={10.1587/transcom.2020CQP0011},
ISSN={1745-1345},
month={July},}
Copy
TY - JOUR
TI - Heuristic Service Chain Construction Algorithm Based on VNF Performances for Optimal Data Transmission Services
T2 - IEICE TRANSACTIONS on Communications
SP - 817
EP - 828
AU - Yasuhito SUMI
AU - Takuji TACHIBANA
PY - 2021
DO - 10.1587/transcom.2020CQP0011
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E104-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2021
AB - 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.
ER -
English
