一种PTN网络路由调度方法  

A Routing Scheduling Method for PTN Networks

作　　者：王锐[1] WANG Rui(China Mobile Group Guangdong Co.,Ltd.,Guangzhou 510623,China)

机构地区：[1]中国移动通信集团广东有限公司,广东广州510623

出　　处：《移动通信》2023年第2期82-86,98,共6页Mobile Communications

摘　　要：针对现有技术方案无法解决复杂业务约束路由调度问题的现状,提出一种PTN网络路由调度方法,通过将路由调度问题转换成节点遍历问题,结合改进后的Dijkstra算法和带变异策略的最大最小蚂蚁算法求解经过起点、终点及各必经点的较优路由。改进后的算法在计算时间复杂度和空间复杂度都有不同程度提升,达到快速、精准计算PTN网络路由的目的。同时,该方法考虑已有路由方案和个性化需求,减少人工干预工作量,具有一定的通用性。Since the existing technical solutions cannot solve the problem that complicated services constrain the routing scheduling,a routing scheduling method is proposed for PTN networks.Specifically,via converting the routing scheduling problem into a node traversal problem,an improved Dijkstra algorithm and a max-min ant algorithm with a mutation scheme are combined to calculate a good route going through the starting point,ending point and each necessary point.The proposed algorithm has been improved in computational time complexity and spatial complexity with different degrees,and the purpose of fast and accurate calculation of PTN routing is realized.Meanwhile,this method considers the existing routing schemes and personalized requirements,reduces the workload of manual intervention and has a certain generality.

关 键 词：DIJKSTRA算法 最大最小蚂蚁算法 分组传送网 路由调度 调度优化 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]