利用往返时延抖动的网络拓扑推断算法  

A Topology Inference Algorithm Using Round Delay Variation

作　　者：赵洪华[1] 陈鸣[1] 

机构地区：[1]解放军理工大学指挥自动化学院,南京210007

出　　处：《西安交通大学学报》2009年第6期28-32,共5页Journal of Xi'an Jiaotong University

基　　金：国家自然科学基金重大研究计划资助项目(90304010);国家高技术研究发展计划资助项目(2007AA01Z418).

摘　　要：为了克服基于端到端单向时延的拓扑推断需要时钟同步及节点间合作的限制,提出了一种利用往返时延抖动的拓扑推断算法.首先定义了四元组列车,其由4个长度相同的ping分组组成,4个ping分组组成2个相邻的紧接分组对,2个紧接分组对的目标地址相同.在空间独立性、时间独立性的条件下,通过四元组列车测量获得的往返时延抖动可以计算节点间的相关性,再根据节点间的相关性便可推断节点间共享链路,从而推断出网络拓扑.理论分析与仿真结果表明,所提算法的收敛速度高于基于端到端单向时延推断拓扑法,并且只需要一个测量节点.In order to reduce the limits of time synchronization and cooperation between nodes in topology inference based on one way delay, a topology inference algorithm based on round delay variation is proposed. A 4-tuple packets train is defined and is composed of 2 packets pairs. Each packets pair is composed of 2 ping packets. The correlations among nodes are then calculated by round delay variation measured with the 4-tuple packets train. Then the links of sharing between nodes and the topology are inferred. The feasibility and correctness of the topology inference based on round delay variation are analyzed theoretically. The algorithm is tested through simulations by NS2. The results show that the convergence of topology inference based on round delay variation is faster than the convergence of topology inference based on one way delay, and the topology inference based on round delay variation needs only one measurement node.

关 键 词：网络 往返时延抖动 拓扑推断 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]