完整後設資料紀錄
DC 欄位語言
dc.contributor.authorJAN, RHen_US
dc.date.accessioned2014-12-08T15:04:41Z-
dc.date.available2014-12-08T15:04:41Z-
dc.date.issued1993-01-01en_US
dc.identifier.issn0305-0548en_US
dc.identifier.urihttp://hdl.handle.net/11536/3179-
dc.description.abstractIn many applications, the network designer may want to know how to synthesize a reliable network. Assume that a network, denoted as G(n,e), has the number of nodes n and the number of edges e, and the operational probability of each edge is known. The system reliability of the network is defined to be the probability that every pair of nodes can communicate with each other. A network synthesis problem considered in this paper is to find a network G(n,e)* that maximizes system reliability over the class of all networks having n nodes and e edges. We find the optimal networks for the classes of networks G(n,n-1), G(n,n) and G(n,n+1), respectively. In addition, an upper bound of maximum reliability for the networks with n nodes and e edges (e greater-than-or-equal-to n + 2) is derived in terms of node degrees. Computational experiments for the reliability upper bound are also presented. The results show that the proposed reliability upper bound is effective.en_US
dc.language.isoen_USen_US
dc.titleDESIGN OF RELIABLE NETWORKSen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTERS & OPERATIONS RESEARCHen_US
dc.citation.volume20en_US
dc.citation.issue1en_US
dc.citation.spage25en_US
dc.citation.epage34en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1993JW23600003-
dc.citation.woscount42-
顯示於類別:期刊論文