## Hierarchical Inference of Unicast Network Topologies Based on End-to-End Measurements

Citations: | 2 - 0 self |

### BibTeX

@MISC{Shih_hierarchicalinference,

author = {Meng-fu Shih and Alfred O. Hero},

title = {Hierarchical Inference of Unicast Network Topologies Based on End-to-End Measurements},

year = {}

}

### OpenURL

### Abstract

Abstract—In this paper, we address the problem of topology discovery in unicast logical tree networks using end-to-end measurements. Without any cooperation from the internal routers, topology estimation can be formulated as hierarchical clustering of the leaf nodes based on pairwise correlations as similarity metrics. Unlike previous work that first assumes the network topology is a binary tree and then tries to generalize to a nonbinary tree, we provide a framework that directly deals with general logical tree topologies. A hierarchical algorithm to estimate the topology is developed in a recursive manner by finding the best partitions of the leaf nodes level by level. Our simulations show that the algorithm is more robust than binary-tree based methods. Index Terms—Graph-based clustering, mixture models, network tomography, topology estimation. I.