Cart (Loading....) | Create Account
Close category search window
 

Dynamic Binary Tree for Hierarchical Clustering of IP Traffic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Truong, P. ; France Telecom R&D, Lannion ; Guillemin, F.

This paper proposes a computational and memory-efficient technique for online unidimensional clustering of individual IP addresses in order to detect high-volume traffic clusters (hierarchical heavy hitters). Our technique is based on a Patricia tree and can cope with today's traffic volume. We test our algorithm by using a traffic trace composed of NetFlow records sent by a few tens of routers of the France telecom IP backbone network. We moreover show how our algorithm can be used for network anomaly detection.

Published in:

Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE

Date of Conference:

26-30 Nov. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.