article

Efficient algorithms for large-scale topology discovery

Authors:

Philippe Raoult,

Timur Friedman, and

Mark CrovellaAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 33, Issue 1

Pages 327 - 338

https://doi.org/10.1145/1071690.1064256

Published: 06 June 2005 Publication History

Abstract

There is a growing interest in discovery of internet topology at the interface level. A new generation of highly distributed measurement systems is currently being deployed. Unfortunately, the research community has not examined the problem of how to perform such measurements efficiently and in a network-friendly manner. In this paper we make two contributions toward that end. First, we show that standard topology discovery methods (e.g., skitter) are quite inefficient, repeatedly probing the same interfaces. This is a concern, because when scaled up, such methods will generate so much traffic that they will begin to resemble DDoS attacks. We measure two kinds of redundancy in probing (intra- and inter-monitor) and show that both kinds are important. We show that straightforward approaches to addressing these two kinds of redundancy must take opposite tacks, and are thus fundamentally in conflict. Our second contribution is to propose and evaluate Doubletree, an algorithm that reduces both types of redundancy simultaneously on routers and end systems. The key ideas are to exploit the tree-like structure of routes to and from a single point in order to guide when to stop probing, and to probe each path by starting near its midpoint. Our results show that Doubletree can reduce both types of measurement load on the network dramatically, while permitting discovery of nearly the same set of nodes and links.

References

[1]

A. Schmitt et al. La météo du net, ongoing service. See: http://www.grenouille.com/.]]

[2]

S. Agarwal, L. Subramanian, J. Rexford, and R. Katz. Characterizing the internet hierarchy from multiple vantage points. In Proc. IEEE INFOCOM, June 2002.]]

[3]

D. P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer. SETI@home: An experiment in public-resource computing. Communications of the ACM, 45(11):56--61, Nov. 2002. See also the SETI@home project: http://setiathome.ssl.berkeley.edu/.]]

Digital Library

[4]

Y. Bejerano and R. Rastogi. Robust monitoring of link delays and faults in IP networks. In Proc. IEEE Infocom, Mar. 2003.]]

[5]

B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422--426, 1970.]]

Digital Library

[6]

A. Broido and k. claffy. Internet topology: Connectivity of IP graphs. In Proc. SPIE International Symposium on Convergence of IT and Communication, 2001.]]

[7]

B. Cheswick, H. Burch, and S. Branigan. Mapping and visualizing the internet. In Proc. USENIX Annual Technical Conference, 2000.]]

Digital Library

[8]

A. Clauset and C. Moore. Traceroute sampling makes random graphs appear to have power law degree distributions. arXiv:cond-mat/0312674 v3 8 Feb. 2004.]]

[9]

B. Donnet, T. Friedman, and M. Crovella. Improved algorithms for network topology discovery. In Proc. of Passive and Active Measurement Workshop (PAM), Mar. 2005.]]

Digital Library

[10]

B. Donnet, P. Raoult, T. Friedman, and M. Crovella. Efficient algorithms for large-scale topology discovery. 2004. arXiv:cs.NI/0411013. See also the traceroute@home project: http://www.tracerouteathome.net/.]]

[11]

P. Erdös and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci., 5:17--61, 1960.]]

[12]

M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In Proc. ACM SIGCOMM, 1999.]]

Digital Library

[13]

L. Gao. On inferring autonomous system relationships in the internet. In Proc. IEEE Global Internet Symposium, Nov. 2000.]]

[14]

F. Georgatos, F. Gruber, D. Karrenberg, M. Santcroos, A. Susanj, H. Uijterwaal, and R. Wilhelm. Providing active measurements as a regular service for ISPs. In Proc. PAM, 2001. See also the RIPE NCC TTM service: http://www.ripe.net/test-traffic/.]]

[15]

R. Govindan and H. Tangmunarunkit. Heuristics for internet map discovery. In Proc. IEEE Infocom, 2000.]]

[16]

B. Huffaker, D. Plummer, D. Moore, and k. claffy. Topology discovery by active probing. In Symposium on Applications and the Internet, Jan. 2002.]]

Digital Library

[17]

