为了在网络中有节点动态加入时推测更新的网络拓扑结构,提出了一种改进的逐步拓扑推测算法I-STIA。该算法首先计算新加入节点与网络中所有探测包接收节点之间的相关度,然后采用一个自适应的动态门限搜索加入节点在拓扑中的正确位置,并利用节点的TTL跳数信息减少搜索的步数。应用该算法可以有效地推测出更新的网络拓扑结构,并提高推测结果的准确度。仿真结果表明:I-STIA相比已有的算法更有效,在同等探测包数目情况下,推测结果的准确度更高。 In order to infer the updated network topology when nodes join dynamically in the network, an improved iterative topology estimation algorithm I-STIA is proposed. The algorithm first calculates the correlation between the newly added nodes and all the probe packets in the network, and then uses an adaptive dynamic threshold search to join the nodes in the correct topology, and uses the TTL hop information of the nodes to reduce the search Step count. The algorithm can effectively predict the updated network topology and improve the accuracy of the inference results. The simulation results show that I-STIA is more effective than the existing algorithms and the accuracy of the result is higher under the same number of detection packets.