Detection of Spatially-Close Fiber Segments in Optical Networks

Farabi Muhammad Iqbal; Stojan Trajanovski; Fernando Kuipers

doi:10.1109/DRCN.2016.7470840

Detection of Spatially-Close Fiber Segments in Optical Networks

Farabi Muhammad Iqbal, Stojan Trajanovski, Fernando Kuipers

Network Architectures and Services

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

13 Citations (Scopus)

184 Downloads (Pure)

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.

Original language	English
Title of host publication	2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)
Editors	P. Chemouil, A. Pattavina, E. Gourdin, S. Secci
Place of Publication	Danvers
Publisher	IEEE
Pages	95-102
Number of pages	8
ISBN (Electronic)	978-1-4673-8496-4
DOIs	https://doi.org/10.1109/DRCN.2016.7470840
Publication status	Published - Mar 2016
Event	2016 12th International Conference on the Design of Reliable Communication Networks (DRCN) - Paris, France Duration: 14 Mar 2016 → 17 Mar 2016

Conference

Conference	2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)
Abbreviated title	DRCN 2016
Country/Territory	France
City	Paris
Period	14/03/16 → 17/03/16

Keywords

Optical fiber networks
Telecommunications
Ducts
Reliability engineering
Communication networks

Access to Document

10.1109/DRCN.2016.7470840

DRCN2016Accepted author manuscript, 481 KB

Cite this

@inproceedings{b777af15e14e4e4db8f647946eec6f16,

title = "Detection of Spatially-Close Fiber Segments in Optical Networks",

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.",

keywords = "Optical fiber networks, Telecommunications, Ducts, Reliability engineering, Communication networks",

author = "{Muhammad Iqbal}, Farabi and Stojan Trajanovski and Fernando Kuipers",

year = "2016",

month = mar,

doi = "10.1109/DRCN.2016.7470840",

language = "English",

pages = "95--102",

editor = "P. Chemouil and A. Pattavina and E. Gourdin and S. Secci",

booktitle = "2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)",

publisher = "IEEE",

address = "United States",

note = "2016 12th International Conference on the Design of Reliable Communication Networks (DRCN), DRCN 2016 ; Conference date: 14-03-2016 Through 17-03-2016",

}

Muhammad Iqbal, F, Trajanovski, S & Kuipers, F 2016, Detection of Spatially-Close Fiber Segments in Optical Networks. in P Chemouil, A Pattavina, E Gourdin & S Secci (eds), 2016 12th International Conference on the Design of Reliable Communication Networks (DRCN). IEEE, Danvers, pp. 95-102, 2016 12th International Conference on the Design of Reliable Communication Networks (DRCN), Paris, France, 14/03/16. https://doi.org/10.1109/DRCN.2016.7470840

Detection of Spatially-Close Fiber Segments in Optical Networks. / Muhammad Iqbal, Farabi; Trajanovski, Stojan; Kuipers, Fernando.
2016 12th International Conference on the Design of Reliable Communication Networks (DRCN). ed. / P. Chemouil; A. Pattavina; E. Gourdin; S. Secci. Danvers: IEEE, 2016. p. 95-102.

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Detection of Spatially-Close Fiber Segments in Optical Networks

AU - Muhammad Iqbal, Farabi

AU - Trajanovski, Stojan

AU - Kuipers, Fernando

PY - 2016/3

Y1 - 2016/3

N2 - 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.

AB - 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.

KW - Optical fiber networks

KW - Telecommunications

KW - Ducts

KW - Reliability engineering

KW - Communication networks

U2 - 10.1109/DRCN.2016.7470840

DO - 10.1109/DRCN.2016.7470840

M3 - Conference contribution

SP - 95

EP - 102

BT - 2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)

A2 - Chemouil, P.

A2 - Pattavina, A.

A2 - Gourdin, E.

A2 - Secci, S.

PB - IEEE

CY - Danvers

T2 - 2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)

Y2 - 14 March 2016 through 17 March 2016

ER -

Detection of Spatially-Close Fiber Segments in Optical Networks

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this