IANA. Special-use IPv4 addresses. RFC 3330, Internet Engineering Task Force, Sep. 2002.]]

Digital Library

[18]

R. K. Jain. The Art of Computer Systems Performance Analysis. John Wiley, 1991.]]

[19]

K. Keys. iffinder. A tool for mapping interfaces to routers. See http://www.caida.org/tools/measurement/iffinder/.]]

[20]

A. Lakhina, J. Byers, M. Crovella, and P. Xie. Sampling biases in IP topology measurements. In Proc. IEEE Infocom, 2003.]]

[21]

D. Magoni and J. J. Pansiot. Analysis of the autonomous system network topology. ACM SIGCOMM Computer Communication Review, 31(3):26--37, Jul. 2001.]]

Digital Library

[22]

A. McGregor, H.-W. Braun, and J. Brown. The NLANR network analysis infrastructure. IEEE Communications Magazine, 38(5):122--128, May 2000. See also the NLANR AMP project: http://watt.nlanr.net/.]]

Digital Library

[23]

J. J. Pansiot and D. Grad. On routes and multicast trees in the internet. ACM SIGCOMM Computer Communication Review, 28(1):41--50, Jan. 1998.]]

Digital Library

[24]

Y. Shavitt. DIMES. Distributed Internet Measurements & Simulations. See: http://www.netdimes.org/.]]

[25]

R. Siamwalla, R. Sharma, and S. Keshav. Discovering internet topology. Technical report, Cornell University, July 1998.]]

[26]

C. R. Simpson, Jr. and G. F. Riley. NETI@home: A distributed approach to collecting end-to-end network performance measurements. In Proc. PAM, 2004. See also the NETI@home project: http://www.neti.gatech.edu/.]]

[27]

N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with Rocketfuel. In Proc. ACM SIGCOMM, 2002.]]

Digital Library

[28]

H. Tangmunarunkit, J. Doyle, R. Govindan, S. Jamin, and S. Shenker. Does AS size determine degree in AS topology? In ACM SIGCOMM Computer Communication Review, volume 31, Oct. 2001.]]

Digital Library

[29]

R. Teixeira, K. Marzullo, S. Savage, and G. Voelker. In search of path diversity in ISP networks. In Proc. Internet Measurement Conference (IMC), 2003.]]

Digital Library

[30]

V. Jacobsen et al. traceroute. man page, UNIX, 1989. See source code: ftp://ftp.ee.lbl.gov/traceroute.tar.gz, and NANOG traceroute source code: ftp://ftp.login.com/pub/software/traceroute/.]]

Cited By

Gouel MVermeulen KMouchet MRohrer JFourmaux OFriedman T(2022)Zeph & Iris map the internetACM SIGCOMM Computer Communication Review10.1145/3523230.352323252:1(2-9)Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1145/3523230.3523232
Gasparri AMarino A(2020)A Distributed Framework for $k$-hop Control Strategies in Large-Scale Networks Based on Local InteractionsIEEE Transactions on Automatic Control10.1109/TAC.2019.292659565:5(1825-1840)Online publication date: May-2020
https://doi.org/10.1109/TAC.2019.2926595
Beverly RDurairajan RPlonka DRohrer J(2018)In the IP of the BeholderProceedings of the Internet Measurement Conference 201810.1145/3278532.3278559(308-321)Online publication date: 31-Oct-2018
https://dl.acm.org/doi/10.1145/3278532.3278559
Show More Cited By

Index Terms

Efficient algorithms for large-scale topology discovery
1. Networks
  1. Network properties
    1. Network structure

Recommendations

Efficient algorithms for large-scale topology discovery
SIGMETRICS '05: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

There is a growing interest in discovery of internet topology at the interface level. A new generation of highly distributed measurement systems is currently being deployed. Unfortunately, the research community has not examined the problem of how to ...
Read More
Improved Algorithms for Large-Scale Topology Discovery
IEEC '09: Proceedings of the 2009 International Symposium on Information Engineering and Electronic Commerce

There is a growing interest in how to effectively and efficiently perform the topology discovery task in a network-friendly manner. Because the traditional method has generated so much traffic that they will begin to resemble distributed denial of ...
Read More
Large-scale testing of the Internet's Border Gateway Protocol (BGP) via topological scale-down

