Rapid Detection of Attacks in Computer Networks by Quickest Changepoint Detection Methods

[1]  G. Lorden.  PROCEDURES FOR REACTING TO A CHANGE IN DISTRIBUTION , 1971 .

[2]  Tze Leung Lai,et al.  Information Bounds and Quick Detection of Parameter Changes in Stochastic Systems , 1998, IEEE Trans. Inf. Theory.

[3]  John S. Heidemann,et al.  A framework for classifying denial of service attacks , 2003, SIGCOMM '03.

[4]  C. Fuh.  Asymptotic operating characteristics of an optimal change point detection in hidden Markov models , 2004, math/0503682.

[5]  E. S. Page.  CONTINUOUS INSPECTION SCHEMES , 1954 .

[6]  Alexander G. Tartakovsky,et al.  On optimality of the Shiryaev-Roberts procedure for detecting a change in distribution , 2009, 0904.3370.

[7]  Y. Mei.  Efficient scalable schemes for monitoring a large number of data streams , 2010 .

[8]  G. Moustakides.  Optimal stopping times for detecting changes in distributions , 1986 .

[9]  Juanita Ellis,et al.  The Internet Security Guidebook: From Planning to Deployment , 2001 .

[10]  Michèle Basseville,et al.  Detection of abrupt changes: theory and application , 1993 .

[11]  Aleksey S. Polunchenko,et al.  State-of-the-Art in Sequential Change-Point Detection , 2011, 1109.2938.

[12]  M. Basseville,et al.  Sequential Analysis: Hypothesis Testing and Changepoint Detection , 2014 .

[13]  Martin Roesch,et al.  Snort - Lightweight Intrusion Detection for Networks , 1999 .

[14]  Moshe Pollak,et al.  ON OPTIMALITY PROPERTIES OF THE SHIRYAEV-ROBERTS PROCEDURE , 2007, 0710.5935.

[15]  M. Pollak.  Optimal Detection of a Change in Distribution , 1985 .

[16]  Vern Paxson,et al.  Bro: a system for detecting network intruders in real-time , 1998, Comput. Networks.

[17]  Hongjoong Kim,et al.  A novel approach to detection of intrusions in computer networks via adaptive sequential and batch-sequential change-point detection methods , 2006, IEEE Transactions on Signal Processing.

[18]  Georgios Loukas,et al.  Protection Against Denial of Service Attacks: A Survey , 2010, Comput. J..

[19]  S. Kent,et al.  On the trail of intrusions into information systems , 2000 .

[20]  V. Veeravalli,et al.  General Asymptotic Bayesian Theory of Quickest Change Detection , 2005 .

[21]  Cheng-Der Fuh,et al.  SPRT and CUSUM in hidden Markov models , 2003 .

[22]  Alexander G. Tartakovsky,et al.  Efficient Computer Network Anomaly Detection by Changepoint Detection Methods , 2012, IEEE Journal of Selected Topics in Signal Processing.

[23]  A. Shiryaev.  On Optimum Methods in Quickest Detection Problems , 1963 .

[24]  Rudolf B. Blazek,et al.  Detection of intrusions in information systems by sequential change-point methods , 2005 .

[25]  M. Pollak.  Average Run Lengths of an Optimal Method of Detecting a Change in Distribution. , 1987 .

[26]  Alexander G. Tartakovsky,et al.  Quickest changepoint detection in distributed multisensor systems under unknown parameters , 2008, 2008 11th International Conference on Information Fusion.

[27]  A. Tartakovsky.  Asymptotic Performance of a Multichart CUSUM Test Under False Alarm Probability Constraint , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[28]  Moshe Pollak,et al.  Third-order Asymptotic Optimality of the Generalized Shiryaev-Roberts Changepoint Detection Procedures , 2010, 1005.1129.

[29]  David Siegmund,et al.  Change-Points: From Sequential Detection to Biology and Back , 2013 .

[30]  George V. Moustakides,et al.  A NUMERICAL APPROACH TO PERFORMANCE ANALYSIS OF QUICKEST CHANGE-POINT DETECTION PROCEDURES , 2009, 0907.3521.