Drawing the AS Graph in 2.5 Dimensions

Baur, Michael and Brandes, Ulrik and Gaertler, Marco and Wagner, Dorothea (2004) Drawing the AS Graph in 2.5 Dimensions. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 43-48 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_6).

Full text not available from this repository.


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).

Item Type:Conference Paper
Additional Information:10.1007/978-3-540-31843-9_6
Classifications:P Styles > P.720 Straight-line
P Styles > P.060 3D
M Methods > M.400 Force-directed / Energy-based
ID Code:566

Repository Staff Only: item control page


V. Batagelj and M. Zaversnik. Generalized cores. Preprint 799, University of Ljubljana, 2002.

G. Di Battista, F. Mariani, M. Padrignani, and M. Pizzonia. BGPlay: A System for Visualizing the Interdomain Routing Evolution. In Proc. of Graph Drawing, GD'03, volume 2912 of Springer LNCS, pages 295-306. Springer, 2004.

M. Baur, U. Brandes, M. Gaertler, and D. Wagner. Drawing the AS Graph in Two and a Half Dimensions. TR 2004-12, Informatics, University Karlsruhe, 2004.

U. Brandes and S. Corman. Visual unrolling of network evolution and the analysis of dynamic discourse. Information Visualization, 2(1):40-50, 2003.

U. Brandes and S. Corman. Visual ranking of link structures.Journal of Graph Algorithms and Applications, 7(2):181-201, 2003.

U. Brandes, T. Dwyer, and F. Schreiber. 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.

P. Eades and Q. Feng. Multilevel visualization of clustered graphs. In Proc. of Graph Drawing, volume 1190 of Springer LNCS, pages 113-128. Springer, 1996.

T. Fruchtermann and E. Reingold. Graph drawing by force-directed placement. Software - Practice and Experience, 21(11):1129-1164, 1991.

M. Gaertler and M. Patrignani. Dynamic analysis of the autonomous system graph. In IPS 2004 - Inter-Domain Performance and Simulation, 2004.

C. Gkantsidis, M. Mihail, and E. Zegura. Spectral analysis of internet topologies. In IEEE Infocom 2003, 2003.

G. Sagie and A. Wool. A clustering approach for exploring the internet structure. In Proc. 23rd IEEE Conv. of Electrical and Electronics Engineers in Israel, 2004.

S. B. Seidman. Network structure and minimum degree. Social Networks, 5:269-287, 1983.

J. Winick and S. Jamin. Inet-3.0: Internet topology generator. Technical Report UM-CSE-TR-456-02, EECS, University of Michigan, 2002.