Finding hierarchical heavy hitters in network measurement system

Focused on identifying hierarchical heavy hitters (HHH) in multiple dimensions from network management perspective, this paper presents a framework of finding HHHs in network measurement systems and proposes a heuristic algorithm on finding static and dynamic HHH in two dimensions. Our algorithm dramatically reduces the space and time complexity comparing with other previous algorithms. We implement and test it in a typical local network and the experimental results verify the effectiveness and efficiency of the algorithm.

[1]  George Varghese,et al.  Fast and scalable layer four switching , 1998, SIGCOMM '98.

[2]  Christopher Olston,et al.  Finding (recently) frequent items in distributed data streams , 2005, 21st International Conference on Data Engineering (ICDE'05).

[3]  Christopher Olston,et al.  Distributed top-k monitoring , 2003, SIGMOD '03.

[4]  Carsten Lund,et al.  Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications , 2004, IMC '04.

[5]  Csaba D. Tóth,et al.  Space complexity of hierarchical heavy hitters in multi-dimensional data streams , 2005, PODS '05.

[6]  Divyakant Agrawal,et al.  Efficient Computation of Frequent and Top-k Elements in Data Streams , 2005, ICDT.

[7]  Graham Cormode,et al.  What's new: finding significant differences in network data streams , 2004, INFOCOM 2004.

[8]  Shigeki Goto,et al.  Identifying elephant flows through periodically sampled packets , 2004, IMC '04.

[9]  George Varghese,et al.  Automatically inferring patterns of resource consumption in network traffic , 2003, SIGCOMM '03.

[10]  Yin Zhang,et al.  Finding critical traffic matrices , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[11]  Nick McKeown,et al.  Algorithms for packet classification , 2001, IEEE Netw..

[12]  P. Young,et al.  Time series analysis, forecasting and control , 1972, IEEE Transactions on Automatic Control.

[13]  Jun Zhang,et al.  Traffic measurement and analysis of TUNET , 2005, 2005 International Conference on Cyberworlds (CW'05).

[14]  Divesh Srivastava,et al.  Diamond in the rough: finding Hierarchical Heavy Hitters in multi-dimensional data , 2004, SIGMOD '04.