KMS Of Academy of mathematics and systems sciences, CAS
Exact reliabilities of most reliable double-loop networks | |
Hwang, FK; Wright, PE; Hu, XD | |
1997-09-01 | |
Source Publication | NETWORKS |
ISSN | 0028-3045 |
Volume | 30Issue:2Pages:81-90 |
Abstract | A double-loop network with hop constants h(1), h(2), DL(n, h(1), h(2)) may be represented as a directed graph with n nodes 0, 1,..., n-1 and 2n links of the form i --> i + h(1)mod n and i --> i + h(2)mod n (referred to as h(1)-links and h(2)-links). They have been proposed as architectures for local area networks and for data alignment in SIMD processors, among other applications. Three reliability models of double-loop networks have been studied in the literature. In the link model, nodes always work and each link fails independently with probability p. Hwang and Li showed that for p small DL(n, 1, 1 + n/2) is most reliable for n even, and DL(n, 1, 2) is most reliable for n odd. In the node model, links always work and each node fails independently with probability p. Hu et al. showed that for p small DL(n, I, 1 + [n/2]) is the most reliable. However, no nonenumerative algorithms were given to compute the reliabilities of these most reliable networks except DL(n, 1, 1 + n/2) for even n under the node model. Recently, Hwang and Wright proposed a novel approach to compute the reliabilities of double-loop networks under the uniform model that each node fails with probability p, each h(1)-link with probability p(1), and each h(2)-link with probability p(2), and the failures are independent. In particular, they obtained the reliabilities for DL(n, 1, 2). in this paper, we applied their approach to compute the reliabilities of DL(n, 1, 1 + [n/2]) under the uniform model, except that for n odd we need the assumption that h(1)-links always work. Note that even under this additional assumption our reliability model is more general than is the node model, the original model under which DL(n, 1, 1 + [n/2]) is found to be most reliable for n odd. We also used this approach to obtain the reliabilities of DL(n, 1, n - 2), known as the daisy chain in the literature. (C) 1997 John Wiley & Sons, Inc. |
Language | 英语 |
WOS Research Area | Computer Science ; Operations Research & Management Science |
WOS Subject | Computer Science, Hardware & Architecture ; Operations Research & Management Science |
WOS ID | WOS:A1997XR26500002 |
Publisher | JOHN WILEY & SONS INC |
Citation statistics | |
Document Type | 期刊论文 |
Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/29046 |
Collection | 中国科学院数学与系统科学研究院 |
Affiliation | CHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA |
Recommended Citation GB/T 7714 | Hwang, FK,Wright, PE,Hu, XD. Exact reliabilities of most reliable double-loop networks[J]. NETWORKS,1997,30(2):81-90. |
APA | Hwang, FK,Wright, PE,&Hu, XD.(1997).Exact reliabilities of most reliable double-loop networks.NETWORKS,30(2),81-90. |
MLA | Hwang, FK,et al."Exact reliabilities of most reliable double-loop networks".NETWORKS 30.2(1997):81-90. |
Files in This Item: | ||||||
There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment