How to visualize the K-root name server

Journal of Graph Algorithms and Applications

Volumn 16, Issue 3, 2012, Pages 675-699

  Di Battista, Giuseppe ^a   Squarcella, Claudio ^a   Nagele, Wolfgang ^b  

^a ROMA TRE UNIVERSITY   (Italy)

^b RIPE NCC   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CHANGE-OVER TIME; NEAR-REAL TIME; NETWORK COORDINATIONS; OPERATIONAL PATTERNS; ROOT NAME SERVERS; ROUTINGS; TIME INTERVAL;

EID: 84868009013     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00267     Document Type: Article

References (32)

1. Apache Hadoop. http://hadoop.apache.org/.
2. TCPDUMP/LIBPCAP public repository. http://www.tcpdump.org/.
3. Visual-K. http://dia.uniroma3.it/~squarcel/visual-k/.
4. M. Akbari Jokar and A. Shoja Sangchooli. Constructing a Block Layout by Face Area. The International Journal of Advanced Manufacturing Tech-nology, 54:801-809, 2011.
5. T. Biedl and L. Ruiz Veĺazquez. Orthogonal Cartograms with Few Corners Per Face. In Algorithms and Data Structures, volume 6844 of Lecture Notes in Computer Science, pages 98-109. Springer Berlin / Heidelberg, 2011.
6. T. Biedl and L. E. R. Veĺazquez. Drawing Planar 3-Trees with Given Face-Areas. In D. Eppstein and E. R. Gansner, editors, Graph Drawing, volume 5849 of Lecture Notes in Computer Science, pages 316-322. Springer Berlin / Heidelberg, 2010.
7. C. Bron and J. Kerbosch. Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM, 16:575-577, September 1973.
8. Z.-Z. Chen, M. Grigni, and C. H. Papadimitriou. Planar Map Graphs. In Proceedings of the thirtieth annual ACM symposium on Theory of comput-ing, STOC '98. ACM, 1998.
9. Z.-Z. Chen, M. Grigni, and C. H. Papadimitriou. Recognizing Hole-Free 4-Map Graphs in Cubic Time. Algorithmica, 45(2):227-262, 2006.
10. L. Colitti, G. Di Battista, F. Mariani, M. Patrignani, and M. Pizzonia. Visualizing Interdomain Routing with BGPlay. Journal of Graph Algorithms and Applications, Special Issue on the 2003 Symposium on Graph Drawing, GD '03, 9(1):117-148, 2005.
11. P. F. Cortese, G. Di Battista, A. Moneta, M. Patrignani, and M. Pizzonia. Topographic Visualization of Prefix Propagation in the Internet. IEEE Transactions on Visualization and Computer Graphics, 12(5):725-732, 2006.
12. M. de Berg, E. Mumford, and B. Speckmann. Optimal BSPs and Rectilinear Cartograms. In Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems, GIS '06, pages 19-26, New York, NY, USA, 2006. ACM.
13. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, July 1998.
14. W. Didimo, G. Liotta, and S. A. Romeo. Topology-Driven Force-Directed Algorithms. In Proceedings of the 18th international conference on Graph drawing, GD'10, pages 165-176, Berlin, Heidelberg, 2011. Springer-Verlag.
15. C. Erten, P. Harding, S. Kobourov, K. Wampler, and G. Yee. GraphAEL: Graph Animations with Evolving Layouts. In G. Liotta, editor, Graph Drawing, volume 2912 of Lecture Notes in Computer Science, pages 98-110. Springer Berlin / Heidelberg, 2004.
16. S. I. Fabrikant and A. Skupin. Cognitively Plausible Information Visualization. Exploring Geovisualization, (November 2004):667-690, 2005.
17. E. Gansner, Y. Hu, M. Kaufmann, and S. Kobourov. Optimal Polygonal Representation of Planar Graphs. In LATIN 2010: Theoretical Informatics, volume 6034 of Lecture Notes in Computer Science, pages 417-432. Springer Berlin / Heidelberg, 2010.
18. M. R. Garey and D. S. Johnson. Crossing Number is NP-Complete. SIAM Journal on Algebraic and Discrete Methods, 4(3):312-316, 1983.
19. M. T. Gastner and M. E. J. Newman. Diffusion-based Method for Producing Density-equalizing Maps. Proceedings of the National Academy of Sciences of the United States of America, 101(20):7499-7504, May 2004.
20. C. Gutwenger and P. Mutzel. An Experimental Study of Crossing Minimization Heuristics. In G. Liotta, editor, Graph Drawing, volume 2912 of Lecture Notes in Computer Science, pages 13-24. Springer, 2003.
21. B. Huffaker, M. Fomenkov, and k. claffy. Influence Maps-A Novel 2-D Visualization of Massive Geographically Distributed Data Sets. Internet Protocol Forum, October 2008.
22. R. Inoue and E. Shimizu. A New Algorithm for Continuous Area Cartogram Construction with Triangulation of Regions and Restriction on Bearing Changes of Edges. Cartography and Geographic Information Sci-ence, 33(2):115-125, 2006.
23. A. Kawaguchi and H. Nagamochi. Orthogonal Drawings for Plane Graphs with Specified Face Areas. In Proceedings of the 4th international con-ference on Theory and applications of models of computation, TAMC'07, pages 584-594, Berlin, Heidelberg, 2007.
24. D. Mashima, S. Kobourov, and Y. Hu. Visualizing Dynamic Data with Maps. In Proc. 4th IEEE Pacific Visualization Symposium, March 2011.
25. S. Masuda, K. Nakajima, T. Kashiwabara, and T. Fujisawa. Crossing Minimization in Linear Embeddings of Graphs. IEEE Transactions on Computers, 39(1):124-127, jan 1990.
26. A. Okabe, B. Boots, K. Sugihara, and S. N. Chiu. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Probability and Statistics. Wiley, NYC, 2nd edition, 2000.
27. M. Ouyang and P. Z. Revesz. Algorithms for Cartogram Animation. In Proceedings of the 2000 International Symposium on Database Engineering & Applications, IDEAS '00, pages 231-235, Washington, DC, USA, 2000. IEEE Computer Society.
28. M. S. Rahman, K. Miura, and T. Nishizeki. Octagonal Drawings of Plane Graphs with Prescribed Face Areas. Computational Geometry: Theory and Applications, 42:214-230, April 2009.
29. R. Reitsma and S. Trubin. Information Space Partitioning using Adaptive Voronoi Diagrams. Information Visualization, 6:123-138, May 2007.
30. G. Robertson, R. Fernandez, D. Fisher, B. Lee, and J. Stasko. Effectiveness of Animation in Trend Visualization. IEEE Transactions on Visualization and Computer Graphics, 14:1325-1332, November 2008.
31. M. Thorup. Map Graphs In Polynomial Time. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, FOCS '98, 1998.
32. M. van Kreveld and B. Speckmann. On Rectangular Cartograms. Compu-tational Geometry: Theory and Applications, 37:175-187, August 2007.