TY - GEN
T1 - Constraint-based local search for finding node-disjoint bounded-paths in optical access networks
AU - Arbelaez, Alejandro
AU - Mehta, Deepak
AU - O’Sullivan, Barry
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
PY - 2015
Y1 - 2015
N2 - Mass deployment of fibre access networks is without doubt one of the goals of many network operators around the globe. The Passive Optical Network has been proposed as a solution to help deliver mass deployment of fibre-to-the-home (FTTH), by reducing the cost per customer compared to current commercially available technologies. A major failure in the access network (e.g., fibre cut, amplifier failure, or other equipment can fail) might affect tens of thousands of customers. Therefore, protecting the network from such failures is one of the most important requirements in the deployment of FTTH solutions. In this paper we use a constraint-based local search approach to design reliable passive optical networks via node-disjoint paths whereby each customer is protected against any one node or link failure. We experiment with a set of very large size real-world networks corresponding to Ireland, Italy and the UK and demonstrate the tradeoff between cost and resiliency.
AB - Mass deployment of fibre access networks is without doubt one of the goals of many network operators around the globe. The Passive Optical Network has been proposed as a solution to help deliver mass deployment of fibre-to-the-home (FTTH), by reducing the cost per customer compared to current commercially available technologies. A major failure in the access network (e.g., fibre cut, amplifier failure, or other equipment can fail) might affect tens of thousands of customers. Therefore, protecting the network from such failures is one of the most important requirements in the deployment of FTTH solutions. In this paper we use a constraint-based local search approach to design reliable passive optical networks via node-disjoint paths whereby each customer is protected against any one node or link failure. We experiment with a set of very large size real-world networks corresponding to Ireland, Italy and the UK and demonstrate the tradeoff between cost and resiliency.
UR - https://www.scopus.com/pages/publications/84944552596
U2 - 10.1007/978-3-319-23219-5_35
DO - 10.1007/978-3-319-23219-5_35
M3 - Conference proceeding
AN - SCOPUS:84944552596
SN - 9783319232188
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 499
EP - 507
BT - Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings
A2 - Pesant, Gilles
PB - Springer Verlag
T2 - 21st International Conference on the Principles and Practice of Constraint Programming, CP 2015
Y2 - 31 August 2015 through 4 September 2015
ER -