Detection of Spatially-Close Fiber Segments in Optical Networks

Spatially-close network fibers have a significant chance of failing simultaneously in the event of man-made or natural disasters within their geographic area. Network operators are interested in the proper detection and grouping of any existing spatially-close fiber segments, to avoid service disruptions due to simultaneous fiber failures. Moreover, spatially-close fibers can further be differentiated by computing the intervals over which they are spatially close. In this paper, we propose (1) polynomial-time algorithms for detecting all the spatially-close fiber segments of different fibers, (2) a polynomial-time algorithm for finding the spatially-close intervals of a fiber to a set of other fibers, and (3) a fast exact algorithm for grouping spatially-close fibers using the minimum number of distinct risk groups. All of our algorithms have a fast running time when simulated on three real-world network topologies.
Network Architectures and Services