A GRASP algorithm with tree based local search for designing a survivable wide area network backbone

System survivability is the ability to give service in spite of failures of some of the components. To assure survivability is an important goal when designing a communications network backbone, to ensure that it can resist to failures in the switch sites as well as in the connection lines. Previous...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Cancela, Héctor, Robledo, Franco, Rubino, Gerardo
Formato: Articulo
Lenguaje:Inglés
Publicado: 2004
Materias:
Ciencias Informáticas
Heuristic methods
survivability
node connectivity
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/9480
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr04-8.pdf
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-9480
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Heuristic methods
survivability
node connectivity
spellingShingle Ciencias Informáticas
Heuristic methods
survivability
node connectivity
Cancela, Héctor
Robledo, Franco
Rubino, Gerardo
A GRASP algorithm with tree based local search for designing a survivable wide area network backbone
topic_facet Ciencias Informáticas
Heuristic methods
survivability
node connectivity
description System survivability is the ability to give service in spite of failures of some of the components. To assure survivability is an important goal when designing a communications network backbone, to ensure that it can resist to failures in the switch sites as well as in the connection lines. Previous work has employed a Greedy Randomized Adaptive Search Procedure (GRASP), based on path algorithms, to build low cost network topologies which comply with heterogeneous node-connectivity requirements, which can model the survivability goals. In this work, we present another variant of the GRASP procedure, based on a tree search, which obtains good results in topologies with a large number of switch nodes.
format Articulo
Articulo
author Cancela, Héctor
Robledo, Franco
Rubino, Gerardo
author_facet Cancela, Héctor
Robledo, Franco
Rubino, Gerardo
author_sort Cancela, Héctor
title A GRASP algorithm with tree based local search for designing a survivable wide area network backbone
title_short A GRASP algorithm with tree based local search for designing a survivable wide area network backbone
title_full A GRASP algorithm with tree based local search for designing a survivable wide area network backbone
title_fullStr A GRASP algorithm with tree based local search for designing a survivable wide area network backbone
title_full_unstemmed A GRASP algorithm with tree based local search for designing a survivable wide area network backbone
title_sort grasp algorithm with tree based local search for designing a survivable wide area network backbone
publishDate 2004
url http://sedici.unlp.edu.ar/handle/10915/9480
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr04-8.pdf
work_keys_str_mv AT cancelahector agraspalgorithmwithtreebasedlocalsearchfordesigningasurvivablewideareanetworkbackbone
AT robledofranco agraspalgorithmwithtreebasedlocalsearchfordesigningasurvivablewideareanetworkbackbone
AT rubinogerardo agraspalgorithmwithtreebasedlocalsearchfordesigningasurvivablewideareanetworkbackbone
AT cancelahector graspalgorithmwithtreebasedlocalsearchfordesigningasurvivablewideareanetworkbackbone
AT robledofranco graspalgorithmwithtreebasedlocalsearchfordesigningasurvivablewideareanetworkbackbone
AT rubinogerardo graspalgorithmwithtreebasedlocalsearchfordesigningasurvivablewideareanetworkbackbone
bdutipo_str Repositorios
_version_ 1764820491904745473

Ejemplares similares