Abstract
Effective tools are crucial for visualizing large quantities of information. While developing these tools, numerous graph drawing problems emerge. We present solutions for reducing clutter in a radial visualization of a bipartite graph representing the alerts generated by an IDS protecting a computer network. Our solutions rely essentially on (i) unambiguous edge bundling to reduce the number of edges to display and (ii) the minimization of the total sum of the edge lengths.
Chapter PDF
Similar content being viewed by others
References
Abdullah, K., Lee, C., Conti, G., Copeland, J.A., Stasko, J.: IDS RainStorm: visualizing IDS alarms. In: IEEE Workshop on Visualization for Computer Security, pp. 1–10 (2005)
Bachmaier, C.: A radial adaptation of the Sugiyama framework for visualizing hierarchical information. IEEE Transactions on Visualization and Computer Graphics 13, 583–594 (2007)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)
Dumas, M., Robert, J.M., McGuffin, M.J., Willig, M.C.: AlertWheel: Radial bipartite graph visualization applied to intrusion detection system alerts (submitted for publication)
Foresti, S., Agutter, J., Livnat, Y., Moon, S., Erbacher, R.: Visual correlation of network alerts. IEEE Comput. Graph. Appl. 26, 48–59 (2006)
Gansner, E., Koren, Y.: Improved Circular Layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 386–398. Springer, Heidelberg (2007)
Northcutt, S., Novak, J.: Network Intrusion Detection, 3rd edn. New Riders, Indianapolis (2002)
Pupyrev, S., Nachmanson, L., Kaufmann, M.: Improving Layered Graph Layouts with Edge Bundling. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 329–340. Springer, Heidelberg (2011)
Purchase, H.C.: Which Aesthetic has the Greatest Effect on Human Understanding? In: Di Battista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248–261. Springer, Heidelberg (1997)
Tamassia, R., Palazzi, B., Papamanthou, C.: Graph Drawing for Security Visualization. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 2–13. Springer, Heidelberg (2009)
Zheng, L., Song, L., Eades, P.: Crossing minimization problems of drawing bipartite graphs in two clusters. In: Asia-Pacific Symposium on Information Visualisation, pp. 33–37 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dumas, M., McGuffin, M.J., Robert, JM., Willig, MC. (2012). Optimizing a Radial Layout of Bipartite Graphs for a Tool Visualizing Security Alerts. In: van Kreveld, M., Speckmann, B. (eds) Graph Drawing. GD 2011. Lecture Notes in Computer Science, vol 7034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25878-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-25878-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25877-0
Online ISBN: 978-3-642-25878-7
eBook Packages: Computer ScienceComputer Science (R0)