EFFICIENT MIXED MODE SUMMARY FOR MOBILE NETWORKS

Cellular networks monitoring and management tasks are based on huge amounts of continuously collected data from network elements and devices. Log files are used to store this data, but it might need to accumulate millions of lines in one day. The standardname of this log is in GPEH format which stands for General Performance Event Handling.This log is usually recorded in a binary format (bin). Thus, efficient and fast compression technique is considered as one of the main aspects targeting the storage cap abilities. On the other hand, based on our experience, we noticed that experts and network engineers are not interested in each log entry. In addition, this massive burst of entries can lose important information; especially those translated into performan ce abnormalities. Thus, summarizing log files would be beneficial in specifying the different problems on certain elements, the overall performance and the expected network future state. In this paper, we introduce an efficient compression algorithm based log frequent patterns. In addition, we propose a Mixed Mode Summary -based Lossless Compression Technique for Mobile Networks log files (MMSLC) as a mixed on -line and off-line compression modes based on the summary extracted from the frequent patterns. Ourscheme exploits the strong correlation between the directly and consecutively recorded bin files for utilizing the online compression mode. On the other hand, it uses the famous “Apriori Algorithm” to extract the frequent patterns from the current file in offline mode. Our proposed scheme is proved to gain high compression ratios in fast speed as well as help in extracting beneficial information from the recorded data.

[1]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[2]  Adem Karahoca,et al.  Data mining via cellular neural networks in the GSM sector , 2004, IASTED Conf. on Software Engineering and Applications.

[3]  S. Grabowski,et al.  Sub-atomic field processing for improved web log compression , 2008, 2008 International Conference on "Modern Problems of Radio Engineering, Telecommunications and Computer Science" (TCSET).

[4]  Kimmo Hätönen,et al.  Data mining for telecommunications network log analysis , 2009 .

[5]  Raj Kumar Gupta,et al.  An Evaluation of Log File and Compression Mechanism , 2012 .

[6]  Justin Zobel,et al.  Relative Lempel-Ziv Factorization for Efficient Storage and Retrieval of Web Collections , 2011, Proc. VLDB Endow..

[7]  Jakub Swacha,et al.  Fast and Efficient Log File Compression , 2007, ADBIS Research Communications.

[8]  Risto Vaarandi,et al.  A Breadth-First Algorithm for Mining Frequent Patterns from Event Logs , 2004, INTELLCOMM.

[9]  Michal J. Okoniewski,et al.  Applying Data Mining Methods for Cellular Radio Network Planning , 2000, Intelligent Information Systems.

[10]  Jean-François Boulicaut,et al.  Comprehensive Log Compression with Frequent Patterns , 2003, DaWaK.

[11]  Salvatore Orlando,et al.  Enhancing the Apriori Algorithm for Frequent Set Counting , 2001, DaWaK.

[12]  Jiawei Han,et al.  Lossless Semantic Compression for Relational Databases Title of Thesis: Lossless Semantic Compression for Relational Databases , 2001 .

[13]  Christian Borgelt.  Recursion Pruning for the Apriori Algorithm , 2004, FIMI.