【摘要】：完整準(zhǔn)確的網(wǎng)絡(luò)拓?fù)涫蔷W(wǎng)絡(luò)管理的基礎(chǔ),鏈路層拓?fù)渥鳛槿W(wǎng)拓?fù)涞闹匾M成部分,由于鏈路層設(shè)備的多樣性、透明性以及多子網(wǎng)結(jié)構(gòu)的復(fù)雜性,使得鏈路層拓?fù)渥詣?dòng)發(fā)現(xiàn)算法成為全網(wǎng)拓?fù)浒l(fā)現(xiàn)研究的重點(diǎn)和難點(diǎn)。本文擬通過(guò)對(duì)當(dāng)前主流算法和典型拓?fù)涞姆治?提出一種改進(jìn)的鏈路層拓?fù)浒l(fā)現(xiàn)算法。 本文首先分析了基于私有協(xié)議、基于生成樹(shù)協(xié)議、基于探測(cè)包和基于地址轉(zhuǎn)發(fā)表的四類鏈路層拓?fù)浒l(fā)現(xiàn)方法,發(fā)現(xiàn)基于地址轉(zhuǎn)發(fā)表的算法具有更好的普適性。經(jīng)理論分析和實(shí)際環(huán)境驗(yàn)證,在大規(guī)模交換網(wǎng)絡(luò)中獲得下行鏈路完整地址轉(zhuǎn)發(fā)表與獲得完整(上下行鏈路完整)地址轉(zhuǎn)發(fā)表相比,可行性更高。因此,本研究在下行鏈路地址轉(zhuǎn)發(fā)表完整這一前提下,對(duì)Yigal Bejerano的算法進(jìn)行改進(jìn),提出一種基于最短路徑的鏈路層拓?fù)浒l(fā)現(xiàn)算法。算法先利用該轉(zhuǎn)發(fā)表針對(duì)每個(gè)子網(wǎng)構(gòu)建交換設(shè)備間的最短路徑,再通過(guò)分析總結(jié)出的四項(xiàng)端口鄰接判定規(guī)則優(yōu)化最短路徑,使每條最短路徑形成單一端口組成的序列,從而計(jì)算出網(wǎng)絡(luò)拓?fù)�。與當(dāng)前主要文獻(xiàn)提出的算法相比,該算法能較好的適用于多子網(wǎng)復(fù)雜拓?fù)洵h(huán)境,在一定程度上降低了算法復(fù)雜度。本算法采用VC++語(yǔ)言基于SNMP協(xié)議實(shí)現(xiàn),并在某大學(xué)校園網(wǎng)中進(jìn)行測(cè)試,能準(zhǔn)確地發(fā)現(xiàn)多子網(wǎng)鏈路層網(wǎng)絡(luò)拓?fù)洹?經(jīng)理論和實(shí)際環(huán)境驗(yàn)證,證明本研究提出的基于下行鏈路完整地址轉(zhuǎn)發(fā)表構(gòu)建最短路徑的鏈路層拓?fù)浒l(fā)現(xiàn)算法可以較好地發(fā)現(xiàn)復(fù)雜多子網(wǎng)的鏈路層拓?fù)浣Y(jié)構(gòu),具有較強(qiáng)的實(shí)踐意義和推廣價(jià)值。
[Abstract]:Complete and accurate network topology is the basis of network management. Link layer topology, as an important part of the whole network topology, because of the diversity and transparency of link layer equipment and the complexity of multi-subnet structure, the automatic discovery algorithm of link layer topology has become the focus and difficulty of the whole network topology discovery research. In this paper, an improved link layer topology discovery algorithm is proposed by analyzing the current mainstream algorithms and typical topologies. In this paper, four kinds of link layer topology discovery methods based on private protocol, spanning tree protocol, detection packet and address forwarding table are analyzed, and it is found that the algorithm based on address forwarding table has better universality. Through theoretical analysis and practical environment verification, it is more feasible to obtain the complete downlink address forwarding table in the large-scale switching network than to obtain the complete (downlink complete) address forwarding table. Therefore, on the premise of complete downlink address forwarding table, this paper improves the Yigal Bejerano algorithm and proposes a link layer topology discovery algorithm based on the shortest path. The algorithm first uses the forwarding table to construct the shortest path between switching devices for each subnet, and then optimizes the shortest path through the analysis and summary of the four port adjoining decision rules, so that each shortest path forms a sequence composed of a single port, and then the network topology is calculated. Compared with the algorithms proposed in the current literature, this algorithm is better suitable for multi-subnet complex topology environment and reduces the complexity of the algorithm to a certain extent. The algorithm is implemented by VC language based on SNMP protocol and tested in the campus network of a university, which can accurately find the network topology of multi-subnet link layer. Through the verification of theory and practical environment, it is proved that the link layer topology discovery algorithm based on downlink complete address forwarding table can find the link layer topology of complex multi-subnet well, which has strong practical significance and popularization value.
【學(xué)位授予單位】：西北大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.02

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 黃基前;理解SNMP、SNMP++及用VC++6.0實(shí)現(xiàn)WindowsSNMP編程[J];光通信技術(shù);2001年03期

2 鄭海,張國(guó)清;物理網(wǎng)絡(luò)拓?fù)浒l(fā)現(xiàn)算法的研究[J];計(jì)算機(jī)研究與發(fā)展;2002年03期

3 石玫;李祥和;;基于STP的物理拓?fù)浒l(fā)現(xiàn)算法研究[J];計(jì)算機(jī)工程與應(yīng)用;2007年09期

4 李學(xué)鋒;楊健強(qiáng);;IP子網(wǎng)物理拓?fù)浣Y(jié)構(gòu)發(fā)現(xiàn)研究[J];計(jì)算機(jī)工程與應(yīng)用;2009年01期

5 李濤;石志強(qiáng);吳志美;;橋接局域網(wǎng)第2層拓?fù)浣Y(jié)構(gòu)的自動(dòng)發(fā)現(xiàn)[J];計(jì)算機(jī)科學(xué);2003年12期

6 張占國(guó);劉淑芬;包鐵;張欣佳;王曉燕;張嬋;;基于STP協(xié)議的物理網(wǎng)絡(luò)拓?fù)浒l(fā)現(xiàn)算法[J];計(jì)算機(jī)工程;2008年06期

7 楊漢祥,楊潤(rùn)華;HP SNMP++ SNMP管理站開(kāi)發(fā)包的分析[J];計(jì)算機(jī)與現(xiàn)代化;2002年02期

8 馬曉波;楊國(guó)林;;通用的異構(gòu)多子網(wǎng)物理拓?fù)浒l(fā)現(xiàn)簡(jiǎn)單算法[J];計(jì)算機(jī)應(yīng)用與軟件;2013年05期

9 孫延濤;吳志美;石志強(qiáng);;基于地址轉(zhuǎn)發(fā)表的交換式以太網(wǎng)拓?fù)浒l(fā)現(xiàn)方法[J];軟件學(xué)報(bào);2006年12期

10 張國(guó)強(qiáng);張國(guó)清;李仰耀;;物理網(wǎng)絡(luò)拓?fù)浒l(fā)現(xiàn)算法的研究和系統(tǒng)實(shí)現(xiàn)[J];小型微型計(jì)算機(jī)系統(tǒng);2006年01期

，

本文編號(hào)：2510782