|
|||||
|
|
| 基于递归BDD的网络系统可靠度算法 | |
| 引用本文： | 张 军,秦乐乐,王震洲,刘教民,王 淼.基于递归BDD的网络系统可靠度算法[J].河北科技大学学报,2011,32(2):143-146,151. |
| 作者姓名： | 张 军 秦乐乐 王震洲 刘教民 王 淼 |
| 作者单位： | 1. 河北工业大学电气工程学院,天津,300401;河北工业大学计算机科学与软件学院,天津,300401 2. 河北科技大学教务处,河北石家庄,050018 3. 河北科技大学信息科学与工程学院,河北石家庄,050018 4. 河北工业大学电气工程学院,天津,300401;河北科技大学信息科学与工程学院,河北石家庄,050018;华北电力大学电力工程系,河北保定,071003 5. 华北电力大学电力工程系,河北保定,071003 |
| 摘 要： | 在网络系统可靠度的BDD算法中,将网络系统表示成BDD时二叉树中存在一定重复和冗余项,从而影响了不交化最小路集的搜索效率.为此,提出了一种基于递归BDD(RBDD)的网络系统可靠度算法.在该算法中,RBDD包括2个二叉树,一个是包含1个伪叶节点的二叉树,另一个是伪叶节点对应的二叉树.理论分析和实例都表明由RBDD得到的... |
| 关 键 词： | 可靠度 二元决策图 递归二元决策图 伪叶节点 不交化最小路集 |
| 收稿时间： | 2010/11/17 0:00:00 |
| 修稿时间： | 2011/1/6 0:00:00 |
An algorithm for computer network system reliability based on recursive binary decision diagram |
|
| ZHANG Jun,QIN Le-le,WANG Zhen-zhou,LIU Jiao-min and WANG Miao.An algorithm for computer network system reliability based on recursive binary decision diagram[J].Journal of Hebei University of Science and Technology,2011,32(2):143-146,151. | |
| Authors: | ZHANG Jun QIN Le-le WANG Zhen-zhou LIU Jiao-min and WANG Miao |
| Institution: | 1.Department of Electrical Engineering,Hebei University of Technology,Tianjin 300401,China;2.School of Computer Science and Engineering,Hebei University of Technology,Tianjin 300401,China;3.Department of Teaching Affairs,Hebei University of Science and Technology,Shijiazhuang Hebei 050018,China;4.College of Information Science and Engineering,Hebei University of Science and Technology,Shijiazhuang Hebei 050018,China;5.Department of Electric Power Engineering,North China Electric Power University,Baoding Hebei 071003,China) |
| Abstract: | In BDD algorithm for network system reliability,there exist some repeated and redundant items after the network system is transformed into a binary tree.It affects the efficiency of searching disjointed minimal path sets.In this paper,a recursive BDD algorithm is presented,which contains two binary trees.One is the binary tree including a pseudo leaf node.The other is the BDD corresponding to the pseudo leaf node.Both theoretical analysis and instance computing show that the binary tree from RBDD has fewer levels and simpler structure than that from BDD,which effectively degrades the repeat and redundancy of the algorithm and improves the efficiency of indexing the disjointed minimal path sets. |
| Keywords: | reliability BDD RBDD pseudo leaf node disjointed minimal path set |
| 本文献已被 维普 万方数据 等数据库收录！ | |
| 点击此处可从《河北科技大学学报》浏览原始摘要信息 | |
| 点击此处可从《河北科技大学学报》下载免费的PDF全文 | |