A Modified Universal Generating Function Algorithm for the Acyclic Binary-State Network Reliability

Network reliability is an important part of planning, designing, and controlling networks. Now, the most general binary-state network (BSN) reliability evaluation methods are based on Minimal Paths (MPs), or Minimal Cuts (MCs). The universal generating function method (UGFM) is a novel, efficient sc...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on reliability Vol. 61; no. 3; pp. 702 - 709
Main Author Yeh, Wei-Chang
Format Journal Article
LanguageEnglish
Published New York IEEE 01.09.2012
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithm design and analysis
Algorithms
Binary-state
Complexity
Complexity theory
Computation
Computer network reliability
Mathematical analysis
Mathematical models
network reliability
Networks
Reliability engineering
Reliability theory
Routines
Searching
State-space methods
Studies
universal generating function method
Online AccessGet full text
ISSN0018-9529
1558-1721
DOI10.1109/TR.2012.2207574

Cover

Abstract Network reliability is an important part of planning, designing, and controlling networks. Now, the most general binary-state network (BSN) reliability evaluation methods are based on Minimal Paths (MPs), or Minimal Cuts (MCs). The universal generating function method (UGFM) is a novel, efficient scheme for determining network reliability. Because the current best-known UGFM can only search for all MPs, it needs to be coupled with another routine such as Sum-of-Disjoint-Product method to calculate the final flow network reliability in terms of obtained MPs. In this study, a straightforward, novel UGFM is presented for calculating the acyclic BSN (ABSN) reliability between the source node and the sink node (i.e. one-to-one reliability). The proposed method is the first UGFM for the ABSN reliability problem without searching for all MPs in advance, which can reduce computational complexity. The computational complexity of the proposed algorithm is analysed, and its efficiency is well illustrated by a numerical example.
AbstractList Network reliability is an important part of planning, designing, and controlling networks. Now, the most general binary-state network (BSN) reliability evaluation methods are based on Minimal Paths (MPs), or Minimal Cuts (MCs). The universal generating function method (UGFM) is a novel, efficient scheme for determining network reliability. Because the current best-known UGFM can only search for all MPs, it needs to be coupled with another routine such as Sum-of-Disjoint-Product method to calculate the final flow network reliability in terms of obtained MPs. In this study, a straightforward, novel UGFM is presented for calculating the acyclic BSN (ABSN) reliability between the source node and the sink node (i.e. one-to-one reliability). The proposed method is the first UGFM for the ABSN reliability problem without searching for all MPs in advance, which can reduce computational complexity. The computational complexity of the proposed algorithm is analysed, and its efficiency is well illustrated by a numerical example.
Author Wei-Chang Yeh
Author_xml – sequence: 1
  givenname: Wei-Chang
  surname: Yeh
  fullname: Yeh, Wei-Chang
