Real-Time Flow Counting in IP Networks: Strict Analysis and Design Issues
Real-time flow counting is significant for Internet Protocol (IP)network management because it enables operators to take appropriate action against anomalies or performance degradation. Most flow counting methods proposed in the literature are based on the linear counting algorithm, which was originally developed for database system applications. This paper first strictly analyzes the statistical nature of the linear counting algorithm. The correctness of the analysis is confirmed through a computer simulation. The strict analysis is also compared with an approximate analysis reported in a previous study. The result clarifies the conditions where the previous approximate analysis did not provide good accuracy.