DocumentCode :
2976468
Title :
Challenges in streaming graph analysis
Author :
Berry, Jonathan ; Oster, M. ; Phillips, Cynthia ; Plimpton, Steven
Author_Institution :
Sandia Nat. Labs., Albuquerque, NM, USA
fYear :
2011
fDate :
7-10 Nov. 2011
Firstpage :
1338
Lastpage :
1338
Abstract :
Summary form only given. The volume of streaming data for cyber analysis is increasing at a rate much greater than any organization´s ability to hire human analysts. As a preliminary step to automating significant portions of analysis workload, we consider the problem of modeling cyber data. Since the latter tends to be relational in nature, graphs are a natural abstraction. This motivates future research into efficient algorithms for fundamental graph problems in a high-volume, streaming environment. Algorithms designed using current theoretical models for streaming graph algorithms are not directly suitable for operations. In this talk, we propose a new streaming model that can be implemented on a parallel system with extremely simple topology. Our model assumes an infinite stream which must be analyzed using finite resources. We illustrate the associated challenges by giving an algorithm for maintaining and querying the connected components of a graph in which edges may be expired periodically.
Keywords :
data models; graph theory; parallel algorithms; cyber analysis; cyber data modelling; data streaming; fundamental graph problems; parallel system; streaming graph analysis; Aging; Algorithm design and analysis; Analytical models; Computational modeling; Electronic mail; Laboratories; USA Councils;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
MILITARY COMMUNICATIONS CONFERENCE, 2011 - MILCOM 2011
Conference_Location :
Baltimore, MD
ISSN :
2155-7578
Print_ISBN :
978-1-4673-0079-7
Type :
conf
DOI :
10.1109/MILCOM.2011.6127489
Filename :
6127489
Link To Document :
بازگشت