DOI

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.
Original languageEnglish
Title of host publication2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)
EditorsP. Chemouil, A. Pattavina, E. Gourdin, S. Secci
Place of PublicationDanvers
PublisherIEEE
Pages95-102
Number of pages8
ISBN (Electronic)978-1-4673-8496-4
DOIs
StatePublished - Mar 2016
Event2016 12th International Conference on the Design of Reliable Communication Networks (DRCN) - Paris, France

Conference

Conference2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)
Abbreviated titleDRCN 2016
CountryFrance
CityParis
Period14/03/1617/03/16

    Research areas

  • Optical fiber networks, Telecommunications, Ducts, Reliability engineering, Communication networks

ID: 14959417