loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 International Conference on Networking, Architecture, and Storage
A Effective Algorithm for Counting Active Flows Based on Loop Bloom Filter
June 12-June 14
ISBN: 978-0-7695-3187-8
ASCII Text
x 
 
Yong Sun, Zhibin Zhang, Li Guo, Shuo Bai, Jianlong Tan, "A Effective Algorithm for Counting Active Flows Based on Loop Bloom Filter," Networking, Architecture, and Storage, International Conference on, pp. 104-109, 2008 International Conference on Networking, Architecture, and Storage, 2008.
 
 
BibTex
x
 
@article{ 10.1109/NAS.2008.19,
author = {Yong Sun and Zhibin Zhang and Li Guo and Shuo Bai and Jianlong Tan},
title = {A Effective Algorithm for Counting Active Flows Based on Loop Bloom Filter},
journal ={Networking, Architecture, and Storage, International Conference on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3187-8},
pages = {104-109},
doi = {http://doi.ieeecomputersociety.org/10.1109/NAS.2008.19},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Networking, Architecture, and Storage, International Conference on
TI - A Effective Algorithm for Counting Active Flows Based on Loop Bloom Filter
SN - 978-0-7695-3187-8
SP104
EP109
A1 - Yong Sun,
A1 - Zhibin Zhang,
A1 - Li Guo,
A1 - Shuo Bai,
A1 - Jianlong Tan,
PY - 2008
KW - null
VL - 0
JA - Networking, Architecture, and Storage, International Conference on
ER -
 
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.
Citation:
Yong Sun, Zhibin Zhang, Li Guo, Shuo Bai, Jianlong Tan, "A Effective Algorithm for Counting Active Flows Based on Loop Bloom Filter," nas, pp.104-109, 2008 International Conference on Networking, Architecture, and Storage, 2008
Usage of this product signifies your acceptance of the Terms of Use.