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
A cadeia de funções de serviço (SFC) é uma série de funções de rede virtuais ordenadas (VNFs) para processar fluxos de tráfego no ambiente de rede virtualizado de redes futuras. Neste artigo, apresentamos um modelo matemático e um esquema baseado em programação dinâmica para resolver o problema de posicionamento de SFC em redes de substrato equipadas com capacidade de virtualização de funções de rede (NFV). Neste artigo, primeiro formulamos o custo geral de colocação de SFC como a combinação do custo de configuração e do custo de operação. Em seguida, formulamos o problema de posicionamento SFC como um modelo de programação linear inteira (ILP) com o objetivo de minimizar o custo geral de configuração e operação, e propomos um esquema de posicionamento SFC baseado em programação dinâmica com reconhecimento de atraso para grandes redes. Realizamos simulações numéricas para avaliar o esquema proposto. Analisamos o custo e o desempenho da rede sob diferentes objetivos de otimização, com e sem manter a ordem das VNFs no SFC. Medimos a taxa de sucesso, a utilização de recursos e o atraso ponta a ponta do SFC em diferentes topologias. Os resultados mostram que o esquema proposto supera outros esquemas relacionados em vários cenários.
Yansen XU
University of Electro-Communications
Ved P. KAFLE
University of Electro-Communications,National Institute of Information and Communications Technology (NICT)
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
Yansen XU, Ved P. KAFLE, "A Mathematical Model and Dynamic Programming Based Scheme for Service Function Chain Placement in NFV" in IEICE TRANSACTIONS on Information,
vol. E102-D, no. 5, pp. 942-951, May 2019, doi: 10.1587/transinf.2018NTP0015.
Abstract: Service function chain (SFC) is a series of ordered virtual network functions (VNFs) for processing traffic flows in the virtualized networking environment of future networks. In this paper, we present a mathematical model and dynamic programing based scheme for solving the problem of SFC placement on substrate networks equipped with network function virtualization (NFV) capability. In this paper, we first formulate the overall cost of SFC placement as the combination of setup cost and operation cost. We then formulate the SFC placement problem as an integer linear programing (ILP) model with the objective of minimizing the overall cost of setup and operation, and propose a delay aware dynamic programming based SFC placement scheme for large networks. We conduct numeric simulations to evaluate the proposed scheme. We analyze the cost and performance of network under different optimization objectives, with and without keeping the order of VNFs in SFC. We measure the success rate, resources utilization, and end to end delay of SFC on different topologies. The results show that the proposed scheme outperforms other related schemes in various scenarios.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2018NTP0015/_p
Copiar
@ARTICLE{e102-d_5_942,
author={Yansen XU, Ved P. KAFLE, },
journal={IEICE TRANSACTIONS on Information},
title={A Mathematical Model and Dynamic Programming Based Scheme for Service Function Chain Placement in NFV},
year={2019},
volume={E102-D},
number={5},
pages={942-951},
abstract={Service function chain (SFC) is a series of ordered virtual network functions (VNFs) for processing traffic flows in the virtualized networking environment of future networks. In this paper, we present a mathematical model and dynamic programing based scheme for solving the problem of SFC placement on substrate networks equipped with network function virtualization (NFV) capability. In this paper, we first formulate the overall cost of SFC placement as the combination of setup cost and operation cost. We then formulate the SFC placement problem as an integer linear programing (ILP) model with the objective of minimizing the overall cost of setup and operation, and propose a delay aware dynamic programming based SFC placement scheme for large networks. We conduct numeric simulations to evaluate the proposed scheme. We analyze the cost and performance of network under different optimization objectives, with and without keeping the order of VNFs in SFC. We measure the success rate, resources utilization, and end to end delay of SFC on different topologies. The results show that the proposed scheme outperforms other related schemes in various scenarios.},
keywords={},
doi={10.1587/transinf.2018NTP0015},
ISSN={1745-1361},
month={May},}
Copiar
TY - JOUR
TI - A Mathematical Model and Dynamic Programming Based Scheme for Service Function Chain Placement in NFV
T2 - IEICE TRANSACTIONS on Information
SP - 942
EP - 951
AU - Yansen XU
AU - Ved P. KAFLE
PY - 2019
DO - 10.1587/transinf.2018NTP0015
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2019
AB - Service function chain (SFC) is a series of ordered virtual network functions (VNFs) for processing traffic flows in the virtualized networking environment of future networks. In this paper, we present a mathematical model and dynamic programing based scheme for solving the problem of SFC placement on substrate networks equipped with network function virtualization (NFV) capability. In this paper, we first formulate the overall cost of SFC placement as the combination of setup cost and operation cost. We then formulate the SFC placement problem as an integer linear programing (ILP) model with the objective of minimizing the overall cost of setup and operation, and propose a delay aware dynamic programming based SFC placement scheme for large networks. We conduct numeric simulations to evaluate the proposed scheme. We analyze the cost and performance of network under different optimization objectives, with and without keeping the order of VNFs in SFC. We measure the success rate, resources utilization, and end to end delay of SFC on different topologies. The results show that the proposed scheme outperforms other related schemes in various scenarios.
ER -