Advertisement

Topology Discovery Using an Address Prefix Based Stopping Rule

  • Benoit Donnet
  • Timur Friedman
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 196)

Abstract

Recently, a first step towards a highly distributed IP-level topology discovery tool has been made with the introduction of the Doubletree algorithm. Doubletree is an efficient cooperative algorithm that allows the discovery of a large portion of nodes and links in the network while strongly reducing probing redundancy on nodes and destinations as well as the amount of probes sent. In this paper, we propose to reduce more strongly the load on destinations and, more essentially, the communication cost required for the cooperation by introducing a probing stopping rule based on CIDR address prefixes.

Keywords

Topology discovery Cooperative algorithm Doubletree CIDR 

References

  1. A. Schmitt et al. (ongoing service). La meteo du net.Google Scholar
  2. Anderson, D. P., Cobb, J., Korpela, E., Lebofsky, M., and Werthimer, D. (2002). SETI@home: An experiment in public-resource computing. Communications of the ACM, 45(11):56–61.CrossRefGoogle Scholar
  3. Bejerano, Y. and Rastogi, R. (2003). Robust monitoring of link delays and faults in IP networks. In Proc. IEEE Infocom.Google Scholar
  4. Bloom, B. H. (1970). Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422–426.zbMATHCrossRefGoogle Scholar
  5. Bonneau, R., Baliga, N. S., Deutsch, E. W., Shannon, P., and Hood, L. (2004). Comprehensive de novo structure prediction in a systems-biology context for the archaea halobacterium. Genome Biology.Google Scholar
  6. Burch, H. and Cheswick, B. (1999). Mapping the internet. IEEE Computer, 32(4):97–98.Google Scholar
  7. Cheswick, B., Burch, H., and Branigan, S. (2000). Mapping and visualizing the internet. In Proc. 2000 USENIX Annual Technical Conference, San Diego, California, USA.Google Scholar
  8. Clauset, A. and Moore, C. (2004). Traceroute sampling makes random graphs appear to have power law degree distributions. Technical Report arXiv:cond-mat/0312674 v3, University of New Mexico.Google Scholar
  9. Donnet, B., Friedman, T., and Crovella, M. (2005a). Improved algorithms for network topology discovery. In Proc. PAM 2005, Boston, USA.Google Scholar
  10. Donnet, B., Raoult, P., Friedman, T., and Crovella, M. (2005b). Efficient algorithms for large-scale topology discovery. In Proc. ACM SIGMETRICS 2005, Banff, Canada.Google Scholar
  11. Fan, L., Cao, P., Almeida, J., and Broder, A. Z. (1998). Summary cache: A scalable wide-area web cache sharing protocol. In Proc. ACM SIGCOMM.Google Scholar
  12. Fuller, V., Li, T., Yu, J., and Varadhan, K. (1993). Classless inter-domain routing (CIDR): an address assignment and aggregation strategy. RFC 1519, Internet Engineering Task Force.Google Scholar
  13. Georgatos, F., Gruber, F., Karrenberg, D., Santcroos, M., Susanj, A., Uijterwaal, H., and Wilhelm, R. (2001). Providing active measurements as a regular service for ISPs. In Proc. Passive and Active Measurement Workshop (PAM).Google Scholar
  14. Govindan, R. and Tangmunarunkit, H. (2000). Heuristics for internet map discovery. In Proc. IEEE Infocom.Google Scholar
  15. Huffaker, B., Plummer, D., Moore, D., and Claffy, k (2002). Topology discovery by active probing. In Symposium on Applications and the Internet, Nara City, Japan.Google Scholar
  16. Jacobsen, V. (1989). traceroute.Google Scholar
  17. Lakhina, A., Byers, J., Crovella, M., and Xie, P. (2003). Sampling biases in IP topology measurements. In Proc. IEEE Infocom’ 03.Google Scholar
  18. Larson, S. M., Snow, C. D., Shirts, M., and Pande, V. S. (2002). FOLDING@home and GENOME@home: Using distributed computing to tackle previously intractable problems in computational biology. In Computational Genomics.Google Scholar
  19. McGregor, A., Braun, H.-W., and Brown, J. (2000). The NLANR network analysis infrastructure. IEEE Communications Magazine, 38(5): 122–128.CrossRefGoogle Scholar
  20. Shavitt, Y. and Shir, E. (2005). DIMES: Let the internet measure itself. cs.NI 050699, arXiv.Google Scholar
  21. Siamwalla, R., Sharma, R., and Keshav, S. (1998). Discovering internet topology. Technical report, Cornell University, Ithaca, NY 14853.Google Scholar
  22. Simpson, Jr., C. R. and Riley, G. F. (2004). NETI@home: A distributed approach to collecting end-to-end network performance measurements. In Proc. Passive and Active Measurement Workshop (PAM).Google Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • Benoit Donnet
    • 1
  • Timur Friedman
    • 1
  1. 1.Laboratoire LiP6/CNRSUniversité Pierre & Marie CurieFrance

Personalised recommendations