Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints

In a real-time computer network, arcs and nodes have multi-state capacity, lead time, and packet accuracy rate (PAR). Evaluating the reliability of a network whose nodes are imperfect is complex, because node failure results in the disablement of adjacent arcs. Such a network is named a stochastic i...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of computer mathematics Vol. 90; no. 3; pp. 457 - 474
Main Authors Lin, Yi-Kuei, Huang, Cheng-Fu
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 01.03.2013
Taylor & Francis Ltd
Subjects
Accuracy
Algorithms
Back up systems
backup reliability
Backups
Computer networks
Mathematical problems
Networks
packet accuracy rate
Packets (communication)
Routing
Routing (telecommunications)
routing scheme
service level agreement
Software reliability
stochastic imperfect-node computer network
Stochastic models
Stochasticity
System reliability
Taiwan
Online AccessGet full text
ISSN0020-7160
1029-0265
DOI10.1080/00207160.2012.736616

Cover

Abstract In a real-time computer network, arcs and nodes have multi-state capacity, lead time, and packet accuracy rate (PAR). Evaluating the reliability of a network whose nodes are imperfect is complex, because node failure results in the disablement of adjacent arcs. Such a network is named a stochastic imperfect-node computer network (SINCN). Under the strict assumption that each arc has a deterministic capacity, the quickest path problem is to find a path that sends a specific amount of data with minimum transmission time. Subject to both an assured PAR and time constraints, this paper proposes an efficient algorithm to evaluate the system reliability of an SINCN. Furthermore, a routing scheme is adopted to reinforce the system reliability. Accordingly, reliability based on the routing scheme is calculated. An application of our method on the Taiwan academic network is described to show its impact on the backup reliability for different routing schemes.
AbstractList In a real-time computer network, arcs and nodes have multi-state capacity, lead time, and packet accuracy rate (PAR). Evaluating the reliability of a network whose nodes are imperfect is complex, because node failure results in the disablement of adjacent arcs. Such a network is named a stochastic imperfect-node computer network (SINCN). Under the strict assumption that each arc has a deterministic capacity, the quickest path problem is to find a path that sends a specific amount of data with minimum transmission time. Subject to both an assured PAR and time constraints, this paper proposes an efficient algorithm to evaluate the system reliability of an SINCN. Furthermore, a routing scheme is adopted to reinforce the system reliability. Accordingly, reliability based on the routing scheme is calculated. An application of our method on the Taiwan academic network is described to show its impact on the backup reliability for different routing schemes.
In a real-time computer network, arcs and nodes have multi-state capacity, lead time, and packet accuracy rate (PAR). Evaluating the reliability of a network whose nodes are imperfect is complex, because node failure results in the disablement of adjacent arcs. Such a network is named a stochastic imperfect-node computer network (SINCN). Under the strict assumption that each arc has a deterministic capacity, the quickest path problem is to find a path that sends a specific amount of data with minimum transmission time. Subject to both an assured PAR and time constraints, this paper proposes an efficient algorithm to evaluate the system reliability of an SINCN. Furthermore, a routing scheme is adopted to reinforce the system reliability. Accordingly, reliability based on the routing scheme is calculated. An application of our method on the Taiwan academic network is described to show its impact on the backup reliability for different routing schemes. [PUBLICATION ABSTRACT]
Author Huang, Cheng-Fu
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 & Technology
– sequence: 2
  givenname: Cheng-Fu
  surname: Huang
  fullname: Huang, Cheng-Fu
  organization: Department of Industrial Management , National Taiwan University of Science & Technology
