A Topology Discovery Method Based on the Improved DoubleTree Algorithm

QIAO Hong,ZHANG Da fang,ZENG Bin,LI Ming wei,HAN Jian

doi:10.3969/j.issn.1007130X.2010.

Computer Engineering & Science >

2010 , Vol. 32 >Issue 4: 18 - 21

DOI: https://doi.org/10.3969/j.issn.1007130X.2010.

论文

A Topology Discovery Method Based on the Improved DoubleTree Algorithm

Expand

(1.School of Software,Hunan University,Changsha 410082；2.School of Computer and Communications,Hunan University,Changsha 410082,China）

Received date: 2009-01-07

Revised date: 2009-04-12

Online published: 2010-03-28

Fold

Abstract

The DoubleTree algorithm is one of the important IP level topology discovery methods. It can reduce probe redundancy dramatically; however, it also brings about a great deal of network traffic, promoting the network burden. In this paper, a DoubleTree++ algorithm based on DoubleTree, is designed and implemented via improving the storage structure of the global stop set.The experiment shows that DoubleTree++ can reduce 50% probe redundancy and decrease the network traffic among probe sources, while covering 95% network nodes and links.

Key words： network topology;probe redundancy;DoubleTree;communication traffic

Cite this article

QIAO Hong,ZHANG Da fang,ZENG Bin,LI Ming wei,HAN Jian . A Topology Discovery Method Based on the Improved DoubleTree Algorithm[J]. Computer Engineering & Science, 2010 , 32(4) : 18 -21 . DOI: 10.3969/j.issn.1007130X.2010.

Options

Outlines

模态框（Modal）标题

Abstract

Cite this article