Topographic visualization of prefix propagation in the internet

IEEE Transactions on Visualization and Computer Graphics

Volumn 12, Issue 5, 2006, Pages 725-732

  Cortese, Pier Francesco ^a   Di Battista, Giuseppe ^a   Moneta, Antonello ^a   Patrignani, Maurizio ^a   Pizzonia, Maurizio ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

Graph drawing; Interdomain routing; Internet visualization; Spring embedder

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONFORMAL MAPPING; INTERNET; TELECOMMUNICATION SERVICES;

GRAPH DRAWING; INTERDOMAIN ROUTING; INTERNET VISUALIZATION; SPRING EMBEDDER; TOPOGRAPHIC MAPS;

COMPUTER GRAPHICS;

EID: 33845665698     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2006.185     Document Type: Conference Paper

References (37)

1. The atlas of cyberspace. http://www.cybergeography.org/atlas/.
2. The internet mapping project. http://research.lumeta.com/ches/map/index. html.
3. Ip mapping. http://www.fractalus.com/steve/stuff/ipmap/.
4. NaMeX, Nautilus Mediterranean Exchange. http://www.namex.it.
5. Routing Information Service of the RIPE (RIS). http://www.ripe.net/ ripencc/pub-services/np/ris/.
6. University of Oregon RouteViews project. http://www.routeviews.org.
7. Walrus - graph visualization tool. http://www.caida.org/tools/ visualization/walrus/.
8. Wikipedia - topographic map. http://en.wikipedia.org/wiki/ Topographic_map.
9. C. Bachmaier, F. Fischer, and M. Forster. Radial coordinate assignment for level graphs. In Proc. COCOON 2005, volume 3595 of INCS, pages 401-410, Springer, 2005.
10. G. Di Battista, M. Patrignani, and M. Pizzonia. Computing the types of the relationships between autonomous systems. In Proc. IEEE INFOCOM, volume 1, pages 156-165, 2003.
11. F. J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In Graph Drawing (Proc. GD'95), volume 1027 of LNCS, pages 76-87, 1996.
12. U. Brandes and S.R. Corman. Visual unrolling of network evolution and the analysis of dynamic discourse. Information Visualization, 2(1):40-50, 2003.
13. U. Brandes, P. Kenis, and D. Wagner. Communicating centrality in policy network drawings. IEEE Transactions on Visualization and Computer Graphics, 9(2):241-253, 2003.
14. A. Carmignani, G. Di Battista, W. Didimo, F. Matera, and M. Pizzonia. Visualization of the high level structure of the internet with hermes. J. Graph Alg. Appl., 6(3):281-311, 2002.
15. M. J. Carpano. Automatic display of hierarchized graphs for computer aided decision analysis. IEEE Tram. Syst. Man Cybern., SMC-10(11):705-715, 1980.
16. L. Colitti, G. Di Battista, F. Mariani, M. Patrignani, and M. Pizzonia. Visualizing interdomain routing with BGPlay. J. Graph Alg. Appl., 9(1):117-148, 2005.
17. K.C. Cox, S.G. Eick, and T. He. 3D geographic network displays. SIGMOD Record, 25(4):50-54, 1996.
18. G. Di Battista, P. Eades, R. Tamassia, and T. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle, River, NJ, 1999.
19. P. Eades and M.L. Huang. Navigating clustered graphs using force-directed methods. J. Graph Alg. Appl., 4(3):157-181, 2000.
20. Q. W. Feng, R. F. Cohen, and P. Eades. How to draw a planar clustered graph. In Proc. COCOON'95, volume 959 of LNCS, pages 21-30. Springer-Verlag, 1995.
21. Y. Frishman and A. Tal. Dynamic drawing of clustered graphs. In INFOVIS '04, pages 191-198. IEEE Computer Society, 2004.
22. T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Softw. Pract. Exper., 21(11):1129-1164, 1991.
23. L. Gao. On inferring autonomous system relationships in the internet. IEEE/ACM Trans. on Networking, 9(6):733-745, 2001.
24. B. Huffaker, D. Plummer, D. Moore, and k claffy. Topology discovery by active probing. In Symposium on Applications and the Internet (SAINT), 2002. http://www.caida.org/outreach/papers/2002/SkitterOverview/.
25. D. Massey M. Lad and L. Zhang. Visualizing internet routing dynamics using link-rank. Technical Report TR050010, UCLA, 2005.
26. H. C. Purchase. Effective information visualisation: A study of graph drawing aesthetics and algorithms. Interact. Comput., 13(2):147-162, 2000.
27. H. C. Purchase. Metrics for graph drawing aesthetics. J. of Visual Lang. and Comput., 13(5):501-516, 2002.
28. J. M. Six and I. G. Tollis. Automated visualization of process diagrams. In Proc. Graph Drawing (GD '01), pages 45-59, 2001.
29. J.W. Stewart. BGP4: Inter-Domain Routing in the Internet. Addison-Wesley, Reading, MA, 1999.
30. L. Subramanian, S. Agarwal, J. Rexford, and R.H. Katz. Characterizing the internet hierarchy from multiple vantage points. In Proc. IEEE INFOCOM, 2002.
31. K. Sugiyama and K. Misue. Graph drawing by the magnetic spring model. J. Visual Lang. Comput., 6(3):217-231, 1995.
32. K. Sugiyama and K. Misue. A simple and unified method for drawing graphs: Magnetic-spring algorithm. In Graph Drawing (Proc. GD '94), volume 894 of LNCS, pages 364-375, 1995.
33. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man Cybern., SMC-11(2):109-125, 1981.
34. A. S. Tanenbaum. Computer Networks. Prentice-hall Int., 1996.
35. V. E. Waddle. Graph layout for displaying data structures. In Graph Drawing (Prof. GD '00), pages 241-252. Springer-Verlag, 2001.
36. C. Walshaw. A multilevel algorithm for force-directed graph drawing. In Graph Drawing (Proc. GD '00), pages 171-182, 2001.
37. K. Yee, D. Fisher, R. Dhamija, and M. Hearst. Animated exploration of dynamic graphs with radial layout. In Proc. INFOVIS '01, pages 43-50. IEEE Computer Society, 2001.