Optimizing a Radial Layout of Bipartite Graphs for a Tool Visualizing Security Alerts

  • Maxime Dumas
  • Michael J. McGuffin
  • Jean-Marc Robert
  • Marie-Claire Willig
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7034)

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.

Keywords

IDS alerts bipartite graph layout edge bundling 

References

  1. 1.
    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)Google Scholar
  2. 2.
    Bachmaier, C.: A radial adaptation of the Sugiyama framework for visualizing hierarchical information. IEEE Transactions on Visualization and Computer Graphics 13, 583–594 (2007)CrossRefGoogle Scholar
  3. 3.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Foresti, S., Agutter, J., Livnat, Y., Moon, S., Erbacher, R.: Visual correlation of network alerts. IEEE Comput. Graph. Appl. 26, 48–59 (2006)CrossRefGoogle Scholar
  6. 6.
    Gansner, E., Koren, Y.: Improved Circular Layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 386–398. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Northcutt, S., Novak, J.: Network Intrusion Detection, 3rd edn. New Riders, Indianapolis (2002)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Maxime Dumas
    • 1
  • Michael J. McGuffin
    • 1
  • Jean-Marc Robert
    • 1
  • Marie-Claire Willig
    • 2
  1. 1.ETSMontréalCanada
  2. 2.EESTIN, UHP Nancy 1France

Personalised recommendations