PTN网状网拓扑设计动态删枝算法

针对分组传送网(PTN)网状网拓扑的特点,为提高PTN网状网拓扑设计中的计算效率,提出了一种改进的PTN网状网拓扑设计动态删枝算法(SR-DE)。该算法先分析PTN网络资源和业务信息,在对优化网络成本循环中动态改变每次循环中删除冗余链路数量,并对业务进行稳定路由,因此可以减少了网络权值的改变次数,避免对业务重复路由,提高了计算效率。模拟仿真结果表明,该算法有效地提高了设计满足业务需求PTN网状网拓扑的计算效率。

Dynamic branch elimination algorithm for topological design of PTN mesh networks

According to the characteristics of Packet Transport Network (PTN) mesh network topology, an improved dynamic elimination algorithm for topological design of PTN mesh networks, Dynamic Elimination of Stable Route (SR-DE) algorithm, was proposed to improve computational efficiency of PTN mesh network topology design. The algorithm first analyzed the PTN network resource and business information, and then the algorithm dynamically changed the number of eliminated branches in each loop of eliminating redundant links, routed the business through stable route, so it could reduce the number of network weights change and avoid the repeat route of business and increase the efficiency of computation. The simulation results show it can improve the computational efficiency of PTN mesh topology design.