Abstract
Recently, many network-device platforms provide a fast SRAM interface for short access latency. However, existing packet classification algorithms achieve high-speed performance by sacrificing the table size; consequently, the entire table is stored in a large DRAM instead of a small SRAM. In this letter, we propose a new partitioning-based packet classification algorithm that generates very small tables and enables the tables to be stored in an SRAM to achieve a very fast speed. Moreover, by removing overhead for the partitioning search, our algorithm provides excellent performance even with DRAMs as compared to other algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
