An algorithm for computing all-terminal reliability bounds
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Outros Autores: | , , , |
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/95486 https://doi.org/10.1109/RNDM.2014.7014934 |
Resumo: | The 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. We propose using an ordered subset of the mincuts and an ordered subset of minpaths to calculate an all-terminal reliability upper and lower bound, respectively. The advantage of the proposed approach results from the fact that it does not require the enumeration of all mincuts or all minpaths as required by other bounds. The performance of the algorithm is compared with the first two Bonferroni bounds, for networks where all mincuts could be calculated. The results show that the proposed approach is computationally feasible and reasonably accurate. Thus allowing one to obtain bounds when it not possible to enumerate all mincuts or all minpaths. |
id |
RCAP_5b4e6f5d7bfa5f182635448f22c9d446 |
---|---|
oai_identifier_str |
oai:estudogeral.uc.pt:10316/95486 |
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 algorithm for computing all-terminal reliability boundsAll-terminal network reliabilityBonferroni boundsNetwork availabilityNetwork reductionThe 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. We propose using an ordered subset of the mincuts and an ordered subset of minpaths to calculate an all-terminal reliability upper and lower bound, respectively. The advantage of the proposed approach results from the fact that it does not require the enumeration of all mincuts or all minpaths as required by other bounds. The performance of the algorithm is compared with the first two Bonferroni bounds, for networks where all mincuts could be calculated. The results show that the proposed approach is computationally feasible and reasonably accurate. Thus allowing one to obtain bounds when it not possible to enumerate all mincuts or all minpaths.FCT - Fundação para a Ciência e a Tecnologia, I.PIEEE2014info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/95486http://hdl.handle.net/10316/95486https://doi.org/10.1109/RNDM.2014.7014934engJ. Silva, T. Gomes, D. Tipper, L. Martins and V. Kounev, "An algorithm for computing all-terminal reliability bounds," 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM), 2014, pp. 76-83, doi: 10.1109/RNDM.2014.7014934.978-1-4799-7040-7978-1-4799-7039-1978-1-4799-7038-4https://ieeexplore.ieee.org/document/7014934Silva, JaimeGomes, Teresa Martinez dos SantosTipper, DavidMartins, LuciaKounev, 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:RCAAP2022-05-25T04:24:43Zoai:estudogeral.uc.pt:10316/95486Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:13:58.414422Repositó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 algorithm for computing all-terminal reliability bounds |
title |
An algorithm for computing all-terminal reliability bounds |
spellingShingle |
An algorithm for computing all-terminal reliability bounds Silva, Jaime All-terminal network reliability Bonferroni bounds Network availability Network reduction |
title_short |
An algorithm for computing all-terminal reliability bounds |
title_full |
An algorithm for computing all-terminal reliability bounds |
title_fullStr |
An algorithm for computing all-terminal reliability bounds |
title_full_unstemmed |
An algorithm for computing all-terminal reliability bounds |
title_sort |
An algorithm for computing all-terminal reliability bounds |
author |
Silva, Jaime |
author_facet |
Silva, Jaime Gomes, Teresa Martinez dos Santos Tipper, David Martins, Lucia Kounev, Velin |
author_role |
author |
author2 |
Gomes, Teresa Martinez dos Santos Tipper, David Martins, Lucia Kounev, Velin |
author2_role |
author author author author |
dc.contributor.author.fl_str_mv |
Silva, Jaime Gomes, Teresa Martinez dos Santos Tipper, David Martins, Lucia Kounev, Velin |
dc.subject.por.fl_str_mv |
All-terminal network reliability Bonferroni bounds Network availability Network reduction |
topic |
All-terminal network reliability Bonferroni bounds Network availability Network reduction |
description |
The 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. We propose using an ordered subset of the mincuts and an ordered subset of minpaths to calculate an all-terminal reliability upper and lower bound, respectively. The advantage of the proposed approach results from the fact that it does not require the enumeration of all mincuts or all minpaths as required by other bounds. The performance of the algorithm is compared with the first two Bonferroni bounds, for networks where all mincuts could be calculated. The results show that the proposed approach is computationally feasible and reasonably accurate. Thus allowing one to obtain bounds when it not possible to enumerate all mincuts or all minpaths. |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014 |
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/95486 http://hdl.handle.net/10316/95486 https://doi.org/10.1109/RNDM.2014.7014934 |
url |
http://hdl.handle.net/10316/95486 https://doi.org/10.1109/RNDM.2014.7014934 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
J. Silva, T. Gomes, D. Tipper, L. Martins and V. Kounev, "An algorithm for computing all-terminal reliability bounds," 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM), 2014, pp. 76-83, doi: 10.1109/RNDM.2014.7014934. 978-1-4799-7040-7 978-1-4799-7039-1 978-1-4799-7038-4 https://ieeexplore.ieee.org/document/7014934 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
IEEE |
publisher.none.fl_str_mv |
IEEE |
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_ |
1799134036829929472 |