BookMark eNp9kD1PWzEUQK0KpAbo3KGLJRaWF_z5nj2mqNBKFKQ0zE-O3zUYHJvaTqv8-xoFdWBgsq50ztX1OUIHMUVA6DMlc0qJPl8t54xQNmeMDHIQH9CMSqk6OjB6gGaEUNVpyfRHdFTKYxuF0GqG7AL_TJN3HiZ8F_0fyMUEfAURsqk-3uPLbbTVp4gX4T5lXx822KWM6wPghd3Z4C3-6qPJu-5XNRXwDdS_KT_hJQRv1j74ujtBh86EAp9e32N0d_ltdfG9u769-nGxuO4sV6p2vdWcaBDOEuglc1pOAtbKWcUllcw4wWXv1nqaBml4bwQxhDtGrV0bph3wY3S23_uc0-8tlDpufLEQgomQtmWk_UD5QAgRDT19gz6mbY7tupESPqheUS4bJfeUzamUDG60vn2y1ajZ-NDQ8SX9uFqOL-nH1_TNO3_jPWe_aY3eMb7sDQ8A_-mecd0Lxv8Ba8yQUA
CODEN IERQAD
CitedBy_id crossref_primary_10_1108_IJQRM_08_2017_0166
crossref_primary_10_1016_j_ress_2016_11_012
crossref_primary_10_1007_s41872_020_00135_y
crossref_primary_10_1016_j_ress_2020_107427
crossref_primary_10_3390_app12146858
crossref_primary_10_1109_ACCESS_2020_3024964
crossref_primary_10_1016_j_ress_2014_06_025
crossref_primary_10_1007_s41872_021_00169_w
crossref_primary_10_1016_j_ress_2024_110774
crossref_primary_10_3390_s151128193
crossref_primary_10_1016_j_ress_2019_03_026
crossref_primary_10_3390_math9121347
crossref_primary_10_1002_qre_3680
crossref_primary_10_1016_j_ress_2016_01_010
crossref_primary_10_1109_TR_2024_3354817
Cites_doi 10.1109/TC.2003.1252856
10.1109/TSMCA.2006.889478
10.1109/TSMCA.2007.909493
10.1016/0143-8174(87)90050-3
10.1109/TSMCA.2006.889479
10.1109/24.9868
10.1109/TR.1985.5222173
10.1109/CMPSAC.2003.1245367
10.1016/S0951-8320(01)00040-0
10.1016/S0925-5273(03)00180-4
10.1016/j.ress.2003.11.004
10.1016/S0305-0548(01)00062-4
10.1109/TC.1986.1676819
10.1016/0026-2714(93)90135-L
10.1109/TSMCA.2006.886375
10.1016/S0305-0548(00)00046-0
10.1016/S0951-8320(01)00032-1
10.1109/TSMCA.2007.891923
10.1016/0026-2714(94)00121-4
10.1016/j.ress.2005.12.006
10.1109/TSMCA.2006.889476
10.1016/j.ijpe.2006.11.009
10.1109/TSMCA.2009.2026209
10.1016/S0951-8320(01)00128-4
10.1109/TR.2008.916871
10.1016/j.ress.2005.08.002
10.1093/oso/9780198533863.001.0001
10.1142/5221
10.1109/24.126675
10.1016/S0951-8320(02)00114-X
10.1109/24.799845
10.1016/S0305-0548(02)00025-4
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2012
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2012
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
F28
FR3
DOI 10.1109/TR.2012.2207574
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList
Engineering Research Database
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-1721
EndPage 709
ExternalDocumentID 2751916321
10_1109_TR_2012_2207574
6239642
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
4.4
5GY
5VS
6IK
8WZ
97E
A6W
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
OCL
P2P
RIA
RIE
RNS
TN5
VH1
VJK
AAYXX
CITATION
7SP
8FD
L7M
RIG
F28
FR3
ID FETCH-LOGICAL-c388t-6c9309e4fc0e652f95d4eb8fc835152af4356fb9dd75a36a40a03f21ccba29fe3
IEDL.DBID RIE
ISSN 0018-9529
IngestDate Sun Sep 28 16:02:27 EDT 2025
Mon Jun 30 03:20:18 EDT 2025
Wed Oct 01 01:27:22 EDT 2025
Thu Apr 24 23:10:10 EDT 2025
Tue Aug 26 17:18:14 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c388t-6c9309e4fc0e652f95d4eb8fc835152af4356fb9dd75a36a40a03f21ccba29fe3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
PQID 1037868135
PQPubID 85456
PageCount 8
ParticipantIDs ieee_primary_6239642
proquest_journals_1037868135
crossref_primary_10_1109_TR_2012_2207574
proquest_miscellaneous_1671370004
crossref_citationtrail_10_1109_TR_2012_2207574
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2012-09-01
PublicationDateYYYYMMDD 2012-09-01
PublicationDate_xml – month: 09
  year: 2012
  text: 2012-09-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on reliability
PublicationTitleAbbrev TR
PublicationYear 2012
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref35
ref13
ref12
ref15
ref14
ref31
ref30
lisnianski (ref8) 2003
ref11
ref32
ref10
ref17
ref19
ref18
colbourn (ref1) 1987
ref24
ref23
ref26
ref25
levitin (ref9) 2005
ref20
ref22
ref21
ushakov (ref37) 1986; 24
zang (ref16) 0
ref28
ref27
ref29
yeh (ref36) 2009; 39
ref7
shier (ref2) 1991
yeh (ref34) 0
ref4
ref3
ref6
ref5
lin (ref33) 2007; 107
References_xml – ident: ref35
  doi: 10.1109/TC.2003.1252856
