By Topic

Notes on the per-flow packet count flow classifier

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

2 Author(s)
M. Ilvesmaki ; Networking Lab., Helsinki Univ. of Technol., Finland ; J. Karvo

To realize a packet count classifier, in addition to the active flow table, a candidate table is needed, where information on flow candidates is kept. We observe the temporal behavior of both the active flow table and flow candidate table size using actual traffic traces. The results indicate that the performance bottleneck in a packet count classifier lies within the candidate table management. Also, the changes in the candidate table size occur much faster than in the active flow table. Therefore, fast methods of creating entries and deletions in the candidate table are needed

Published in:

Local Computer Networks, 2001. Proceedings. LCN 2001. 26th Annual IEEE Conference on

Date of Conference: