检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘红军[1] 胡晓峰[1] 邓文平[1] 卢锡城[1]
机构地区:[1]国防科学技术大学计算机学院,湖南长沙410073
出 处:《软件学报》2012年第9期2388-2400,共13页Journal of Software
基 金:国家自然科学基金(61103189;61070199);长江学者和创新团队发展计划(IRT1012);湖南省自然科学基金(11JJ7003)
摘 要:准确评估节点的重要性,是增强网络生存性的基础.由于域间路由系统路由策略的复杂性,已有的面向静态拓扑的节点重要性评估方法不能真实反映各个自治系统(autonomous systems,简称AS)在路由中的重要性.首次从动态路由的角度基于AS之间的最优路径从路由上评估各个AS的重要性,经过AS的最优路径数量越多,它就越重要.提出了基于首选路由的AS重要性评估方法,其时间复杂性为O(l nm),它与面向静态拓扑的评估方法中最好的时间复杂性相同,并且能够更准确地描述节点的实际重要性.通过真实路由数据进行实验,与两种典型的面向静态拓扑的基于顶点度、强度中心性的评估方法对比,其结果表明,基于首选路由的评估方法可以有效发现AS网络中连接较少但很重要的节点,并且评估的重要性与实际的重要性更吻合.Evaluating the importance of node is valuable for improving the network survivability. Due to the complexity of inter-domain policy, the existing evaluating methods which are based on static topology can not reflect the real importance of the autonomous systems (ASes) in routing. This paper is the first study to evaluate the AS importance through the best paths between the ASes from the view of dynamic routing. The more the best paths passing through an AS, the more important it is. An evaluation method based on preferred route is proposed, the complexity of which is O(lxnm) and the evaluated importance is more accurate. The time complexity is the same as the best complexity of the evaluating methods based on static topology. To verify the validity, the preferred route method is compared with two representative methods based on static topology under real routing data, which are degree method and stress centrality method respectively. The result shows that the preferred route method can discover the nodes of importance but small connections efficiently. Moreover, the evaluated importance is closer to the real AS importance than the other two methods.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222