Reliability evaluation of a multistate network subject to time constraint under routing policy

A multistate network is a stochastic network composed of multistate arcs in which each arc has several possible capacities and may fail due to failure, maintenance, etc. The quality of a multistate network depends on how to meet the customer's requirements and how to provide the service in time...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of systems science Vol. 44; no. 8; pp. 1400 - 1408
Main Author Lin, Yi-Kuei
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis Group 01.08.2013
Taylor & Francis
Subjects
Online AccessGet full text

Cover

Loading…
Abstract A multistate network is a stochastic network composed of multistate arcs in which each arc has several possible capacities and may fail due to failure, maintenance, etc. The quality of a multistate network depends on how to meet the customer's requirements and how to provide the service in time. The system reliability, the probability that a given amount of data can be transmitted through a pair of minimal paths (MPs) simultaneously under the time constraint, is a proper index to evaluate the quality of a multistate network. An efficient solution procedure is first proposed to calculate it. In order to further enhance the system reliability, the network administrator decides the routing policy in advance to indicate the first and the second priority pairs of MPs. The second priority pair of MPs takes charge of the transmission duty if the first fails. The system reliability under the routing policy can be subsequently evaluated.
AbstractList A multistate network is a stochastic network composed of multistate arcs in which each arc has several possible capacities and may fail due to failure, maintenance, etc. The quality of a multistate network depends on how to meet the customer's requirements and how to provide the service in time. The system reliability, the probability that a given amount of data can be transmitted through a pair of minimal paths (MPs) simultaneously under the time constraint, is a proper index to evaluate the quality of a multistate network. An efficient solution procedure is first proposed to calculate it. In order to further enhance the system reliability, the network administrator decides the routing policy in advance to indicate the first and the second priority pairs of MPs. The second priority pair of MPs takes charge of the transmission duty if the first fails. The system reliability under the routing policy can be subsequently evaluated.
Author Lin, Yi-Kuei
Author_xml – sequence: 1
  givenname: Yi-Kuei
  surname: Lin
  fullname: Lin, Yi-Kuei
  email: yklin@mail.ntust.edu.tw
  organization: Department of Industrial Management , National Taiwan University of Science and Technology
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27465521$$DView record in Pascal Francis
BookMark eNqFkc2OFCEURokZE3ta38AFGxM31fJTQOHGmMnomExiYnQruUWDYaSgBWpMv71V9vTGhbNic77vXu65RBcpJ4fQS0p2lAzkDSGMKMXojhHKdlJoOfRP0Ib2su8Ep_oCbVakW5ln6LLWO0KIEIxs0PcvLgYYQwztiN09xBlayAlnjwFPc2yhNmgOJ9d-5_IT13m8c7bhlnELk8M2p9oKhNTwnPau4JLnFtIPfMgx2ONz9NRDrO7Fw7tF3z5cf7266W4_f_x09f62sz3hrQPQA6EjU2oEAYq5XnqutJaEDc5SADqoUSgmRk29F3LsqdSacCH9fs855Vv0-tR7KPnX7GozU6jWxQjJ5bkaqgRfPqyVfBwVRPKB6CWxRa8eUKgWoi-QbKjmUMIE5WiY6uVSuk5_e-JsybUW540N7e8d19NEQ4lZPZmzJ7N6MidPS7j_J3zufyT27hQLyecywWIn7k2DY8zlvCj_b8MfJg2q0Q
CODEN IJSYA9
CitedBy_id crossref_primary_10_1080_00207721_2013_783947
crossref_primary_10_1080_00207721_2013_807383
crossref_primary_10_1016_j_ins_2016_01_027
Cites_doi 10.1016/0020-0190(93)90214-T
10.1080/00207720802090856
10.1016/0167-8191(92)90048-C
10.1109/TSMCA.2006.889478
10.1002/net.3230250306
10.1016/0020-0190(94)00008-5
10.1109/24.257817
10.1016/j.asoc.2010.11.002
10.1016/S0305-0548(03)00195-3
10.1109/TR.1985.5222235
10.1016/j.ress.2006.11.004
10.1080/00207720601014156
10.1002/net.3230070204
10.1016/0305-0548(90)90039-A
10.1109/TR.1985.5222178
10.1145/28869.28874
10.1287/opre.33.1.153
10.1016/j.ijpe.2009.10.022
10.1109/TR.2010.2055920
10.1016/0305-0548(93)90096-2
10.1016/0020-0190(93)90057-G
10.1016/0305-0548(88)90031-7
10.1080/00207720903326944
10.1016/0305-0548(94)90045-0
10.1016/S0305-0548(98)00020-3
10.1016/S0305-0548(03)00250-8
10.1016/S0305-0548(02)00025-4
10.1016/S0167-6377(97)00008-4
10.1109/24.387394
10.1016/j.amc.2011.05.001
10.1109/TR.2004.833315
10.1016/j.ress.2005.12.006
10.1016/j.ejor.2006.03.013
10.1080/00207219108921308
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2013
2014 INIST-CNRS
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2013
– notice: 2014 INIST-CNRS
DBID AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1080/00207721.2012.659684
DatabaseName CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Applied Sciences
EISSN 1464-5319
EndPage 1408
ExternalDocumentID 27465521
10_1080_00207721_2012_659684
659684
GroupedDBID -~X
.7F
.DC
.QJ
0BK
0R~
29J
30N
4.4
5GY
5VS
8VB
AAENE
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACNCT
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AGDLA
AGMYJ
AHDZW
AIJEM
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EBS
EJD
E~A
E~B
F5P
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
M4Z
MS~
NA5
NX~
O9-
P2P
QWB
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
ZL0
~02
~S~
07I
1TA
4B5
AAGDL
AAHIA
AAYJJ
AAYXX
ACTTO
ADUMR
ADXEU
ADYSH
AEHZU
AEZBV
AFBWG
AFFNX
AFION
AFRVT
AGBLW
AGVKY
AGWUF
AIYEW
AKHJE
AKMBP
ALRRR
ALXIB
AMPGV
BGSSV
BWMZZ
C0-
C5H
CAG
CITATION
COF
CYRSC
DAOYK
DEXXA
FETWF
IFELN
L8C
LJTGL
NUSFT
OPCYK
T9H
TAJZE
TAP
UB6
ZXP
IQODW
TASJS
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c403t-aa9801b277ba5a72e46f37996028ec1aa187b5725b91ff56b416990356fdd3313
ISSN 0020-7721
IngestDate Mon Jul 21 09:56:06 EDT 2025
Fri Jul 11 10:44:22 EDT 2025
Mon Jul 21 09:12:23 EDT 2025
Tue Jul 01 01:02:40 EDT 2025
Thu Apr 24 22:56:59 EDT 2025
Wed Dec 25 09:05:32 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 8
Keywords Policy
Probabilistic approach
Interconnected power system
Routing
Maintenance
System reliability
Transmission time
quality
Service time
routing policy
Quality control
Complex network
User requirement
multistate network
Language English
License CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c403t-aa9801b277ba5a72e46f37996028ec1aa187b5725b91ff56b416990356fdd3313
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
PQID 1506380975
PQPubID 23500
PageCount 9
ParticipantIDs crossref_citationtrail_10_1080_00207721_2012_659684
proquest_miscellaneous_1506380975
informaworld_taylorfrancis_310_1080_00207721_2012_659684
crossref_primary_10_1080_00207721_2012_659684
proquest_miscellaneous_1753552976
pascalfrancis_primary_27465521
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2013-08-01
PublicationDateYYYYMMDD 2013-08-01
PublicationDate_xml – month: 08
  year: 2013
  text: 2013-08-01
  day: 01
