检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:何明[1,2] 裘杭萍[1] 肖登海[1] 刘勇[1] 王立峰
机构地区:[1]解放军理工大学指挥自动化学院,江苏南京210007 [2]东南大学信息科学与工程学院,江苏南京210096 [3]沈阳军区,辽宁沈阳110001
出 处:《解放军理工大学学报(自然科学版)》2009年第3期269-272,共4页Journal of PLA University of Science and Technology(Natural Science Edition)
基 金:国家863计划资助项目(2007AA012432;2007AA-01Z433)
摘 要:为了有效评估网络可靠性,通过计算网络节点对的可靠性,提出了一种利用节点有序排列的随机图模型来计算网络系统中节点对可靠性的新方法。该方法使用基于滑动窗口技术的递归算法,滑动窗口由数个连续节点构成。首先通过在单步中计算出窗口包含的所有节点的连通概率,其次窗口向前滑动一个节点,此过程重复,直至窗口到达最后的节点,此时的连通概率即可计算网络系统的节点对可靠性。仿真结果表明,该方法尤其适用于邻近节点间距很小的网络。算法最主要的优点在于降低计算复杂度。To evaluate the reliability of network, a new method was presented for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence was presented. Based on a recursive algorithm using the "sliding window" technique, the window was composed of several consecutive nodes. The kernel of the algorithm was that the connectivity probabilities for all nodes included in the window were found in a single step. Subsequently, the window was moved one node forward. This process was repeated until the window reached the terminal node. The connectivity probabilities found at that point were used to compute the node-pair reliability of the network system considered. Simulation results show that the algorithm whose main advantage is low numerical complexity is designed especially for graphs with small distances between adjacent nodes.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147