Tracking per-flow state — Binned Duration Flow Tracking

Author

Whitehead, Brad ; Lung, Chung-Horng ; Rabinovitch, Peter

Author_Institution

Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, ON, Canada

fYear

2010

fDate

11-14 July 2010

Firstpage

73

Lastpage

80

Abstract

Recent advances in network monitoring have increasingly focused on obtaining per-flow information, such as flow state. Tracking the state of network flows opens up a new dimension of information gathering for network operators, allowing previously unattainable data to be captured. This paper presents a time efficient novel method - Binned Duration Flow Tracking (BDFT) - of tracking per-flow state by grouping valid flows into “bins”. BDFT is intended for high-speed routers where CPU time is crucial. BDFT is time efficient by adopting Bloom filters as the primary data structures. Simulation results show that BDFT can achieve over 99% accuracy on traces of real network traffic.

Keywords

Internet; telecommunication traffic; transport protocols; Bloom filters; binned duration flow tracking; per-flow state; real network traffic; Accuracy; Aging; Data structures; Information filters; Memory management; Radiation detectors; Bloom filter; flow tracking; high-speed networks; network monitoring;

fLanguage

English

Publisher

ieee

Conference_Titel

Performance Evaluation of Computer and Telecommunication Systems (SPECTS), 2010 International Symposium on

Conference_Location

Ottawa, ON

Print_ISBN

978-1-56555-340-8

Type

conf

Filename

5590229