Visual Analysis of Network Traffic for Resource Planning, Interactive Monitoring, and Interpretation of Security Threats

Florian Mansmann, Daniel Keim, Stephen North, Brian Rexroad, and Daniel Sheleheda

IEEE Trans. Vis. Comput. Graph. 13(6) pp. 1105-1112, 2007. PDF (1297K)

Directed Graphs and Rectangular Layouts

Adam Buchsbaum, Emden Gansner, and Suresh Venkatasubramanian

Asia-Pacific Symposium on Visualisation, 2007. PDF (87K)

Measuring and extracting proximity in networks

Yehuda Koren, Stephen North, and Chris Volinsky

KDD pp. 245-255, 2006. PDF (212K)

Improved Circular Layouts

Emden Gansner and Yehuda Koren

Graph Drawing pp. 386-398, 2006. PDF (203K)

Drawing Directed Graphs Using Quadratic Programming

Tim Dwyer, Yehuda Koren, and Kim Marriott

IEEE Trans. Vis. Comput. Graph. 12(4) pp. 536-548, 2006. PDF (2437K)

Global Registration of Multiple 3D Point Sets via Optimization-on-a-Manifold

Shankar Krishnan, Pei Lee, John Moore, and Suresh Venkatasubramanian

Symposium on Geometry Processing pp. 187-196, 2005. PDF (662K)

Topological Fisheye Views for Visualizing Large Graphs

Emden Gansner, Yehuda Koren, and Stephen North

INFOVIS pp. 175-182, 2004. PDF (5483K)

The following videos give an introduction to some of our work.

LiveRAC (mpeg - 30 MB)
LiveRAC is a visualization system that supports the analysis of large collections of system management timeseries data consisting of hundreds of parameters across thousands of network devices. It provides high information density using a reorderable matrix of charts, with semantic zooming adapting each chart's visual representation to the available space. LiveRAC allows side-by-side visual comparison of arbitrary groupings of devices and parameters at multiple levels of detail. The video illustrates its capabilities.

Path Router (mpeg - 4.3 MB)
Illustrates a technique for routing a smooth curve between two points while avoiding intervening objects. The technique and its related aesthetics were designed for drawing edges of graphs.

Uncluttering Force-Directed Graph Layouts (mpeg - 5.8 MB)
Applies a Voronoi diagram-based technique and smooth path routing to remove node-node and node-edge overlaps in force-directed layouts of graphs.

Hardware-accelerated View-dependent Map Simplication (Quicktime - big! 200 MB)
Demonstrates a novel hardware accelerated map simplification that improves rendering performance and reduces clutter in interactive map viewers.

Kinetic Depth Contours (Quicktime)
Demonstrates the power of graphics hardware for computing the depth contours of a set of points in the plane. The video is a real time capture of the computation. Also see the paper "Hardware-Assisted Computation of Depth Contours" by Krishnan et al.

Bounding Box of Moving Points (Quicktime)
Demonstrates the use of duality in hardware to compute the minimum enclosing bounding box of moving points in three dimensions. This video is based on work done by Shankar Krishnan and Suresh Venkatasubramanian with Prof. Pankaj Agarwal and Nabil Mustafa at Duke.

Toplogical Fisheye Viewer demo (Quicktime)
A rough cut demonstrating the Topview user interface for a browser for large graphs. We illustrate it on the (inferred) peer-to-peer core of an AS graph hierarchy (from work by Agarwal, Subramanian, Rexford and Katz), and on a 148,000 node router graph provided by Bill Cheswick formerly at Lumeta Corp..