Network Function Placement for Service Chains with Server Maintenance Cost

Network function virtualization (NFV) is a technique of building new network architecture that can decouple network functions from proprietary equipment and thus increase the flexibility of network services deployment while reducing the total cost significantly. In the NFV scheme, network functions are placed on generic servers over the network. When a network service is requested, it will be implemented by chaining several Virtual Network Functions (VNFs) placed on servers to form a Service Function Chain (SFC). The deployment of SFC faces an unprecedented challenge: when several network services are requested, which servers should be chosen to form service function chains while minimizing the total cost? Many existing optimization models consider the feasibility of placing the SFCs or minimizing the resource consumed by the VNFs. However, activate and maintain a server to hold VNFs also consume a huge amount of energy, and it's possible to lower the total energy cost by carefully arrange the servers with low maintenance cost. Therefore, in this paper, to investigate the network function placement for service chains with server maintenance cost, we propose a heuristic algorithm, which firstly construct a server set that may accommodate all service chains with low server maintenance cost. Then it formulates a linear programming to find the schemes of chaining the VNFs (also called placement configurations) with minimum communication cost in the server set, and obtain its optimal fractional solutions. Eventually, we perform a rounding scheme to achieve integer solutions that out-performs the greedy scheme in many evaluations.

[1]  Joseph Naor,et al.  Near optimal placement of virtual network functions , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[2]  L. Velasco,et al.  Minimizing energy costs in federated datacenters under uncertain green energy availability , 2014, 2014 16th International Conference on Transparent Optical Networks (ICTON).

[3]  John C. S. Lui,et al.  On the Theory of Function Placement and Chaining for Network Function Virtualization , 2018, MobiHoc.

[4]  Sang Il Kim,et al.  Method for VNF Placement for Service Function Chaining optimized in the NFV Environment , 2019, 2019 Eleventh International Conference on Ubiquitous and Future Networks (ICUFN).

[5]  Eiji Oki,et al.  Virtual Network Function Placement Model for Service Chaining to Relax Visit Order and Routing Constraints , 2018, 2018 IEEE 7th International Conference on Cloud Networking (CloudNet).

[6]  Jie Wu,et al.  A Novel Algorithm for NFV Chain Placement in Edge Computing Environments , 2018, 2018 IEEE Global Communications Conference (GLOBECOM).

[7]  Ruiting Zhou.  An Online Placement Scheme for VNF Chains in Geo-Distributed Clouds , 2018, 2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS).

[8]  Harvey J. Greenberg.  Greedy Algorithms for Minimum Spanning Tree , 1998 .

[9]  Djamal Zeghlache,et al.  A multi-objective non-dominated sorting genetic algorithm for VNF chains placement , 2018, 2018 15th IEEE Annual Consumer Communications & Networking Conference (CCNC).

[10]  Juan Felipe Botero,et al.  Coordinated Allocation of Service Function Chains , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).

[11]  Raouf Boutaba,et al.  Service Function Chaining Simplified , 2016, ArXiv.

[12]  Vyas Sekar,et al.  Making middleboxes someone else's problem: network processing as a cloud service , 2012, SIGCOMM '12.

[13]  Takuji Tachibana,et al.  VNF Placement with Optimization Problem Based on Data Throughput for Service Chaining , 2018, 2018 IEEE 7th International Conference on Cloud Networking (CloudNet).