BookMark eNqFkbuOFDEQRS20SMwu_AGBJRKSHsqPfpgEwYqXtBIJxJbbLgvPdtuN7QbN39OtgWQDiBzUOVflutfkKqaIhDxncGQwwCsADj3r4MiB8WMvuo51j8iBAVcN8K69IocdaXbmCbku5QQAg-q7A_n5ztj7daEZp2DGMIV6psnTUpP9bkoNloZ5wezR1iYmh9SmeVkrZhqx_kr5vtCyjqdtTGuiyxaGlRpr12zsmWZTkZroaA3zrsZSswmxlqfksTdTwWd_3hvy7cP7r7efmrsvHz_fvr1rLB9EbRzIoQXReuUEeuTgfOsYsM4wOSAKrySXyrUtQ-VHNnYtDrbvhHdylLx34oa8vOQuOf1YsVQ9h2JxmkzEtBbNhFRSKCX6DX3xAD2lNcdtu41iivdDL9VGvb5QNqdSMnptQzU1pLj_bNIM9F6J_luJ3ivRl0o2WT6Qlxxmk8__095ctBB9yrPZzj45Xc15StlnE20oWvwz4Tf0LqWq
CitedBy_id crossref_primary_10_1142_S0218488515500014
Cites_doi 10.1016/S0951-8320(01)00128-4
10.1016/S0951-8320(98)00076-3
10.1016/0020-0190(93)90214-T
10.1016/0026-2714(94)00121-4
10.1016/0020-0190(94)00008-5
10.1016/j.cor.2010.10.024
10.1109/24.257817
10.1016/j.amc.2007.02.133
10.1016/j.ress.2006.11.004
10.1109/TR.1985.5222235
10.1109/JSAC.1986.1146410
10.1080/0020716031000103385
10.1016/S0305-0548(02)00025-4
10.1016/0305-0548(94)90045-0
10.1002/net.3230250306
10.1016/S0305-0548(03)00250-8
10.1093/ietcom/e90-b.11.3061
10.1080/00207160701697354
10.1109/TR.1985.5222178
10.1080/07408170601013653
10.1016/0305-0548(90)90039-A
10.1016/0305-0548(93)90096-2
10.1016/0167-8191(92)90048-C
10.1109/TC.1982.1676078
10.1016/0020-0190(93)90057-G
10.1016/0166-218X(88)90065-0
10.1016/S0360-8352(98)00111-9
10.1109/24.740489
10.1016/j.ress.2004.05.002
10.1016/S0305-0548(98)00020-3
10.1016/S0167-6377(97)00008-4
10.1016/S0305-0548(03)00195-3
10.3934/jimo.2011.7.211
10.1016/j.ejor.2005.07.015
10.1016/j.ejor.2006.03.013
10.1080/00207160412331336017
10.1109/90.929850
10.1109/TSMCA.2010.2069093
10.1109/TR.2008.2011660
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2013
Copyright Taylor & Francis Ltd. 2013
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2013
– notice: Copyright Taylor & Francis Ltd. 2013
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1080/00207160.2012.736616
DatabaseName CrossRef
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 Computer Science
EISSN 1029-0265
EndPage 474
ExternalDocumentID 2926041931
10_1080_00207160_2012_736616
736616
GeographicLocations Taiwan
GeographicLocations_xml – name: Taiwan
GroupedDBID -~X
.4S
.7F
.DC
.QJ
0BK
0R~
29J
30N
4.4
5GY
5VS
AAENE
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABDBF
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACGOD
ACIWK
ACNCT
ACUHS
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AGDLA
AGMYJ
AHDZW
AI.
AIJEM
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
ARCSS
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EAP
EBS
EDO
EJD
EMK
EPL
EST
ESX
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
M4Z
MK~
NA5
NY~
O9-
P2P
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TBQAZ
TDBHL
TEJ
TFL
TFT
TFW
TN5
TTHFI
TUROJ
TUS
TWF
UPT
UT5
UU3
VH1
WH7
ZGOLN
~S~
07G
1TA
AAGDL
AAHIA
AAIKQ
AAKBW
AAYJJ
AAYXX
ABEFU
ACAGQ
ACGEE
ACTIO
ADYSH
AEUMN
AFFNX
AFRVT
AGCQS
AGLEN
AGROQ
AHMOU
AIYEW
ALCKM
AMEWO
AMPGV
AMVHM
AMXXU
AQRUH
BCCOT
BPLKW
C06
CAG
CITATION
COF
CRFIH
DMQIW
DWIFK
H~9
IVXBP
LJTGL
NUSFT
QCRFL
TAQ
TFMCV
TOXWX
UB9
UU8
V3K
V4Q
ZY4
7SC
8FD
JQ2
L7M
L~C
L~D
TASJS
ID FETCH-LOGICAL-c283t-d0485035f9d3efe20df5d1016a148ee3f94249d551e9fb1b65e8c763fd4b427d3
ISSN 0020-7160
IngestDate Thu Jul 10 22:22:53 EDT 2025
Wed Aug 13 06:31:12 EDT 2025
Tue Jul 01 01:04:43 EDT 2025
Thu Apr 24 22:52:12 EDT 2025
Wed Dec 25 09:05:16 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c283t-d0485035f9d3efe20df5d1016a148ee3f94249d551e9fb1b65e8c763fd4b427d3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
PQID 1319278749
PQPubID 52924
PageCount 18
ParticipantIDs proquest_journals_1319278749
crossref_primary_10_1080_00207160_2012_736616
informaworld_taylorfrancis_310_1080_00207160_2012_736616
proquest_miscellaneous_1349439937
crossref_citationtrail_10_1080_00207160_2012_736616
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 20130301
PublicationDateYYYYMMDD 2013-03-01
PublicationDate_xml – month: 03
  year: 2013
  text: 20130301
  day: 01
