动态拓扑推测的改进算法  

Algorithm for the inference of a dynamic topology

作　　者：苏海波[1] 李勇[1] 金德鹏[1] 曾烈光[1] 

机构地区：[1]清华大学电子工程系,微波与数字通信国家重点实验室,北京100084

出　　处：《清华大学学报（自然科学版）》2011年第6期739-744,共6页Journal of Tsinghua University(Science and Technology)

基　　金：国家“九七三”重点基础研究项目(2007CB310701);国家“八六三”高技术项目(2008AA01A331,2008AA01Z107);

摘　　要：为了在网络中有节点动态加入时推测更新的网络拓扑结构,提出了一种改进的逐步拓扑推测算法I-STIA。该算法首先计算新加入节点与网络中所有探测包接收节点之间的相关度,然后采用一个自适应的动态门限搜索加入节点在拓扑中的正确位置,并利用节点的TTL跳数信息减少搜索的步数。应用该算法可以有效地推测出更新的网络拓扑结构,并提高推测结果的准确度。仿真结果表明:I-STIA相比已有的算法更有效,在同等探测包数目情况下,推测结果的准确度更高。An improved sequential topology inference algorithm was developed to infer an updated network topology for a changed node set.The algorithm first computes the relevancy between the joined node and the receiver nodes with an adaptive threshold used to search for the correct position of the joined node.In the algorithm incorporates the hop count information to reduce the number of search steps.This algorithm can effectively infer the updated network topology and improve the inference accuracy.Simulations show that this algorithm is more effective and more accurate than existing algorithms with the same probes.

关 键 词：网络层析 网络拓扑 拓扑推测 

分 类 号：TP393.0[自动化与计算机技术—计算机应用技术]