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

发布时间：2018-05-28 10:00

本文选题：可生存虚拟网络映射 + 区分服务QoP　；参考：《通信学报》2013年12期

【摘要】：用户对虚拟网保护需求呈现多样化的趋势,针对如何实现不同需求的可生存虚拟网映射是当前研究亟待解决的问题。建立了区分保护质量(QoP)的可生存虚拟网络映射问题的数学模型,然后提出了一种启发式算法进行求解。该算法包括广度优先搜索的节点映射策略和区分QoP的链路映射策略。模拟实验表明,该算法不仅能满足用户不同的虚拟网保护需求,而且相比现有算法降低了底层网络资源开销。
[Abstract]:Users have diversified requirements for virtual network protection. How to realize the survivable virtual network mapping with different requirements is an urgent problem to be solved. A mathematical model of survivable virtual network mapping problem is established, and a heuristic algorithm is proposed to solve the problem. The algorithm includes a node mapping strategy based on breadth-first search and a link mapping strategy that distinguishes QoP. The simulation results show that the proposed algorithm can not only meet the different protection requirements of the users, but also reduce the overhead of the underlying network resources compared with the existing algorithms.
【作者单位】：北京邮电大学网络与交换技术国家重点实验室;
【基金】：国家自然科学基金资助项目(61170274) 国家重点基础研究发展计划基金资助项目(2011CB302506) 国家自然科学基金委创新研究群体基金资助项目(60821001)~~
【分类号】：TP393.01

【参考文献】