The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Espera-se que as redes softwarizadas sejam utilizadas como rede central para os serviços móveis de 5ª Geração (5G). Para a arquitetura da rede central móvel, espera-se que o encadeamento de serviços seja utilizado para direcionar dinamicamente o tráfego através de múltiplas funções de rede. Neste artigo, para encadeamento dinâmico de serviços multicaminho, propomos um algoritmo de posicionamento VNF baseado em guloseima. Este método pode fornecer encadeamento de serviços de múltiplos caminhos, de modo a utilizar os recursos do nó, como CPU, de forma eficaz, ao mesmo tempo que diminui o custo de largura de banda e atraso de transmissão. O algoritmo proposto consiste em quatro algoritmos de diferença, e os VNFs são colocados apropriadamente com esses algoritmos. Nosso algoritmo proposto obtém uma solução quase ótima para o problema de otimização formulado com um algoritmo ganancioso e, portanto, cadeias de serviços multipercurso podem ser fornecidas dinamicamente. Avaliamos o desempenho do nosso método proposto com simulação e comparamos seu desempenho com o desempenho de outros métodos. Em exemplos numéricos, é mostrado que nosso algoritmo proposto pode fornecer cadeias de serviços de múltiplos caminhos de forma adequada, de modo a utilizar efetivamente a quantidade limitada de recursos do nó. Além disso, é mostrado que nosso algoritmo proposto é eficaz para fornecer encadeamento de serviços dinamicamente em redes de grande escala.
Kohei TABOTA
University of Fukui
Takuji TACHIBANA
University of Fukui
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.
Copiar
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
Copiar
@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},}
Copiar
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 -