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

Simple item page
dc.contributor.authorArbelaez, Alejandroen
dc.contributor.authorMehta, Deepaken
dc.contributor.authorO'Sullivan, Barryen
dc.contributor.funderSeventh Framework Programmeen
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2024-01-30T11:39:08Z
dc.date.available2024-01-30T11:39:08Z
dc.date.issued2015-01-01en
dc.description.abstractMass 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.en
dc.description.statusPeer revieweden
dc.description.versionAccepted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationArbelaez, 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. https://doi.org/10.1007/978-3-319-23219-5_35en
dc.identifier.doi10.1007/978-3-319-23219-5_35en
dc.identifier.endpage507en
dc.identifier.isbn9783319232188en
dc.identifier.isbn9783319232195en
dc.identifier.issn0302-9743en
dc.identifier.issn1611-3349en
dc.identifier.journaltitleLecture Notes in Computer Scienceen
dc.identifier.startpage499en
dc.identifier.urihttps://hdl.handle.net/10468/15451
dc.identifier.volume9255en
dc.language.isoenen
dc.publisherSpringer Nature Ltd.en
dc.relation.ispartofLecture Notes in Computer Scienceen
dc.relation.ispartofPrinciples and Practice of Constraint Programmingen
dc.relation.ispartofInternational Conference on Principles and Practice of Constraint Programming (CP 2015) 31 August - 4 September, Cork, Irelanden
dc.relation.projectinfo:eu-repo/grantAgreement/EC/FP7::SP1::ICT/318137/EU/The DIStributed Core for unlimited bandwidth supply for all Users and Services/DISCUSen
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/en
dc.rights© 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: https://doi.org/10.1007/978-3-319-23219-5_35en
dc.subjectLocal search algorithmen
dc.subjectLink failureen
dc.subjectDisjoint pathen
dc.subjectPassive optical networken
dc.subjectMinimum span tree problemen
dc.titleConstraint-based local search for finding node-disjoint bounded-paths in optical access networksen
dc.typeBook chapteren
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
cp-2015-paper_94.pdf
Size:
362.19 KB
Format:
Adobe Portable Document Format
Description:
Accepted Version
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Insight Centre for Data Analytics - Conference Items