面向底层单节点失效的轻量级可靠虚拟网络映射算法

发布时间：2018-08-30 16:27

【摘要】：网络可靠性是虚拟网络设计的一个重要指标,目前得到了越来越多的关注。该文对轻量级可靠的虚拟网络映射问题进行研究。目标是不预留底层网络保护资源,当底层物理网络单节点失效时,虚拟网络拓扑除失效虚拟节点外仍保持连通,将损失降到最小。文章首先给出了存在轻量级可靠虚拟网络映射可能的必要条件并加以证明,然后基于此条件对面向底层单节点失效的轻量级可靠虚拟网络映射问题进行整数线性规划建模,最后设计了一种新的启发式算法对其进行求解。该算法包括拓扑感知的虚拟节点映射策略和一种基于禁忌搜索(tabu search)算法的虚拟链路映射策略。模拟实验结果表明,该文提出的算法在得到轻量级可靠虚拟网络映射的同时,仍能获得较高的底层网络长期运行平均收益和底层网络资源利用率。
[Abstract]:Network reliability is an important index of virtual network design, and has been paid more and more attention. In this paper, the problem of lightweight and reliable virtual network mapping is studied. The goal is not to reserve the protection resources of the underlying network. When the single node of the underlying physical network fails, the virtual network topology remains connected except the failed virtual node, and the loss is minimized. In this paper, the necessary conditions for the existence of lightweight reliable virtual network mapping are first given and proved. Based on this condition, the integer linear programming model of the lightweight reliable virtual network mapping problem for the failure of the underlying single node is established. Finally, a new heuristic algorithm is designed to solve the problem. The algorithm includes topologically aware virtual node mapping strategy and a virtual link mapping strategy based on Tabu search (tabu search) algorithm. The simulation results show that the proposed algorithm not only can obtain the lightweight and reliable virtual network mapping, but also can obtain a high long-term average operating income of the underlying network and the utilization of the underlying network resources.
【作者单位】：北京邮电大学网络与交换技术国家重点实验室;
【基金】：国家自然科学基金(61170274) 国家973计划项目(2011CB302506) 工业和信息化部国家科技重大专项(2011ZX03002-001-01) 国家自然科学基金委创新研究群体项目(60821001) 河北省自然科学基金(F2011402028)资助课题
【分类号】：TP393.1

【参考文献】