Advertisement

Improved Algorithms for Network Topology Discovery

  • Benoit Donnet
  • Timur Friedman
  • Mark Crovella
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3431)

Abstract

Topology discovery systems are starting to be introduced in the form of easily and widely deployed software. However, little consideration has been given as to how to perform large-scale topology discovery efficiently and in a network-friendly manner. In prior work, we have described how large numbers of traceroute monitors can coordinate their efforts to map the network while reducing their impact on routers and end-systems. The key is for them to share information regarding the paths they have explored. However, such sharing introduces considerable communication overhead. Here, we show how to improve the communication scaling properties through the use of Bloom filters to encode a probing stop set. Also, any system in which every monitor traces routes towards every destination has inherent scaling problems. We propose capping the number of monitors per destination, and dividing the monitors into clusters, each cluster focusing on a different destination list.

Keywords

False Positive Rate Hash Function Bloom Filter Link Coverage Straight Horizontal Line 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Jacobsen, V., et al.: traceroute. man page, UNIX, See source code: and NANOG traceroute source code (1989), ftp://ftp.ee.lbl.gov/traceroute.tar.gz, ftp://ftp.ee.lbl.gov/traceroute.tar.gz
  2. 2.
    Huffaker, B., Plummer, D., Moore, D., Claffy, K.: Topology discovery by active probing. In: Proc. Symposium on Applications and the Internet (2002), See also the skitter project: http://www.caida.org/tools/measurement/skitter/
  3. 3.
    Georgatos, F., Gruber, F., Karrenberg, D., Santcroos, M., Susanj, A., Uijterwaal, H., Wilhelm, R.: 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/
  4. 4.
    McGregor, A., Braun, H.W., Brown, J.: The NLANR network analysis infrastructure. IEEE Communications Magazine 38, 122–128 (2000);See also the NLANR AMP project: http://watt.nlanr.net/ CrossRefGoogle Scholar
  5. 5.
    Cheswick, B., Burch, H., Branigan, S.: Mapping and visualizing the internet. In: Proc. USENIX Annual Technical Conference (2000)Google Scholar
  6. 6.
    Anderson, D.P., Cobb, J., Korpela, E., Lebofsky, M., Werthimer, D.: SETI@home: An experiment in public-resource computing. Communications of the ACM 45, 56–61 (2002); See also the SETI@home project: http://setiathome.ssl.berkeley.edu/ CrossRefGoogle Scholar
  7. 7.
    Schmitt, A., et al.: La météo du net (ongoing service) See: http://www.grenouille.com/
  8. 8.
    Simpson Jr., C.R., Riley, G.F.: NETI@home: A distributed approach to collecting end-to-end network performance measurements. In: Barakat, C., Pratt, I. (eds.) PAM 2004. LNCS, vol. 3015, pp. 168–174. Springer, Heidelberg (2004) See also the NETI@home project: http://www.neti.gatech.edu/ CrossRefGoogle Scholar
  9. 9.
    Shavitt, Y., et al.: DIMES (ongoing project) See: http://www.netdimes.org/
  10. 10.
    Donnet, B., Raoult, P., Friedman, T., Crovella, M.: Efficient algorithms for large-scale topology discovery. Preprint (under review). arXiv:cs.NI/0411013 v1 (2004) See also the traceroute@home project: http://www.tracerouteathome.net/.
  11. 11.
    Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13, 422–426 (1970)zbMATHCrossRefGoogle Scholar
  12. 12.
    Mitzenmacher, M.: Compressed Bloom filters. In: Proc. Twentieth Annual ACM Symposium on Principles of Distributed Computing, pp. 144–150 (2001)Google Scholar
  13. 13.
    Matsumoto, M., Nishimura, T.: Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Trans. on Modeling and Computer Simulation 8, 3–30 (1998) See also the Mersenne Twister home page: http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html zbMATHCrossRefGoogle Scholar
  14. 14.
    Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: A scalable wide-area web cache sharing protocol. In: Proc. ACM SIGCOMM (1998)Google Scholar
  15. 15.
    Dall’Asta, L., Alvarez-Hamelin, I., Barrat, A., Vázquez, A., Vespignani, A.: A statistical approach to the traceroute-like exploration of networks: theory and simulations. In: Proc. Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN (2004) (Preprint: arXiv:cond-mat/0406404.)Google Scholar
  16. 16.
    Barford, P., Bestavros, A., Byers, J., Crovella, M.: On the marginal utility of network topology measurements. In: Proc. ACM SIGCOMM Internet Measurement Workshop, IMW (2001)Google Scholar
  17. 17.
    Fuller, V., Li, T., Yu, J., Varadhan, K.: Classless inter-domain routing (CIDR): an address assignment and aggregation strategy. RFC 1519, IETF (1993)Google Scholar
  18. 18.
    Bejerano, Y., Rastogi, R.: Robust monitoring of link delays and faults in IP networks. In: Proc. IEEE Infocom (2003)Google Scholar
  19. 19.
    Govindan, R., Tangmunarunkit, H.: Heuristics for internet map discovery. In: Proc. IEEE Infocom (2000)Google Scholar
  20. 20.
    Lakhina, A., Byers, J., Crovella, M., Xie, P.: Sampling biases in IP topology measurements. In: Proc. IEEE Infocom. (2003)Google Scholar
  21. 21.
    Clauset, A., Moore, C.: Why mapping the internet is hard. Technical report. arXiv:cond-mat/0407339 v1 (2004)Google Scholar
  22. 22.
    Petermann, T., De Los Rios, P.: Exploration of scale-free networks. Eur. Phys. J. B 38 (2004)(Preprint: arXiv:cond-mat/0401065)Google Scholar
  23. 23.
    Guillaume, J.L., Latapy, M.: Relevance of massively distributed explorations of the internet topology: Simulation results. In: Proc. IEEE Infocom (2005)Google Scholar
  24. 24.
    Rekhter, Y., Li, T., et al.: A border gateway protocol 4 (BGP-4). RFC 1771, IETF (1995)Google Scholar
  25. 25.
    Quoitin, B., Pelsser, C., Bonaventure, O., Uhlig, S.: A performance evaluation of BGP-based traffic engineering. International Journal of Network Management (to appear) See also the C-BGP simulator page: http://cbgp.info.ucl.ac.be/

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Benoit Donnet
    • 1
  • Timur Friedman
    • 1
  • Mark Crovella
    • 2
  1. 1.Laboratoire LiP6-CNRSUniversité Pierre & Marie Curie 
  2. 2.Department of Computer ScienceBoston University 

Personalised recommendations