Method of data compression for traffic monitoring

In this paper a problem of compressing data containing information on basic parameters of network traffic is considered. Six test sets with different types of network traffic for known monitoring tool Wireshark are formed. Analysis of compression efficiency for these datasets by widely used archivers is carried out. It is shown that the main part of memory in compressed data relates to timestamps. A method for compressing timestamps that consists in delta calculation, Burrows-Wheeler transform (BWT), distance coding (DC) and recursive group coding (RGC) at the final stage is proposed. It is demonstrated that the use of RGC at the final stage provides more efficient coding compared to known methods. It is also shown that the proposed method of timestamps coding produces about twice larger compression ratio than WinRar.

[1]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[2]  Glen G. Langdon,et al.  Arithmetic Coding , 1979 .

[3]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

[4]  David Salomon,et al.  Data Compression: The Complete Reference , 2006 .

[5]  Jean-François Raymond,et al.  Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[6]  Jaakko Astola,et al.  Fast Codes for Large Alphabets , 2003, Commun. Inf. Syst..

[7]  Konstantina Papagiannaki,et al.  Structural analysis of network traffic flows , 2004, SIGMETRICS '04/Performance '04.

[8]  Nikolay N. Ponomarenko,et al.  DCT Based High Quality Image Compression , 2005, SCIA.

[9]  J. Astola,et al.  Additional lossless compression of JPEG images , 2005, ISPA 2005. Proceedings of the 4th International Symposium on Image and Signal Processing and Analysis, 2005..

[10]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[11]  K. Egiazarian,et al.  EFFICIENT BIT-PLANES BASED METHOD FOR COMPRESSION OF 3 D-DCT COEFFICIENTS , 2007 .

[12]  Nikolay N. Ponomarenko,et al.  Fast Recursive Coding Based on Grouping of Symbols , 2007, ArXiv.

[13]  Amar Mukherjee,et al.  The Burrows-Wheeler Transform:: Data Compression, Suffix Arrays, and Pattern Matching , 2008 .

[14]  Carey L. Williamson,et al.  A comparative analysis of web and peer-to-peer traffic , 2008, WWW.

[15]  E.P. Markatos,et al.  Evaluation of Compression of Remote Network Monitoring Data Streams , 2008, NOMS Workshops 2008 - IEEE Network Operations and Management Symposium Workshops.

[16]  Francesco Marcelloni,et al.  An Efficient Lossless Compression Algorithm for Tiny Nodes of Monitoring Wireless Sensor Networks , 2009, Comput. J..

[17]  Antonio Pescapè,et al.  Traffic analysis of peer-to-peer IPTV communities , 2009, Comput. Networks.

[18]  J. Astola,et al.  Recursive Coding: A New Fast and Simple Alternative of Arithmetical Coding , 2009 .

[19]  Dario Rossi,et al.  Detailed Analysis of Skype Traffic , 2009, IEEE Transactions on Multimedia.

[20]  Jaakko Astola,et al.  Means and results of efficiency analysis for data compression methods applied to typical multimedia data , 2014, 2014 First International Scientific-Practical Conference Problems of Infocommunications Science and Technology.

[21]  Yang Xiao,et al.  Network forensics analysis using Wireshark , 2015, Int. J. Secur. Networks.