Mapping the Internet

Discovery of a network topology is a challenging task. Available algorithms that rely on simple hop-limited, traceroute-style probes give different performance in terms of the completeness (fuzziness) of the resulting map, the speed of mapping, and the efficiency of mapping. The authors provide a brief overview of the types of mapping abstractions that have been used and review available techniques for generating maps of the Internet's infrastructure. A small study conducted in order to compare two of these techniques is described. Results of this study indicate that informed random address probing offers more complete network maps quickly and more efficiently. They also suggest that probing from multiple sources and amalgamating the results may improve the completeness of maps.

[1]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[2]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  B. Cheswick,et al.  The Internet mapping project , 1998 .