PublicationDecade 2010
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle International journal of computer mathematics
PublicationYear 2013
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References CIT0030
CIT0010
CIT0032
CIT0031
CIT0012
CIT0034
CIT0011
CIT0033
Jedwab J. (CIT0018) 1992
CIT0036
CIT0013
CIT0035
CIT0016
CIT0038
CIT0015
CIT0037
CIT0017
CIT0039
CIT0019
CIT0041
CIT0040
CIT0021
CIT0020
CIT0001
CIT0023
CIT0022
CIT0003
CIT0025
CIT0002
CIT0024
CIT0005
CIT0027
CIT0004
CIT0026
CIT0007
CIT0029
CIT0006
Ford L. R. (CIT0014) 1962
CIT0028
CIT0009
CIT0008
References_xml – ident: CIT0037
  doi: 10.1016/S0951-8320(01)00128-4
– ident: CIT0019
  doi: 10.1016/S0951-8320(98)00076-3
– ident: CIT0020
  doi: 10.1016/0020-0190(93)90214-T
– ident: CIT0034
  doi: 10.1016/0026-2714(94)00121-4
– ident: CIT0008
  doi: 10.1016/0020-0190(94)00008-5
– ident: CIT0027
  doi: 10.1016/j.cor.2010.10.024
– ident: CIT0017
  doi: 10.1109/24.257817
– ident: CIT0024
  doi: 10.1016/j.amc.2007.02.133
– ident: CIT0038
  doi: 10.1016/j.ress.2006.11.004
– ident: CIT0003
  doi: 10.1109/TR.1985.5222235
– ident: CIT0016
  doi: 10.1109/JSAC.1986.1146410
– ident: CIT0040
  doi: 10.1080/0020716031000103385
– ident: CIT0022
  doi: 10.1016/S0305-0548(02)00025-4
– ident: CIT0006
  doi: 10.1016/0305-0548(94)90045-0
– ident: CIT0021
  doi: 10.1002/net.3230250306
– ident: CIT0031
  doi: 10.1016/S0305-0548(03)00250-8
– ident: CIT0029
  doi: 10.1093/ietcom/e90-b.11.3061
– ident: CIT0035
  doi: 10.1080/00207160701697354
– ident: CIT0036
  doi: 10.1109/TR.1985.5222178
– ident: CIT0041
  doi: 10.1080/07408170601013653
– ident: CIT0009
  doi: 10.1016/0305-0548(90)90039-A
– ident: CIT0007
  doi: 10.1016/0305-0548(93)90096-2
– ident: CIT0015
  doi: 10.1016/0167-8191(92)90048-C
– ident: CIT0002
  doi: 10.1109/TC.1982.1676078
