邻近节点小间距的网络可靠性的计算

Computing the Reliability of Network With Small Distances Between Adjacent Nodes

提出通过节点有序排列的随机图模型来计算网络系统中节点对可靠性的方法,该方法基于使用滑动窗口技术的递归算法,滑动窗口由数个连续节点构成.窗口包含的所有节点的连通概率可以在单步中计算出来,随后窗口向前滑动一个节点,重复该过程直到最终窗口到达最后的节点,此时用连通概率即可计算网络系统的节点对可靠性.该算法尤其适用于邻近节点间距小的网络.

A new method is presented for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence. It is based on a reeursive algorithm using the ＂sliding window＂ technique, and the window is composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes includ- ed in the window are computed. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to com- pute the node-pair reliability of the network system in question. The algorithm is designed especially for graphs with small distances between adjacent nodes.