Abstract

This paper explores the problem of processing the immense volume of measurement data arising during network traffic monitoring. Due to the ever-increasing demands of current networks, observing accurate information about every single flow is virtually infeasible. In many cases the existing methods for the reduction of flow records are still not sufficient enough. Since the accurate knowledge of flows termed as ``heavy-hitters'' suffices to fulfill most of the monitoring purposes, we decided to aggregate the flow records pertaining to non-heavy-hitters. However, due to the ever-changing nature of traffic, their identification is a challenge. To overcome this challenge, our proposed approach – the adaptive aggregation of flow records – automatically adjusts its operation to the actual traffic load and to the monitoring requirements. Preliminary experiments in existing network topologies showed that adaptive aggregation efficiently reduces the number of flow records, while a significant proportion of traffic details is preserved.

Keywords

MSC

68M10, 68M12, 90B18, 90B20

Cite this article

@article{cai-2974,
  author  = {Adrián Pekár and Martin Chovanec and Liberios Vokorokos and Eva Chovancová and Peter Feciľak and Miroslav Michalko},
  title   = {Adaptive Aggregation of Flow Records},
  journal = {Computing and Informatics},
  volume  = {37},
  number  = {1},
  pages   = {142--164},
  year    = {2018},
  issn    = {1335-9150},
  doi     = {10.4149/cai_2018_1_142}
}
Download .bib