– ident: CIT0005
  doi: 10.1016/0020-0190(93)90057-G
– volume-title: Flows in Networks
  year: 1962
  ident: CIT0014
– ident: CIT0004
  doi: 10.1016/0166-218X(88)90065-0
– ident: CIT0001
  doi: 10.1016/S0360-8352(98)00111-9
– ident: CIT0011
  doi: 10.1109/24.740489
– ident: CIT0032
  doi: 10.1016/j.ress.2004.05.002
– ident: CIT0010
  doi: 10.1016/S0305-0548(98)00020-3
– ident: CIT0028
  doi: 10.1016/S0167-6377(97)00008-4
– ident: CIT0030
  doi: 10.1016/S0305-0548(03)00195-3
– ident: CIT0026
  doi: 10.3934/jimo.2011.7.211
– volume-title: Traffic estimation for the largest sources, on a network, using packet sampling with limited storage
  year: 1992
  ident: CIT0018
– ident: CIT0023
  doi: 10.1016/j.ejor.2005.07.015
– ident: CIT0012
  doi: 10.1016/j.ejor.2006.03.013
– ident: CIT0033
  doi: 10.1080/00207160412331336017
– ident: CIT0013
  doi: 10.1109/90.929850
– ident: CIT0039
  doi: 10.1109/TSMCA.2010.2069093
– ident: CIT0025
  doi: 10.1109/TR.2008.2011660
