DocumentCode
1500597
Title
A heuristic method of finding heavy hitter prefix pairs in IP traffic
Author
Truong, Patrick ; Guillemin, Fabrice
Author_Institution
Orange Labs., Lannion, France
Volume
13
Issue
10
fYear
2009
fDate
10/1/2009 12:00:00 AM
Firstpage
803
Lastpage
805
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.
Keywords
IP networks; telecommunication traffic; trees (mathematics); IP traffic; NetFlow data; Patricia tree; global traffic; heavy hitter prefix pair; heuristic method; Aggregates; Algorithm design and analysis; Clustering algorithms; Frequency; IP networks; Lattices; Multidimensional systems; Telecommunication traffic; Testing; Address prefixes, hierarchical heavy hitters.;
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2009.090969
Filename
5288469
Link To Document