An effective algorithm for computing all-terminal reliability bounds

Detalhes bibliográficos
Autor(a) principal: Silva, Jaime
Data de Publicação: 2015
Outros Autores: Gomes, Teresa, Tipper, David, Martins, Lúcia, Kounev, Velin
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10316/48333
https://doi.org/10.1002/net.21634
Resumo: An effective algorithm for computing all-terminal reliability bounds
id RCAP_94bf7e826a58502a7daef2520db0f95d
oai_identifier_str oai:estudogeral.uc.pt:10316/48333
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling An effective algorithm for computing all-terminal reliability boundsall-terminal network reliabilitynetwork availabilitybinary decision diagram (BDD)sum of disjoint productsbounds computationAn effective algorithm for computing all-terminal reliability boundsThe exact calculation of all‐terminal reliability is not feasible in large networks. Hence estimation techniques and lower and upper bounds for all‐terminal reliability have been utilized. Here, we propose using an ordered subset of the mincuts and an ordered subset of the minpaths to calculate an all‐terminal reliability upper and lower bound, respectively. The advantage of the proposed new approach results from the fact that it does not require the enumeration of all mincuts or all minpaths as required by other bounds. The proposed algorithm uses maximally disjoint minpaths, prior to their sequential generation, and also uses a binary decision diagram for the calculation of their union probability. The numerical results show that the proposed approach is computationally feasible, reasonably accurate and much faster than the previous version of the algorithm. This allows one to obtain tight bounds when it not possible to enumerate all mincuts or all minpaths as revealed by extensive tests on real‐world networks.The work of Jaime Silva has been supported by ICIS Project CENTRO-07- 0224-FEDER-002003. The work of Teresa Gomes and Lúcia Martins has been in part supported by the Portuguese Foundation for Science and Technology under project grant UID/MULTI/00308/2013 and ICIS Project CENTRO-07- 0224-FEDER-002003.Wiley2015info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/48333http://hdl.handle.net/10316/48333https://doi.org/10.1002/net.21634eng0028-3045https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21634Silva, JaimeGomes, TeresaTipper, DavidMartins, LúciaKounev, Velininfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2021-07-16T15:03:01Zoai:estudogeral.uc.pt:10316/48333Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:53:43.833714Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv An effective algorithm for computing all-terminal reliability bounds
title An effective algorithm for computing all-terminal reliability bounds
spellingShingle An effective algorithm for computing all-terminal reliability bounds
Silva, Jaime
all-terminal network reliability
network availability
binary decision diagram (BDD)
sum of disjoint products
bounds computation
title_short An effective algorithm for computing all-terminal reliability bounds
title_full An effective algorithm for computing all-terminal reliability bounds
title_fullStr An effective algorithm for computing all-terminal reliability bounds
title_full_unstemmed An effective algorithm for computing all-terminal reliability bounds
title_sort An effective algorithm for computing all-terminal reliability bounds
author Silva, Jaime
author_facet Silva, Jaime
Gomes, Teresa
Tipper, David
Martins, Lúcia
Kounev, Velin
author_role author
author2 Gomes, Teresa
Tipper, David
Martins, Lúcia
Kounev, Velin
author2_role author
author
author
author
dc.contributor.author.fl_str_mv Silva, Jaime
Gomes, Teresa
Tipper, David
Martins, Lúcia
Kounev, Velin
dc.subject.por.fl_str_mv all-terminal network reliability
network availability
binary decision diagram (BDD)
sum of disjoint products
bounds computation
topic all-terminal network reliability
network availability
binary decision diagram (BDD)
sum of disjoint products
bounds computation
description An effective algorithm for computing all-terminal reliability bounds
publishDate 2015
dc.date.none.fl_str_mv 2015
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10316/48333
http://hdl.handle.net/10316/48333
https://doi.org/10.1002/net.21634
url http://hdl.handle.net/10316/48333
https://doi.org/10.1002/net.21634
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 0028-3045
https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21634
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Wiley
publisher.none.fl_str_mv Wiley
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799133823740411904

Registros relacionados