PublicationDecade 2010
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle International journal of systems science
PublicationYear 2013
Publisher Taylor & Francis Group
Taylor & Francis
Publisher_xml – name: Taylor & Francis Group
– name: Taylor & Francis
References CIT0030
CIT0010
CIT0032
CIT0031
CIT0012
CIT0034
CIT0011
CIT0033
CIT0014
CIT0013
CIT0035
CIT0016
CIT0015
CIT0018
CIT0017
CIT0019
CIT0021
CIT0020
CIT0001
CIT0023
CIT0022
Bodin LD (CIT0005) 1982; 10
CIT0003
CIT0025
CIT0002
CIT0024
CIT0027
CIT0004
CIT0026
CIT0007
CIT0029
CIT0006
CIT0028
CIT0009
CIT0008
References_xml – ident: CIT0018
  doi: 10.1016/0020-0190(93)90214-T
– ident: CIT0031
  doi: 10.1080/00207720802090856
– ident: CIT0016
  doi: 10.1016/0167-8191(92)90048-C
– ident: CIT0022
  doi: 10.1109/TSMCA.2006.889478
– volume: 10
  start-page: 63
  year: 1982
  ident: CIT0005
  publication-title: Computers and Operations Research
– ident: CIT0025
  doi: 10.1002/net.3230250306
