Communication-Efficient Tracking of Distributed Cumulative Triggers
Ling Huang
Garofalakis, M.
Joseph, A.D.
Taft, N.
UC Berkeley, Berkeley, CA;
This paper appears in: Distributed Computing Systems, 2007. ICDCS '07. 27th International Conference on
Publication Date: 25-27 June 2007
On page(s): 54-54
Location: Toronto, ON,
ISSN: 1063-6927
ISBN: 0-7695-2837-3
INSPEC Accession Number: 10290188
Digital Object Identifier: 10.1109/ICDCS.2007.93
Current Version Published: 2007-07-09
Abstract
In recent work, we proposed D-Trigger, a framework for tracking a global condition over a large network that allows us to detect anomalies while only collecting a very limited amount of data from distributed monitors. In this paper, we expand our previous work by designing a new class of queries (conditions) that can be tracked for anomaly violations. We show how security violations can be detected over a time window of any size. This is important because security operators do not know in advance the window of time in which measurements should be made to detect anomalies. We also present an algorithm that determines how each machine should filter its time series measurements before back-hauling them to a central operations center. Our filters are computed analytically such that upper bounds on false positive and missed detection rates are guaranteed. In our evaluation, we show that botnet detection can be carried out successfully over a distributed set of machines, while simultaneously filtering out 80 to 90% of the measurement data.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
