Exact reliabilities of most reliable double-loop networks

CSpace > 应用数学研究所

	Exact reliabilities of most reliable double-loop networks
	Hwang, FK; Wright, PE; Hu, XD
	1997-09-01
发表期刊	NETWORKS
ISSN	0028-3045
卷号	30 期号:2 页码:81-90
摘要	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.
语种	英语
WOS研究方向	Computer Science ; Operations Research & Management Science
WOS类目	Computer Science, Hardware & Architecture ; Operations Research & Management Science
WOS记录号	WOS:A1997XR26500002
出版者	JOHN WILEY & SONS INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/29046
专题	应用数学研究所
通讯作者	Hwang, FK
作者单位	CHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA
推荐引用方式 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.