Skip to main content
eScholarship
Open Access Publications from the University of California

Network Traffic Analysis With Query Driven VisualizationSC 2005 HPC Analytics Results

  • Author(s): Stockinger, Kurt
  • Wu, Kesheng
  • Campbell, Scott
  • Lau, Stephen
  • Fisk, Mike
  • Gavrilov, Eugene
  • Kent, Alex
  • Davis, Christopher E.
  • Olinger, Rick
  • Young, Rob
  • Prewett, Jim
  • Weber, Paul
  • Caudell, Thomas P.
  • Bethel, E. Wes
  • Smith, Steve
  • et al.
Abstract

Our analytics challenge is is to identify, characterize, and visualize anomalous subsets of large collections of network connection data. We use a combination of HPC resources, advanced algorithms, and visualization techniques. To effectively and efficiently identify the salient portions of the data, we rely on a multi-stage workflow that includes data acquisition, summarization (feature extraction), novelty detection, and classification. Once these subsets of interest have been identified and automatically characterized, we use a state-of-the-art high-dimensional query system to extract data subsets for interactive visualization. Our approach is equally useful for other large-data analysis problems where it is more practical to identify interesting subsets of the data for visualization than to render all data elements. By reducing the size of the rendering workload, we enable highly interactive and useful visualizations. As a result of this work we were able to analyze six months worth of data interactively with response times two orders of magnitude shorter than with conventional methods.

Main Content
Current View