Greedy-Based VNF Placement Algorithm for Dynamic Multipath Service Chaining

Kohei TABOTA; Takuji TACHIBANA

doi:10.1587/transcom.2018NVP0006

Greedy-Based VNF Placement Algorithm for Dynamic Multipath Service Chaining

Kohei TABOTA, Takuji TACHIBANA

Full Text Views

0

Cite this

Summary :

Softwarized networks are expected to be utilized as a core network for the 5th Generation (5G) mobile services. For the mobile core network architecture, service chaining is expected to be utilized for dynamically steering traffic across multiple network functions. In this paper, for dynamic multipath service chaining, we propose a greedy-based VNF placement algorithm. This method can provide multipath service chaining so as to utilize the node resources such as CPU effectively while decreasing the cost about bandwidth and transmission delay. The proposed algorithm consists of four difference algorithms, and VNFs are placed appropriately with those algorithm. Our proposed algorithm obtains near optimal solution for the formulated optimization problem with a greedy algorithm, and hence multipath service chains can be provided dynamically. We evaluate the performance of our proposed method with simulation and compare its performance with the performances of other methods. In numerical examples, it is shown that our proposed algorithm can provide multipath service chains appropriately so as to utilize the limited amount of node resources effectively. Moreover, it is shown that our proposed algorithm is effective for providing service chaining dynamically in large-scale network.

Publication: IEICE TRANSACTIONS on Communications Vol.E102-B No.3 pp.429-438

Publication Date: 2019/03/01

Publicized: 2018/09/20

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2018NVP0006

Type of Manuscript: Special Section PAPER (Special Section on Network Virtualization and Network Softwarization for Diverse 5G Services)

Category

Authors

Kohei TABOTA
University of Fukui
Takuji TACHIBANA
University of Fukui

Keyword

service chaining, multipath, VNF, greedy algorithm, NFV, mobile core networks

Cite this

Copy

Kohei TABOTA, Takuji TACHIBANA, "Greedy-Based VNF Placement Algorithm for Dynamic Multipath Service Chaining" in IEICE TRANSACTIONS on Communications, vol. E102-B, no. 3, pp. 429-438, March 2019, doi: 10.1587/transcom.2018NVP0006.
Abstract: Softwarized networks are expected to be utilized as a core network for the 5th Generation (5G) mobile services. For the mobile core network architecture, service chaining is expected to be utilized for dynamically steering traffic across multiple network functions. In this paper, for dynamic multipath service chaining, we propose a greedy-based VNF placement algorithm. This method can provide multipath service chaining so as to utilize the node resources such as CPU effectively while decreasing the cost about bandwidth and transmission delay. The proposed algorithm consists of four difference algorithms, and VNFs are placed appropriately with those algorithm. Our proposed algorithm obtains near optimal solution for the formulated optimization problem with a greedy algorithm, and hence multipath service chains can be provided dynamically. We evaluate the performance of our proposed method with simulation and compare its performance with the performances of other methods. In numerical examples, it is shown that our proposed algorithm can provide multipath service chains appropriately so as to utilize the limited amount of node resources effectively. Moreover, it is shown that our proposed algorithm is effective for providing service chaining dynamically in large-scale network.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018NVP0006/_p

Copy

@ARTICLE{e102-b_3_429,
author={Kohei TABOTA, Takuji TACHIBANA, },
journal={IEICE TRANSACTIONS on Communications},
title={Greedy-Based VNF Placement Algorithm for Dynamic Multipath Service Chaining},
year={2019},
volume={E102-B},
number={3},
pages={429-438},
abstract={Softwarized networks are expected to be utilized as a core network for the 5th Generation (5G) mobile services. For the mobile core network architecture, service chaining is expected to be utilized for dynamically steering traffic across multiple network functions. In this paper, for dynamic multipath service chaining, we propose a greedy-based VNF placement algorithm. This method can provide multipath service chaining so as to utilize the node resources such as CPU effectively while decreasing the cost about bandwidth and transmission delay. The proposed algorithm consists of four difference algorithms, and VNFs are placed appropriately with those algorithm. Our proposed algorithm obtains near optimal solution for the formulated optimization problem with a greedy algorithm, and hence multipath service chains can be provided dynamically. We evaluate the performance of our proposed method with simulation and compare its performance with the performances of other methods. In numerical examples, it is shown that our proposed algorithm can provide multipath service chains appropriately so as to utilize the limited amount of node resources effectively. Moreover, it is shown that our proposed algorithm is effective for providing service chaining dynamically in large-scale network.},
keywords={},
doi={10.1587/transcom.2018NVP0006},
ISSN={1745-1345},
month={March},}

Copy

TY - JOUR
TI - Greedy-Based VNF Placement Algorithm for Dynamic Multipath Service Chaining
T2 - IEICE TRANSACTIONS on Communications
SP - 429
EP - 438
AU - Kohei TABOTA
AU - Takuji TACHIBANA
PY - 2019
DO - 10.1587/transcom.2018NVP0006
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E102-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2019
AB - Softwarized networks are expected to be utilized as a core network for the 5th Generation (5G) mobile services. For the mobile core network architecture, service chaining is expected to be utilized for dynamically steering traffic across multiple network functions. In this paper, for dynamic multipath service chaining, we propose a greedy-based VNF placement algorithm. This method can provide multipath service chaining so as to utilize the node resources such as CPU effectively while decreasing the cost about bandwidth and transmission delay. The proposed algorithm consists of four difference algorithms, and VNFs are placed appropriately with those algorithm. Our proposed algorithm obtains near optimal solution for the formulated optimization problem with a greedy algorithm, and hence multipath service chains can be provided dynamically. We evaluate the performance of our proposed method with simulation and compare its performance with the performances of other methods. In numerical examples, it is shown that our proposed algorithm can provide multipath service chains appropriately so as to utilize the limited amount of node resources effectively. Moreover, it is shown that our proposed algorithm is effective for providing service chaining dynamically in large-scale network.
ER -