– ident: CIT0007
  doi: 10.1016/0020-0190(94)00008-5
– ident: CIT0017
  doi: 10.1109/24.257817
– ident: CIT0026
  doi: 10.1016/j.asoc.2010.11.002
– ident: CIT0029
  doi: 10.1016/S0305-0548(03)00195-3
– ident: CIT0004
  doi: 10.1109/TR.1985.5222235
– ident: CIT0035
  doi: 10.1016/j.ress.2006.11.004
– ident: CIT0021
  doi: 10.1080/00207720601014156
– ident: CIT0014
  doi: 10.1002/net.3230070204
– ident: CIT0008
  doi: 10.1016/0305-0548(90)90039-A
– ident: CIT0032
  doi: 10.1109/TR.1985.5222178
– ident: CIT0013
  doi: 10.1145/28869.28874
– ident: CIT0015
  doi: 10.1287/opre.33.1.153
– ident: CIT0023
  doi: 10.1016/j.ijpe.2009.10.022
– ident: CIT0024
  doi: 10.1109/TR.2010.2055920
– ident: CIT0006
  doi: 10.1016/0305-0548(93)90096-2
– ident: CIT0009
  doi: 10.1016/0020-0190(93)90057-G
– ident: CIT0001
  doi: 10.1016/0305-0548(88)90031-7
– ident: CIT0003
  doi: 10.1080/00207720903326944
– ident: CIT0010
  doi: 10.1016/0305-0548(94)90045-0
– ident: CIT0011
  doi: 10.1016/S0305-0548(98)00020-3
– ident: CIT0030
  doi: 10.1016/S0305-0548(03)00250-8
– ident: CIT0019
  doi: 10.1016/S0305-0548(02)00025-4
– ident: CIT0028
  doi: 10.1016/S0167-6377(97)00008-4
– ident: CIT0002
  doi: 10.1109/24.387394
– ident: CIT0027
  doi: 10.1016/j.amc.2011.05.001
– ident: CIT0020
  doi: 10.1109/TR.2004.833315
– ident: CIT0034
  doi: 10.1016/j.ress.2005.12.006
– ident: CIT0012
  doi: 10.1016/j.ejor.2006.03.013
– ident: CIT0033
  doi: 10.1080/00207219108921308
