Service Chain Construction Algorithm for Maximizing Total Data Throughput in Resource-Constrained NFV Environments
Summary :
In resource-constrained network function virtualization (NFV) environments, it is expected that data throughput for service chains is maintained by using virtual network functions (VNFs) effectively. In this paper, we formulate an optimization problem for maximizing the total data throughput in resource-constrained NFV environments. Moreover, based on our formulated optimization problem, we propose a heuristic service chain construction algorithm for maximizing the total data throughput. This algorithm also determines the placement of VNFs, the amount of resources for each VNF, and the transmission route for each service chain. It is expected that the heuristic algorithm can construct service chains more quickly than the meta-heuristic algorithm. We evaluate the performance of the proposed methods with simulations, and we investigate the effectiveness of our proposed heuristic algorithm through a performance comparison. Numerical examples show that our proposed methods can construct service chains so as to maximize the total data throughput regardless of the number of service chains, the amount of traffic, and network topologies.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E103-B No.4 pp.335-346
- Publication Date
- 2020/04/01
- Publicized
- 2019/10/08
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2019NRP0008
- Type of Manuscript
- Special Section PAPER (Special Section on Network Resource Control and Management Technologies for Sustainable Social Information Infrastructure)
- Category
Authors
Daisuke AMAYA
University of Fukui
Shunsuke HOMMA
NTT Corporation
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
Daisuke AMAYA, Shunsuke HOMMA, Takuji TACHIBANA, "Service Chain Construction Algorithm for Maximizing Total Data Throughput in Resource-Constrained NFV Environments" in IEICE TRANSACTIONS on Communications,
vol. E103-B, no. 4, pp. 335-346, April 2020, doi: 10.1587/transcom.2019NRP0008.
Abstract: In resource-constrained network function virtualization (NFV) environments, it is expected that data throughput for service chains is maintained by using virtual network functions (VNFs) effectively. In this paper, we formulate an optimization problem for maximizing the total data throughput in resource-constrained NFV environments. Moreover, based on our formulated optimization problem, we propose a heuristic service chain construction algorithm for maximizing the total data throughput. This algorithm also determines the placement of VNFs, the amount of resources for each VNF, and the transmission route for each service chain. It is expected that the heuristic algorithm can construct service chains more quickly than the meta-heuristic algorithm. We evaluate the performance of the proposed methods with simulations, and we investigate the effectiveness of our proposed heuristic algorithm through a performance comparison. Numerical examples show that our proposed methods can construct service chains so as to maximize the total data throughput regardless of the number of service chains, the amount of traffic, and network topologies.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2019NRP0008/_p
Copy
@ARTICLE{e103-b_4_335,
author={Daisuke AMAYA, Shunsuke HOMMA, Takuji TACHIBANA, },
journal={IEICE TRANSACTIONS on Communications},
title={Service Chain Construction Algorithm for Maximizing Total Data Throughput in Resource-Constrained NFV Environments},
year={2020},
volume={E103-B},
number={4},
pages={335-346},
abstract={In resource-constrained network function virtualization (NFV) environments, it is expected that data throughput for service chains is maintained by using virtual network functions (VNFs) effectively. In this paper, we formulate an optimization problem for maximizing the total data throughput in resource-constrained NFV environments. Moreover, based on our formulated optimization problem, we propose a heuristic service chain construction algorithm for maximizing the total data throughput. This algorithm also determines the placement of VNFs, the amount of resources for each VNF, and the transmission route for each service chain. It is expected that the heuristic algorithm can construct service chains more quickly than the meta-heuristic algorithm. We evaluate the performance of the proposed methods with simulations, and we investigate the effectiveness of our proposed heuristic algorithm through a performance comparison. Numerical examples show that our proposed methods can construct service chains so as to maximize the total data throughput regardless of the number of service chains, the amount of traffic, and network topologies.},
keywords={},
doi={10.1587/transcom.2019NRP0008},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - Service Chain Construction Algorithm for Maximizing Total Data Throughput in Resource-Constrained NFV Environments
T2 - IEICE TRANSACTIONS on Communications
SP - 335
EP - 346
AU - Daisuke AMAYA
AU - Shunsuke HOMMA
AU - Takuji TACHIBANA
PY - 2020
DO - 10.1587/transcom.2019NRP0008
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E103-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2020
AB - In resource-constrained network function virtualization (NFV) environments, it is expected that data throughput for service chains is maintained by using virtual network functions (VNFs) effectively. In this paper, we formulate an optimization problem for maximizing the total data throughput in resource-constrained NFV environments. Moreover, based on our formulated optimization problem, we propose a heuristic service chain construction algorithm for maximizing the total data throughput. This algorithm also determines the placement of VNFs, the amount of resources for each VNF, and the transmission route for each service chain. It is expected that the heuristic algorithm can construct service chains more quickly than the meta-heuristic algorithm. We evaluate the performance of the proposed methods with simulations, and we investigate the effectiveness of our proposed heuristic algorithm through a performance comparison. Numerical examples show that our proposed methods can construct service chains so as to maximize the total data throughput regardless of the number of service chains, the amount of traffic, and network topologies.
ER -
English
