A multiple-link failures enumeration approach for availability analysis on partially disjoint paths

Autores
Gonzalez-Montoro, Nehuen; Finochietto, Jorge M.; Cherini, Renato
Año de publicación
2017
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Ponencia presentada en la DRCN 2017 - Design of Reliable Communication Networks; 13th International Conference. 08-10 March 2017, Munich, Germany .
Fil: Cherini, Renato. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.
Fil: Gonzalez-Montoro, Nehuen. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales; Argentina.
Fil: Finochietto, Jorge M. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales; Argentina.
Optical networks provide huge amounts of bandwidths to support services that demand high data transfer rates. However, these services also need to meet high availability requirements which are typically threatened by link failures. Availability can be increased by enabling multiple paths to route the service through the network by means of either protection and/or restoration schemes. In this context, efficient methods for computing the availability of a service than can be routed over multiple paths are needed. In particular, these methods need to consider that paths may not necessarily be fully disjoint as some links among them may be shared. As long as the required service availability can be met, partially disjoint paths can reduce cost as a single optical channel (wavelength) can be used on shared links based on split and select schemes. In this paper, a new method is proposed for computing the service availability on scenarios with multiple-link failures based on the enumeration of these scenarios. In particular, we demonstrate that the amount of scenarios can be reduced to speedup availability computation times, which introduces a bounded error on the results. This method is illustrated in the context of the availability aware routing problem, proposing both an ILP model and an heuristic to select the routing paths that can meet a target service availability at a minimum cost in terms of required links. Numerical results show that partially disjoint paths can offer cost-efficient solutions to this problem. Finally, a comparison on the computing times of the proposed method is analyzed, demonstrating that it can run up to one order of magnitude faster than a traditional method based on the factorization algorithm.
Fil: Cherini, Renato. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.
Fil: Gonzalez-Montoro, Nehuen. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales; Argentina.
Fil: Finochietto, Jorge M. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales; Argentina.
Otras Ciencias de la Computación e Información
Materia
Optical network
Availability
Reliability
ILP
Nivel de accesibilidad
acceso abierto
Condiciones de uso
Repositorio
Repositorio Digital Universitario (UNC)
Institución
Universidad Nacional de Córdoba
OAI Identificador
oai:rdu.unc.edu.ar:11086/563488

