Multi-match Packet Classification on Memory-Logic Trade-off FPGA-based Architecture
Packet processing is becoming much more challenging as networks evolve towards a multi-service platform. In particular, packet classification demands smaller processing times as data rates increase. To successfully meet this requirement, hardware-based classification architectures have become an area of extensive research. Even if Field Programmable Logic Arrays (FPGAs) have emerged as an interesting technology for implementing these architectures, existing proposals either exploit maximal concurrency with unbounded resource consumption, or base the architecture on distributed RAM memory-based schemes which strongly undervalues FPGA capabilities. Moreover, most of these proposals target best-match classification and are not suited for high-speed updates of classification rulesets. In this paper, we propose a new approach which exploits rich logic resources available in modern FPGAs while reducing memory consumption. Our architecture is conceived for multi-match classification, and its mapping methodology is naturally suited for high-speed, simple updating of the classification ruleset. Analytical evaluation and implementation results of our architecture are promising, demonstrating that it is suitable for line speed processing with balanced resource consumption. With additional optimizations, our proposal has the potential to be integrated into network processing architectures demanding all aforementioned features.
| Main Authors: | , |
|---|---|
| Format: | conferenceObject biblioteca |
| Language: | eng |
| Published: |
2013
|
| Subjects: | Pipeline processing, Field-programmable, Hardware-based, Classification architectures, |
| Online Access: | http://hdl.handle.net/11086/28727 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|