Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ICTON.2015.7193474 | 2015 17TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON) |
DocType | ISSN | Citations |
Conference | 2162-7339 | 0 |
PageRank | References | Authors |
0.34 | 4 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alejandro Arbelaez | 1 | 51 | 8.51 |
| deepak mehta | 2 | 45 | 10.03 |
| barry osullivan | 3 | 74 | 17.27 |
| Cemalettin Öztürk | 4 | 12 | 3.86 |
| Luis Quesada | 5 | 11 | 14.00 |