Constraint-based local search for finding node-disjoint bounded-paths in optical access networks

Thumbnail Image
cp-2015-paper_94.pdf(362.19 KB)
Accepted Version
Arbelaez, Alejandro
Mehta, Deepak
O’Sullivan, Barry
Journal Title
Journal ISSN
Volume Title
Springer Nature Ltd.
Research Projects
Organizational Units
Journal Issue
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.
Local search algorithm , Link failure , Disjoint path , Passive optical network , Minimum span tree problem
Arbelaez, A., Mehta, D. and O’Sullivan, B. (2015) 'Constraint-based local search for finding node-disjoint bounded-paths in optical access networks', in Pesant, G. (ed) Principles and Practice of Constraint Programming, pp. 499-507. CP 2015. Lecture Notes in Computer Science, 9255. Springer, Cham.
© 2015, Springer International Publishing Switzerland. This version of the paper has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: