当前位置:主页 > 管理论文 > 移动网络论文 >

Internet路由级拓扑发现系统设计与实现

发布时间:2018-08-16 10:58
【摘要】:近几十年来,6Internet得到了迅速普及,对其进行有效的管理变的越来越重要。网络拓扑发现技术是网络管理的基础,如何准确的、完整的发现网络拓扑结构,对于网络管理是十分重要的。同时,如何为网络管理员提供一个直观的拓扑图也是本文的研究重点。本文通过分析DoubleTree拓扑发现方法和FR算法(Fruchterman Reingold Algorithm)的优缺点,提出一种针对Internet路由级拓扑的发现方法-IpDT算法(Improved DoubleTree Algorithm)和一种网络拓扑布局算法-DHL算法(Degree Hierarchical Layout Algorithm).并以此为基础,设计实现了一个网络拓扑发现及可视化原型系统,主要工作为: (1)归纳了Internet路由级拓扑发现和可视化布局的特点和难点,对比分析了目前常用的网络拓扑发现与布局算法的优缺点。 (2)在对Internet路由级拓扑发现过程中,针对DoubleTree算法难以选择初始跳数,以及探测节点之间共享全局停止集时通信量较高等问题,提出了IpDT算法。设计出合理的探测规则,计算平均跳数作为其初始跳数,并用Bloom fliter对全局停止集进行压缩。仿真结果表明,IpDT算法能有效的降低探测冗余和探测节点间的通信量,,达到减小网络负载的目的。 (3)针对Internet路由级拓扑的可视化布局,FR算法存在执行时间长和布局效果层次性不佳等问题,提出了DHL算法。首先,根据路由级拓扑中节点度分布的幂律性质将节点分为三类;接着对分类后的节点进行分层显示;最后根据层次的不同选取合理的初始温度和迭代次数。实验结果表明,DHL算法能有效降低算法的时间复杂度和边的交叉数。 (4)设计实现了一个网络拓扑发现及可视化原型系统,该系统包括三个模块:拓扑发现模块、数据转换及读取模块和拓扑显示模块。拓扑发现模块是整个系统的基础,主要用于探测目标网络,获取网络的拓扑信息,拓扑发现方法采用本文第三章提出的IpDT算法;数据转换及读取模块的主要功能是处理拓扑发现模块得到的拓扑信息;拓扑显示模块的主要功能是采用拓扑布局算法以图形的方式显示网络的拓扑,拓扑布局所用技术是本文第四章提出的DHL算法。最后对系统进行测试,验证该系统的有效性。
[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 谢红漫,钱德沛,栾钟治,陈衡;基于分层的网络拓扑结构可视化方法研究[J];北京航空航天大学学报;2004年06期

2 赵天福;周丹平;;基于OSPF协议的网络拓扑发现技术的实现[J];江南大学学报(自然科学版);2008年02期

3 尤澜涛;朱巧明;李培峰;;基于OSPF的网络拓扑快速发现系统的设计[J];计算机工程;2006年24期

4 王慧;罗军勇;寇晓蕤;;基于OSPF协议报文的网络拓扑分析算法[J];计算机工程;2008年06期

5 吴鹏;李思昆;;适于社会网络结构分析与可视化的布局算法[J];软件学报;2011年10期

6 姜誉,胡铭曾,方滨兴,张宏莉;一个Internet路由器级拓扑自动发现系统[J];通信学报;2002年12期

7 王若f,

本文编号:2185784


资料下载
论文发表

本文链接:https://www.wllwen.com/guanlilunwen/ydhl/2185784.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户8a9b3***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com