GPSO: A Graph-based Heuristic Algorithm for Service Function Chain Placement in Data Center Networks

Network Function Virtualization (NFV) is a promising technology. Connecting Virtual Network Functions (VNFs) forms Service Function Chains (SFCs). SFCs can flexibly orchestrate and expand network functions. However, the SFCs perform network functions that require very high reliability, even reaching the level of physical switches. Therefore, the influence of physical machines and network links can no longer be ignored when considering the reliability of SFCs. This paper proposes the Graph-based Particle Swarm Optimization (GPSO) algorithm to address the SFC placement problem. GPSO adopts a novel velocity update strategy that can adapt to the non-Euclidean structure of the physical machine topology in the data center. Compared to traditional heuristic algorithms, GPSO only needs 57% execution time and can achieve 110% fitness value. Moreover, the GPSO algorithm can trade-off reliability and resource utilization. The evaluation results show that GPSO achieves higher reliability than the state of the art algorithms under the threshold of 80% resource utilization.

[1]  Rahul Potharaju,et al.  When the network crumbles: an empirical study of cloud network failures and their impact on services , 2013, SoCC.

[2]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[3]  Junliang Chen,et al.  GMTA: A Geo-Aware Multi-Agent Task Allocation Approach for Scientific Workflows in Container-Based Cloud , 2020, IEEE Transactions on Network and Service Management.

[4]  Yuanyuan Yang,et al.  Placement of Highly Available Virtual Network Functions Through Local Rerouting , 2018, 2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS).

[5]  Yujun Wen,et al.  An Improved Artificial Fish Swarm Algorithm and its Application , 2018, 2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS).

[6]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[7]  Ryan A. Rossi,et al.  Deep Inductive Graph Representation Learning , 2020, IEEE Transactions on Knowledge and Data Engineering.

[8]  Haoran Zhang,et al.  A novel particle swarm optimization based on prey-predator relationship , 2018, Appl. Soft Comput..

[9]  Abdallah Shami,et al.  Network Function Virtualization-Aware Orchestrator for Service Function Chaining Placement in the Cloud , 2019, IEEE Journal on Selected Areas in Communications.

[10]  Subin Shen,et al.  Virtualized Network Function Consolidation Based on Multiple Status Characteristics , 2019, IEEE Access.

[11]  Bo Cheng,et al.  GTAA: A Geo-Aware Task Allocation Approach in Cloud Workflow , 2019, 2019 IEEE International Conference on Web Services (ICWS).

[12]  Jian Guo,et al.  Joint Optimization of Chain Placement and Request Scheduling for Network Function Virtualization , 2017, 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS).

[13]  Junliang Chen,et al.  Joint Availability Guarantee and Resource Optimization of Virtual Network Function Placement in Data Center Networks , 2020, IEEE Transactions on Network and Service Management.

[14]  Xueli An,et al.  Data-Center Architecture Impacts on Virtualized Network Functions Service Chain Embedding with High Availability Requirements , 2015, 2015 IEEE Globecom Workshops (GC Wkshps).