|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
27th International Conference on Distributed Computing Systems (ICDCS '07)
Communication-Efficient Tracking of Distributed Cumulative Triggers
Toronto, Canada
June 25-June 27
ISBN: 0-7695-2837-3
| ASCII Text | x | ||
| Ling Huang, Minos Garofalakis, Anthony D. Joseph, Nina Taft, "Communication-Efficient Tracking of Distributed Cumulative Triggers," 2012 IEEE 32nd International Conference on Distributed Computing Systems, pp. 54, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2007. | |||
| BibTex | x | ||
| @article{ 10.1109/ICDCS.2007.93, author = {Ling Huang and Minos Garofalakis and Anthony D. Joseph and Nina Taft}, title = {Communication-Efficient Tracking of Distributed Cumulative Triggers}, journal ={2012 IEEE 32nd International Conference on Distributed Computing Systems}, volume = {0}, year = {2007}, isbn = {0-7695-2837-3}, pages = {54}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.2007.93}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE 32nd International Conference on Distributed Computing Systems TI - Communication-Efficient Tracking of Distributed Cumulative Triggers SN - 0-7695-2837-3 SP EP A1 - Ling Huang, A1 - Minos Garofalakis, A1 - Anthony D. Joseph, A1 - Nina Taft, PY - 2007 KW - Distributed Triggering KW - Network Monitoring KW - Anomaly Detection KW - Data Aggregation KW - Queueing Theory. VL - 0 JA - 2012 IEEE 32nd International Conference on Distributed Computing Systems ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCS.2007.93
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:
Distributed Triggering, Network Monitoring, Anomaly Detection, Data Aggregation, Queueing Theory.
Citation:
Ling Huang, Minos Garofalakis, Anthony D. Joseph, Nina Taft, "Communication-Efficient Tracking of Distributed Cumulative Triggers," icdcs, pp.54, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.
