A Routing Optimization and Application for Power Grid Communication Service Based on Minimized Trenches

There is a frequent phenomenon that optical cables pass through identical trenches in metro cable topologies. Early operations engineers used the shortest path algorithm to configure the work and protected routes of power services. With the advancement of urban infrastructure, some trenches will inevitably be damaged, leading to an increase in power grid communication service interruption numbers. This paper proposes a route optimization algorithm for power grid communication services based on minimized trenches. First, the urban optical path topology is modeled, and the output function is aimed at minimizing common trenches’ work-protect route. Then, the deep first search (DFS) fusion sorting algorithm selects all the service’s working routes. Next, the corresponding route of the work route is deleted, and all protected routes are found by using the fusion-sorted DFS algorithm again. Subsequently, the groups with the least common trench between the work and protected route are calculated and used as the final primary and secondary routes for the service. Finally, the effectiveness and practicability of the algorithm are verified by computer simulation and application examples from the Anhui metropolitan area network, respectively.