Hierarchical inference of unicast network topologies based on end-to-end measurements

IEEE Transactions on Signal Processing

Volumn 55, Issue 5 I, 2007, Pages 1708-1718

  Shih, Meng Fu ^a   Hero III, Alfred O ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Graph based clustering; Mixture models; Network tomography; Topology estimation

Indexed keywords

BINARY TREES; CLUSTERING ALGORITHMS; GRAPH THEORY; ROUTERS; TOMOGRAPHY;

GRAPH-BASED CLUSTERING; NETWORK TOMOGRAPHY; TOPOLOGY ESTIMATION;

TOPOLOGY;

EID: 34247895464     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2006.890830     Document Type: Article

References (24)

1. S. Ratnasamy and S. McCanne, "Inference of multicast routing trees and bottleneck bandwidths using end-to-end measurements," presented at the IEEE INFOCOM 1999, New York, NY, Mar. 1999.
2. N. G. Duffield, J. Horowitz, F. Lo Presti, and D. Towsley, "Multicast topology inference from measured end-to-end loss," IEEE Trans. Inf. Theory, vol. 48, pp. 26-45, Jan. 2002.
3. N. G. Duffield, J. Horowitz, and F. Lo Presti, "Adaptive multicast topology inference," presented at the IEEE INFOCOM 2001, Anchorage, AL, Apr. 2001.
4. M. Coates, R. Castro, and R. Nowak, "Maximum likelihood network topology identification from edge-based unicast measurements," presented at the ACM Sigmetric, Marina Del Rey, CA, Jun. 2002.
5. R. Castro, M. Coates, G. Liang, R. Nowak, and B. Yu, "Internet tomography: Recent developments," Stat. Sci., vol. 19, no. 3, pp. 499-517, 2003.
6. R. Castro, M. Coates, and R. Nowak, "Likelihood based hierarchical clustering," IEEE Trans. Signal Processing, vol. 52, no. 8, pp. 2308-2321, Aug. 2004.
7. M. Shih and A. Hero, "Network topology discovery using finite mixture models," presented at the IEEE Int. Conf. Acoustics, Speech, Signal Processing (ICASSP) 2003, Montreal, QC, Canada, May 2003.
8. M. Shih and A. Hero, "Topology discovery on unicast networks: A hierarchical approach based on end-to-end measurements," EECS Dept., Univ. of Michigan, Ann Arbor, MI, CSPL Tech. Rep. TR-357, Mar. 2005.
9. M. Shih and A. O. Hero III, "Unicast-based inference of network link delay distributions with finite mixture models," IEEE Trans. Signal Process., vol. 51, no. 8, pp. 2219-2228, Aug. 2003.
10. A. Bestavros, J. Byers, and K. Harfoush, "Inference and labeling of metric-induced network topologies," presented at the IEEE INFOCOM 2002, New York, NY, Jun. 2002.
11. K. Zhang and D. Shasha, "Simple fast algorithms for the editing distance between trees and related problems," SIAM J. Comput., vol. 18, pp. 1245-1262, 1989.
12. M. Shih, "Unicast Internet tomography," Ph.D. dissertation, EECS Dept., Univ. of Michigan, Ann Arbor, MI, 2005.
13. A. K. Jain, M. N. Murty, and P. J. Flynn, "Data clustering : A review," ACM Comput. Surv., vol. 31, no. 3, pp. 264-323, 1999.
14. N. G. Duffield and F. Lo Presti, "Network tomography from measured end-to-end delay covariance," IEEE/ACM Trans. Netw., vol. 12, no. 6, pp. 978-992, Dec. 2004.
15. N. G. Duffield, J. Horowitz, F. Lo Presti, and D. Towsley, "Multicast topology inference from end-to-end measurements," presented at the Proc. IP Traffic Measurement, Modeling, Management, Monterey, CA, Sep. 2000.
16. G. McLachlan and D. Peel, Finite mixture models. New York: Wiley, 2000.
17. M. Figueiredo and A. K. Jain, "Unsupervised learning of finite mixture models," IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, pp. 381-396, Mar. 2002.
18. J. J. Oliver, R. A. Baxter, and C. S. Wallace, "Unsupervised learning using MML," in Proc. 13th Int. Conf. Machine Learning (ICML), 1996, pp. 364-372.
19. A. D. Lanterman, "Schwarz, Wallace, and Rissanen: Intertwining themes in theories of model order estimation," Int. Stat. Rev., vol. 69, pp. 185-212, Aug. 2001.
20. E. Hartuv and R. Shamir, "A clustering algorithm based on graph connectivity," Inf. Process. Lett., vol. 76, no. 4-6, pp. 175-181, Dec. 2000.
21. M. Brinkmeier, "Communities in graphs," Technical University Ilmenau, Ilmenau, Germany, Tech. Rep., 2002 [Online]. Available: http:// eiche.theoinf.tu-ilmenau.de/~mbrinkme/documents/communities.pdf, [Online]. Available:
22. H. Nagamochi and T. Ibaraki, "Linear time algorithm for finding a sparse κ-connected spanning subgraph of a κ-connected graph," Algorithmica, vol. 7, no. 5-6, pp. 583-596, 1992.
23. M. Stoer and F. Wagner, "A simple min-cut algorithm," J. ACM, vol. 44, no. 4, pp. 585-591, Jul. 1997.
24. M. Rabbat, R. Nowak, and M. Coates, "Multiple source, multiple destination network tomography," presented at the IEEE INFOCOM, Hong Kong, Mar. 2004.