论文部分内容阅读
为满足IPv6网络的拓扑发现需求,提出了一种基于滑动地址序列的IPv6网络拓扑发现算法。算法根据并发进行的分布式探针数量,将待探测的目标地址集等分为若干子集,在每个周期内每个探针只按序针对其中的一个子集进行探测,同时探针之间互相通告各自探测的结果;此后每个探针按序对下一个子集进行探测,如果发现过程抵达前面的探测周期中其他探针已经发现的共同路径时,则停止继续向前探测。基于本算法实现的系统对一个真实的纯IPv6主干网环境进行了全面发现实验。实验结果表明,该引擎减少了约35%的IPv6探测报文,达到设计目的。
In order to meet the requirement of IPv6 network topology discovery, an IPv6 network topology discovery algorithm based on sliding address sequence is proposed. The algorithm divides the target address set to be probed into several sub-sets according to the number of distributed probes that are concurrently executed. In each cycle, each probe is only probed for one of the sub-sets in sequence. At the same time, After that, each probe probes the next subset in sequence, and if it is found that the process arrives at the common path that other probes have found in the previous detection cycle, then it will stop to probe forward. The system based on this algorithm performs a comprehensive discovery experiment on a real pure IPv6 backbone network. Experimental results show that the engine reduces IPv6 probing messages by about 35% to achieve the design goals.