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

IEEE Communications Letters

Volumn 13, Issue 10, 2009, Pages 803-805

  Truong, Patrick ^a   Guillemin, Fabrice ^a  

^a ORANGE LABS   (France)

Author keywords

Address prefixes; Hierarchical heavy hitters

Indexed keywords

ADDRESS PREFIXES; HEAVY-HITTER; HIERARCHICAL HEAVY HITTERS; IP NETWORKS; IP TRAFFIC; NETFLOW DATA; PATRICIA TREE; PREFIX-PAIR;

ALGORITHMS; INTERNET PROTOCOLS; TERMINOLOGY;

HEURISTIC METHODS;

EID: 70350501463     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2009.090969     Document Type: Article

References (6)

1. G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava, "Finding hierarchical heavy hitters in streaming data," in Proc. ACM TKDD, Jan. 2008.
2. Y. Zhang, S. Singh, S. Sen, N. Duffield, and C. Lund, "Online identification of hierarchical heavy hitters: Algorithms, evaluation and applications," in Proc. IMC '04, Oct. 2004.
3. P. Truong and F. Guillemin, "Dynamic binary trees for hierachical clustering of IP traffic," in Proc. Globecom 2007, Nov. 2007.
4. C. Estan, S. Savage, and G. Varghese, "Automatically inferring patterns of resource consumption in network traffic," in Proc. SIGCOMM, 2003.
5. C. Estan and G. Magin, "Interactive traffic analysis and visualization with Wisconsin Netpy," in Proc. Lisa 05, Dec. 2005.
6. G. Manku and R. Motwani, "Approximate frequency counts over data streams," in Proc. VLDB, Aug. 2002.