返回Google圖書搜尋

Most Reliable Double Loop Networks in Survival Reliability

DIMACS (GROUP)X. D. HuF. K. HwangWen-Ch'ing Winnie Li

出版	DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, 1991
URL	http://books.google.com.hk/books?id=ygODGwAACAAJ&hl=&source=gbs_api

註釋Abstract: "Double loop networks have been intensively studied as interconnecting networks. However, the reliability analysis of such networks has hit a snag since the usual measure of reliability, the graph connectivity, is completely powerless as all double loops, if connected, are 2-connected. Recently, Hwang and Li introduced a new analysis by partitioning cutsets into isolated and nonisolated ones and gave results on both types. Along the same line, we extend their results to the survival reliability model by showing that when each node fails independently with a very small probability, [formula] is the most reliable connected double loop network except when n = 3 and 9, in which case G(1,2) is the most reliable."