【摘要】：基于簡(jiǎn)單網(wǎng)管協(xié)議的拓?fù)浒l(fā)現(xiàn)通常需要掃描整個(gè)網(wǎng)段,尤其是對(duì)于小規(guī)模園區(qū)網(wǎng),網(wǎng)段中會(huì)有許多IP地址無(wú)回應(yīng),大大增加了拓?fù)浒l(fā)現(xiàn)時(shí)間.為此,提出用層次遍歷的方法由邊緣設(shè)備向核心設(shè)備逐步搜索以便完成拓?fù)浒l(fā)現(xiàn),不需要掃描網(wǎng)絡(luò)中的IP地址,僅通過(guò)地址轉(zhuǎn)發(fā)表就能高效快速地獲取整個(gè)園區(qū)網(wǎng)的拓?fù)浣Y(jié)構(gòu).仿真實(shí)驗(yàn)表明,該方法可在1 min內(nèi)推斷出包含80個(gè)節(jié)點(diǎn)的網(wǎng)絡(luò)拓?fù)潢P(guān)系,通過(guò)實(shí)際部署進(jìn)一步驗(yàn)證了方法的有效性.
[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è)經(jīng)濟(jì)學(xué)院自動(dòng)化與控制系;總參第63所;廣西民族大學(xué)信息科學(xué)與工程學(xué)院;
【基金】：國(guó)家自然科學(xué)基金(No.61462009) 中國(guó)博士后基金(No.2015M582832) 江蘇省博士后科研基金(No.1402138C) 河南省高等學(xué)校重點(diǎn)項(xiàng)目基金(No.13B520337) 廣西自然科學(xué)基金(No.2014GXNSFAA118358)資助
【分類(lèi)號(hào)】：TP393.02
，

本文編號(hào)：2235897