IEICE TRANSACTIONS on Information
A Mathematical Model and Dynamic Programming Based Scheme for Service Function Chain Placement in NFV
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E102-D No.5 pp.942-951
- Publication Date
- 2019/05/01
- Publicized
- 2019/02/27
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2018NTP0015
- Type of Manuscript
- Special Section PAPER (Special Section on the Architectures, Protocols, and Applications for the Future Internet)
- Category
Authors
Yansen XU
University of Electro-Communications
Ved P. KAFLE
University of Electro-Communications,National Institute of Information and Communications Technology (NICT)
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
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
Copy
@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},}
Copy
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 -
English
