BOSAM: A Tool for Visualizing Topological Structures Based on the Bitmap of Sorted Adjacent Matrix

Though the adjacent matrix is a representation of a topology, it does not tell the topological structures explicitly. A visualization tool which can represent topological structures explicitly is desired for model validation or measurements comparison. However, displaying nodes and links directly in a space as a routine is ineffective for massive topologies, like that of Internet. Instead, researchers have recourse to various statistical metrics extracted from the adjacent matrix. Such a statistical metric often reflects only a single aspect of the topology but at the cost of burdensome computation. In this paper a novel simple visualization tool based on displaying the Bitmap of Sorted Adjacent Matrix, BOSAM, is proposed to fill the gap. Validations of AS-level topology models and comparisons of topology measurements are provided to show that BOSAM works efficiently. The bitmap displaying can avoid messy cross lines and make the correlation between nodes stand out. The rules of sorting node indexes can be defined flexibly to expose diverse topological structures. Moreover, some fractal features in the AS graphs or generated graphs, which are not easily to be covered by statistical analysis, can be exposed explicitly as well. Parting from the huge burden of statistical computation, BOSAM can be realized easily.

[1]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[2]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  Shi Zhou,et al.  Accurately modeling the Internet topology , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  A. Clauset,et al.  Traceroute sampling makes random graphs appear to have power law degree distributions , 2003, cond-mat/0312674.

[6]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[7]  Cristopher Moore,et al.  Accuracy and scaling phenomena in Internet mapping. , 2004, Physical review letters.

[8]  Walter Willinger,et al.  The origin of power laws in Internet topologies revisited , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[10]  Walter Willinger,et al.  A first-principles approach to understanding the internet's router-level topology , 2004, SIGCOMM '04.

[11]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Priya Mahadevan,et al.  Comparative Analysis of the Internet AS-Level Topologies Extracted from Different Data Sources , 2004 .

[13]  Peng Xie,et al.  Sampling biases in IP topology measurements , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Shi Zhou,et al.  Analyzing and modelling the AS-level Internet topology , 2003, ArXiv.