By Topic

Online identifying elephant flows through a scalable non-uniform sampling algorithm

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)
Cheng Guang ; Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing ; Gong Jian

Elephant flows contribute a large portion of the total traffic volume despite being relatively few in the number of flows. Thus, it is very important to identify these elephant flows in traffic engineering, network operation and management. One can easily keep counters for a few elephant flows using a small amount of fast memory (SRAM). Thus a reasonable goal is to devise an algorithm that identifies elephant flows using a limited SRAM memory. In this paper, we propose a novel approach to tackle this issue by using an identifying Elephant flows based on a Scalable Non-uniform Sampling algorithm (ESNS) to make the monitoring system self-adjustable to the varying monitored traffic. The paper use CERNET traces to compare the performance the ESNS algorithm with the sample and hold algorithm, and sampled algorithm. The experiment shows that the ESNS has better precision than PSH and sampled algorithm under the same flow memory size and configures.

Published in:

Communication Technology, 2008. ICCT 2008. 11th IEEE International Conference on

Date of Conference:

10-12 Nov. 2008