A Dynamic Energy-saving Deployment Algorithm for Virtual Data Centers

Network Function Virtualization (NFV) is a rapidly evolving network technology in recent years. The purpose of NFV is to use virtualization technology to softwareize network functions, and dynamically deploy virtual network functions (VNFs) according to the usage status of network links and the service requirements of users. NFV can increase the flexibility of network services and the utilization of network resources. In the proposed paper, we analyze the user data of urban computing, and propose that the time and location of the user’s use of the network service is subject to regular changes. Based on this judement, we propose a new energy-saving deployment method for virtual data centers (vDCs). In this paper, we formalize the placement problem of vDC into a multicommodity flow problem and address it as an integer linear programming (ILP). We design a centrality-based greedy algorithm and evaluate its effectiveness by comparing the proposed algorithm with the ILP optimal solution. The evaluation results show that the greedy algorithm proposed in this paper can obtain the approximate optimal solution of ILP, and the running time of the proposed algorithm is shorter than the ILP solution when the number of network nodes increases.