Efficient Network Tomography for Internet Topology Discovery

被引:31
作者
Eriksson, Brian [1 ]
Dasarathy, Gautam [2 ]
Barford, Paul [3 ]
Nowak, Robert [2 ]
机构
[1] Boston Univ, Dept Comp Sci, Boston, MA 02215 USA
[2] Univ Wisconsin, Dept Elect & Comp Engn, Madison, WI 53706 USA
[3] Univ Wisconsin, Dept Comp Sci, Madison, WI 53706 USA
基金
美国国家科学基金会;
关键词
Internet topology; network monitoring; network tomography; routing topology inference; sampling methods; unicast; INFERENCE;
D O I
10.1109/TNET.2011.2175747
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Accurate and timely identification of the router-level topology of the Internet is one of the major unresolved problems in Internet research. Topology recovery via tomographic inference is potentially an attractive complement to standard methods that use TTL-limited probes. Unfortunately, limitations of prior tomographic techniques make timely resolution of large-scale topologies impossible due to the requirement of an infeasible number of measurements. In this paper, we describe new techniques that aim toward efficient tomographic inference for accurate router-level topology measurement. We introduce methodologies based on Depth-First Search (DFS) ordering that clusters end-hosts based on shared infrastructure and enables the logical tree topology of a network to be recovered accurately and efficiently. We evaluate the capabilities of our algorithms in large-scale simulation and find that our methods will reconstruct topologies using less than 2% of the measurements required by exhaustive methods and less than 15% of the measurements needed by the current state-of-the-art tomographic approach. We also present results from a study of the live Internet where we show our DFS-based methodologies can recover the logical router-level topology more accurately and with fewer probes than prior techniques.
引用
收藏
页码:931 / 943
页数:13
相关论文
共 20 条
[1]   Understanding Internet topology: Principles, models, and validation [J].
Alderson, D ;
Li, L ;
Willinger, W ;
Doyle, JC .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2005, 13 (06) :1205-1218
[2]  
[Anonymous], 2004, PROC INTERNET MEASUR
[3]   Likelihood based hierarchical clustering [J].
Castro, RM ;
Coates, MJ ;
Nowak, RD .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2004, 52 (08) :2308-2321
[4]  
Coates M., 2002, Performance Evaluation Review, V30, P11, DOI 10.1145/511399.511337
[5]   Deployment of an algorithm for large-scale topology discovery [J].
Donnet, Benoit ;
Raoult, Philippe ;
Friedman, Timur ;
Crovella, Mark .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2006, 24 (12) :2210-2220
[6]   Network tomography from measured end-to-end delay covariance [J].
Duffield, NG ;
Lo Presti, F .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (06) :978-992
[7]  
Duffield NG, 2001, IEEE INFOCOM SER, P1636, DOI 10.1109/INFCOM.2001.916660
[8]   Network loss tomography using striped unicast probes [J].
Duffield, Nick ;
Lo Presti, Francesco ;
Paxson, Vern ;
Towsley, Don .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2006, 14 (04) :697-710
[9]  
Eriksson B., 2010, Proc. IEEE International Conference on Computer Communications (INFOCOM), P1
[10]  
Friedman J., 2001, The Elements of Statistical Learning: Data Mining, Inference, and Prediction, V1