|Table of Contents|

Objective Evaluation Method of Significance of Nodes and Links in Communication Network


Research Field:
Publishing date:


Objective Evaluation Method of Significance of Nodes and Links in Communication Network
DAI Fu-sheng
Weihai Campus,Harbin Institute of Technology,Weihai 264209,China
commun icat ion netwo rk reliab ility route algor ithm sw itch ing node communication capac ity
In order to evaluate the sign ificance of each node and link o f a communication netwo rk comprehensively and objectively, this paper introduces the concept o f norma lized re liab ility index w e ighted by capac ity. The index is defined based on thewho le and part of a communication respect ive.l One is the no rmalized reliab ility index w eighted by the total capacity of reliability betw een all the nodes o f a netw ork and the o ther is the norm alized reliab ility index w eighted by themax imum capacity betw een tw o designated nodes. The log ic algebraic a lgorithm of ach iev ing all the routes o f the netw ork is studied, and the tota l algebra ic a lgorithm o f re liability index is derived, wh ich is fit to design program s and avo ids the heavymanual calcu lation. Tak ing the effect degree on the re liability index of the node and link invalidation as the eva luating rule, the ob jective evaluation of the sign if-i cance of nodes and links is rea lized through align ing it in order. The re liability index of a commun-cat ion netw ork w ith typ ica l topo logy structure is calcu lated in detail and the ordering resu lt o f the sign if icance o f nodes and links is obta ined from the who le and part of the netw ork respective ly.


[ 1] 陈勇, 胡爱群, 蔡天佑, 等. 通信网中链路重要性的 评价方法[ J]. 电子学报, 2003, 31( 4): 573- 575.
[ 2] 陈勇, 胡爱群, 胡骏, 等. 通信网中最重要节点的确 定方法[ J]. 高技术通讯, 2004, 14( 1): 21- 24.
[ 3] Rao V V B. M ost-v ita l edg e o f a graph w ith respect to spann ing trees[ J] . IEEE Trans Re liability, 1998, 47 ( 1): 6- 7.
[ 4] T sen F P, Sung T Y, L in M Y, e t a.l F ind ing the m ost v ita l edg esw ith respect to the num ber o f spann ing trees[ J]. IEEE Trans Re liability, 1994, 43( 4): 600 - 602.
[ 5] Page L B, Perry J E. Re liability po lynom ials and link im portance in netwo rks[ J]. IEEE Trans Re liability, 1994, 43( 1): 51- 58.
[ 6] N ardelli E, Pro iettiG, W idmayer P. Finding the detour- critica l edge o f a shortest path be tw een two nodes [ J]. Inform ation Processing Letters, 1998, 67 ( 1 ): 51- 54.
[ 7] Na rdelli E, ProiettiG, W idm ayer P. A faster computation o f the m ost v ita l edge of a shortest pa th[ J]. Inform ation Processing Letters, 2001, 79( 2): 81- 85.
[ 8] Traldi L. Reliability po lynom ials and link im portance in networks [ J]. IEEE T rans Reliability, 2000, 49 ( 3) : 322.
[ 9] H su L H, Jan R H, Lee Y C, et a .l F ind ing them ost vita l edg e w ith respect to m inim um spann ing tree in w e ighted g raphs [ J]. In fo rm ation Processing Letters, 1991, 39( 5): 277- 281.
[ 10] 熊庆旭, 刘有恒. 基于网络状态之间关系的网络的 可靠性分析[ J]. 通信学报, 1998, 19( 3) : 55- 61.
[ 11] 刘爱民, 刘有恒. 部件不可靠下的通信网业务性能 分析[ J]. 电子学报, 2002, 30( 10): 1 459- 1 462.
[ 12] Aggarwa lK K. Integ ration o f re liability and capac ity in perform ance o f a te lecommun ica tion ne tw ork [ J ]. IEEE Trans Re liab ility, 1985, 34( 1): 184- 186.
[ 13] T rstensky D, Bow ron P. An a lternative index for the reliability o f te lecommunication netwo rks [ J]. IEEE T rans Re liab ility, 1984, 33( 10): 343- 345.
[ 14] 陈坚, 孙小菡, 张明德. 一种基于最小路径的通信 网络可靠性分析[ J]. 电子器件, 2003, 26 ( 4): 447 - 450.
[ 15] 唐宝民, 王文鼐, 李标庆. 电信网技术基础[M ]. 北 京: 人民邮电出版社, 2001. 315- 317.


Last Update: 2006-12-30