Joint Optimization of Chain Placement and Request Scheduling for Network Function Virtualization

• Published in: Proceedings of the International Conference on Distributed Computing Systems pp. 731 - 741
• Main Authors: Qixia Zhang, Yikai Xiao, Fangming Liu, Lui, John C. S., Jian Guo, Tao Wang
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2017
• Subjects: Chain Placement; Computational modeling; Heuristic algorithms; Mathematical model; Network Function Virtualization (NFV); Open Jackson Network; Packet loss; Processor scheduling; Request Scheduling; Resource management; Response Latency; Schedules
• ISSN: 1063-6927
• DOI: 10.1109/ICDCS.2017.232

Compared with executing Network Functions (NFs) on dedicated hardwares, the recent trend of Network Function Virtualization (NFV) holds the promise for operators to flexibly deploy software-based NFs on commodity servers. However, virtual NFs (VNFs) are normally "chained" together to provide a specific network service. Thus, an efficient scheme is needed to place the VNF chains across the network and effectively schedule requests to service instances, which can maximize the average resource utilization of each node in service and simultaneously minimize the average response latency of each request. To this end, we formulate first VNF chains placement problem as a variant of bin-packing problem, which is NP-hard, and we model request scheduling problem based on the key concepts from open Jackson network. To jointly optimize the performance of NFV, we propose a priority-driven weighted algorithm to improve resource utilization and a heuristic algorithm to reduce response latency. Through extensive trace-driven simulations, we show that our methods can indeed enhance performance in diverse scenarios. In particular, we can improve the average resource utilization by 33.4% and can reduce the average total latency by 19.9% as compared with the state-of-the-art methods.