Spare reliability for capacitated computer networks under tolerable error rate and latency considerations

Yi-Kuei Lin; Cheng Fu Huang

doi:10.1080/03610918.2013.810259

Spare reliability for capacitated computer networks under tolerable error rate and latency considerations

Yi-Kuei Lin^*, Cheng Fu Huang

^*Corresponding author for this work

Department of Industrial Engineering and Management

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

Error rate and transmission time are both critical factors in a computer system. In addition to guarantee the robustness of the computer system under both tolerable error rate and latency, enhancing the system reliability by a routing scheme, named spare reliability, is also a critical task. Virtually, each branch possesses multiple possible capacities. Such a network is termed a capacitated computer network (CCN). Hence, this article develops an efficient algorithm to derive the spare reliability of a CCN, where the spare reliability is the probability that data can be sent through multiple minimal paths considering routing scheme.

Original language	English
Pages (from-to)	1879-1899
Number of pages	21
Journal	Communications in Statistics: Simulation and Computation
Volume	43
Issue number	8
DOIs	https://doi.org/10.1080/03610918.2013.810259
State	Published - 14 Sep 2014

Keywords

Capacitated computer network (CCN)
Latency
Routing scheme
Spare reliability
Tolerable error rate

Access to Document

10.1080/03610918.2013.810259

Fingerprint Dive into the research topics of 'Spare reliability for capacitated computer networks under tolerable error rate and latency considerations'. Together they form a unique fingerprint.

Cite this

@article{56a26f63f7a943d38648f9a9f4632912,

title = "Spare reliability for capacitated computer networks under tolerable error rate and latency considerations",

abstract = "Error rate and transmission time are both critical factors in a computer system. In addition to guarantee the robustness of the computer system under both tolerable error rate and latency, enhancing the system reliability by a routing scheme, named spare reliability, is also a critical task. Virtually, each branch possesses multiple possible capacities. Such a network is termed a capacitated computer network (CCN). Hence, this article develops an efficient algorithm to derive the spare reliability of a CCN, where the spare reliability is the probability that data can be sent through multiple minimal paths considering routing scheme.",

keywords = "Capacitated computer network (CCN), Latency, Routing scheme, Spare reliability, Tolerable error rate",

author = "Yi-Kuei Lin and Huang, {Cheng Fu}",

year = "2014",

month = sep,

day = "14",

doi = "10.1080/03610918.2013.810259",

language = "English",

volume = "43",

pages = "1879--1899",

journal = "Communications in Statistics Part B: Simulation and Computation",

issn = "0361-0918",

publisher = "Taylor and Francis Ltd.",

number = "8",

}

TY - JOUR

T1 - Spare reliability for capacitated computer networks under tolerable error rate and latency considerations

AU - Lin, Yi-Kuei

AU - Huang, Cheng Fu

PY - 2014/9/14

Y1 - 2014/9/14

N2 - Error rate and transmission time are both critical factors in a computer system. In addition to guarantee the robustness of the computer system under both tolerable error rate and latency, enhancing the system reliability by a routing scheme, named spare reliability, is also a critical task. Virtually, each branch possesses multiple possible capacities. Such a network is termed a capacitated computer network (CCN). Hence, this article develops an efficient algorithm to derive the spare reliability of a CCN, where the spare reliability is the probability that data can be sent through multiple minimal paths considering routing scheme.

AB - Error rate and transmission time are both critical factors in a computer system. In addition to guarantee the robustness of the computer system under both tolerable error rate and latency, enhancing the system reliability by a routing scheme, named spare reliability, is also a critical task. Virtually, each branch possesses multiple possible capacities. Such a network is termed a capacitated computer network (CCN). Hence, this article develops an efficient algorithm to derive the spare reliability of a CCN, where the spare reliability is the probability that data can be sent through multiple minimal paths considering routing scheme.

KW - Capacitated computer network (CCN)

KW - Latency

KW - Routing scheme

KW - Spare reliability

KW - Tolerable error rate

UR - http://www.scopus.com/inward/record.url?scp=84898870321&partnerID=8YFLogxK

U2 - 10.1080/03610918.2013.810259

DO - 10.1080/03610918.2013.810259

M3 - Article

AN - SCOPUS:84898870321

VL - 43

SP - 1879

EP - 1899

JO - Communications in Statistics Part B: Simulation and Computation

JF - Communications in Statistics Part B: Simulation and Computation

SN - 0361-0918

IS - 8

ER -

Spare reliability for capacitated computer networks under tolerable error rate and latency considerations

Abstract

Keywords

Access to Document

Other files and links

Cite this