Visualization of the Autonomous Systems Interconnections with HERMES

Carmignani, Andrea and Di Battista, Giuseppe and Didimo, Walter and Matera, Francesco and Pizzonia, Maurizio (2001) Visualization of the Autonomous Systems Interconnections with HERMES. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 150-163 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_14).

Full text not available from this repository.

Abstract

HERMES is a system for exploring and visualizing Autonomous Systems and their interconnections. It relies on a three-tiers architecture, on a large repository of routing information coming from heterogeneous sources, and on sophisticated graph drawing engine. Such an engine exploits static and dynamic graph drawing techniques.

Item Type:Conference Paper
Additional Information:10.1007/3-540-44541-2_14
Classifications:M Methods > M.300 Dynamic / Incremental / Online
S Software and Systems > S.999 Others
ID Code:332

Repository Staff Only: item control page

References

Aprisma. Spectrum. On line. http//www.aprisma.com.

T. Bates, E. Gerich, L. Joncherary, J. M. Jouanigot, D. Karrenberg, M. Terpstra, and J. Yu. Representation on ip routing policies in a routing registry. On line, 1994. ripe-181, http://ripe.net, rfc 1786.

P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. IEEE Transactions on Computers, 49(8), 2000.

T. C. Biedl and M. Kaufmann. Area-efficient static and incremental graph drawings. In R. Burkard and G. Woeginger, editors, Algorithms (Proc. ESA '97), volume 1284 of Lectutre Notes in Computer Sci., pages 37-52. Springer-Verlag, 1997.

U. Brandes and D. Wagner. Dynamic grid embedding with few bends and changes. In K.-Y. Chwa and Q. H. Ibarra, editors, ISAAC'98, volume 1533 of Lecture Notes in Comput. Sci., pages 89-98. Springer-Verlag, 1998.

S. Bridgeman and R. Tamassia. Difference metrics for interactive orthogonal graph drawing algorithms. In S. H. Whitesides, editor, Graph Drawing (Proc. GD '98), volume 1547 of Lecture Notes in Comput. Sci., pages 57-71. Springer-Verlag, 1998.

S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara. Interactive-Giotto: An algorithm for interactive orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes in Comput. Sci., pages 303-308. Springer-Verlag, 1998.

M. Bukowy and J. Snabb. RIPE NCC database documentation update to support RIPE DB ver. 2.2.1. On line, 1999. ripe-189, http://www.ripe.net.

CAIDA. Otter: Tool for topology display. On line. http://www.caida.org.

CAIDA. Plankton: Visualizing nlanr's web cache hierarchy. On line. http://www.caida.org.

R. F. Cohen, G. Di Battista, R. Tamassia and I.G. Tollis. Dynamic graph drawings: Trees, series-parallel digraphs, and planar ST-digraphs. SIAM J. Comput., 24(5):970-1001, 1995.

Cornell University. Argus. On line. http://www.cs.cornell.edu/cnrg/topology_aware/discovery/argus.html.

G. Di Battista, W. Didimo, M. Patrignani, and M. Pizzonia. Orthogonal and quasi-upward drawings with vertices of prescribed sizes. In J. Kratochvil, editor, Graph Drawing (Proc. GD '99), volume 1731 of Lecture Notes Comput. Sci., pages 297-310. Springer-Verlag, 1999.

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.

G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of for graph drawing algorithms. Comput. Geom. Theory. Appl., 7:303-325, 1997.

G. Di Battista, R. Lillo, and F. Vernacotola. Ptolomaeus: The web cartographer. In S. H. Withesides, editor, Graph Drawing (Proc. GD '98), volume 1547 of Lecture Notes in Comput. Sci., pages 444-445. Springer-Verlag, 1998.

M. Dodge. An atlas of cyberspaces. On line. http://www.cybergeography.com/atlas/atlas.html.

P. Eades, R. F. Cohen, and M. L. Huang. Online animated graph drawing for web navigation. In G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes in Comput. Sci., pages 330-335. Springer-Verlag, 1997.

P. Eades, W. Lai, K. Misue, and K. Sugiyama. Presserving the mental map of a diagram. In Proceedings of Compugraphics 91, pages 24-33, 1991.

U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95, volume 1027 of Lecture Notes in Comput. Sci., pages 254-266. Springer-Verlag, 1996.

GDToolkit:. Graph drawing toolkit. On line. http://www.gdtoolkit.com.

B. Huffaker. Tools to visualize the internet multicast backbone. On line. http://www.caida.org.

IPMA. Internet performance measurement and analysis project. On line. http://www.merit.edu/ipma.

Merit Network, Inc. Radb database services. On line. http://www.radb.net.

D. Meyer. University of oregon route views project. On line. http://www.antc.uoregon.edu/route-views.

K. Miriyala, S. W. Hornick, and R. Tamassia. An incremental approach to aesthetic graph layout. In Proc. Internat. Workshop on Computer-Aided Software Engineering, 1993.

K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. J. Visual Lang. Comput., 6(2):183-210, 1995.

S. North. Incremental layout in DynaDAG. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Comput. Sci., pages 409-418. Springer-Verlag, 1996.

A. Papakostas and I. G. Tollis. Interactive orthogonal graph drawing. IEEE Transactions on Computers, 47(11):1297-1309, 1998.

C. Rachit. Octopus: Backbone topology discovery. On line. http://www.cs.cornell.edu/cnrg/topology_aware/topology/Default.html.

Y. Rekhter. A border gateway protocol 4 (bgp-4). IETF, rfc 1771.

R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-444, 1987.

R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61-79, 1988.