Notes on the Per-Flow Packet Count Flow Classifier

Authors:
Mika Ilvesmäki;Jouni Karvo
Affiliations:
-;-
Venue:
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Year:
2001

Citing 4
Cited 0

A simulation study of IP switching

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
IP switching—ATM under IP

IEEE/ACM Transactions on Networking (TON)
Adaptive resource management for flow-based IP/ATM hybrid switching systems

IEEE/ACM Transactions on Networking (TON)
Beyond best effort: router architectures for the differentiated services of tomorrow's Internet

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

To realize a packet count classifier, in addition tothe active flow table, a candidate table is needed, whereinformation on flow candidates is kept.We will ob-serve the temporal behavior of both the active flow tableand flow candidate table size using actual traffic traces.The results indicate that the performance bottleneck ina packet count classifier lies within the candidate tablemanagement.Also, the changes in the candidate ta-ble size occur much faster than in the active flow table.Therefore, fast methods of creating entries and dele-tions in the candidate table are needed.