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

通信网中链路重要性的评价方法
引用本文:陈勇,胡爱群,蔡天佑,钟子果. 通信网中链路重要性的评价方法[J]. 电子学报, 2003, 31(4): 573-575
作者姓名:陈勇  胡爱群  蔡天佑  钟子果
作者单位:东南大学无线电工程系,江苏南京 210096
基金项目:教育部优秀青年教师资助计划项目
摘    要:本文提出了一种通信网链路重要性的评价方法,该方法可以评价全网范围内的链路重要性.最重要的链路是将其进行边收缩操作后,得到的图的生成树数目最多.通过比较生成树的数目,我们可以判断通信网中任意两条链路的相对重要性.基于生成树数目的边收缩方法反映了某条链路处于正常工作时,对整个通信网的贡献大小.实验结果和理论分析均证明了该方法的有效性和可行性.

关 键 词:通信网  生成树数目  边删除  边收缩  
文章编号:0372-2112(2003)04-0573-03
收稿时间:2002-08-21

Evaluation Method for Link Importance in Communication Networks
CHEN Yong,HU Ai-qun,CAI Tian-you,ZHONG Zi-guo. Evaluation Method for Link Importance in Communication Networks[J]. Acta Electronica Sinica, 2003, 31(4): 573-575
Authors:CHEN Yong  HU Ai-qun  CAI Tian-you  ZHONG Zi-guo
Affiliation:Department of Radio Engineering,Southeast University,Nanjing,Jiangsu 210096,China
Abstract:An algorithm to determine the most vital edges of a communication network is presented in this paper.Since a spanning tree consisting of non-failed edges must exist in order for a success state to occur in the all-terminal problem,the number of such spanning trees is a measure of reliability.For a given edge e in the graph G,G*e is the graph with the edge contracted,where the edge denotes a link and the vertex denotes a node respectively.The relative importance of the two edges in the graph can be compared by computing the number of spanning trees of G*e for each of the two edges.The most vital edge in G is an edge whose contraction maximizes the number of spanning trees and whose proper functioning contributes most to system reliability.Experimental results and theoretical analysis show that the edge-contraction algorithm is effective and feasible.
Keywords:communication networks  number of spanning trees  edge-deletion  edge-contraction
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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