ACM Home Page
Please provide us with feedback. Feedback
Network Traffic Analysis With Query Driven Visualization SC 2005 HPC Analytics Results
Full text PdfPdf (364 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 2005 ACM/IEEE conference on Supercomputing table of contents
Page: 72  
Year of Publication: 2005
ISBN:1-59593-061-2
Authors
Kurt Stockinger  High Performance Computing Research Department (HPCRD/LBNL)
Kesheng Wu  High Performance Computing Research Department (HPCRD/LBNL)
Scott Campbell  National Energy Research Sciences Center (NERSC/LBNL)
Stephen Lau  National Energy Research Sciences Center (NERSC/LBNL)
Mike Fisk  Los Alamos National Laboratory (LANL)
Eugene Gavrilov  Los Alamos National Laboratory (LANL)
Alex Kent  Los Alamos National Laboratory (LANL)
Christopher E. Davis  University of New Mexico (UNM)
Rick Olinger  University of New Mexico (UNM)
Rob Young  University of New Mexico (UNM)
Jim Prewett  University of New Mexico (UNM)
Paul Weber  Los Alamos National Laboratory (LANL)
Thomas P. Caudell  Los Alamos National Laboratory (LANL)
E. Wes Bethel  High Performance Computing Research Department (HPCRD/LBNL
Steve Smith  Los Alamos National Laboratory (LANL)
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 38,   Citation Count: 1
Additional Information:

abstract   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1109/SC.2005.47

ABSTRACT

Our analytics task is to identify, characterize, and visualize anomalous subsets of as large of a collection of network connection data as possible. 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 multistage 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 stateof- the-art high-dimensional query system to extract this data 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 it is to render all data elements. By reducing the size of the rendering workload, we enable highly interactive and useful visualizations.



Collaborative Colleagues:
Kurt Stockinger: colleagues
Kesheng Wu: colleagues
Scott Campbell: colleagues
Stephen Lau: colleagues
Mike Fisk: colleagues
Eugene Gavrilov: colleagues
Alex Kent: colleagues
Christopher E. Davis: colleagues
Rick Olinger: colleagues
Rob Young: colleagues
Jim Prewett: colleagues
Paul Weber: colleagues
Thomas P. Caudell: colleagues
E. Wes Bethel: colleagues
Steve Smith: colleagues