The Internet is a critical communication infrastructure servicing billions of end-users world-wide. Ongoing studies of the Internet's operations show that data loss and increased latency are occurring due to weaknesses in its interdomain routing ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 33, Issue 1

Performance evaluation review

June 2005

417 pages

ISSN:0163-5999

DOI:10.1145/1071690

Issue’s Table of Contents

SIGMETRICS '05: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
June 2005
428 pages
ISBN:1595930221
DOI:10.1145/1064212
General Chairs:
Derek Eager
University of Saskatchewan, Canada
,
Carey Williamson
University of Calgary, Canada
,
Program Chairs:
Sem Borst
Bell Labs, USA & CWI, The Netherlands
,
John C. S. Lui
Chinese University of Hong Kong, China

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 June 2005

Published in SIGMETRICS Volume 33, Issue 1

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

82
Total Citations
View Citations
1,137
Total Downloads

Downloads (Last 12 months)21
Downloads (Last 6 weeks)3

Other Metrics

View Author Metrics

Citations

Cited By

Gouel MVermeulen KMouchet MRohrer JFourmaux OFriedman T(2022)Zeph & Iris map the internetACM SIGCOMM Computer Communication Review10.1145/3523230.352323252:1(2-9)Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1145/3523230.3523232
Gasparri AMarino A(2020)A Distributed Framework for $k$-hop Control Strategies in Large-Scale Networks Based on Local InteractionsIEEE Transactions on Automatic Control10.1109/TAC.2019.292659565:5(1825-1840)Online publication date: May-2020
https://doi.org/10.1109/TAC.2019.2926595
Beverly RDurairajan RPlonka DRohrer J(2018)In the IP of the BeholderProceedings of the Internet Measurement Conference 201810.1145/3278532.3278559(308-321)Online publication date: 31-Oct-2018
https://dl.acm.org/doi/10.1145/3278532.3278559
Mensah PDubus SKanoun WMorin CPiolle GTotel E(2017)Connectivity graph reconstruction for networking cloud infrastructures2017 IEEE 16th International Symposium on Network Computing and Applications (NCA)10.1109/NCA.2017.8171337(1-9)Online publication date: Oct-2017
https://doi.org/10.1109/NCA.2017.8171337
Beverly RGill PHeidemann JByers JGovindan R(2016)Yarrp'ing the InternetProceedings of the 2016 Internet Measurement Conference10.1145/2987443.2987479(413-420)Online publication date: 14-Nov-2016
https://dl.acm.org/doi/10.1145/2987443.2987479
Coskun ICanbaz MGunes M(2016)Efficient as Network Topology Measurement Based on Ingress to Subnet Reachability2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops)10.1109/LCN.2016.033(87-95)Online publication date: Nov-2016
https://doi.org/10.1109/LCN.2016.033
Ouédraogo FBissyandé TDaouda SBassolé DSéré ASié O(2016)Impact of Small-World Effect on the ip-level Routing Dynamicse-Infrastructure and e-Services10.1007/978-3-319-43696-8_3(26-35)Online publication date: 14-Oct-2016
https://doi.org/10.1007/978-3-319-43696-8_3
Yifan Gong Bingsheng He Jianlong Zhong (2015)Network Performance Aware MPI Collective Communication Operations in the CloudIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2013.9626:11(3079-3089)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1109/TPDS.2013.96
Marchetta Pde Donato WPersico VPescape A(2015)Experimenting with alternative path tracing solutionsProceedings of the 2015 IEEE Symposium on Computers and Communication (ISCC)10.1109/ISCC.2015.7405552(427-432)Online publication date: 6-Jul-2015
https://dl.acm.org/doi/10.1109/ISCC.2015.7405552
Cunha ÍTeixeira RVeitch DDiot C(2014)DTRACKIEEE/ACM Transactions on Networking10.1109/TNET.2013.226983722:4(1025-1038)Online publication date: 1-Aug-2014
https://dl.acm.org/doi/10.1109/TNET.2013.2269837
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents