Network delay inference from additive metrics

Random Structures and Algorithms

Volumn 37, Issue 2, 2010, Pages 176-203

  Bhamidi, Shankar ^a   Rajagopal, Ram ^b   Roch, Sébastien ^c  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Multicast routing; Network tomography; Tree metrics

Indexed keywords

EID: 77954782059     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20305     Document Type: Article

References (27)

1. K. Atteson, The performance of neighbor-joining methods of phylogenetic reconstruction, Algorithmica 25 (1999), 251-278 MR MR1703580 (2000k:92013).
2. S. Bhamidi, R. Rajagopal,and S. Roch, Network delay inference from additive metrics,Preprint. Available at Arxiv: math.PR/0604367 (2006).
3. P. Buneman, The recovery of trees from measures of dissimilarity, Mathematics in the Archaelogical and Historical Sciences, Edinburgh University Press, Edinburgh, 1971, pp. 187-395.
4. R. Cáceres, N. G. Duffield, J. Horowitz, and D. F. Towsley, Multicast-based inference of network-internal loss characteristics, IEEE Trans Inform Theory 45 (1999), 2462-2480 MR MR1725131.
5. J. Cao, D. Davis, S. Vander Wiel, and B. Yu, Time-varying network tomography: Router link data, J Am Stat Assoc 95 (2000), 1063-1075,MR MR1821715.
6. R. Castro, M. Coates, G. Liang, R. Nowak, and B. Yu, Network tomography: Recent developments, Stat Sci 19 (2004), 499-517 MR MR2185628.
7. J. T. Chang, Full reconstruction of Markov models on evolutionary trees: Identifiability and consistency, Math Biosci 137 (1996), 51-73,MR MR1410044 (97k:92011).
8. C. Daskalakis, E. Mossel, and S. Roch, Phylogenies without branch bounds: Contracting the short, pruning the deep, In S. Batzoglou (Editor), Research in Computational Molecular Biology, 13th Annual International Conference, RECOMB 2009, Tucson, AZ, 2009, Proceedings. Lecture Notes in Computer Science, 5541, Springer, Berlin, 2009, pp. 451-465.
9. P. L. Erdos, M. A. Steel, L. A. Székely, and T. J. Warnow, A few logs suffice to build (almost) all trees, Random Struct Algorithms 14 (1999), 153-184,MR MR1667319 (2000b:92003).
10. J. S. Farris, A probability model for inferring evolutionary trees, Syst Zool 22 (1973), 250-256.
11. J. Felsenstein, Inferring Phylogenies, Sinauer New York, New York, 2004.
12. V. King, L. Zhang, and Y. Zhou, On the complexity of distance-based evolutionary tree reconstruction, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003), 2003, pp. 444-453,MR MR1974948.
13. M. R. Lacey and J. T. Chang, A signal-to-noise analysis of phylogeny estimation by neighborjoining: Insufficiency of polynomial length sequences, Math Biosci 199 (2006), 188-215.,MR MR2211625 (2007a:92048).
14. M. Ledoux, The concentration of measure phenomenon, Mathematical Surveys and Monographs, Vol. 89, American Mathematical Society, Providence, RI, 2001 MR MR1849347 (2003k:28019).
15. G. Liang, E. Mossel, and B. Yu, Network topology inference through end-to-end measurements (2007).
16. E. Mossel, Distorted metrics on trees and phylogenetic forests, IEEE/ACM Trans Comput Bio Bioinform 4 (2007), 108-116.
17. E. Mossel and S. Roch, Learning nonsingular phylogenies and hidden Markov models, Ann Appl Probab 16 (2006), 583-614 MR MR2244426.
18. R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press, Cambridge, 1995 MR MR1344451 (96i:65003).
19. J. Ni and S. Tatikonda, A Markov random field approach to multicast-based network inference problems, Proceedings of the IEEE International Symposium on Information Theory, Seattle, WA, 2006, pp. 2769-2773.
20. J. Ni and S. Tatikonda, Explicit link parameter estimators based on end-to-end measurements, Forty-Fifth Annual Allerton Conference, Monticello, IL, 2007.
21. J. Ni and S. Tatikonda, Network tomography based on additive metrics, Proceedings of the 42nd Annual Conference on Information Sciences and Systems, Seattle, WA, 2008, pp. 1149-1154.
22. J. Ni, H. Xie, S. Tatikonda, and Y. R. Yang, Network routing topology inference from end- to-end measurements, INFOCOM 2008. The 27th Conference on Computer Communications. IEEE, Phoenix, AZ, 2008, pp. 36-40.
23. F. LoPresti, N.G. Duffield, J. Horowitz, and D. Towsley, Multicast-basedinferenceofnetworkinternal delay distributions, IEEE/ACM Trans Netw 10 (2002), 761-775.
24. N. Saitou and M. Nei, The neighbor-joining method: A new method for reconstructing phylogenetic trees, Mol Biol Evol 4 (1987), 406-425.
25. C. Semple and M. Steel, Phylogenetics, Oxford Lecture Series in Mathematics and its Applications,Vol.24,Oxford University Press,Oxford, 2003 MRMR2060009(2005g:92024).
26. P. H. A. Sneath and R. R. Sokal, Numerical taxonomy, The principles and practice of numerical classification, A Series of Books in Biology, W. H. Freeman and Co., San Francisco, CA, 1973 MR MR0456594 (56 #14818).
27. Y. Vardi, Network Tomography: Estimating source-destination traffic intensities from link data, J Am Stat Assoc 91 (1996), 365-377 MR MR1394093 (97a:62050).