– ident: ref31
  doi: 10.1109/TSMCA.2006.889478
– ident: ref15
  doi: 10.1109/TSMCA.2007.909493
– ident: ref6
  doi: 10.1016/0143-8174(87)90050-3
– ident: ref5
  doi: 10.1109/TSMCA.2006.889479
– ident: ref19
  doi: 10.1109/24.9868
– year: 1987
  ident: ref1
  publication-title: The Combinatorics of Network Reliability
– ident: ref17
  doi: 10.1109/TR.1985.5222173
– year: 0
  ident: ref34
  article-title: A New Universal Generating Function Method for Estimating the Novel Multi-Resource Multistate Information Network Reliability
  publication-title: IEEE Trans Systems Man and Cybernetics (Part A) under revision
– ident: ref13
  doi: 10.1109/CMPSAC.2003.1245367
– ident: ref29
  doi: 10.1016/S0951-8320(01)00040-0
– ident: ref30
  doi: 10.1016/S0925-5273(03)00180-4
– ident: ref18
  doi: 10.1016/j.ress.2003.11.004
– ident: ref28
  doi: 10.1016/S0305-0548(01)00062-4
– ident: ref12
  doi: 10.1109/TC.1986.1676819
– ident: ref21
  doi: 10.1016/0026-2714(93)90135-L
– ident: ref4
  doi: 10.1109/TSMCA.2006.886375
– ident: ref23
  doi: 10.1016/S0305-0548(00)00046-0
– ident: ref27
  doi: 10.1016/S0951-8320(01)00032-1
– ident: ref3
  doi: 10.1109/TSMCA.2007.891923
– ident: ref22
  doi: 10.1016/0026-2714(94)00121-4
– ident: ref25
  doi: 10.1016/j.ress.2005.12.006
– ident: ref7
  doi: 10.1109/TSMCA.2006.889476
– year: 0
  ident: ref16
  publication-title: A BDD-Based Algorithm for Reliability Graph Analysis
– year: 2005
  ident: ref9
  publication-title: Universal Generating Function in Reliability Analysis and Optimization
– volume: 107
  start-page: 572
  year: 2007
  ident: ref33
  article-title: Performance evaluation for the logistics system in case that capacity weight varies from arcs and types of commodity
  publication-title: International Journal of Production Economics
  doi: 10.1016/j.ijpe.2006.11.009
– volume: 24
  start-page: 118
  year: 1986
  ident: ref37
  article-title: A Universal Generating Function
  publication-title: Soviet Journal of Computer and Systems Sciences
– volume: 39
  start-page: 1247
  year: 2009
  ident: ref36
  article-title: A Simple Universal Generating Function Method to Search for All MPs in Networks
  publication-title: IEEE Trans Systems Man and Cybernetics (Part A)
  doi: 10.1109/TSMCA.2009.2026209
– ident: ref24
  doi: 10.1016/S0951-8320(01)00128-4
– ident: ref26
  doi: 10.1109/TR.2008.916871
– ident: ref11
  doi: 10.1016/j.ress.2005.08.002
– year: 1991
  ident: ref2
  publication-title: Network Reliability and Algebraic Structures
  doi: 10.1093/oso/9780198533863.001.0001
– year: 2003
  ident: ref8
  publication-title: Multi-State System Reliability Assessment Optimization and Applications
  doi: 10.1142/5221
– ident: ref20
  doi: 10.1109/24.126675
– ident: ref10
  doi: 10.1016/S0951-8320(02)00114-X
– ident: ref14
  doi: 10.1109/24.799845
– ident: ref32
  doi: 10.1016/S0305-0548(02)00025-4