SSID ssj0005520
Score 2.0094874
Snippet A multistate network is a stochastic network composed of multistate arcs in which each arc has several possible capacities and may fail due to failure,...
SourceID proquest
pascalfrancis
crossref
informaworld
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 1400
SubjectTerms Applied sciences
Computer networks
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Maintenance
Mathematical analysis
multistate network
Networks
Policies
Priorities
quality
Routing (telecommunications)
routing policy
Software
System reliability
transmission time
Title Reliability evaluation of a multistate network subject to time constraint under routing policy
URI https://www.tandfonline.com/doi/abs/10.1080/00207721.2012.659684
https://www.proquest.com/docview/1506380975
https://www.proquest.com/docview/1753552976
Volume 44
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lj9MwELage4ED4inKY2UkblVWiRMnznEFu6pgWS6tKByw7NSRiqBZNckBfj0ztvOoqJaFS9RacdzOfLbHk5lvCHnN8WVSqBmmKIsgiXUR5Arp8WCvDEUeFdq6Bj5cpvNl8m7FV10Nd59d0uiT4tfBvJL_0Sq0gV4xS_YfNNs_FBrgM-gXrqBhuN5IxxhP7Hi2f45ou13Ko40UtOlCs60L9Z7VrUavizU3Nz9smHptS0Q0thrubrarWhsFfTWQBX8bIt0Hx-GIbsIxQdczv5P28T2OmuDzJnjfms3YtYBlHkTnWuhC_UM0v12TcStkkiYBTtzxEuooHD1UxGg9hONbONpb4as4uG53gY4sxOEw4o6dpDxPXfm4fZrsy4_yfHlxIRdnq8VtcsSgB5uQo9P52y-fhuge7hk5_T_osiaRVv3AKHtWyR5nLQbLqhrmS-kKnfyxZ1tDZHGf3PMnCHrq4PCA3DLbh-TuiFfyEfk6AgYdgEGrkio6AIN6YFAPDNpUFIFBB2BQCwzqgUEdMB6T5fnZ4s088IU0giIJ4yZQKgdDRIOktOIqYyZJyzhDXh4mTBEpFYlM84xxnUdlyVMNVjpYKTFPy_U6jqP4CZlsq615SijL4YBjVAoyLxMRGZ2EGkvV8TTP1llYTEncCVIWnmUef_B3GfVktE78EsUvnfinJOh7XTmWlb_cL8Y6ko31bnkNyfj6rsd7-uzHYxlSCbJoSl51Cpaw1OL7M7U1VVtLJOOMRZhn_Jp74PgPTwEj_9kNnvOc3Bnm3QsyaXateQlGbqOPPaB_A40io4g
linkProvider Library Specific Holdings
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PT9swFH4a7DA4jLGBKINiJK6pYjuOk-M0repY2xNInLDsNLkMJahNDvDX42cnLQWtSOOUi-34x7Pf8_P3vgdwIfAxKTQMQ5STIOImC1KN9HhWV4ZJSjPjXAOTaTy6ji5vRIcmXLSwSrxDF54owp3VuLnRGd1B4jCEO7RWIV7vKBvEIo2TaAs-2q_EJAY8nK5QHqJlZrS3JKzSRc_9o5U17bTGXYqgSb2w81b4hBevzm6nkIZ7YLqheBzK30FTm0H2-ILl8V1j_QKfW3OV_PDytQ8f8vIr7D4jMfwGt4hq9mzfD2RFHk6qgmji8IouaImUHnBOFo1B3w-pK4KJ7UmGFiomqqgJBrTNybxqEItN7h1l8QFcD39d_RwFbdaGIItCXgdap1brGSal0UJLlkdxwSWSwLAkz6jWNJFGSCZMSotCxMaahFYlchEXsxnnlB_CdlmV-REQllprOtd2VVkRJTQ3UWgwL5qIUzmTYdYD3q2WylpKc-zwnaJL5lM_ewpnT_nZ60GwrHXvKT3eKJ88FwRVO1dKKwaKb67aXxOa5f-YRN46Rntw3kmRsvsaH2t0mVfNQiHzI0_CVIoNZexd07ZiLcrj_-_jGXwaXU3Gavx7-uc77DCX7gMBjiewXc-b_NQaXbXpu231BLuyHJM
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fb9MwED6xIaHxAAyG6IDhSbymiu3YTh4RUI1f1R6otCcsO41fhpKqTR62v34-O-laJorE3m3Hvpx9d_Z33wG8F_iYlFqGKcp5knFbJoVBejxvK9O8oKUNVwM_pvJsln29EBcbWfwIq8QY2kWiiHBW4-ZezN2AiMMM7tQ7hRjdUTaWopB5tgcPJXKHYxJHOr0FeYiemNEHSdhlSJ77yyhbxmmLuhQxk2blxeZivYs7R3ewR5OnYIaVRBjK5bhr7bi8_oPk8T5LfQZPemeVfIjadQgPqvo5PN6gMHwBvxDTHLm-r8gtdThpHDEkoBVDyhKpI9ycrDqLNz-kbQiWtScl-qdYpqIlmM62JMumQyQ2WQTC4iOYTT7__HiW9DUbkjJLeZsYU3ibZ5lS1gijWJVJxxVSwLC8KqkxNFdWKCZsQZ0T0nqH0BtELqSbzzmn_CXs101dvQLCCu9LV0YqxlyW08pmqcWqaEIWaq7ScgR8-Fm67AnNccK_NV3znkbpaZSejtIbQbLutYiEHv9on2_qgW7DRUqvBZrv7nqypTPr7zGFrHWMjuB0UCLtdzU-1Zi6arqVRt5HnqeFEjva-EjTj-L9yeP_n-M7eHT-aaK_f5l-ew0HLNT6QHTjG9hvl1311ntcrT0Jm-oGGVkbNw
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=Reliability+evaluation+of+a+multistate+network+subject+to+time+constraint+under+routing+policy&rft.jtitle=International+journal+of+systems+science&rft.au=Lin%2C+Yi-Kuei&rft.date=2013-08-01&rft.issn=0020-7721&rft.eissn=1464-5319&rft.volume=44&rft.issue=8&rft.spage=1400&rft.epage=1408&rft_id=info:doi/10.1080%2F00207721.2012.659684&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7721&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7721&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7721&client=summon