从联结数角度看NFV网络中的资源调度条件  

Resource Dispatching Conditions in NFV Networks from Binding Number Perspective

作　　者：吴剑章 Wu Jianzhang(College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China)

机构地区：[1]南京航天航空大学,计算机科学与技术学院,南京211106

出　　处：《数学理论与应用》2022年第3期46-60,共15页Mathematical Theory and Applications

摘　　要：在资源调度网络中,资源调度的可行性等价于对应网络图中分数因子的存在性.研究特定图结构中分数因子的存在性可以帮助工程师设计和构建有效利用资源的网络.一个图称为全分数(g,f,n′,m)-临界消去图,如果从G中删除任何n′个顶点后,剩余的图仍然是全分数(g,f,m)-消去图.在本文中,我们给出两个使图成为全分数(g,f,n′,m)-临界消去图的联结数条件,并且通过例子说明结果是紧的.In the resource scheduling network,the availability of resource scheduling is equivalent to the existence of the fractional factor in the corresponding network graph.The study on the existence of fractional factors in specific graph structure can help engineers design and construct the network with efficient use of resources.A graph G is called an all fractional(g,f,n′,m)critical deleted graph if after removing any n′vertices from G the remaining graph is still an all fractional(g,f,m)deleted graph.In this paper,we present two binding number conditions for a graph to be an all fractional(g,f,n′,m)critical deleted graph,and illustrate the results are sharp with examples.

关 键 词：NFV网络 资源调度 全分数因子 全分数(g f n′ m)-临界消去图 

分 类 号：TP393.01[自动化与计算机技术—计算机应用技术]