Affiliations: [a] College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China
| [b] Department of Mathematics, Comsats Institute of Information Technology, Sahiwal, Pakistan
Correspondence:
[*]
Corresponding author. Jianzhang Wu, College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China Tel.: +86 4403877466372828. E-mail: [email protected].
Abstract: Network function virtualization (NFV) can be regarded as the latest trick development in the provisioning of network service. Software programs are running on virtual machines and industry standard servers to replace the traditional hardware middleboxes, and thus lead to flexibility, service agility and cost decreasing. A basic problem in NFV service chain provisioning is the ability of resource scheduling which equals to the existence of fractional factor. The concept of all fractional (g, f, n′, m)-critical deleted graph is the extension of fractional (g, f, n′, m)-critical deleted graph. In this paper, we consider the resource scheduling problem in NFV networks using graph theory, and an independent set degree condition and an independent set neighborhood union condition for all fractional (g, f, n′, m)-critical deleted graphs are determined. Furthermore, we show that the result are tight on independent set condition.
Keywords: NFV network, resource scheduling, all fractional factor, all fractional (g, f, n′, m)-critical deleted graph, independent set degree condition, independent set neighborhood union condition
