Dynamic branch elimination algorithm for topological design of PTN mesh networks
Jie Chen · Journal of Computer Applications · 2010
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.