Ceaser: Exploring the Monitoring Rules in the Time Dimension

In cloud environment, most failures would not strike at a sudden moment but evolve from a minor anomaly. During the evolving procedure, it may generate a series of events. But users can't specify exactly the event sequences of all the failures due the lack of time or knowledge. Automatically exploring the monitoring rules in time dimension can help users refine their rules and timely discover the failure. Based on these facts, we introduce our prototype: Ceaser. It analyzes the raw rules that user specified based on history event sequence, and try to refine them in the time dimension. Unlike pattern mining or event summarization, the rule refinement process is handled by a rule generator Ceaser-S and an extensible CEP engine Ceaser-E. The cooperation of these two can not only discover the event sequence pattern which one event happens after another, they can also explore the monitoring rules including the negative pattern or Kleeneclosure pattern and other user defined pattern.

[1]  Jun Zhang,et al.  Simlarity Search for Web Services , 2004, VLDB.

[2]  Jongik Kim,et al.  Efficient Exact Similarity Searches Using Multiple Token Orderings , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[3]  Graham Cormode,et al.  Communication-efficient distributed monitoring of thresholded counts , 2006, SIGMOD Conference.

[4]  Eamonn J. Keogh,et al.  On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration , 2002, Data Mining and Knowledge Discovery.

[5]  Assaf Schuster,et al.  A Geometric Approach to Monitoring Threshold Functions over Distributed Data Streams , 2010, Ubiquitous Knowledge Discovery.

[6]  Ritu Chadha,et al.  Application of time series analysis to fault management in MANETs , 2010, 2010 International Conference on Network and Service Management.

[7]  Shicong Meng,et al.  Monitoring continuous state violation in datacenters: Exploring the time dimension , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[8]  Frederick Reiss,et al.  TelegraphCQ: continuous dataflow processing , 2003, SIGMOD '03.

[9]  Qiang Chen,et al.  Aurora : a new model and architecture for data stream management ) , 2006 .

[10]  Christos Faloutsos,et al.  Efficient Similarity Search In Sequence Databases , 1993, FODO.

[11]  Yanlei Diao,et al.  High-performance complex event processing over streams , 2006, SIGMOD Conference.

[12]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[13]  Depei Qian,et al.  NEPnet: A scalable monitoring system for anomaly detection of network service , 2011, 2011 7th International Conference on Network and Service Management.

[14]  Samuel Madden,et al.  ZStream: a cost-based query processor for adaptively detecting composite events , 2009, SIGMOD Conference.

[15]  Eli Upfal,et al.  Learning-based Query Performance Modeling and Prediction , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[16]  Alexander Clemm,et al.  NETradamus: A forecasting system for system event messages , 2010, 2010 IEEE Network Operations and Management Symposium - NOMS 2010.

[17]  Kyuseok Shim,et al.  Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases , 1995, VLDB.

[18]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.