一种适合低连接度拓扑的集中式保护路由机制

发布时间：2019-02-21 16:42

【摘要】：在集中式路由中,由路由控制平台统一计算路由表进行分发,路由器不再具备决策能力,需要预先构建一种具备保护功能的路由机制,使得路由器的下游路径失效后都有立即可用的备份路径,确保报文的最小损失,已有的集中式保护路由机制在低连接度拓扑上保护效果不佳.为了解决该问题,提出了一种适合低连接度拓扑的集中式域内保护路由机制,允许失效处的相邻节点在没有可用路径时将报文返回至其上游节点,由有可用备份路径的上游节点通过备份路径发送,确保单个节点或连接失效后报文的最小损失.证明了为给定拓扑构建最优保护路由的问题是一个NP-hard问题,并且提出了解决该问题的三阶段启发式算法.在各种类型的拓扑中验证了启发式算法的性能.实验结果表明,该方法优于已有保护路由方案.
[Abstract]:In centralized routing, the routing table is distributed by the routing control platform, so the router no longer has decision-making ability, so it is necessary to construct a routing mechanism with protection function in advance. The backup path is available immediately after the downstream path of the router fails to ensure the minimum loss of packets. The existing centralized protection routing mechanism has poor protection effect on low connectivity topology. To solve this problem, a centralized intra-domain protection routing mechanism suitable for low connectivity topology is proposed, which allows adjacent nodes at failure points to return packets to their upstream nodes when there is no available path. The upstream node with available backup path is sent through the backup path to ensure the minimum loss of packets after the failure of a single node or connection. It is proved that the problem of constructing optimal protection routing for a given topology is a NP-hard problem, and a three-stage heuristic algorithm is proposed to solve the problem. The performance of the heuristic algorithm is verified in various topologies. Experimental results show that the proposed scheme is superior to the existing protection routing scheme.
【作者单位】：东南大学计算机科学与工程学院;
【基金】：国家重点基础研究发展计划(973)(2010CB328104) 国家自然科学基金(60903161,60903162,61003257,61070158,61070161,61070210) 国家科技支撑计划(2010BAI88B03,2011BAK21B02) 高等学校博士点学科专项科研基金(20110092130002) 江苏省自然科学基金(BK2008030) 江苏省网络与信息安全重点实验室资助项目(BM2003201) 教育部计算机网络与信息集成重点实验室(东南大学)资助项目(93K-9)
【分类号】：TP393.05

【相似文献】