By Topic

A Effective Algorithm for Counting Active Flows Based on Loop Bloom Filter

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
$33 $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

5 Author(s)
Yong Sun ; Inst. of Comput. Technol., Chinese Acad. of Sci., Beijing ; Zhibin Zhang ; Li Guo ; Shuo Bai
more authors

Network traffic analysis based on flows plays an important role in network monitoring and P2P identification. They are all grounded in flow counting and differ in how to count. Timeout detecting is a major strategy to identify termination of flows and can influence the validity of flow counting. The algorithms for counting flow based on Hash method can't deal with timeout problems perfectly. In this paper, a novel algorithm based on loop bloom filter is proposed. It can estimate active flow with timeout detection on high speed links more accurately. Experiment results show that this algorithm can ensure accuracy while only consuming minimum time and memories.

Published in:

Networking, Architecture, and Storage, 2008. NAS '08. International Conference on

Date of Conference:

12-14 June 2008