id RDUUNC_9c727a2b59b2a5475cae47172ff8ddb9
oai_identifier_str oai:rdu.unc.edu.ar:11086/563488
network_acronym_str RDUUNC
repository_id_str 2572
network_name_str Repositorio Digital Universitario (UNC)
spelling A multiple-link failures enumeration approach for availability analysis on partially disjoint pathsGonzalez-Montoro, NehuenFinochietto, Jorge M.Cherini, RenatoOptical networkAvailabilityReliabilityILPPonencia presentada en la DRCN 2017 - Design of Reliable Communication Networks; 13th International Conference. 08-10 March 2017, Munich, Germany .Fil: Cherini, Renato. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.Fil: Gonzalez-Montoro, Nehuen. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales; Argentina.Fil: Finochietto, Jorge M. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales; Argentina.Optical networks provide huge amounts of bandwidths to support services that demand high data transfer rates. However, these services also need to meet high availability requirements which are typically threatened by link failures. Availability can be increased by enabling multiple paths to route the service through the network by means of either protection and/or restoration schemes. In this context, efficient methods for computing the availability of a service than can be routed over multiple paths are needed. In particular, these methods need to consider that paths may not necessarily be fully disjoint as some links among them may be shared. As long as the required service availability can be met, partially disjoint paths can reduce cost as a single optical channel (wavelength) can be used on shared links based on split and select schemes. In this paper, a new method is proposed for computing the service availability on scenarios with multiple-link failures based on the enumeration of these scenarios. In particular, we demonstrate that the amount of scenarios can be reduced to speedup availability computation times, which introduces a bounded error on the results. This method is illustrated in the context of the availability aware routing problem, proposing both an ILP model and an heuristic to select the routing paths that can meet a target service availability at a minimum cost in terms of required links. Numerical results show that partially disjoint paths can offer cost-efficient solutions to this problem. Finally, a comparison on the computing times of the proposed method is analyzed, demonstrating that it can run up to one order of magnitude faster than a traditional method based on the factorization algorithm.Fil: Cherini, Renato. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.Fil: Gonzalez-Montoro, Nehuen. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales; Argentina.Fil: Finochietto, Jorge M. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales; Argentina.Otras Ciencias de la Computación e Información2017info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf978-3-8007-4383-4http://hdl.handle.net/11086/563488https://ieeexplore.ieee.org/document/7993410enginfo:eu-repo/semantics/openAccessreponame:Repositorio Digital Universitario (UNC)instname:Universidad Nacional de Córdobainstacron:UNC2026-10-29T10:17:03Zoai:rdu.unc.edu.ar:11086/563488Institucionalhttps://rdu.unc.edu.ar/Universidad públicaNo correspondehttp://rdu.unc.edu.ar/oai/snrdoca.unc@gmail.comArgentinaNo correspondeNo correspondeNo correspondeopendoar:25722026-10-29 10:17:03.507Repositorio Digital Universitario (UNC) - Universidad Nacional de Córdobafalse
dc.title.none.fl_str_mv A multiple-link failures enumeration approach for availability analysis on partially disjoint paths
title A multiple-link failures enumeration approach for availability analysis on partially disjoint paths
spellingShingle A multiple-link failures enumeration approach for availability analysis on partially disjoint paths
Gonzalez-Montoro, Nehuen
Optical network
Availability
Reliability
ILP
title_short A multiple-link failures enumeration approach for availability analysis on partially disjoint paths
title_full A multiple-link failures enumeration approach for availability analysis on partially disjoint paths
title_fullStr A multiple-link failures enumeration approach for availability analysis on partially disjoint paths
title_full_unstemmed A multiple-link failures enumeration approach for availability analysis on partially disjoint paths
title_sort A multiple-link failures enumeration approach for availability analysis on partially disjoint paths
dc.creator.none.fl_str_mv Gonzalez-Montoro, Nehuen
Finochietto, Jorge M.
Cherini, Renato
author Gonzalez-Montoro, Nehuen
author_facet Gonzalez-Montoro, Nehuen
Finochietto, Jorge M.
Cherini, Renato
author_role author
author2 Finochietto, Jorge M.
Cherini, Renato
author2_role author
author
dc.subject.none.fl_str_mv Optical network
Availability
Reliability
ILP
topic Optical network
Availability
Reliability
ILP
dc.description.none.fl_txt_mv Ponencia presentada en la DRCN 2017 - Design of Reliable Communication Networks; 13th International Conference. 08-10 March 2017, Munich, Germany .
Fil: Cherini, Renato. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.
Fil: Gonzalez-Montoro, Nehuen. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales; Argentina.
Fil: Finochietto, Jorge M. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales; Argentina.
Optical networks provide huge amounts of bandwidths to support services that demand high data transfer rates. However, these services also need to meet high availability requirements which are typically threatened by link failures. Availability can be increased by enabling multiple paths to route the service through the network by means of either protection and/or restoration schemes. In this context, efficient methods for computing the availability of a service than can be routed over multiple paths are needed. In particular, these methods need to consider that paths may not necessarily be fully disjoint as some links among them may be shared. As long as the required service availability can be met, partially disjoint paths can reduce cost as a single optical channel (wavelength) can be used on shared links based on split and select schemes. In this paper, a new method is proposed for computing the service availability on scenarios with multiple-link failures based on the enumeration of these scenarios. In particular, we demonstrate that the amount of scenarios can be reduced to speedup availability computation times, which introduces a bounded error on the results. This method is illustrated in the context of the availability aware routing problem, proposing both an ILP model and an heuristic to select the routing paths that can meet a target service availability at a minimum cost in terms of required links. Numerical results show that partially disjoint paths can offer cost-efficient solutions to this problem. Finally, a comparison on the computing times of the proposed method is analyzed, demonstrating that it can run up to one order of magnitude faster than a traditional method based on the factorization algorithm.
Fil: Cherini, Renato. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.
Fil: Gonzalez-Montoro, Nehuen. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales; Argentina.
Fil: Finochietto, Jorge M. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales; Argentina.
Otras Ciencias de la Computación e Información
description Ponencia presentada en la DRCN 2017 - Design of Reliable Communication Networks; 13th International Conference. 08-10 March 2017, Munich, Germany .
publishDate 2017
dc.date.none.fl_str_mv 2017
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv 978-3-8007-4383-4
http://hdl.handle.net/11086/563488
https://ieeexplore.ieee.org/document/7993410
identifier_str_mv 978-3-8007-4383-4
url http://hdl.handle.net/11086/563488
https://ieeexplore.ieee.org/document/7993410
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositorio Digital Universitario (UNC)
instname:Universidad Nacional de Córdoba
instacron:UNC
reponame_str Repositorio Digital Universitario (UNC)
collection Repositorio Digital Universitario (UNC)
instname_str Universidad Nacional de Córdoba
instacron_str UNC
institution UNC
repository.name.fl_str_mv Repositorio Digital Universitario (UNC) - Universidad Nacional de Córdoba
repository.mail.fl_str_mv oca.unc@gmail.com
_version_ 1880393202283839488
score 13.334379