DocumentCode :
2309415
Title :
A Effective Algorithm for Counting Active Flows Based on Loop Bloom Filter
Author :
Sun, Yong ; Zhang, Zhibin ; Guo, Li ; Bai, Shuo ; Tan, Jianlong
Author_Institution :
Inst. of Comput. Technol., Chinese Acad. of Sci., Beijing
fYear :
2008
fDate :
12-14 June 2008
Firstpage :
104
Lastpage :
109
Abstract :
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.
Keywords :
active networks; peer-to-peer computing; telecommunication congestion control; P2P identification; active flow counting; high speed links; loop bloom filter; network monitoring; network traffic analysis; timeout detection; Algorithm design and analysis; Computer architecture; Computer crime; Data analysis; Electronic mail; Filters; Monitoring; Sampling methods; Sun; Telecommunication traffic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networking, Architecture, and Storage, 2008. NAS '08. International Conference on
Conference_Location :
Chongqing
Print_ISBN :
978-0-7695-3187-8
Type :
conf
DOI :
10.1109/NAS.2008.19
Filename :
4579567
Link To Document :
بازگشت