电信科学 ›› 2014, Vol. 30 ›› Issue (2): 70-75.doi: 10.3969/j.issn.1000-0801.2014.02.009

• 研究与开发 • 上一篇    下一篇

基于二分图K优完美匹配的虚拟网映射算法设计

余建军1,吴春明2   

  1. 1 衢州职业技术学院 衢州 324000
    2 浙江大学人工智能研究所 杭州 310027
  • 出版日期:2014-02-15 发布日期:2017-06-20
  • 基金资助:
    国家自然科学基金资助项目;国家自然科学基金资助项目;国家重点基础研究发展计划(“973”计划)基金资助项目;浙江省教育厅科研项目

Design of Virtual Network Mapping Algorithm Based on K-Best Perfect Matchings of Bipartite Graph

Jianjun Yu1,Chunming Wu2   

  1. 1 Quzhou College of Technology,Quzhou 324000,China
    2 AI Institute,Zhejiang University,Hangzhou 310027,China
  • Online:2014-02-15 Published:2017-06-20

摘要:

为提高虚拟节点映射的可行性,基于可行性检验定理和用于衡量节点可用性的节点等级指标,设计了基于二分图K优完美匹配的以降低映射代价为目标的虚拟网映射迭代算法。实验表明,所提出的算法能提高虚拟网构建请求接受率和虚拟网构建收益代价比,从而提高物理网提供商的收益。

关键词: 虚拟网节点映射, 节点等级, 可行性检验定理, 二分图K优完美匹配

Abstract:

To improve the feasibility of virtual node mapping,grounded on feasibility test theorem and node rank indicators used to measure node availability,the virtual network mapping iterative algorithm based on K-best perfect matchings of bipartite graph was proposed,aiming at reducing mapping cost.Experiment shows that the proposed algorithm increases virtual network construction request acceptance ratio and benefit cost ratio,and hence can improve profit of physical network service provider.

Key words: virtual node mapping, node rank, feasibility test theorem, K-best perfect matchings of bipartite graph

No Suggested Reading articles found!