Nowadays, rapid evolution of computers and mobile devices has caused the explosive increase in network traffic. So it becomes more and more necessary to archive network traffic for analyzing network events and a lot of emerging applications. Compression is fundamental for traffic archival solution to save the storage space, and indexing is effective to accelerate search queries for archive of traffic data. In this paper, we propose BreadZip (blocks row-reordering and adaptive index zip), a combination of initial traffic data and index compression. BreadZip has three main advantages. 1) to improve compressing efficiency and reduce memory footprint, traffic data is reordered in sequence and divided into fixed-size blocks; 2) to accelerate queries, an improved bitmap indexes with smaller volume than traditional will be introduced; 3) to save space, both traffic blocks and bitmap indexes are compressed in different simple run-length encoding methods respectively. Finally, our empirical results on network traffic from CAIDA (Cooperative Association for Internet Data Analysis) show that our solution can significantly reduce the volume of traffic data, while simultaneously preserving the ability to perform selectively queries with response times in seconds.
BreadZip: a combination of network traffic data and bitmap index encoding algorithm
2014-10-01
189438 byte
Conference paper
Electronic Resource
English
Bitmap Index-Based Decision Trees
British Library Conference Proceedings | 2005
|Optimizing Adaptive Clustered Bitmap Index Based on Medical Data Warehouse
British Library Conference Proceedings | 2016
|Bitmap-Oriented Approach to Character Recognition
British Library Online Contents | 2003
|Bitmap-Oriented Approach to Character Recognition
British Library Online Contents | 2003
|Finite State DCT with Global Bitmap Image Coding
British Library Conference Proceedings | 1994
|