期刊文献+

铁路通信网络终端对可靠性的计算 被引量:2

The Computation of Railway Communication Network Terminal-pair Reliability
下载PDF
导出
摘要 根据铁路通信网络特点得出铁路通信网络的逻辑结构,从而抽象出其一般拓扑结构.对拓扑结构特点进行分析,给出适合计算该拓扑结构终端对可靠性的几种算法,最后结合实例,利用其中的一种算法,即全代数化的算法来说明这种网络的终端对可靠性的具体计算步骤. By analyzing the characteristic of railway communication network, the logical construction can be obtained. Then the general topology of this kind network is obtained as well on the basis of the logical construction of railway communication network. Through analyzing the topology, several methods to compute this kind of communication network terminal - pair reliability is gained. At last an all - algebra algorithm is given to explain the detailed computing step.
出处 《哈尔滨理工大学学报》 CAS 2007年第2期87-89,共3页 Journal of Harbin University of Science and Technology
关键词 铁路通信 可靠性 路由算法 终端对 railway communication reliability route algorithm terminal - pair
  • 相关文献

参考文献8

二级参考文献34

  • 1李标庆,金虹.考虑容量的通信网可靠性算法[J].南京邮电学院学报,1995,15(1):1-5. 被引量:4
  • 2沈元隆.计算通信网络可靠性的分解技术[J].系统工程学报,1996,11(3):47-53. 被引量:4
  • 3周南良,数字逻辑,1992年,186页
  • 4梅启智,系统可靠性工程基础,1987年,76页
  • 5马振华.离散数学引导[M].北京:清华大学出版社,1993.249-258.
  • 6Aggarwal K K,Gupta J S,Misra K B.A simple method for reliability evaluation of a communication system[J].IEEE Trans.Comm.,1975,23(5): 563-566.
  • 7Netes V A, Filin B P. Consideration of node failures in network-reliability calculation [J]. IEEE Trans. Reliability, 1996, 45(I): 127-128.
  • 8Torrieri D. Calculation of node-pair reliability in large networks with unreliable nodes [J]. IEEE Trans. Reliability, 1994, 43(3): 375-377,382.
  • 9Torrieri D. An efficient algorithm for the calculation of node-pair reliability [A].Proc. IEEE MILCOM'91 [C]. 1991-11. 187-192.
  • 10Ke W J, Wang S D. Reliability evaluation fur distributed computing networks with imperfect nodes [J] IEEE Trans. Reliability, 1997, 46(3):342-349.

共引文献405

同被引文献22

  • 1谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,26(11):79-83. 被引量:257
  • 2戴伏生.通信网络各节点和链路重要性的客观评估方法[J].南京理工大学学报,2006,30(6):748-754. 被引量:10
  • 3Behr A, Camarinopoulos L, Pampoukis G.Domination of K-out-of-n systems[J].IEEE Transactions on Reliability, 1995,44 (4) : 705 -707.
  • 4Charles C J.The combinatorics of network reliability[M]. Oxford: Oxford University Press, 1987.
  • 5Kong Ruoshan,Zhou Huanbei.End-to-end availability anal- ysis of physical network[EB/OL]. (2004).http://www.ieee. org.
  • 6Yeh W C.A path-based algorithm for evaluating the k- out-of-n flow network reliability[J].Reliability Engineer- ing and System Safety,2005,87:243-251.
  • 7Yeh F M,Lu S K,Kuo S Y.OBDD-based evaluation of k-terminal network reliability[J].IEEE Transactions on Re- liability, 2002,51 (4) : 443-451.
  • 8Corley H W, Sha D Y.Most vital links and nodes in weighted networks[J].Oper Res Lett, 1982,1 : 157-160.
  • 9Nardelli E,Proietti G,Widmayer P.Finding the most vi- tal node of a shortest path[J].Theoretical Computer Sci- ence,2001,296(1 ) : 167-177.
  • 10Abdullah K.A multiobjective genetic algorithm approach to telecommunication network design problems consid- ering reliability and performance[D].The University of Pittsburgh, 2001.

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部