基于可满足性模理论的虚拟网映射问题求解  

VIRTUAL NETWORK MAPPING PROBLEM BASED ON SATISFIABILITY MODULE THEORY

作　　者：余建军[1] 吴春明[2] Yu Jianjun;Wu Chunming(School of Information Engineering,Quzhou College of Technology,Quzhou 324000,Zhejiang,China;College of Computer Science and Technology,Zhejiang University,Hangzhou 310027,Zhejiang,China)

机构地区：[1]衢州职业技术学院信息工程学院,浙江衢州324000 [2]浙江大学计算机科学与技术学院,浙江杭州310027

出　　处：《计算机应用与软件》2023年第2期138-143,共6页Computer Applications and Software

基　　金：浙江省自然科学基金项目(LY14F020010);国家高技术研究发展计划(863计划)项目(2015AA016103);国家重点研发计划项目(2016YFB0800102);浙江省重点研发计划项目(2017C01064)。

摘　　要：针对物理网络不支持路径分割且物理节点不支持重复映射的虚拟网映射问题,建立以物理网络资源消耗量最小化为目标的整数线性规划模型;基于可满足性模理论,构建这类虚拟网映射问题的SMT公式,并采用SMT求解器求解最优解。实验表明,所提方法能有效提高虚拟网络构建请求的接受率和物理网络提供商的长期收益。For the virtual network mapping problem where the physical network does not support path splitting and the physical nodes do not support repeated mapping,this paper constructs an integer linear programming model with the goal of minimizing the consumption of physical network resources.Based on the satisfiability module theory(SMT),it constructed SMT formulas for this kind of virtual network mapping problem and used the SMT solver to work out the optimal solution.The experimental results show that the proposed method can effectively improve the acceptance ratio of virtual network construction requests and the long-term profit of physical network providers.

关 键 词：虚拟网映射 可满足性模理论 SMT公式 最优解 

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