A heuristic method of finding heavy hitter prefix pairs in IP traffic

Authors:
Patrick Truong;Fabrice Guillemin
Affiliations:
Orange Labs, Lannion, France;Orange Labs, Lannion, France
Venue:
IEEE Communications Letters
Year:
2009

Citing 5
Cited 1

Automatically inferring patterns of resource consumption in network traffic

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications

Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Interactive traffic analysis and visualization with Wisconsin Netpy

LISA '05 Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19
Approximate frequency counts over data streams

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Finding hierarchical heavy hitters in streaming data

ACM Transactions on Knowledge Discovery from Data (TKDD)

Review: A survey of network flow applications

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a heuristic method of finding prefix pairs in IP traffic, which represent more than a prescribed threshold of global traffic. Two Patricia trees are used for finding those source and destination prefixes with a sufficient amount of traffic. A heuristic method is then proposed to identify those pairs of prefixes with a total amount of traffic exceeding a given proportion of global traffic. The proposed algorithm is tested against NetFlow data from Orange's transit IP network.