Network delay inference from additive metrics

We use computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multicast-based delay inference, that is, the problem of reconstructing delay characteristics of a network from end-to-end delay measurements on network paths. Our inference algorithm is based on additive metric techniques used in phylogenetics. It runs in polynomial time and requires a sample of size only poly(log n). We also show how to recover the topology of the routing tree. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010

[1]  M. Steel.  Recovering a tree from the leaf colourations it generates under a Markov model , 1994 .

[2]  N. Saitou,et al.  The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.

[3]  R. Durrett.  Probability: Theory and Examples , 1993 .

[4]  Jian Ni,et al.  A Markov Random Field Approach to Multicast-Based Network Inference Problems , 2006, 2006 IEEE International Symposium on Information Theory.

[5]  Elchanan Mossel.  Distorted Metrics on Trees and Phylogenetic Forests , 2007, TCBB.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  J. Farris.  A Probability Model for Inferring Evolutionary Trees , 1973 .

[8]  P. Erdös,et al.  A few logs suffice to build (almost) all trees (l): part I , 1997 .

[9]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[10]  M. Ledoux.  The concentration of measure phenomenon , 2001 .

[11]  Ronitt Rubinfeld,et al.  On the learnability of discrete distributions , 1994, STOC '94.

[12]  Joseph T. Chang,et al.  A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences. , 2006, Mathematical biosciences.

[13]  Jian Ni,et al.  Network tomography based on additive metrics , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[14]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[15]  Bing Yu,et al.  Time-Varying Network Tomography: Router Link Data , 2000 .

[16]  Y. Vardi,et al.  Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data , 1996 .

[17]  Donald F. Towsley,et al.  Multicast-based inference of network-internal delay distributions , 2002, TNET.

[18]  Donald F. Towsley,et al.  Multicast-based inference of network-internal loss characteristics , 1999, IEEE Trans. Inf. Theory.

[19]  Elchanan Mossel,et al.  Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep , 2008, SIAM J. Discret. Math..

[20]  Peter H. A. Sneath,et al.  Numerical Taxonomy: The Principles and Practice of Numerical Classification , 1973 .

[21]  Joseph T. Chang,et al.  Full reconstruction of Markov models on evolutionary trees: identifiability and consistency. , 1996, Mathematical biosciences.

[22]  P. Buneman.  The Recovery of Trees from Measures of Dissimilarity , 1971 .

[23]  Li Zhang,et al.  On the complexity of distance-based evolutionary tree reconstruction , 2003, SODA '03.

[24]  Kevin Atteson,et al.  The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction , 1999, Algorithmica.

[25]  Robert Nowak,et al.  Network Tomography: Recent Developments , 2004 .

[26]  Paul W. Goldberg,et al.  Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model , 2001, SIAM J. Comput..

[27]  Jian Ni,et al.  Network Routing Topology Inference from End-to-End Measurements , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.