SSID ssj0008976
Score 1.9306583
Snippet In a real-time computer network, arcs and nodes have multi-state capacity, lead time, and packet accuracy rate (PAR). Evaluating the reliability of a network...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 457
SubjectTerms Accuracy
Algorithms
Back up systems
backup reliability
Backups
Computer networks
Mathematical problems
Networks
packet accuracy rate
Packets (communication)
Routing
Routing (telecommunications)
routing scheme
service level agreement
Software reliability
stochastic imperfect-node computer network
Stochastic models
Stochasticity
System reliability
Title Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
URI https://www.tandfonline.com/doi/abs/10.1080/00207160.2012.736616
https://www.proquest.com/docview/1319278749
https://www.proquest.com/docview/1349439937
Volume 90
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9NAEF6F9sKFNyJQ0CJxq1zZ3l3HPpZCFfE6paJwsbwvGrV1qsTmwI1_zox37WxIxaMXy_Ija2U-z8sz3xDyKs-NNjytIp5x2CSwV4hCRMzkmbSWW6mxUfjjp2x6wt-ditPR6GfYXdLIA_Xj2r6Sm0gVjoFcsUv2PyQ7_CgcgH2QL2xBwrD9Jxm_rtR5e4X9KHNHt919Lgd3Tp1VyL-MPZBmiQUbUb3QpqsfxxEO-7Ur_l7tr1qJiRj0QCF4PscEsFLtEmfAI4eEq6-cX3Yl7atunIRjfur92c2EYkBDMSx1OfDCDt77B8db8GUevW_NfA0sn7o-OjP1t-i4DRMSOByChQmJ2dZskFD_QrAKEZr7EmOcysUCHIgERaiT3QhRjz0WKFju6Ky9reZuws-WGejrJtMYF8MCvvRgwsAV-Y11u7Pj7sQtsptCpAG6ffdw-ubr58Gc50U3oXB49L7_Egnar1lgw7_ZYL_dsvadCzO7R-742IMeOiDdJyNTPyB3-7ke1Kv5h-S7wxUNcEUXlq5xRTdxRXth0x5X1OOKNgvqcEV7XFHEFQVcUcQVDXD1iJwcv50dTSM_nyNS4JQ2kQbtL2ImbKGZsSaNtRUas0EVxNjGMFtwCO41-OSmsDKRmTC5AntmNZc8nWj2mOzUi9o8IVQaIaukgvg_tlzFqTSZmCiWKc2LmNnJmLD-Xy2VJ6_Hh7sok4Hj1smiRFmUThZjEg13XTnylr9cn4cCK5sOytahuGR_vnWvF27pX7ZVmYB9S8Ei8mJMXg6nQX_jR7mqNosWr-EF76KEpzdf_Rm5vX4T98hOs2zNc3CWG_nCw_kXkG2_Ig
linkProvider Library Specific Holdings
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELagHOBCeYotpRiJa1ZJbCfxERDVtrR7aiVukZ9itW1SbRyk8us7EycrCqJIcIkixePYjv15ZjL-hpD3VeWs47lKeMHhksGdFFIkzFWF9p57bfGg8OmyWJzz469iiibsxrBKtKF9JIoYsBoXNzqjp5A4PMINO2ORYmRWPi8Z7DHFffJAyKLEtcnS5RaMKznkl0OJBEWm03N_qOXW7nSLu_Q3rB42oMNdoqemx7iT9bwPem5-_MLq-F99e0Iej-op_RDn01NyzzXPyO6U-oGOSPCcfP-ozLq_oht3sYpM39e09RQ0SfNNIfUzXYE-vsFYkaRpraNmqqKJcecd7XqNPiAaWgp2-9oFqozpN8pcU6SvoNAFGlaXKIost2rVhO4FOT_8fPZpkYwpHBIDektILACESJnw0jLnXZ5aLyw6DBSYYc4xLznYfxbUNie9znQhXGUA8rzlmuelZS_JTtM27hWh2gmtMgUmYuq5SXPtClEaVhjLZcp8OSNs-nS1GfnNsXEXdbalQY1DW-PQ1nFoZyTZSl1Ffo-_lK9-nhV1GPwqPiZBqdndovvTDKpHoOjqDCAwB9DkckbebR_DEsf_NqpxbY9luOSDIrn3729_Sx4uzk5P6pOj5ZfX5FE-ZPXAULp9shM2vXsDulXQB8PquQFM3xeo
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELagSIgL5akuFDAS16yS-LHxsbSsymvFgUq9WX6K1VbJajdBKr--M3GyakGABJcoUjyJ7difZ-yZbwh5U1XBB16ajEsOlwLulFAiY6GSNkYercdA4c8LeXrGP5yL82tR_OhWiTZ0TEQRPVbj5F77OHrEYQQ3LIwyR8escjpjsMTI2-SOxDM-DOLIFzssrlSfXg4lMhQZg-d-85Ybi9MN6tJfoLpff-b7xIw1T24nq2nX2qn78ROp4_807QG5Pyin9CiNpofkVqgfkf0x8QMdcOAx-f7WuFW3pptwsUw835e0iRT0SPfNIPEzXYI2vkFPkaxufKBufEWdvM63dNtZ3AGibUPBal-Flhrnuo1xlxTJKyi0gGLeexBFjluzrNvtE3I2f_f1-DQbEjhkDrSWNvMADyJnIirPQgxl7qPwuF1gwAgLgUXFwfrzoLQFFW1hpQiVA8CLnltezjx7Svbqpg4HhNogrCkMGIh55C4vbZBi5ph0nqucxdmEsPHPaTewm2PlLnSxI0FNXauxa3Xq2gnJdlLrxO7xl_LV9UGh235XJaYUKJr9WfRwHEB6gImtLgAAS4BMribk9e4xTHA8tTF1aDoswxXv1chn__71V-Tul5O5_vR-8fE5uVf2KT3Qj-6Q7LWbLrwAxaq1L_u5cwXDERZM
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=Backup+reliability+of+stochastic+imperfect-node+computer+networks+subject+to+packet+accuracy+rate+and+time+constraints&rft.jtitle=International+journal+of+computer+mathematics&rft.au=Lin%2C+Yi-Kuei&rft.au=Huang%2C+Cheng-Fu&rft.date=2013-03-01&rft.pub=Taylor+%26+Francis&rft.issn=0020-7160&rft.eissn=1029-0265&rft.volume=90&rft.issue=3&rft.spage=457&rft.epage=474&rft_id=info:doi/10.1080%2F00207160.2012.736616&rft.externalDocID=736616
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7160&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7160&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7160&client=summon