Internet路由級拓撲發(fā)現(xiàn)系統(tǒng)設計與實現(xiàn)
發(fā)布時間：2018-08-16 10:58
【摘要】：近幾十年來,6Internet得到了迅速普及,對其進行有效的管理變的越來越重要。網(wǎng)絡拓撲發(fā)現(xiàn)技術是網(wǎng)絡管理的基礎,如何準確的、完整的發(fā)現(xiàn)網(wǎng)絡拓撲結構,對于網(wǎng)絡管理是十分重要的。同時,如何為網(wǎng)絡管理員提供一個直觀的拓撲圖也是本文的研究重點。本文通過分析DoubleTree拓撲發(fā)現(xiàn)方法和FR算法(Fruchterman Reingold Algorithm)的優(yōu)缺點,提出一種針對Internet路由級拓撲的發(fā)現(xiàn)方法-IpDT算法(Improved DoubleTree Algorithm)和一種網(wǎng)絡拓撲布局算法-DHL算法(Degree Hierarchical Layout Algorithm).并以此為基礎,設計實現(xiàn)了一個網(wǎng)絡拓撲發(fā)現(xiàn)及可視化原型系統(tǒng),主要工作為： (1)歸納了Internet路由級拓撲發(fā)現(xiàn)和可視化布局的特點和難點,對比分析了目前常用的網(wǎng)絡拓撲發(fā)現(xiàn)與布局算法的優(yōu)缺點。 (2)在對Internet路由級拓撲發(fā)現(xiàn)過程中,針對DoubleTree算法難以選擇初始跳數(shù),以及探測節(jié)點之間共享全局停止集時通信量較高等問題,提出了IpDT算法。設計出合理的探測規(guī)則,計算平均跳數(shù)作為其初始跳數(shù),并用Bloom fliter對全局停止集進行壓縮。仿真結果表明,IpDT算法能有效的降低探測冗余和探測節(jié)點間的通信量,,達到減小網(wǎng)絡負載的目的。 (3)針對Internet路由級拓撲的可視化布局,FR算法存在執(zhí)行時間長和布局效果層次性不佳等問題,提出了DHL算法。首先,根據(jù)路由級拓撲中節(jié)點度分布的冪律性質將節(jié)點分為三類；接著對分類后的節(jié)點進行分層顯示；最后根據(jù)層次的不同選取合理的初始溫度和迭代次數(shù)。實驗結果表明,DHL算法能有效降低算法的時間復雜度和邊的交叉數(shù)。 (4)設計實現(xiàn)了一個網(wǎng)絡拓撲發(fā)現(xiàn)及可視化原型系統(tǒng),該系統(tǒng)包括三個模塊：拓撲發(fā)現(xiàn)模塊、數(shù)據(jù)轉換及讀取模塊和拓撲顯示模塊。拓撲發(fā)現(xiàn)模塊是整個系統(tǒng)的基礎,主要用于探測目標網(wǎng)絡,獲取網(wǎng)絡的拓撲信息,拓撲發(fā)現(xiàn)方法采用本文第三章提出的IpDT算法；數(shù)據(jù)轉換及讀取模塊的主要功能是處理拓撲發(fā)現(xiàn)模塊得到的拓撲信息；拓撲顯示模塊的主要功能是采用拓撲布局算法以圖形的方式顯示網(wǎng)絡的拓撲,拓撲布局所用技術是本文第四章提出的DHL算法。最后對系統(tǒng)進行測試,驗證該系統(tǒng)的有效性。
[Abstract]:In recent decades, the Internet has been popularized rapidly, and it becomes more and more important to manage it effectively. Network topology discovery technology is the basis of network management. How to accurately and completely discover network topology is very important for network management. At the same time, how to provide an intuitive topology for network administrators is also the focus of this paper. By analyzing the advantages and disadvantages of DoubleTree topology discovery method and FR algorithm (Fruchterman Reingold Algorithm), this paper proposes a Internet routing level topology discovery algorithm (Improved DoubleTree Algorithm) and a network topology layout algorithm (Degree Hierarchical Layout Algorithm). Algorithm (Degree Hierarchical Layout Algorithm). Based on this, a network topology discovery and visualization prototype system is designed and implemented. The main work is as follows: (1) the characteristics and difficulties of Internet routing level topology discovery and visualization layout are summarized. The advantages and disadvantages of current network topology discovery and layout algorithms are compared and analyzed. (2) in the process of Internet routing level topology discovery, it is difficult for DoubleTree algorithm to select initial hops. The IpDT algorithm is proposed to detect the problem of high traffic when the global stop set is shared between the nodes. A reasonable detection rule is designed and the average number of hops is calculated as the initial number of hops. The global stop set is compressed by Bloom fliter. The simulation results show that the IpDT algorithm can effectively reduce the detection redundancy and the communication traffic between the detection nodes, and achieve the purpose of reducing the network load. (3) the execution time of the visual layout FR algorithm for Internet routing topology is reduced. Problems such as length and poor layouts, DHL algorithm is proposed. Firstly, the nodes are divided into three categories according to the power law property of node degree distribution in routing topology; then the nodes are displayed in layers; finally, the reasonable initial temperature and iteration times are selected according to the different levels. Experimental results show that the DHL algorithm can effectively reduce the time complexity of the algorithm and the cross number of edges. (4) A network topology discovery and visualization prototype system is designed and implemented. The system consists of three modules: topology discovery module. Data conversion and read module and topology display module. Topology discovery module is the foundation of the whole system. It is mainly used to detect the target network and obtain the topology information of the network. The topology discovery method adopts the IpDT algorithm proposed in the third chapter of this paper. The main function of the data conversion and reading module is to process the topology information obtained by the topology discovery module, and the main function of the topology display module is to display the topology of the network graphically by using the topology layout algorithm. The topology layout is based on the DHL algorithm proposed in Chapter 4 of this paper. Finally, the system is tested to verify the effectiveness of the system.
【學位授予單位】：南京郵電大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.07
[Abstract]:In recent decades, the Internet has been popularized rapidly, and it becomes more and more important to manage it effectively. Network topology discovery technology is the basis of network management. How to accurately and completely discover network topology is very important for network management. At the same time, how to provide an intuitive topology for network administrators is also the focus of this paper. By analyzing the advantages and disadvantages of DoubleTree topology discovery method and FR algorithm (Fruchterman Reingold Algorithm), this paper proposes a Internet routing level topology discovery algorithm (Improved DoubleTree Algorithm) and a network topology layout algorithm (Degree Hierarchical Layout Algorithm). Algorithm (Degree Hierarchical Layout Algorithm). Based on this, a network topology discovery and visualization prototype system is designed and implemented. The main work is as follows: (1) the characteristics and difficulties of Internet routing level topology discovery and visualization layout are summarized. The advantages and disadvantages of current network topology discovery and layout algorithms are compared and analyzed. (2) in the process of Internet routing level topology discovery, it is difficult for DoubleTree algorithm to select initial hops. The IpDT algorithm is proposed to detect the problem of high traffic when the global stop set is shared between the nodes. A reasonable detection rule is designed and the average number of hops is calculated as the initial number of hops. The global stop set is compressed by Bloom fliter. The simulation results show that the IpDT algorithm can effectively reduce the detection redundancy and the communication traffic between the detection nodes, and achieve the purpose of reducing the network load. (3) the execution time of the visual layout FR algorithm for Internet routing topology is reduced. Problems such as length and poor layouts, DHL algorithm is proposed. Firstly, the nodes are divided into three categories according to the power law property of node degree distribution in routing topology; then the nodes are displayed in layers; finally, the reasonable initial temperature and iteration times are selected according to the different levels. Experimental results show that the DHL algorithm can effectively reduce the time complexity of the algorithm and the cross number of edges. (4) A network topology discovery and visualization prototype system is designed and implemented. The system consists of three modules: topology discovery module. Data conversion and read module and topology display module. Topology discovery module is the foundation of the whole system. It is mainly used to detect the target network and obtain the topology information of the network. The topology discovery method adopts the IpDT algorithm proposed in the third chapter of this paper. The main function of the data conversion and reading module is to process the topology information obtained by the topology discovery module, and the main function of the topology display module is to display the topology of the network graphically by using the topology layout algorithm. The topology layout is based on the DHL algorithm proposed in Chapter 4 of this paper. Finally, the system is tested to verify the effectiveness of the system.
【學位授予單位】：南京郵電大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.07
【參考文獻】
相關期刊論文 前10條
1 謝紅漫,錢德沛,欒鐘治,陳衡;基于分層的網(wǎng)絡拓撲結構可視化方法研究[J];北京航空航天大學學報;2004年06期
2 趙天福;周丹平;;基于OSPF協(xié)議的網(wǎng)絡拓撲發(fā)現(xiàn)技術的實現(xiàn)[J];江南大學學報(自然科學版);2008年02期
3 尤瀾濤;朱巧明;李培峰;;基于OSPF的網(wǎng)絡拓撲快速發(fā)現(xiàn)系統(tǒng)的設計[J];計算機工程;2006年24期
4 王慧;羅軍勇;寇曉蕤;;基于OSPF協(xié)議報文的網(wǎng)絡拓撲分析算法[J];計算機工程;2008年06期
5 吳鵬;李思昆;;適于社會網(wǎng)絡結構分析與可視化的布局算法[J];軟件學報;2011年10期
6 姜譽,胡銘曾,方濱興,張宏莉;一個Internet路由器級拓撲自動發(fā)現(xiàn)系統(tǒng)[J];通信學報;2002年12期
7 王若f，
本文編號：2185784
本文鏈接：http://sikaile.net/guanlilunwen/ydhl/2185784.html
最近更新
教材專著
