通信学报 ›› 2013, Vol. 34 ›› Issue (12): 79-83.doi: 10.3969/j.issn.1000-436X.2013.12.009

• 学术论文 • 上一篇    下一篇

区分服务QoP的可生存虚拟网络映射算法研究

刘光远,双锴,苏森   

  1. 北京邮电大学 网络与交换技术国家重点实验室,北京100876
  • 出版日期:2013-12-25 发布日期:2017-07-05
  • 基金资助:
    国家自然科学基金资助项目;国家重点基础研究发展计划基金资助项目;国家自然科学基金委创新研究群体基金资助项目

Survivable virtual network mapping with differentiated services QoP

Guang-yuan LIU,Kai SHUANG,Sen SU   

  1. State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China
  • Online:2013-12-25 Published:2017-07-05
  • Supported by:
    The National Natural Science Foundation of China;The National Bas ic Research Program of China;Innovative Research Groups of the National Natural Science Foundation of China

摘要:

用户对虚拟网保护需求呈现多样化的趋势,针对如何实现不同需求的可生存虚拟网映射是当前研究亟待解决的问题。建立了区分保护质量(QoP)的可生存虚拟网络映射问题的数学模型,然后提出了一种启发式算法进行求解。该算法包括广度优先搜索的节点映射策略和区分QoP的链路映射策略。模拟实验表明,该算法不仅能满足用户不同的虚拟网保护需求,而且相比现有算法降低了底层网络资源开销。

关键词: 可生存虚拟网络映射, 区分服务QoP, 数学模型, 启发式

Abstract:

The protection needs of virtual network are more and more diversified.So how to realize survival virtual net-work mapping of different needs is the important issue.The mathematical model of differentiated services QoP issue was formulated.Then a heuristic algorithm was proposed to solve it.The simulation results demonstrate the algorithm can sa-tisfy various virtual networks protection for users and decline the substrate network bandwidth cost compared with other algorithms.

Key words: survival virtual network mapping, differentiated services QoP, mathematical model, heuristic

No Suggested Reading articles found!