@inbook{ec179369c4614fc38ad7cb8f4a616ae5,
title = "A scalable approach for computing distance-bounded node-disjoint paths in optical networks",
abstract = "Both access and core optical networks require connectivity between a given set of pairs of nodes under path-length constraints. In the context of Long Reach Passive Optical Networks (LR-PON) there is a limit on the length of the fibre between a local-exchange (LE) site and its metro-core (MC) node, and in the transparent optical core network the length of fibre between each pair of MC nodes must be within a given threshold. A failure in the network could affect hundreds of thousands of customers. Therefore, it is often important ensuring multiple connectivity between a given set of pair of nodes through at least two node-disjoint paths while respecting the path-length constraints. Node-disjointness allows switching to an alternative path whenever a link or a node fails. Minimising the cost associated with the fibre while maximising the disjointness for a given network is a very challenging task. In this paper, we develop and present a general approach that is scalable for solving very large instances of this problem.",
author = "Alejandro Arbelaez and Deepak Mehta and Barry O'Sullivan and Cemalettin Ozturk and Luis Quesada",
note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 17th International Conference on Transparent Optical Networks, ICTON 2015 ; Conference date: 05-07-2015 Through 09-07-2015",
year = "2015",
month = aug,
day = "12",
doi = "10.1109/ICTON.2015.7193474",
language = "English",
series = "International Conference on Transparent Optical Networks",
publisher = "IEEE Computer Society",
editor = "Marek Jaworski and Marian Marciniak",
booktitle = "ICTON 2015 - 17th International Conference on Transparent Optical Networks",
address = "United States",
}