TY - GEN
T1 - Performance guarantee aware orchestration for service function chains with elastic demands
AU - Wen, Tao
AU - Yu, Hongfang
AU - Du, Xiaojiang
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/12/7
Y1 - 2017/12/7
N2 - In this paper, we study how to provide optimal performance guarantee in multi-resource scenarios, such as Network Function Virtualization (NFV), where Virtual Network Function (VNF) resource demands of one Service Function Chain (SFC) are elastic and correlated with the end-to-end throughput of SFC. Previous works such as Dominant Resource Fairness (DRF) achieve this goal only if the demands are already orchestrated to dedicated resource instances. However, how to orchestrate SFC to VNF instances is a key issue in NFV. Few previous works have investigated the relationship between them. In this paper, we consider the problem of SFC orchestration subject to DRF allocation scheme so as to find the orchestration scheme with optimal performance guarantee. We analyze it and model it as SFC Performance Guarantee (SFC-PG) problem, followed by a Mixed Integer Linear Programming (MILP) formulation. We design a heuristic Performance Guarantee Aware Orchestration (PGAO) to solve it in large scale cases. We conduct simulations with a variety of circumstances and parameters, and the results demonstrate that PGAO achieves better performance compared to existing solutions.
AB - In this paper, we study how to provide optimal performance guarantee in multi-resource scenarios, such as Network Function Virtualization (NFV), where Virtual Network Function (VNF) resource demands of one Service Function Chain (SFC) are elastic and correlated with the end-to-end throughput of SFC. Previous works such as Dominant Resource Fairness (DRF) achieve this goal only if the demands are already orchestrated to dedicated resource instances. However, how to orchestrate SFC to VNF instances is a key issue in NFV. Few previous works have investigated the relationship between them. In this paper, we consider the problem of SFC orchestration subject to DRF allocation scheme so as to find the orchestration scheme with optimal performance guarantee. We analyze it and model it as SFC Performance Guarantee (SFC-PG) problem, followed by a Mixed Integer Linear Programming (MILP) formulation. We design a heuristic Performance Guarantee Aware Orchestration (PGAO) to solve it in large scale cases. We conduct simulations with a variety of circumstances and parameters, and the results demonstrate that PGAO achieves better performance compared to existing solutions.
KW - Network Function Virtualization
KW - Performance Guarantee
KW - Service Function Chaining
UR - http://www.scopus.com/inward/record.url?scp=85043271744&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85043271744&partnerID=8YFLogxK
U2 - 10.1109/NFV-SDN.2017.8169854
DO - 10.1109/NFV-SDN.2017.8169854
M3 - Conference contribution
AN - SCOPUS:85043271744
T3 - 2017 IEEE Conference on Network Function Virtualization and Software Defined Networks, NFV-SDN 2017
SP - 1
EP - 4
BT - 2017 IEEE Conference on Network Function Virtualization and Software Defined Networks, NFV-SDN 2017
T2 - 2017 IEEE Conference on Network Function Virtualization and Software Defined Networks, NFV-SDN 2017
Y2 - 6 November 2017 through 8 November 2017
ER -