Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benhamiche, A., Mahjoub, R., Perrot, N.: On the design of optical OFDM-based networks. In: Pahl, J., Reiners, T., Voß, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 1–6. Springer, Heidelberg (2011)
Ruffini, M., Wosinska, L., Achouche, M., Chen, J., Doran, N., Farjady, F., Mon-talvo, J., Ossieur, P., O’Sullivan, B., Parsons, N., Pfeiffer, T., Qiu, X.Z., Raack, C., Rohde, H., Schiano, M., Townsend, P., Wessaly, R., Yin, X., Payne, D.B.: Discus: An end-to-end solution for ubiquitous broadband optical access. IEEE Communications Magazine 52(2), 24–32 (2014)
Davey, R., Grossman, D., Rasztovits-Wiech, M., Payne, D., Nesset, D., Kelly, A., Rafel, A., Appathurai, S., Yang, S.H.: Long-reach passive optical networks. Journal of Lightwave Technology 27(3), 273–291 (2009)
Payne, D.B.: FTTP deployment options and economic challenges. In: Proceedings of the 36th European Conference and Exhibition on Optical Communication (ECOC 2009) (2009)
Arbelaez, A., Mehta, D., O’Sullivan, B., Quesada, L.: Constraint-based local search for edge disjoint rooted distance-constrainted minimum spanning tree problem. In: CPAIOR 2015, pp. 31–46 (2015)
Pham, Q.D., Deville, Y., Van Hentenryck, P.: LS(Graph): a constraint-based local search for constraint optimization on trees and paths. Constraints 17(4), 357–408 (2012)
Mukherjee, B.: Optical WDM Networks (Optical Networks). Springer-Verlag New York Inc., Secaucus (2006)
Blesa, M., Blum, C.: Finding edge-disjoint paths in networks: An ant colony optimization algorithm. Journal of Mathematical Modelling and Algorithms 6(3), 361–391 (2007)
Ruthmair, M., Raidl, G.R.: Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6239, pp. 391–400. Springer, Heidelberg (2010)
Ruffini, M., Mehta, D., O’Sullivan, B., Quesada, L., Doyle, L., Payne, D.B.: Deployment strategies for protected Long-Reach PON. Journal of Optical Communications and Networking 4, 118–129 (2012)
DISCUS: Project Deliverable 2.6, Architectural optimization for different geotypes
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Arbelaez, A., Mehta, D., O’Sullivan, B. (2015). Constraint-Based Local Search for Finding Node-Disjoint Bounded-Paths in Optical Access Networks. In: Pesant, G. (eds) Principles and Practice of Constraint Programming. CP 2015. Lecture Notes in Computer Science(), vol 9255. Springer, Cham. https://doi.org/10.1007/978-3-319-23219-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-319-23219-5_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23218-8
Online ISBN: 978-3-319-23219-5
eBook Packages: Computer ScienceComputer Science (R0)