【摘要】：基于簡單網(wǎng)管協(xié)議的拓撲發(fā)現(xiàn)通常需要掃描整個網(wǎng)段,尤其是對于小規(guī)模園區(qū)網(wǎng),網(wǎng)段中會有許多IP地址無回應,大大增加了拓撲發(fā)現(xiàn)時間.為此,提出用層次遍歷的方法由邊緣設備向核心設備逐步搜索以便完成拓撲發(fā)現(xiàn),不需要掃描網(wǎng)絡中的IP地址,僅通過地址轉發(fā)表就能高效快速地獲取整個園區(qū)網(wǎng)的拓撲結構.仿真實驗表明,該方法可在1 min內推斷出包含80個節(jié)點的網(wǎng)絡拓撲關系,通過實際部署進一步驗證了方法的有效性.
[Abstract]:Topology discovery based on simple network management protocol usually needs to scan the whole network segment, especially for small scale campus network, there will be many IP addresses in the network segment without response, which greatly increases the topology discovery time. Therefore, a hierarchical traversal method is proposed to search from edge devices to core devices in order to realize topology discovery. Instead of scanning the IP address in the network, the topology structure of the whole campus network can be obtained efficiently and quickly only by address forwarding table. The simulation results show that the proposed method can infer the network topology with 80 nodes within 1 min, and the effectiveness of the method is further verified by actual deployment.
【作者單位】： 河南牧業(yè)經濟學院自動化與控制系;總參第63所;廣西民族大學信息科學與工程學院;
【基金】：國家自然科學基金(No.61462009) 中國博士后基金(No.2015M582832) 江蘇省博士后科研基金(No.1402138C) 河南省高等學校重點項目基金(No.13B520337) 廣西自然科學基金(No.2014GXNSFAA118358)資助
【分類號】：TP393.02
，

本文編號：2235897