首页 | 本学科首页   官方微博 | 高级检索  
     

计算通信网络整体概率连通性的一种新算法
引用本文:陈育斌,李建东,陈家模,郭梯云.计算通信网络整体概率连通性的一种新算法[J].通信学报,2000,21(9):91-96.
作者姓名:陈育斌  李建东  陈家模  郭梯云
作者单位:西安电子科技大学,通信工程学院,陕西,西安,710071
摘    要:本文提出了一种计算网络整体概率连通性的新算法。该算法首先构造了一种多级状态空间分解法,对网络状态空间进行了分解,并对分解所得的生成事件提出了一种提出了一种特殊的生成子网构造法,从而有效减少了网络状态空间集。新算法通过迭代运算用上下界来逼近网络概率连通性的值,与传统算法相比,具有运算速度快、收敛性能好,很适合近似计算的特点。

关 键 词:概率连通性算波  计算机网络
修稿时间:1998-10-06

A new algorithm for network probabilistic connectivity
CHEN Yu-bin,LI Jian-dong,CHEN Jia-mo,GUO Ti-yun.A new algorithm for network probabilistic connectivity[J].Journal on Communications,2000,21(9):91-96.
Authors:CHEN Yu-bin  LI Jian-dong  CHEN Jia-mo  GUO Ti-yun
Abstract:A new algorithm for network probabilistic connectivity is presented in this paper In this algorithm,the multi level decomposition algorithm of the network states space is given A new method to construct sub graphs of the obtained events is proposed,which can greatly reduce the dimensions of network states space An iterative computation is used to approximate the lower bound and the upper bound of the value of the probabilistic connectivity Compared with other algorithms,ours is characterized by its fast computing and converging speed,and is most suitable for approximating computation
Keywords:network  probabilistic connectivity  algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号