| A New Algorithm for the Weighted Reliability of Networks |
| |
| 引用本文： | LIU Chen (Nanjing University of Posts and Telecomunications,Nanjing 210003,P.R.China). A New Algorithm for the Weighted Reliability of Networks[J]. 中国邮电高校学报(英文版), 2000, 7(3) |
| |
| 作者姓名： | LIU Chen (Nanjing University of Posts and Telecomunications Nanjing 210003 P.R.China) |
| |
| 作者单位： | Nanjing University of Posts and Telecomunications，Nanjing 210003，P.R.China |
| |
| 摘 要： | 1 ＩｎｔｒｏｄｕｃｔｉｏｎＵｓｕａｌｌｙ ,ｔｈｅｍｅｔｈｏｄｏｌｏｇｙｏｆａｎａｌｙｚｉｎｇｔｈｅｐｅｒ ｆｏｒｍａｎｃｅｉｎｄｅｘｏｆｎｅｔｗｏｒｋｃａｎｂｅｃｌａｓｓｉｆｉｅｄｉｎｔｏｔｗｏｃａｔｅｇｏｒｉｅｓ:ｏｎｅｉｓｔｈｅｒｅｌｉａｂｉｌｉｔｙａｎａｌｙｓｉｓ,ａｍｏｎｇｗｈｉｃｈｔｈｅａｎａｌｙｓｉｓｏｆｔｅｒｍｉｎａｌｒｅｌｉａｂｉｌｉｔｙｉｓｍｏｓｔｆｏ ｃｕｓｅｄｏｎ[1～ 2 ] .Ｔｈｅａｎａｌｙｓｉｓｏｆｔｅｒｍｉｎａｌｒｅｌｉａｂｉｌｉｔｙｄｏｅｓｎ ｔｔａｋｅｔｈｅｒｅｓｔｒｉｃ…
|
A New Algorithm for the Weighted Reliability of Networks |
| |
| LIU Chen. A New Algorithm for the Weighted Reliability of Networks[J]. The Journal of China Universities of Posts and Telecommunications, 2000, 7(3) |
| |
| Authors: | LIU Chen |
| |
| Abstract: | The weighted reliability of network is defined as the sum of the multiplication of the probability of each network state by its normalized weighting factor. Under a certain state, when the capacity from source s to sink t is larger than the given required capacity Cr, then the normalized weighting factor is 1, otherwise, it is the ratio of the capacity to the required capacity Cr. This paper proposes a new algorithm for the weighted reliability of networks, puts forward the concept of saturated state of capacity, and suggests a recursive formula for expanding the minimal paths to be the sum of qualifying subsets. In the new algorithm, the expansions of the minimal paths don't create the irrelevant qualifying subsets, thus decreasing the unnecessary expanding calculation. Compared with the current algorithms, this algorithm has the advantage of a small amount of computations for computer implementation. |
| |
| Keywords: | weighted reliability capacity minimal paths network flow |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
