Detection of Spatially-Close Fiber Segments in Optical Networks

Conference paper (2016)

Authors

M.A.F. Muhammad Iqbal Network Architectures and Services - EEMCS
S. Trajanovski Network Architectures and Services - EEMCS
F.A. Kuipers Network Architectures and Services - EEMCS
Research Group
Network Architectures and Services (EEMCS) (TU Delft)
Copyright: © 2016 M.A.F. Muhammad Iqbal, S. Trajanovski, F.A. Kuipers
DOI
help_outline
https://doi.org/10.1109/DRCN.2016.7470840
Telecommunications Communication networks Optical fiber networks Reliability engineering Ducts
More Info
expand_more

Published Date

2016-3

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Quantum & Computer Engineering

Research Group

Network Architectures and Services

Abstract

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.

Files

DRCN2016.pdf
(.pdf | 0.548 Mb)