Affiliations: [a] College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China
| [b]
Hochschule für Technik und Wirtschaft Berlin, Germany
Correspondence:
[*]
Corresponding author. Jianzhang Wu, College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China. Tel.: +86 4403877466372828. E-mail: jzwu@njnet.edu.cn.
Abstract: In the NFV network, the availability of resource scheduling can be transformed to the existence of the fractional factor in the corresponding NFV network graph. Researching on the existence of special fractional factors in network structure can help to construct the NFV network with the efficient application of resources. The concept of fractional (g, f, n′, m)-critical deleted graph is corresponding to the structure of NFV network where certain sites and channels are occupied in some period of time. In this paper, we present several sharp degree conditions for a graph to be an all fractional (g, f, n′, m)-critical deleted graph. These results extend the corresponding conclusions raised in Gao et al. [9].
Keywords: NFV network, resource scheduling, all fractional factor, all fractional (g, f, n′, m)-critical deleted graph
