Abstract
We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-cores are represented by 2D layouts whose interdependence for increasing k is displayed by the third dimension. For the core with maximum value a spectral layout is chosen thus emphasizing on the most important part of the AS graph. The lower cores are added iteratively by force-based methods. In contrast to alternative approaches to visualize AS graph data, our method illustrates the entire AS graph structure. Moreover, it is generic with regard to the hierarchy displayed by the third dimension.
The authors gratefully acknowledge financial support from DFG under grant WA 654/13-2 and BR 2158/1-2, and from the European Commission within FET Open Projects COSIN (IST-2001-33555) and DELIS (contract no. 001907).
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Batagelj, V., Zaveršnik, M.: Generalized cores. Preprint 799, University of Ljubljana (2002)
Di Battista, G., Mariani, F., Patrignani, M., Pizzonia, M.: BGPlay: A System for Visualizing the Interdomain Routing Evolution. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 295–306. Springer, Heidelberg (2004)
Baur, M., Brandes, U., Gaertler, M., Wagner, D.: Drawing the AS Graph in Two and a Half Dimensions. TR 2004-12, Informatics, University Karlsruhe (2004)
Brandes, U., Corman, S.: Visual unrolling of network evolution and the analysis of dynamic discourse. Information Visualization 2(1), 40–50 (2003)
Brandes, U., Cornelsen, S.: Visual ranking of link structures. Journal of Graph Algorithms and Applications 7(2), 181–201 (2003)
Brandes, U., Dwyer, T., Schreiber, F.: Visual understanding of metabolic pathways across organisms using layout in two and a half dimensions. Journal of Integrative Bioinformatics 0002 (2004)
CAIDA. Walrus – graph visualization tool (2002)
CAIDA. Visualizing internet topology at a macroscopic scale (2003)
Eades, P., Feng, Q.: Multilevel visualization of clustered graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 113–128. Springer, Heidelberg (1997)
Fruchtermann, T., Reingold, E.: Graph drawing by force-directed placement. Software – Practice and Experience 21(11), 1129–1164 (1991)
Gaertler, M., Patrignani, M.: Dynamic analysis of the autonomous system graph. In: IPS 2004 – Inter-Domain Performance and Simulation (2004)
Gkantsidis, C., Mihail, M., Zegura, E.: Spectral analysis of internet topologies. In: IEEE Infocom 2003 (2003)
Sagie, G., Wool, A.: A clustering approach for exploring the internet structure. In: Proc. 23rd IEEE Conv. of Electrical and Electronics Engineers in Israel (2004)
Seidman, S.B.: Network structure and minimum degree. Social Networks 5, 269–287 (1983)
Winick, J., Jamin, S.: Inet-3.0: Internet topology generator. Technical Report UM-CSE-TR-456-02, EECS, University of Michigan (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baur, M., Brandes, U., Gaertler, M., Wagner, D. (2005). Drawing the AS Graph in 2.5 Dimensions. In: Pach, J. (eds) Graph Drawing. GD 2004. Lecture Notes in Computer Science, vol 3383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-31843-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24528-5
Online ISBN: 978-3-540-31843-9
eBook Packages: Computer ScienceComputer Science (R0)