SSID ssj0014498
Score 2.079018
Snippet Network reliability is an important part of planning, designing, and controlling networks. Now, the most general binary-state network (BSN) reliability...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 702
SubjectTerms Algorithm design and analysis
Algorithms
Binary-state
Complexity
Complexity theory
Computation
Computer network reliability
Mathematical analysis
Mathematical models
network reliability
Networks
Reliability engineering
Reliability theory
Routines
Searching
State-space methods
Studies
universal generating function method
Title A Modified Universal Generating Function Algorithm for the Acyclic Binary-State Network Reliability
URI https://ieeexplore.ieee.org/document/6239642
https://www.proquest.com/docview/1037868135
https://www.proquest.com/docview/1671370004
Volume 61
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-1721
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014498
  issn: 0018-9529
  databaseCode: RIE
  dateStart: 19630101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Nb9QwEB21PcGBr4JYKMhIHDiQ1HFsxz4uiFWFtD1UW6m3yLEnsGK7QSV7KL-esZON-JS4RYrtWBnb8-x58wzw2gn0lWqKLJh4dBPQZ4ZwelaVErlvSuFSbtXyXJ9dyo9X6uoA3k65MIiYyGeYx8cUyw-d38WjslNy1Zbw8iEcVkYPuVpTxEBKO666NIGVsKOMT8Ht6eoiUrhELgT5x0r-4oHSlSp_rMPJuSzuw3LfrYFT8iXf9U3uv_-m2Pi__X4A90aUyebDsHgIB7h9BHd_0h48Bj9nyy6sW4KgbGRnUI1BhTpSodmCPF60GptvPnU36_7zNSOAywgwsrm_9Zu1Z-9SMm-WACs7HwjlLJKcB_Hv28dwufiwen-WjTcuZL40ps-0tyW3KFvPUSvRWhUkNqb1hNPI0buWwJVuGxtCpVypneSOl60ovG-csC2WT-Bo223xKbAqCIlOah68kq7AhstKaoM2CGpfFTPI91ao_ShHHm_F2NRpW8Jtvbqoo9nq0WwzeDNV-Doocfy76HE0wlRs_P8zONmbuR5n6rc65kkabYpSzeDV9JrmWAycuC12OyqjaStfRfj77O8tP4c78fsD9-wEjvqbHb4gsNI3L9Mo_QEIP-ZZ
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwEB6VcoAeeBXUhRaMxIEDSR3HduLjtupqge4eqq3UW-TYk7Ji2aCSPZRfj-14I54St0h-yMrYns-ebz4DvNEMTSHqLLGlv7qxaJLS4fSkyDlSU-dMh9yq2VxOL_mHK3G1A--GXBhEDOQzTP1niOXb1mz8Vdmxc9XK4eU7cFdwzkWfrTXEDDhXcd91S1gwFYV8MqqOFxeexMVSxpyHLPgvPig8qvLHThzcy-QhzLYD61kln9NNV6fm-2-ajf878kfwIOJMMu4nxmPYwfUT2PtJfXAfzJjMWrtsHAglkZ_hWvQ61J4MTSbO53m7kfHqur1Zdp--EAdxiYOMZGxuzWppyElI500CZCXznlJOPM25l_--fQqXk7PF6TSJby4kJi_LLpFG5VQhbwxFKVijhOVYl41xSM25et04eCWbWllbCJ1LzammecMyY2rNVIP5M9hdt2s8AFJYxlFzSa0RXGdYU15wWaKyzPUvshGkWytUJgqS-3cxVlU4mFBVLS4qb7Yqmm0Eb4cGX3stjn9X3fdGGKrF_z-Cw62Zq7hWv1U-U7KUZZaLEbweit0q86ETvcZ24-pId5gvPAB-_veeX8G96WJ2Xp2_n398Aff9WHom2iHsdjcbPHLQpatfhhn7Azzi6aY
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Modified+Universal+Generating+Function+Algorithm+for+the+Acyclic+Binary-State+Network+Reliability&rft.jtitle=IEEE+transactions+on+reliability&rft.au=Wei-Chang+Yeh&rft.date=2012-09-01&rft.pub=IEEE&rft.issn=0018-9529&rft.volume=61&rft.issue=3&rft.spage=702&rft.epage=709&rft_id=info:doi/10.1109%2FTR.2012.2207574&rft.externalDocID=6239642
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9529&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9529&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9529&client=summon